diff --git a/dist/02-XYLO1.mp3 b/dist/02-XYLO1.mp3
new file mode 100644
index 00000000..5f1c9b92
Binary files /dev/null and b/dist/02-XYLO1.mp3 differ
diff --git a/dist/assets/1551f4f60c37af51121f.woff2 b/dist/assets/1551f4f60c37af51121f.woff2
new file mode 100644
index 00000000..2217164f
Binary files /dev/null and b/dist/assets/1551f4f60c37af51121f.woff2 differ
diff --git a/dist/assets/184be8c3aa435ca6c3f5.ttf b/dist/assets/184be8c3aa435ca6c3f5.ttf
new file mode 100644
index 00000000..a071a7a8
Binary files /dev/null and b/dist/assets/184be8c3aa435ca6c3f5.ttf differ
diff --git a/dist/assets/2285773e6b4b172f07d9.woff b/dist/assets/2285773e6b4b172f07d9.woff
new file mode 100644
index 00000000..3375bef0
Binary files /dev/null and b/dist/assets/2285773e6b4b172f07d9.woff differ
diff --git a/dist/assets/23f19bb08961f37aaf69.eot b/dist/assets/23f19bb08961f37aaf69.eot
new file mode 100644
index 00000000..cba6c6cc
Binary files /dev/null and b/dist/assets/23f19bb08961f37aaf69.eot differ
diff --git a/dist/assets/2f517e09eb2ca6650ff5.svg b/dist/assets/2f517e09eb2ca6650ff5.svg
new file mode 100644
index 00000000..b9881a43
--- /dev/null
+++ b/dist/assets/2f517e09eb2ca6650ff5.svg
@@ -0,0 +1,3717 @@
+
+
+
diff --git a/dist/assets/4689f52cc96215721344.svg b/dist/assets/4689f52cc96215721344.svg
new file mode 100644
index 00000000..463af27c
--- /dev/null
+++ b/dist/assets/4689f52cc96215721344.svg
@@ -0,0 +1,801 @@
+
+
+
diff --git a/dist/assets/491974d108fe4002b2aa.ttf b/dist/assets/491974d108fe4002b2aa.ttf
new file mode 100644
index 00000000..7157aafb
Binary files /dev/null and b/dist/assets/491974d108fe4002b2aa.ttf differ
diff --git a/dist/assets/527940b104eb2ea366c8.ttf b/dist/assets/527940b104eb2ea366c8.ttf
new file mode 100644
index 00000000..8d75dedd
Binary files /dev/null and b/dist/assets/527940b104eb2ea366c8.ttf differ
diff --git a/dist/assets/77206a6bb316fa0aded5.eot b/dist/assets/77206a6bb316fa0aded5.eot
new file mode 100644
index 00000000..a4e59893
Binary files /dev/null and b/dist/assets/77206a6bb316fa0aded5.eot differ
diff --git a/dist/assets/7a3337626410ca2f4071.woff2 b/dist/assets/7a3337626410ca2f4071.woff2
new file mode 100644
index 00000000..56328948
Binary files /dev/null and b/dist/assets/7a3337626410ca2f4071.woff2 differ
diff --git a/dist/assets/7a8b4f130182d19a2d7c.svg b/dist/assets/7a8b4f130182d19a2d7c.svg
new file mode 100644
index 00000000..00296e95
--- /dev/null
+++ b/dist/assets/7a8b4f130182d19a2d7c.svg
@@ -0,0 +1,5034 @@
+
+
+
diff --git a/dist/assets/9bbb245e67a133f6e486.eot b/dist/assets/9bbb245e67a133f6e486.eot
new file mode 100644
index 00000000..e9941719
Binary files /dev/null and b/dist/assets/9bbb245e67a133f6e486.eot differ
diff --git a/dist/assets/bb58e57c48a3e911f15f.woff b/dist/assets/bb58e57c48a3e911f15f.woff
new file mode 100644
index 00000000..ad077c6b
Binary files /dev/null and b/dist/assets/bb58e57c48a3e911f15f.woff differ
diff --git a/dist/assets/be9ee23c0c6390141475.ttf b/dist/assets/be9ee23c0c6390141475.ttf
new file mode 100644
index 00000000..25abf389
Binary files /dev/null and b/dist/assets/be9ee23c0c6390141475.ttf differ
diff --git a/dist/assets/d878b0a6a1144760244f.woff2 b/dist/assets/d878b0a6a1144760244f.woff2
new file mode 100644
index 00000000..402f81c0
Binary files /dev/null and b/dist/assets/d878b0a6a1144760244f.woff2 differ
diff --git a/dist/assets/eeccf4f66002c6f2ba24.woff b/dist/assets/eeccf4f66002c6f2ba24.woff
new file mode 100644
index 00000000..23ee6634
Binary files /dev/null and b/dist/assets/eeccf4f66002c6f2ba24.woff differ
diff --git a/dist/editor.worker.js b/dist/editor.worker.js
new file mode 100644
index 00000000..1838a1c8
--- /dev/null
+++ b/dist/editor.worker.js
@@ -0,0 +1,18494 @@
+/******/ (() => { // webpackBootstrap
+/******/ "use strict";
+/******/ var __webpack_modules__ = ({
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/arrays.js":
+/*!*****************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/arrays.js ***!
+ \*****************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ ArrayQueue: () => (/* binding */ ArrayQueue),
+/* harmony export */ CallbackIterable: () => (/* binding */ CallbackIterable),
+/* harmony export */ CompareResult: () => (/* binding */ CompareResult),
+/* harmony export */ arrayInsert: () => (/* binding */ arrayInsert),
+/* harmony export */ asArray: () => (/* binding */ asArray),
+/* harmony export */ binarySearch: () => (/* binding */ binarySearch),
+/* harmony export */ binarySearch2: () => (/* binding */ binarySearch2),
+/* harmony export */ booleanComparator: () => (/* binding */ booleanComparator),
+/* harmony export */ coalesce: () => (/* binding */ coalesce),
+/* harmony export */ coalesceInPlace: () => (/* binding */ coalesceInPlace),
+/* harmony export */ compareBy: () => (/* binding */ compareBy),
+/* harmony export */ distinct: () => (/* binding */ distinct),
+/* harmony export */ equals: () => (/* binding */ equals),
+/* harmony export */ firstOrDefault: () => (/* binding */ firstOrDefault),
+/* harmony export */ forEachAdjacent: () => (/* binding */ forEachAdjacent),
+/* harmony export */ forEachWithNeighbors: () => (/* binding */ forEachWithNeighbors),
+/* harmony export */ groupAdjacentBy: () => (/* binding */ groupAdjacentBy),
+/* harmony export */ groupBy: () => (/* binding */ groupBy),
+/* harmony export */ insertInto: () => (/* binding */ insertInto),
+/* harmony export */ isFalsyOrEmpty: () => (/* binding */ isFalsyOrEmpty),
+/* harmony export */ isNonEmptyArray: () => (/* binding */ isNonEmptyArray),
+/* harmony export */ numberComparator: () => (/* binding */ numberComparator),
+/* harmony export */ pushMany: () => (/* binding */ pushMany),
+/* harmony export */ pushToEnd: () => (/* binding */ pushToEnd),
+/* harmony export */ pushToStart: () => (/* binding */ pushToStart),
+/* harmony export */ quickSelect: () => (/* binding */ quickSelect),
+/* harmony export */ range: () => (/* binding */ range),
+/* harmony export */ removeFastWithoutKeepingOrder: () => (/* binding */ removeFastWithoutKeepingOrder),
+/* harmony export */ reverseOrder: () => (/* binding */ reverseOrder),
+/* harmony export */ splice: () => (/* binding */ splice),
+/* harmony export */ tail: () => (/* binding */ tail),
+/* harmony export */ tail2: () => (/* binding */ tail2),
+/* harmony export */ tieBreakComparators: () => (/* binding */ tieBreakComparators)
+/* harmony export */ });
+/**
+ * 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 = 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 = (a, b) => a === b) {
+ if (one === other) {
+ return true;
+ }
+ if (!one || !other) {
+ return false;
+ }
+ if (one.length !== other.length) {
+ return false;
+ }
+ for (let i = 0, len = one.length; i < len; i++) {
+ if (!itemEquals(one[i], other[i])) {
+ return false;
+ }
+ }
+ return true;
+}
+/**
+ * Remove the element at `index` by replacing it with the last element. This is faster than `splice`
+ * but changes the order of the array
+ */
+function removeFastWithoutKeepingOrder(array, index) {
+ const last = array.length - 1;
+ if (index < last) {
+ array[index] = array[last];
+ }
+ array.pop();
+}
+/**
+ * Performs a binary search algorithm over a sorted array.
+ *
+ * @param array The array being searched.
+ * @param key The value we search for.
+ * @param comparator A function that takes two array elements and returns zero
+ * if they are equal, a negative number if the first element precedes the
+ * second one in the sorting order, or a positive number if the second element
+ * precedes the first one.
+ * @return See {@link binarySearch2}
+ */
+function binarySearch(array, key, comparator) {
+ return binarySearch2(array.length, i => comparator(array[i], key));
+}
+/**
+ * Performs a binary search algorithm over a sorted collection. Useful for cases
+ * when we need to perform a binary search over something that isn't actually an
+ * array, and converting data to an array would defeat the use of binary search
+ * in the first place.
+ *
+ * @param length The collection length.
+ * @param compareToKey A function that takes an index of an element in the
+ * collection and returns zero if the value at this index is equal to the
+ * search key, a negative number if the value precedes the search key in the
+ * sorting order, or a positive number if the search key precedes the value.
+ * @return A non-negative index of an element, if found. If not found, the
+ * result is -(n+1) (or ~n, using bitwise notation), where n is the index
+ * where the key should be inserted to maintain the sorting order.
+ */
+function binarySearch2(length, compareToKey) {
+ let low = 0, high = length - 1;
+ while (low <= high) {
+ const mid = ((low + high) / 2) | 0;
+ const comp = compareToKey(mid);
+ if (comp < 0) {
+ low = mid + 1;
+ }
+ else if (comp > 0) {
+ high = mid - 1;
+ }
+ else {
+ return mid;
+ }
+ }
+ return -(low + 1);
+}
+function quickSelect(nth, data, compare) {
+ nth = nth | 0;
+ if (nth >= data.length) {
+ throw new TypeError('invalid index');
+ }
+ const pivotValue = data[Math.floor(data.length * Math.random())];
+ const lower = [];
+ const higher = [];
+ const pivots = [];
+ for (const value of data) {
+ const val = compare(value, pivotValue);
+ if (val < 0) {
+ lower.push(value);
+ }
+ else if (val > 0) {
+ higher.push(value);
+ }
+ else {
+ pivots.push(value);
+ }
+ }
+ if (nth < lower.length) {
+ return quickSelect(nth, lower, compare);
+ }
+ else if (nth < lower.length + pivots.length) {
+ return pivots[0];
+ }
+ else {
+ return quickSelect(nth - (lower.length + pivots.length), higher, compare);
+ }
+}
+function groupBy(data, compare) {
+ const result = [];
+ let currentGroup = undefined;
+ for (const element of data.slice(0).sort(compare)) {
+ if (!currentGroup || compare(currentGroup[0], element) !== 0) {
+ currentGroup = [element];
+ result.push(currentGroup);
+ }
+ else {
+ currentGroup.push(element);
+ }
+ }
+ return result;
+}
+/**
+ * Splits the given items into a list of (non-empty) groups.
+ * `shouldBeGrouped` is used to decide if two consecutive items should be in the same group.
+ * The order of the items is preserved.
+ */
+function* groupAdjacentBy(items, shouldBeGrouped) {
+ let currentGroup;
+ let last;
+ for (const item of items) {
+ if (last !== undefined && shouldBeGrouped(last, item)) {
+ currentGroup.push(item);
+ }
+ else {
+ if (currentGroup) {
+ yield currentGroup;
+ }
+ currentGroup = [item];
+ }
+ last = item;
+ }
+ if (currentGroup) {
+ yield currentGroup;
+ }
+}
+function forEachAdjacent(arr, f) {
+ for (let i = 0; i <= arr.length; i++) {
+ f(i === 0 ? undefined : arr[i - 1], i === arr.length ? undefined : arr[i]);
+ }
+}
+function forEachWithNeighbors(arr, f) {
+ for (let i = 0; i < arr.length; i++) {
+ f(i === 0 ? undefined : arr[i - 1], arr[i], i + 1 === arr.length ? undefined : arr[i + 1]);
+ }
+}
+/**
+ * @returns New array with all falsy values removed. The original array IS NOT modified.
+ */
+function coalesce(array) {
+ return array.filter(e => !!e);
+}
+/**
+ * Remove all falsy values from `array`. The original array IS modified.
+ */
+function coalesceInPlace(array) {
+ let to = 0;
+ for (let i = 0; i < array.length; i++) {
+ if (!!array[i]) {
+ array[to] = array[i];
+ to += 1;
+ }
+ }
+ array.length = to;
+}
+/**
+ * @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 equality by returning an alternate value for each.
+ */
+function distinct(array, keyFn = value => value) {
+ const seen = new Set();
+ return array.filter(element => {
+ const key = keyFn(element);
+ if (seen.has(key)) {
+ return false;
+ }
+ seen.add(key);
+ return true;
+ });
+}
+function firstOrDefault(array, notFoundValue) {
+ return array.length > 0 ? array[0] : notFoundValue;
+}
+function range(arg, to) {
+ let from = typeof to === 'number' ? arg : 0;
+ if (typeof to === 'number') {
+ from = arg;
+ }
+ else {
+ from = 0;
+ to = arg;
+ }
+ const result = [];
+ if (from <= to) {
+ for (let i = from; i < to; i++) {
+ result.push(i);
+ }
+ }
+ else {
+ for (let 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) {
+ const before = target.slice(0, insertIndex);
+ const after = target.slice(insertIndex);
+ return before.concat(insertArr, after);
+}
+/**
+ * Pushes an element to the start of the array, if found.
+ */
+function pushToStart(arr, value) {
+ const 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) {
+ const index = arr.indexOf(value);
+ if (index > -1) {
+ arr.splice(index, 1);
+ arr.push(value);
+ }
+}
+function pushMany(arr, items) {
+ for (const item of items) {
+ arr.push(item);
+ }
+}
+function asArray(x) {
+ return Array.isArray(x) ? x : [x];
+}
+/**
+ * Insert the new items in the array.
+ * @param array The original array.
+ * @param start The zero-based location in the array from which to start inserting elements.
+ * @param newItems The items to be inserted
+ */
+function insertInto(array, start, newItems) {
+ const startIdx = getActualStartIndex(array, start);
+ const originalLength = array.length;
+ const newItemsLength = newItems.length;
+ array.length = originalLength + newItemsLength;
+ // Move the items after the start index, start from the end so that we don't overwrite any value.
+ for (let i = originalLength - 1; i >= startIdx; i--) {
+ array[i + newItemsLength] = array[i];
+ }
+ for (let i = 0; i < newItemsLength; i++) {
+ array[i + startIdx] = newItems[i];
+ }
+}
+/**
+ * Removes elements from an array and inserts new elements in their place, returning the deleted elements. Alternative to the native Array.splice method, it
+ * can only support limited number of items due to the maximum call stack size limit.
+ * @param array The original array.
+ * @param start The zero-based location in the array from which to start removing elements.
+ * @param deleteCount The number of elements to remove.
+ * @returns An array containing the elements that were deleted.
+ */
+function splice(array, start, deleteCount, newItems) {
+ const index = getActualStartIndex(array, start);
+ let result = array.splice(index, deleteCount);
+ if (result === undefined) {
+ // see https://bugs.webkit.org/show_bug.cgi?id=261140
+ result = [];
+ }
+ insertInto(array, index, newItems);
+ return result;
+}
+/**
+ * Determine the actual start index (same logic as the native splice() or slice())
+ * If greater than the length of the array, start will be set to the length of the array. In this case, no element will be deleted but the method will behave as an adding function, adding as many element as item[n*] provided.
+ * If negative, it will begin that many elements from the end of the array. (In this case, the origin -1, meaning -n is the index of the nth last element, and is therefore equivalent to the index of array.length - n.) If array.length + start is less than 0, it will begin from index 0.
+ * @param array The target array.
+ * @param start The operation index.
+ */
+function getActualStartIndex(array, start) {
+ return start < 0 ? Math.max(start + array.length, 0) : Math.min(start, array.length);
+}
+var CompareResult;
+(function (CompareResult) {
+ function isLessThan(result) {
+ return result < 0;
+ }
+ CompareResult.isLessThan = isLessThan;
+ function isLessThanOrEqual(result) {
+ return result <= 0;
+ }
+ CompareResult.isLessThanOrEqual = isLessThanOrEqual;
+ function isGreaterThan(result) {
+ return result > 0;
+ }
+ CompareResult.isGreaterThan = isGreaterThan;
+ function isNeitherLessOrGreaterThan(result) {
+ return result === 0;
+ }
+ CompareResult.isNeitherLessOrGreaterThan = isNeitherLessOrGreaterThan;
+ CompareResult.greaterThan = 1;
+ CompareResult.lessThan = -1;
+ CompareResult.neitherLessOrGreaterThan = 0;
+})(CompareResult || (CompareResult = {}));
+function compareBy(selector, comparator) {
+ return (a, b) => comparator(selector(a), selector(b));
+}
+function tieBreakComparators(...comparators) {
+ return (item1, item2) => {
+ for (const comparator of comparators) {
+ const result = comparator(item1, item2);
+ if (!CompareResult.isNeitherLessOrGreaterThan(result)) {
+ return result;
+ }
+ }
+ return CompareResult.neitherLessOrGreaterThan;
+ };
+}
+/**
+ * The natural order on numbers.
+*/
+const numberComparator = (a, b) => a - b;
+const booleanComparator = (a, b) => numberComparator(a ? 1 : 0, b ? 1 : 0);
+function reverseOrder(comparator) {
+ return (a, b) => -comparator(a, b);
+}
+class ArrayQueue {
+ /**
+ * Constructs a queue that is backed by the given array. Runtime is O(1).
+ */
+ constructor(items) {
+ this.items = items;
+ this.firstIdx = 0;
+ this.lastIdx = this.items.length - 1;
+ }
+ get length() {
+ return this.lastIdx - this.firstIdx + 1;
+ }
+ /**
+ * Consumes elements from the beginning of the queue as long as the predicate returns true.
+ * If no elements were consumed, `null` is returned. Has a runtime of O(result.length).
+ */
+ takeWhile(predicate) {
+ // P(k) := k <= this.lastIdx && predicate(this.items[k])
+ // Find s := min { k | k >= this.firstIdx && !P(k) } and return this.data[this.firstIdx...s)
+ let startIdx = this.firstIdx;
+ while (startIdx < this.items.length && predicate(this.items[startIdx])) {
+ startIdx++;
+ }
+ const result = startIdx === this.firstIdx ? null : this.items.slice(this.firstIdx, startIdx);
+ this.firstIdx = startIdx;
+ return result;
+ }
+ /**
+ * Consumes elements from the end of the queue as long as the predicate returns true.
+ * If no elements were consumed, `null` is returned.
+ * The result has the same order as the underlying array!
+ */
+ takeFromEndWhile(predicate) {
+ // P(k) := this.firstIdx >= k && predicate(this.items[k])
+ // Find s := max { k | k <= this.lastIdx && !P(k) } and return this.data(s...this.lastIdx]
+ let endIdx = this.lastIdx;
+ while (endIdx >= 0 && predicate(this.items[endIdx])) {
+ endIdx--;
+ }
+ const result = endIdx === this.lastIdx ? null : this.items.slice(endIdx + 1, this.lastIdx + 1);
+ this.lastIdx = endIdx;
+ return result;
+ }
+ peek() {
+ if (this.length === 0) {
+ return undefined;
+ }
+ return this.items[this.firstIdx];
+ }
+ dequeue() {
+ const result = this.items[this.firstIdx];
+ this.firstIdx++;
+ return result;
+ }
+ takeCount(count) {
+ const result = this.items.slice(this.firstIdx, this.firstIdx + count);
+ this.firstIdx += count;
+ return result;
+ }
+}
+/**
+ * This class is faster than an iterator and array for lazy computed data.
+*/
+class CallbackIterable {
+ constructor(
+ /**
+ * Calls the callback for every item.
+ * Stops when the callback returns false.
+ */
+ iterate) {
+ this.iterate = iterate;
+ }
+ toArray() {
+ const result = [];
+ this.iterate(item => { result.push(item); return true; });
+ return result;
+ }
+ filter(predicate) {
+ return new CallbackIterable(cb => this.iterate(item => predicate(item) ? cb(item) : true));
+ }
+ map(mapFn) {
+ return new CallbackIterable(cb => this.iterate(item => cb(mapFn(item))));
+ }
+ findLast(predicate) {
+ let result;
+ this.iterate(item => {
+ if (predicate(item)) {
+ result = item;
+ }
+ return true;
+ });
+ return result;
+ }
+ findLastMaxBy(comparator) {
+ let result;
+ let first = true;
+ this.iterate(item => {
+ if (first || CompareResult.isGreaterThan(comparator(item, result))) {
+ first = false;
+ result = item;
+ }
+ return true;
+ });
+ return result;
+ }
+}
+CallbackIterable.empty = new CallbackIterable(_callback => { });
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/arraysFind.js":
+/*!*********************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/arraysFind.js ***!
+ \*********************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ MonotonousArray: () => (/* binding */ MonotonousArray),
+/* harmony export */ findFirstIdxMonotonousOrArrLen: () => (/* binding */ findFirstIdxMonotonousOrArrLen),
+/* harmony export */ findFirstMaxBy: () => (/* binding */ findFirstMaxBy),
+/* harmony export */ findFirstMinBy: () => (/* binding */ findFirstMinBy),
+/* harmony export */ findFirstMonotonous: () => (/* binding */ findFirstMonotonous),
+/* harmony export */ findLast: () => (/* binding */ findLast),
+/* harmony export */ findLastIdx: () => (/* binding */ findLastIdx),
+/* harmony export */ findLastIdxMonotonous: () => (/* binding */ findLastIdxMonotonous),
+/* harmony export */ findLastMaxBy: () => (/* binding */ findLastMaxBy),
+/* harmony export */ findLastMonotonous: () => (/* binding */ findLastMonotonous),
+/* harmony export */ findMaxIdxBy: () => (/* binding */ findMaxIdxBy),
+/* harmony export */ mapFindFirst: () => (/* binding */ mapFindFirst)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+function findLast(array, predicate, fromIdx) {
+ const idx = findLastIdx(array, predicate);
+ if (idx === -1) {
+ return undefined;
+ }
+ return array[idx];
+}
+function findLastIdx(array, predicate, fromIndex = array.length - 1) {
+ for (let i = fromIndex; i >= 0; i--) {
+ const element = array[i];
+ if (predicate(element)) {
+ return i;
+ }
+ }
+ return -1;
+}
+/**
+ * Finds the last item where predicate is true using binary search.
+ * `predicate` must be monotonous, i.e. `arr.map(predicate)` must be like `[true, ..., true, false, ..., false]`!
+ *
+ * @returns `undefined` if no item matches, otherwise the last item that matches the predicate.
+ */
+function findLastMonotonous(array, predicate) {
+ const idx = findLastIdxMonotonous(array, predicate);
+ return idx === -1 ? undefined : array[idx];
+}
+/**
+ * Finds the last item where predicate is true using binary search.
+ * `predicate` must be monotonous, i.e. `arr.map(predicate)` must be like `[true, ..., true, false, ..., false]`!
+ *
+ * @returns `startIdx - 1` if predicate is false for all items, otherwise the index of the last item that matches the predicate.
+ */
+function findLastIdxMonotonous(array, predicate, startIdx = 0, endIdxEx = array.length) {
+ let i = startIdx;
+ let j = endIdxEx;
+ while (i < j) {
+ const k = Math.floor((i + j) / 2);
+ if (predicate(array[k])) {
+ i = k + 1;
+ }
+ else {
+ j = k;
+ }
+ }
+ return i - 1;
+}
+/**
+ * Finds the first item where predicate is true using binary search.
+ * `predicate` must be monotonous, i.e. `arr.map(predicate)` must be like `[false, ..., false, true, ..., true]`!
+ *
+ * @returns `undefined` if no item matches, otherwise the first item that matches the predicate.
+ */
+function findFirstMonotonous(array, predicate) {
+ const idx = findFirstIdxMonotonousOrArrLen(array, predicate);
+ return idx === array.length ? undefined : array[idx];
+}
+/**
+ * Finds the first item where predicate is true using binary search.
+ * `predicate` must be monotonous, i.e. `arr.map(predicate)` must be like `[false, ..., false, true, ..., true]`!
+ *
+ * @returns `endIdxEx` if predicate is false for all items, otherwise the index of the first item that matches the predicate.
+ */
+function findFirstIdxMonotonousOrArrLen(array, predicate, startIdx = 0, endIdxEx = array.length) {
+ let i = startIdx;
+ let j = endIdxEx;
+ while (i < j) {
+ const k = Math.floor((i + j) / 2);
+ if (predicate(array[k])) {
+ j = k;
+ }
+ else {
+ i = k + 1;
+ }
+ }
+ return i;
+}
+/**
+ * Use this when
+ * * You have a sorted array
+ * * You query this array with a monotonous predicate to find the last item that has a certain property.
+ * * You query this array multiple times with monotonous predicates that get weaker and weaker.
+ */
+class MonotonousArray {
+ constructor(_array) {
+ this._array = _array;
+ this._findLastMonotonousLastIdx = 0;
+ }
+ /**
+ * The predicate must be monotonous, i.e. `arr.map(predicate)` must be like `[true, ..., true, false, ..., false]`!
+ * For subsequent calls, current predicate must be weaker than (or equal to) the previous predicate, i.e. more entries must be `true`.
+ */
+ findLastMonotonous(predicate) {
+ if (MonotonousArray.assertInvariants) {
+ if (this._prevFindLastPredicate) {
+ for (const item of this._array) {
+ if (this._prevFindLastPredicate(item) && !predicate(item)) {
+ throw new Error('MonotonousArray: current predicate must be weaker than (or equal to) the previous predicate.');
+ }
+ }
+ }
+ this._prevFindLastPredicate = predicate;
+ }
+ const idx = findLastIdxMonotonous(this._array, predicate, this._findLastMonotonousLastIdx);
+ this._findLastMonotonousLastIdx = idx + 1;
+ return idx === -1 ? undefined : this._array[idx];
+ }
+}
+MonotonousArray.assertInvariants = false;
+/**
+ * Returns the first item that is equal to or greater than every other item.
+*/
+function findFirstMaxBy(array, comparator) {
+ if (array.length === 0) {
+ return undefined;
+ }
+ let max = array[0];
+ for (let i = 1; i < array.length; i++) {
+ const item = array[i];
+ if (comparator(item, max) > 0) {
+ max = item;
+ }
+ }
+ return max;
+}
+/**
+ * Returns the last item that is equal to or greater than every other item.
+*/
+function findLastMaxBy(array, comparator) {
+ if (array.length === 0) {
+ return undefined;
+ }
+ let max = array[0];
+ for (let i = 1; i < array.length; i++) {
+ const item = array[i];
+ if (comparator(item, max) >= 0) {
+ max = item;
+ }
+ }
+ return max;
+}
+/**
+ * Returns the first item that is equal to or less than every other item.
+*/
+function findFirstMinBy(array, comparator) {
+ return findFirstMaxBy(array, (a, b) => -comparator(a, b));
+}
+function findMaxIdxBy(array, comparator) {
+ if (array.length === 0) {
+ return -1;
+ }
+ let maxIdx = 0;
+ for (let i = 1; i < array.length; i++) {
+ const item = array[i];
+ if (comparator(item, array[maxIdx]) > 0) {
+ maxIdx = i;
+ }
+ }
+ return maxIdx;
+}
+/**
+ * Returns the first mapped value of the array which is not undefined.
+ */
+function mapFindFirst(items, mapFn) {
+ for (const value of items) {
+ const mapped = mapFn(value);
+ if (mapped !== undefined) {
+ return mapped;
+ }
+ }
+ return undefined;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/assert.js":
+/*!*****************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/assert.js ***!
+ \*****************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ assertFn: () => (/* binding */ assertFn),
+/* harmony export */ assertNever: () => (/* binding */ assertNever),
+/* harmony export */ checkAdjacentItems: () => (/* binding */ checkAdjacentItems),
+/* harmony export */ ok: () => (/* binding */ ok)
+/* harmony export */ });
+/* 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.
+ *--------------------------------------------------------------------------------------------*/
+
+/**
+ * Throws an error with the provided message if the provided value does not evaluate to a true Javascript value.
+ *
+ * @deprecated Use `assert(...)` instead.
+ * This method is usually used like this:
+ * ```ts
+ * import * as assert from 'vs/base/common/assert';
+ * assert.ok(...);
+ * ```
+ *
+ * However, `assert` in that example is a user chosen name.
+ * There is no tooling for generating such an import statement.
+ * Thus, the `assert(...)` function should be used instead.
+ */
+function ok(value, message) {
+ if (!value) {
+ throw new Error(message ? `Assertion failed (${message})` : 'Assertion Failed');
+ }
+}
+function assertNever(value, message = 'Unreachable') {
+ throw new Error(message);
+}
+/**
+ * condition must be side-effect free!
+ */
+function assertFn(condition) {
+ if (!condition()) {
+ // eslint-disable-next-line no-debugger
+ debugger;
+ // Reevaluate `condition` again to make debugging easier
+ condition();
+ (0,_errors_js__WEBPACK_IMPORTED_MODULE_0__.onUnexpectedError)(new _errors_js__WEBPACK_IMPORTED_MODULE_0__.BugIndicatingError('Assertion Failed'));
+ }
+}
+function checkAdjacentItems(items, predicate) {
+ let i = 0;
+ while (i < items.length - 1) {
+ const a = items[i];
+ const b = items[i + 1];
+ if (!predicate(a, b)) {
+ return false;
+ }
+ i++;
+ }
+ return true;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/cache.js":
+/*!****************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/cache.js ***!
+ \****************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ CachedFunction: () => (/* binding */ CachedFunction),
+/* harmony export */ LRUCachedFunction: () => (/* binding */ LRUCachedFunction)
+/* harmony export */ });
+/**
+ * Uses a LRU cache to make a given parametrized function cached.
+ * Caches just the last value.
+ * The key must be JSON serializable.
+*/
+class LRUCachedFunction {
+ constructor(fn) {
+ this.fn = fn;
+ this.lastCache = undefined;
+ this.lastArgKey = undefined;
+ }
+ get(arg) {
+ const key = JSON.stringify(arg);
+ if (this.lastArgKey !== key) {
+ this.lastArgKey = key;
+ this.lastCache = this.fn(arg);
+ }
+ return this.lastCache;
+ }
+}
+/**
+ * Uses an unbounded cache (referential equality) to memoize the results of the given function.
+*/
+class CachedFunction {
+ get cachedValues() {
+ return this._map;
+ }
+ constructor(fn) {
+ this.fn = fn;
+ this._map = new Map();
+ }
+ get(arg) {
+ if (this._map.has(arg)) {
+ return this._map.get(arg);
+ }
+ const value = this.fn(arg);
+ this._map.set(arg, value);
+ return value;
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/cancellation.js":
+/*!***********************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/cancellation.js ***!
+ \***********************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ CancellationToken: () => (/* binding */ CancellationToken),
+/* harmony export */ CancellationTokenSource: () => (/* binding */ CancellationTokenSource)
+/* harmony export */ });
+/* 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.
+ *--------------------------------------------------------------------------------------------*/
+
+const shortcutEvent = Object.freeze(function (callback, context) {
+ const handle = setTimeout(callback.bind(context), 0);
+ return { dispose() { 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 = {}));
+class MutableToken {
+ constructor() {
+ this._isCancelled = false;
+ this._emitter = null;
+ }
+ cancel() {
+ if (!this._isCancelled) {
+ this._isCancelled = true;
+ if (this._emitter) {
+ this._emitter.fire(undefined);
+ this.dispose();
+ }
+ }
+ }
+ get isCancellationRequested() {
+ return this._isCancelled;
+ }
+ get onCancellationRequested() {
+ if (this._isCancelled) {
+ return shortcutEvent;
+ }
+ if (!this._emitter) {
+ this._emitter = new _event_js__WEBPACK_IMPORTED_MODULE_0__.Emitter();
+ }
+ return this._emitter.event;
+ }
+ dispose() {
+ if (this._emitter) {
+ this._emitter.dispose();
+ this._emitter = null;
+ }
+ }
+}
+class CancellationTokenSource {
+ constructor(parent) {
+ this._token = undefined;
+ this._parentListener = undefined;
+ this._parentListener = parent && parent.onCancellationRequested(this.cancel, this);
+ }
+ get token() {
+ if (!this._token) {
+ // be lazy and create the token only when
+ // actually needed
+ this._token = new MutableToken();
+ }
+ return this._token;
+ }
+ cancel() {
+ 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();
+ }
+ }
+ dispose(cancel = false) {
+ var _a;
+ if (cancel) {
+ this.cancel();
+ }
+ (_a = this._parentListener) === null || _a === void 0 ? void 0 : _a.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();
+ }
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/codicons.js":
+/*!*******************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/codicons.js ***!
+ \*******************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ Codicon: () => (/* binding */ Codicon),
+/* harmony export */ getCodiconFontCharacters: () => (/* binding */ getCodiconFontCharacters)
+/* harmony export */ });
+/* harmony import */ var _types_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./types.js */ "./node_modules/monaco-editor/esm/vs/base/common/types.js");
+
+const _codiconFontCharacters = Object.create(null);
+function register(id, fontCharacter) {
+ if ((0,_types_js__WEBPACK_IMPORTED_MODULE_0__.isString)(fontCharacter)) {
+ const val = _codiconFontCharacters[fontCharacter];
+ if (val === undefined) {
+ throw new Error(`${id} references an unknown codicon: ${fontCharacter}`);
+ }
+ fontCharacter = val;
+ }
+ _codiconFontCharacters[id] = fontCharacter;
+ return { id };
+}
+/**
+ * Only to be used by the iconRegistry.
+ */
+function getCodiconFontCharacters() {
+ return _codiconFontCharacters;
+}
+/**
+ * The Codicon library is a set of default icons that are built-in in VS Code.
+ *
+ * In the product (outside of base) Codicons should only be used as defaults. In order to have all icons in VS Code
+ * themeable, component should define new, UI component specific icons using `iconRegistry.registerIcon`.
+ * In that call a Codicon can be named as default.
+ */
+const Codicon = {
+ // built-in icons, with image name
+ add: register('add', 0xea60),
+ plus: register('plus', 0xea60),
+ gistNew: register('gist-new', 0xea60),
+ repoCreate: register('repo-create', 0xea60),
+ lightbulb: register('lightbulb', 0xea61),
+ lightBulb: register('light-bulb', 0xea61),
+ repo: register('repo', 0xea62),
+ repoDelete: register('repo-delete', 0xea62),
+ gistFork: register('gist-fork', 0xea63),
+ repoForked: register('repo-forked', 0xea63),
+ gitPullRequest: register('git-pull-request', 0xea64),
+ gitPullRequestAbandoned: register('git-pull-request-abandoned', 0xea64),
+ recordKeys: register('record-keys', 0xea65),
+ keyboard: register('keyboard', 0xea65),
+ tag: register('tag', 0xea66),
+ tagAdd: register('tag-add', 0xea66),
+ tagRemove: register('tag-remove', 0xea66),
+ gitPullRequestLabel: register('git-pull-request-label', 0xea66),
+ person: register('person', 0xea67),
+ personFollow: register('person-follow', 0xea67),
+ personOutline: register('person-outline', 0xea67),
+ personFilled: register('person-filled', 0xea67),
+ gitBranch: register('git-branch', 0xea68),
+ gitBranchCreate: register('git-branch-create', 0xea68),
+ gitBranchDelete: register('git-branch-delete', 0xea68),
+ sourceControl: register('source-control', 0xea68),
+ mirror: register('mirror', 0xea69),
+ mirrorPublic: register('mirror-public', 0xea69),
+ star: register('star', 0xea6a),
+ starAdd: register('star-add', 0xea6a),
+ starDelete: register('star-delete', 0xea6a),
+ starEmpty: register('star-empty', 0xea6a),
+ comment: register('comment', 0xea6b),
+ commentAdd: register('comment-add', 0xea6b),
+ alert: register('alert', 0xea6c),
+ warning: register('warning', 0xea6c),
+ search: register('search', 0xea6d),
+ searchSave: register('search-save', 0xea6d),
+ logOut: register('log-out', 0xea6e),
+ signOut: register('sign-out', 0xea6e),
+ logIn: register('log-in', 0xea6f),
+ signIn: register('sign-in', 0xea6f),
+ eye: register('eye', 0xea70),
+ eyeUnwatch: register('eye-unwatch', 0xea70),
+ eyeWatch: register('eye-watch', 0xea70),
+ circleFilled: register('circle-filled', 0xea71),
+ primitiveDot: register('primitive-dot', 0xea71),
+ closeDirty: register('close-dirty', 0xea71),
+ debugBreakpoint: register('debug-breakpoint', 0xea71),
+ debugBreakpointDisabled: register('debug-breakpoint-disabled', 0xea71),
+ debugHint: register('debug-hint', 0xea71),
+ primitiveSquare: register('primitive-square', 0xea72),
+ edit: register('edit', 0xea73),
+ pencil: register('pencil', 0xea73),
+ info: register('info', 0xea74),
+ issueOpened: register('issue-opened', 0xea74),
+ gistPrivate: register('gist-private', 0xea75),
+ gitForkPrivate: register('git-fork-private', 0xea75),
+ lock: register('lock', 0xea75),
+ mirrorPrivate: register('mirror-private', 0xea75),
+ close: register('close', 0xea76),
+ removeClose: register('remove-close', 0xea76),
+ x: register('x', 0xea76),
+ repoSync: register('repo-sync', 0xea77),
+ sync: register('sync', 0xea77),
+ clone: register('clone', 0xea78),
+ desktopDownload: register('desktop-download', 0xea78),
+ beaker: register('beaker', 0xea79),
+ microscope: register('microscope', 0xea79),
+ vm: register('vm', 0xea7a),
+ deviceDesktop: register('device-desktop', 0xea7a),
+ file: register('file', 0xea7b),
+ fileText: register('file-text', 0xea7b),
+ more: register('more', 0xea7c),
+ ellipsis: register('ellipsis', 0xea7c),
+ kebabHorizontal: register('kebab-horizontal', 0xea7c),
+ mailReply: register('mail-reply', 0xea7d),
+ reply: register('reply', 0xea7d),
+ organization: register('organization', 0xea7e),
+ organizationFilled: register('organization-filled', 0xea7e),
+ organizationOutline: register('organization-outline', 0xea7e),
+ newFile: register('new-file', 0xea7f),
+ fileAdd: register('file-add', 0xea7f),
+ newFolder: register('new-folder', 0xea80),
+ fileDirectoryCreate: register('file-directory-create', 0xea80),
+ trash: register('trash', 0xea81),
+ trashcan: register('trashcan', 0xea81),
+ history: register('history', 0xea82),
+ clock: register('clock', 0xea82),
+ folder: register('folder', 0xea83),
+ fileDirectory: register('file-directory', 0xea83),
+ symbolFolder: register('symbol-folder', 0xea83),
+ logoGithub: register('logo-github', 0xea84),
+ markGithub: register('mark-github', 0xea84),
+ github: register('github', 0xea84),
+ terminal: register('terminal', 0xea85),
+ console: register('console', 0xea85),
+ repl: register('repl', 0xea85),
+ zap: register('zap', 0xea86),
+ symbolEvent: register('symbol-event', 0xea86),
+ error: register('error', 0xea87),
+ stop: register('stop', 0xea87),
+ variable: register('variable', 0xea88),
+ symbolVariable: register('symbol-variable', 0xea88),
+ array: register('array', 0xea8a),
+ symbolArray: register('symbol-array', 0xea8a),
+ symbolModule: register('symbol-module', 0xea8b),
+ symbolPackage: register('symbol-package', 0xea8b),
+ symbolNamespace: register('symbol-namespace', 0xea8b),
+ symbolObject: register('symbol-object', 0xea8b),
+ symbolMethod: register('symbol-method', 0xea8c),
+ symbolFunction: register('symbol-function', 0xea8c),
+ symbolConstructor: register('symbol-constructor', 0xea8c),
+ symbolBoolean: register('symbol-boolean', 0xea8f),
+ symbolNull: register('symbol-null', 0xea8f),
+ symbolNumeric: register('symbol-numeric', 0xea90),
+ symbolNumber: register('symbol-number', 0xea90),
+ symbolStructure: register('symbol-structure', 0xea91),
+ symbolStruct: register('symbol-struct', 0xea91),
+ symbolParameter: register('symbol-parameter', 0xea92),
+ symbolTypeParameter: register('symbol-type-parameter', 0xea92),
+ symbolKey: register('symbol-key', 0xea93),
+ symbolText: register('symbol-text', 0xea93),
+ symbolReference: register('symbol-reference', 0xea94),
+ goToFile: register('go-to-file', 0xea94),
+ symbolEnum: register('symbol-enum', 0xea95),
+ symbolValue: register('symbol-value', 0xea95),
+ symbolRuler: register('symbol-ruler', 0xea96),
+ symbolUnit: register('symbol-unit', 0xea96),
+ activateBreakpoints: register('activate-breakpoints', 0xea97),
+ archive: register('archive', 0xea98),
+ arrowBoth: register('arrow-both', 0xea99),
+ arrowDown: register('arrow-down', 0xea9a),
+ arrowLeft: register('arrow-left', 0xea9b),
+ arrowRight: register('arrow-right', 0xea9c),
+ arrowSmallDown: register('arrow-small-down', 0xea9d),
+ arrowSmallLeft: register('arrow-small-left', 0xea9e),
+ arrowSmallRight: register('arrow-small-right', 0xea9f),
+ arrowSmallUp: register('arrow-small-up', 0xeaa0),
+ arrowUp: register('arrow-up', 0xeaa1),
+ bell: register('bell', 0xeaa2),
+ bold: register('bold', 0xeaa3),
+ book: register('book', 0xeaa4),
+ bookmark: register('bookmark', 0xeaa5),
+ debugBreakpointConditionalUnverified: register('debug-breakpoint-conditional-unverified', 0xeaa6),
+ debugBreakpointConditional: register('debug-breakpoint-conditional', 0xeaa7),
+ debugBreakpointConditionalDisabled: register('debug-breakpoint-conditional-disabled', 0xeaa7),
+ debugBreakpointDataUnverified: register('debug-breakpoint-data-unverified', 0xeaa8),
+ debugBreakpointData: register('debug-breakpoint-data', 0xeaa9),
+ debugBreakpointDataDisabled: register('debug-breakpoint-data-disabled', 0xeaa9),
+ debugBreakpointLogUnverified: register('debug-breakpoint-log-unverified', 0xeaaa),
+ debugBreakpointLog: register('debug-breakpoint-log', 0xeaab),
+ debugBreakpointLogDisabled: register('debug-breakpoint-log-disabled', 0xeaab),
+ briefcase: register('briefcase', 0xeaac),
+ broadcast: register('broadcast', 0xeaad),
+ browser: register('browser', 0xeaae),
+ bug: register('bug', 0xeaaf),
+ calendar: register('calendar', 0xeab0),
+ caseSensitive: register('case-sensitive', 0xeab1),
+ check: register('check', 0xeab2),
+ checklist: register('checklist', 0xeab3),
+ chevronDown: register('chevron-down', 0xeab4),
+ dropDownButton: register('drop-down-button', 0xeab4),
+ chevronLeft: register('chevron-left', 0xeab5),
+ chevronRight: register('chevron-right', 0xeab6),
+ chevronUp: register('chevron-up', 0xeab7),
+ chromeClose: register('chrome-close', 0xeab8),
+ chromeMaximize: register('chrome-maximize', 0xeab9),
+ chromeMinimize: register('chrome-minimize', 0xeaba),
+ chromeRestore: register('chrome-restore', 0xeabb),
+ circle: register('circle', 0xeabc),
+ circleOutline: register('circle-outline', 0xeabc),
+ debugBreakpointUnverified: register('debug-breakpoint-unverified', 0xeabc),
+ circleSlash: register('circle-slash', 0xeabd),
+ circuitBoard: register('circuit-board', 0xeabe),
+ clearAll: register('clear-all', 0xeabf),
+ clippy: register('clippy', 0xeac0),
+ closeAll: register('close-all', 0xeac1),
+ cloudDownload: register('cloud-download', 0xeac2),
+ cloudUpload: register('cloud-upload', 0xeac3),
+ code: register('code', 0xeac4),
+ collapseAll: register('collapse-all', 0xeac5),
+ colorMode: register('color-mode', 0xeac6),
+ commentDiscussion: register('comment-discussion', 0xeac7),
+ compareChanges: register('compare-changes', 0xeafd),
+ creditCard: register('credit-card', 0xeac9),
+ dash: register('dash', 0xeacc),
+ dashboard: register('dashboard', 0xeacd),
+ database: register('database', 0xeace),
+ debugContinue: register('debug-continue', 0xeacf),
+ debugDisconnect: register('debug-disconnect', 0xead0),
+ debugPause: register('debug-pause', 0xead1),
+ debugRestart: register('debug-restart', 0xead2),
+ debugStart: register('debug-start', 0xead3),
+ debugStepInto: register('debug-step-into', 0xead4),
+ debugStepOut: register('debug-step-out', 0xead5),
+ debugStepOver: register('debug-step-over', 0xead6),
+ debugStop: register('debug-stop', 0xead7),
+ debug: register('debug', 0xead8),
+ deviceCameraVideo: register('device-camera-video', 0xead9),
+ deviceCamera: register('device-camera', 0xeada),
+ deviceMobile: register('device-mobile', 0xeadb),
+ diffAdded: register('diff-added', 0xeadc),
+ diffIgnored: register('diff-ignored', 0xeadd),
+ diffModified: register('diff-modified', 0xeade),
+ diffRemoved: register('diff-removed', 0xeadf),
+ diffRenamed: register('diff-renamed', 0xeae0),
+ diff: register('diff', 0xeae1),
+ discard: register('discard', 0xeae2),
+ editorLayout: register('editor-layout', 0xeae3),
+ emptyWindow: register('empty-window', 0xeae4),
+ exclude: register('exclude', 0xeae5),
+ extensions: register('extensions', 0xeae6),
+ eyeClosed: register('eye-closed', 0xeae7),
+ fileBinary: register('file-binary', 0xeae8),
+ fileCode: register('file-code', 0xeae9),
+ fileMedia: register('file-media', 0xeaea),
+ filePdf: register('file-pdf', 0xeaeb),
+ fileSubmodule: register('file-submodule', 0xeaec),
+ fileSymlinkDirectory: register('file-symlink-directory', 0xeaed),
+ fileSymlinkFile: register('file-symlink-file', 0xeaee),
+ fileZip: register('file-zip', 0xeaef),
+ files: register('files', 0xeaf0),
+ filter: register('filter', 0xeaf1),
+ flame: register('flame', 0xeaf2),
+ foldDown: register('fold-down', 0xeaf3),
+ foldUp: register('fold-up', 0xeaf4),
+ fold: register('fold', 0xeaf5),
+ folderActive: register('folder-active', 0xeaf6),
+ folderOpened: register('folder-opened', 0xeaf7),
+ gear: register('gear', 0xeaf8),
+ gift: register('gift', 0xeaf9),
+ gistSecret: register('gist-secret', 0xeafa),
+ gist: register('gist', 0xeafb),
+ gitCommit: register('git-commit', 0xeafc),
+ gitCompare: register('git-compare', 0xeafd),
+ gitMerge: register('git-merge', 0xeafe),
+ githubAction: register('github-action', 0xeaff),
+ githubAlt: register('github-alt', 0xeb00),
+ globe: register('globe', 0xeb01),
+ grabber: register('grabber', 0xeb02),
+ graph: register('graph', 0xeb03),
+ gripper: register('gripper', 0xeb04),
+ heart: register('heart', 0xeb05),
+ home: register('home', 0xeb06),
+ horizontalRule: register('horizontal-rule', 0xeb07),
+ hubot: register('hubot', 0xeb08),
+ inbox: register('inbox', 0xeb09),
+ issueClosed: register('issue-closed', 0xeba4),
+ issueReopened: register('issue-reopened', 0xeb0b),
+ issues: register('issues', 0xeb0c),
+ italic: register('italic', 0xeb0d),
+ jersey: register('jersey', 0xeb0e),
+ json: register('json', 0xeb0f),
+ bracket: register('bracket', 0xeb0f),
+ kebabVertical: register('kebab-vertical', 0xeb10),
+ key: register('key', 0xeb11),
+ law: register('law', 0xeb12),
+ lightbulbAutofix: register('lightbulb-autofix', 0xeb13),
+ linkExternal: register('link-external', 0xeb14),
+ link: register('link', 0xeb15),
+ listOrdered: register('list-ordered', 0xeb16),
+ listUnordered: register('list-unordered', 0xeb17),
+ liveShare: register('live-share', 0xeb18),
+ loading: register('loading', 0xeb19),
+ location: register('location', 0xeb1a),
+ mailRead: register('mail-read', 0xeb1b),
+ mail: register('mail', 0xeb1c),
+ markdown: register('markdown', 0xeb1d),
+ megaphone: register('megaphone', 0xeb1e),
+ mention: register('mention', 0xeb1f),
+ milestone: register('milestone', 0xeb20),
+ gitPullRequestMilestone: register('git-pull-request-milestone', 0xeb20),
+ mortarBoard: register('mortar-board', 0xeb21),
+ move: register('move', 0xeb22),
+ multipleWindows: register('multiple-windows', 0xeb23),
+ mute: register('mute', 0xeb24),
+ noNewline: register('no-newline', 0xeb25),
+ note: register('note', 0xeb26),
+ octoface: register('octoface', 0xeb27),
+ openPreview: register('open-preview', 0xeb28),
+ package: register('package', 0xeb29),
+ paintcan: register('paintcan', 0xeb2a),
+ pin: register('pin', 0xeb2b),
+ play: register('play', 0xeb2c),
+ run: register('run', 0xeb2c),
+ plug: register('plug', 0xeb2d),
+ preserveCase: register('preserve-case', 0xeb2e),
+ preview: register('preview', 0xeb2f),
+ project: register('project', 0xeb30),
+ pulse: register('pulse', 0xeb31),
+ question: register('question', 0xeb32),
+ quote: register('quote', 0xeb33),
+ radioTower: register('radio-tower', 0xeb34),
+ reactions: register('reactions', 0xeb35),
+ references: register('references', 0xeb36),
+ refresh: register('refresh', 0xeb37),
+ regex: register('regex', 0xeb38),
+ remoteExplorer: register('remote-explorer', 0xeb39),
+ remote: register('remote', 0xeb3a),
+ remove: register('remove', 0xeb3b),
+ replaceAll: register('replace-all', 0xeb3c),
+ replace: register('replace', 0xeb3d),
+ repoClone: register('repo-clone', 0xeb3e),
+ repoForcePush: register('repo-force-push', 0xeb3f),
+ repoPull: register('repo-pull', 0xeb40),
+ repoPush: register('repo-push', 0xeb41),
+ report: register('report', 0xeb42),
+ requestChanges: register('request-changes', 0xeb43),
+ rocket: register('rocket', 0xeb44),
+ rootFolderOpened: register('root-folder-opened', 0xeb45),
+ rootFolder: register('root-folder', 0xeb46),
+ rss: register('rss', 0xeb47),
+ ruby: register('ruby', 0xeb48),
+ saveAll: register('save-all', 0xeb49),
+ saveAs: register('save-as', 0xeb4a),
+ save: register('save', 0xeb4b),
+ screenFull: register('screen-full', 0xeb4c),
+ screenNormal: register('screen-normal', 0xeb4d),
+ searchStop: register('search-stop', 0xeb4e),
+ server: register('server', 0xeb50),
+ settingsGear: register('settings-gear', 0xeb51),
+ settings: register('settings', 0xeb52),
+ shield: register('shield', 0xeb53),
+ smiley: register('smiley', 0xeb54),
+ sortPrecedence: register('sort-precedence', 0xeb55),
+ splitHorizontal: register('split-horizontal', 0xeb56),
+ splitVertical: register('split-vertical', 0xeb57),
+ squirrel: register('squirrel', 0xeb58),
+ starFull: register('star-full', 0xeb59),
+ starHalf: register('star-half', 0xeb5a),
+ symbolClass: register('symbol-class', 0xeb5b),
+ symbolColor: register('symbol-color', 0xeb5c),
+ symbolCustomColor: register('symbol-customcolor', 0xeb5c),
+ symbolConstant: register('symbol-constant', 0xeb5d),
+ symbolEnumMember: register('symbol-enum-member', 0xeb5e),
+ symbolField: register('symbol-field', 0xeb5f),
+ symbolFile: register('symbol-file', 0xeb60),
+ symbolInterface: register('symbol-interface', 0xeb61),
+ symbolKeyword: register('symbol-keyword', 0xeb62),
+ symbolMisc: register('symbol-misc', 0xeb63),
+ symbolOperator: register('symbol-operator', 0xeb64),
+ symbolProperty: register('symbol-property', 0xeb65),
+ wrench: register('wrench', 0xeb65),
+ wrenchSubaction: register('wrench-subaction', 0xeb65),
+ symbolSnippet: register('symbol-snippet', 0xeb66),
+ tasklist: register('tasklist', 0xeb67),
+ telescope: register('telescope', 0xeb68),
+ textSize: register('text-size', 0xeb69),
+ threeBars: register('three-bars', 0xeb6a),
+ thumbsdown: register('thumbsdown', 0xeb6b),
+ thumbsup: register('thumbsup', 0xeb6c),
+ tools: register('tools', 0xeb6d),
+ triangleDown: register('triangle-down', 0xeb6e),
+ triangleLeft: register('triangle-left', 0xeb6f),
+ triangleRight: register('triangle-right', 0xeb70),
+ triangleUp: register('triangle-up', 0xeb71),
+ twitter: register('twitter', 0xeb72),
+ unfold: register('unfold', 0xeb73),
+ unlock: register('unlock', 0xeb74),
+ unmute: register('unmute', 0xeb75),
+ unverified: register('unverified', 0xeb76),
+ verified: register('verified', 0xeb77),
+ versions: register('versions', 0xeb78),
+ vmActive: register('vm-active', 0xeb79),
+ vmOutline: register('vm-outline', 0xeb7a),
+ vmRunning: register('vm-running', 0xeb7b),
+ watch: register('watch', 0xeb7c),
+ whitespace: register('whitespace', 0xeb7d),
+ wholeWord: register('whole-word', 0xeb7e),
+ window: register('window', 0xeb7f),
+ wordWrap: register('word-wrap', 0xeb80),
+ zoomIn: register('zoom-in', 0xeb81),
+ zoomOut: register('zoom-out', 0xeb82),
+ listFilter: register('list-filter', 0xeb83),
+ listFlat: register('list-flat', 0xeb84),
+ listSelection: register('list-selection', 0xeb85),
+ selection: register('selection', 0xeb85),
+ listTree: register('list-tree', 0xeb86),
+ debugBreakpointFunctionUnverified: register('debug-breakpoint-function-unverified', 0xeb87),
+ debugBreakpointFunction: register('debug-breakpoint-function', 0xeb88),
+ debugBreakpointFunctionDisabled: register('debug-breakpoint-function-disabled', 0xeb88),
+ debugStackframeActive: register('debug-stackframe-active', 0xeb89),
+ circleSmallFilled: register('circle-small-filled', 0xeb8a),
+ debugStackframeDot: register('debug-stackframe-dot', 0xeb8a),
+ debugStackframe: register('debug-stackframe', 0xeb8b),
+ debugStackframeFocused: register('debug-stackframe-focused', 0xeb8b),
+ debugBreakpointUnsupported: register('debug-breakpoint-unsupported', 0xeb8c),
+ symbolString: register('symbol-string', 0xeb8d),
+ debugReverseContinue: register('debug-reverse-continue', 0xeb8e),
+ debugStepBack: register('debug-step-back', 0xeb8f),
+ debugRestartFrame: register('debug-restart-frame', 0xeb90),
+ callIncoming: register('call-incoming', 0xeb92),
+ callOutgoing: register('call-outgoing', 0xeb93),
+ menu: register('menu', 0xeb94),
+ expandAll: register('expand-all', 0xeb95),
+ feedback: register('feedback', 0xeb96),
+ gitPullRequestReviewer: register('git-pull-request-reviewer', 0xeb96),
+ groupByRefType: register('group-by-ref-type', 0xeb97),
+ ungroupByRefType: register('ungroup-by-ref-type', 0xeb98),
+ account: register('account', 0xeb99),
+ gitPullRequestAssignee: register('git-pull-request-assignee', 0xeb99),
+ bellDot: register('bell-dot', 0xeb9a),
+ debugConsole: register('debug-console', 0xeb9b),
+ library: register('library', 0xeb9c),
+ output: register('output', 0xeb9d),
+ runAll: register('run-all', 0xeb9e),
+ syncIgnored: register('sync-ignored', 0xeb9f),
+ pinned: register('pinned', 0xeba0),
+ githubInverted: register('github-inverted', 0xeba1),
+ debugAlt: register('debug-alt', 0xeb91),
+ serverProcess: register('server-process', 0xeba2),
+ serverEnvironment: register('server-environment', 0xeba3),
+ pass: register('pass', 0xeba4),
+ stopCircle: register('stop-circle', 0xeba5),
+ playCircle: register('play-circle', 0xeba6),
+ record: register('record', 0xeba7),
+ debugAltSmall: register('debug-alt-small', 0xeba8),
+ vmConnect: register('vm-connect', 0xeba9),
+ cloud: register('cloud', 0xebaa),
+ merge: register('merge', 0xebab),
+ exportIcon: register('export', 0xebac),
+ graphLeft: register('graph-left', 0xebad),
+ magnet: register('magnet', 0xebae),
+ notebook: register('notebook', 0xebaf),
+ redo: register('redo', 0xebb0),
+ checkAll: register('check-all', 0xebb1),
+ pinnedDirty: register('pinned-dirty', 0xebb2),
+ passFilled: register('pass-filled', 0xebb3),
+ circleLargeFilled: register('circle-large-filled', 0xebb4),
+ circleLarge: register('circle-large', 0xebb5),
+ circleLargeOutline: register('circle-large-outline', 0xebb5),
+ combine: register('combine', 0xebb6),
+ gather: register('gather', 0xebb6),
+ table: register('table', 0xebb7),
+ variableGroup: register('variable-group', 0xebb8),
+ typeHierarchy: register('type-hierarchy', 0xebb9),
+ typeHierarchySub: register('type-hierarchy-sub', 0xebba),
+ typeHierarchySuper: register('type-hierarchy-super', 0xebbb),
+ gitPullRequestCreate: register('git-pull-request-create', 0xebbc),
+ runAbove: register('run-above', 0xebbd),
+ runBelow: register('run-below', 0xebbe),
+ notebookTemplate: register('notebook-template', 0xebbf),
+ debugRerun: register('debug-rerun', 0xebc0),
+ workspaceTrusted: register('workspace-trusted', 0xebc1),
+ workspaceUntrusted: register('workspace-untrusted', 0xebc2),
+ workspaceUnspecified: register('workspace-unspecified', 0xebc3),
+ terminalCmd: register('terminal-cmd', 0xebc4),
+ terminalDebian: register('terminal-debian', 0xebc5),
+ terminalLinux: register('terminal-linux', 0xebc6),
+ terminalPowershell: register('terminal-powershell', 0xebc7),
+ terminalTmux: register('terminal-tmux', 0xebc8),
+ terminalUbuntu: register('terminal-ubuntu', 0xebc9),
+ terminalBash: register('terminal-bash', 0xebca),
+ arrowSwap: register('arrow-swap', 0xebcb),
+ copy: register('copy', 0xebcc),
+ personAdd: register('person-add', 0xebcd),
+ filterFilled: register('filter-filled', 0xebce),
+ wand: register('wand', 0xebcf),
+ debugLineByLine: register('debug-line-by-line', 0xebd0),
+ inspect: register('inspect', 0xebd1),
+ layers: register('layers', 0xebd2),
+ layersDot: register('layers-dot', 0xebd3),
+ layersActive: register('layers-active', 0xebd4),
+ compass: register('compass', 0xebd5),
+ compassDot: register('compass-dot', 0xebd6),
+ compassActive: register('compass-active', 0xebd7),
+ azure: register('azure', 0xebd8),
+ issueDraft: register('issue-draft', 0xebd9),
+ gitPullRequestClosed: register('git-pull-request-closed', 0xebda),
+ gitPullRequestDraft: register('git-pull-request-draft', 0xebdb),
+ debugAll: register('debug-all', 0xebdc),
+ debugCoverage: register('debug-coverage', 0xebdd),
+ runErrors: register('run-errors', 0xebde),
+ folderLibrary: register('folder-library', 0xebdf),
+ debugContinueSmall: register('debug-continue-small', 0xebe0),
+ beakerStop: register('beaker-stop', 0xebe1),
+ graphLine: register('graph-line', 0xebe2),
+ graphScatter: register('graph-scatter', 0xebe3),
+ pieChart: register('pie-chart', 0xebe4),
+ bracketDot: register('bracket-dot', 0xebe5),
+ bracketError: register('bracket-error', 0xebe6),
+ lockSmall: register('lock-small', 0xebe7),
+ azureDevops: register('azure-devops', 0xebe8),
+ verifiedFilled: register('verified-filled', 0xebe9),
+ newLine: register('newline', 0xebea),
+ layout: register('layout', 0xebeb),
+ layoutActivitybarLeft: register('layout-activitybar-left', 0xebec),
+ layoutActivitybarRight: register('layout-activitybar-right', 0xebed),
+ layoutPanelLeft: register('layout-panel-left', 0xebee),
+ layoutPanelCenter: register('layout-panel-center', 0xebef),
+ layoutPanelJustify: register('layout-panel-justify', 0xebf0),
+ layoutPanelRight: register('layout-panel-right', 0xebf1),
+ layoutPanel: register('layout-panel', 0xebf2),
+ layoutSidebarLeft: register('layout-sidebar-left', 0xebf3),
+ layoutSidebarRight: register('layout-sidebar-right', 0xebf4),
+ layoutStatusbar: register('layout-statusbar', 0xebf5),
+ layoutMenubar: register('layout-menubar', 0xebf6),
+ layoutCentered: register('layout-centered', 0xebf7),
+ layoutSidebarRightOff: register('layout-sidebar-right-off', 0xec00),
+ layoutPanelOff: register('layout-panel-off', 0xec01),
+ layoutSidebarLeftOff: register('layout-sidebar-left-off', 0xec02),
+ target: register('target', 0xebf8),
+ indent: register('indent', 0xebf9),
+ recordSmall: register('record-small', 0xebfa),
+ errorSmall: register('error-small', 0xebfb),
+ arrowCircleDown: register('arrow-circle-down', 0xebfc),
+ arrowCircleLeft: register('arrow-circle-left', 0xebfd),
+ arrowCircleRight: register('arrow-circle-right', 0xebfe),
+ arrowCircleUp: register('arrow-circle-up', 0xebff),
+ heartFilled: register('heart-filled', 0xec04),
+ map: register('map', 0xec05),
+ mapFilled: register('map-filled', 0xec06),
+ circleSmall: register('circle-small', 0xec07),
+ bellSlash: register('bell-slash', 0xec08),
+ bellSlashDot: register('bell-slash-dot', 0xec09),
+ commentUnresolved: register('comment-unresolved', 0xec0a),
+ gitPullRequestGoToChanges: register('git-pull-request-go-to-changes', 0xec0b),
+ gitPullRequestNewChanges: register('git-pull-request-new-changes', 0xec0c),
+ searchFuzzy: register('search-fuzzy', 0xec0d),
+ commentDraft: register('comment-draft', 0xec0e),
+ send: register('send', 0xec0f),
+ sparkle: register('sparkle', 0xec10),
+ insert: register('insert', 0xec11),
+ mic: register('mic', 0xec12),
+ thumbsDownFilled: register('thumbsdown-filled', 0xec13),
+ thumbsUpFilled: register('thumbsup-filled', 0xec14),
+ coffee: register('coffee', 0xec15),
+ snake: register('snake', 0xec16),
+ game: register('game', 0xec17),
+ vr: register('vr', 0xec18),
+ chip: register('chip', 0xec19),
+ piano: register('piano', 0xec1a),
+ music: register('music', 0xec1b),
+ micFilled: register('mic-filled', 0xec1c),
+ gitFetch: register('git-fetch', 0xec1d),
+ copilot: register('copilot', 0xec1e),
+ lightbulbSparkle: register('lightbulb-sparkle', 0xec1f),
+ lightbulbSparkleAutofix: register('lightbulb-sparkle-autofix', 0xec1f),
+ robot: register('robot', 0xec20),
+ sparkleFilled: register('sparkle-filled', 0xec21),
+ diffSingle: register('diff-single', 0xec22),
+ diffMultiple: register('diff-multiple', 0xec23),
+ // derived icons, that could become separate icons
+ dialogError: register('dialog-error', 'error'),
+ dialogWarning: register('dialog-warning', 'warning'),
+ dialogInfo: register('dialog-info', 'info'),
+ dialogClose: register('dialog-close', 'close'),
+ treeItemExpanded: register('tree-item-expanded', 'chevron-down'), // collapsed is done with rotation
+ treeFilterOnTypeOn: register('tree-filter-on-type-on', 'list-filter'),
+ treeFilterOnTypeOff: register('tree-filter-on-type-off', 'list-selection'),
+ treeFilterClear: register('tree-filter-clear', 'close'),
+ treeItemLoading: register('tree-item-loading', 'loading'),
+ menuSelection: register('menu-selection', 'check'),
+ menuSubmenu: register('menu-submenu', 'chevron-right'),
+ menuBarMore: register('menubar-more', 'more'),
+ scrollbarButtonLeft: register('scrollbar-button-left', 'triangle-left'),
+ scrollbarButtonRight: register('scrollbar-button-right', 'triangle-right'),
+ scrollbarButtonUp: register('scrollbar-button-up', 'triangle-up'),
+ scrollbarButtonDown: register('scrollbar-button-down', 'triangle-down'),
+ toolBarMore: register('toolbar-more', 'more'),
+ quickInputBack: register('quick-input-back', 'arrow-left')
+};
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/color.js":
+/*!****************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/color.js ***!
+ \****************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ Color: () => (/* binding */ Color),
+/* harmony export */ HSLA: () => (/* binding */ HSLA),
+/* harmony export */ HSVA: () => (/* binding */ HSVA),
+/* harmony export */ RGBA: () => (/* binding */ RGBA)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+function roundFloat(number, decimalPoints) {
+ const decimal = Math.pow(10, decimalPoints);
+ return Math.round(number * decimal) / decimal;
+}
+class RGBA {
+ constructor(r, g, b, a = 1) {
+ this._rgbaBrand = undefined;
+ this.r = Math.min(255, Math.max(0, r)) | 0;
+ this.g = Math.min(255, Math.max(0, g)) | 0;
+ this.b = Math.min(255, Math.max(0, b)) | 0;
+ this.a = roundFloat(Math.max(Math.min(1, a), 0), 3);
+ }
+ static equals(a, b) {
+ return a.r === b.r && a.g === b.g && a.b === b.b && a.a === b.a;
+ }
+}
+class HSLA {
+ constructor(h, s, l, a) {
+ this._hslaBrand = undefined;
+ this.h = Math.max(Math.min(360, h), 0) | 0;
+ this.s = roundFloat(Math.max(Math.min(1, s), 0), 3);
+ this.l = roundFloat(Math.max(Math.min(1, l), 0), 3);
+ this.a = roundFloat(Math.max(Math.min(1, a), 0), 3);
+ }
+ static equals(a, b) {
+ return a.h === b.h && a.s === b.s && a.l === b.l && a.a === b.a;
+ }
+ /**
+ * Converts an RGB color value to HSL. Conversion formula
+ * adapted from http://en.wikipedia.org/wiki/HSL_color_space.
+ * Assumes r, g, and b are contained in the set [0, 255] and
+ * returns h in the set [0, 360], s, and l in the set [0, 1].
+ */
+ static fromRGBA(rgba) {
+ const r = rgba.r / 255;
+ const g = rgba.g / 255;
+ const b = rgba.b / 255;
+ const a = rgba.a;
+ const max = Math.max(r, g, b);
+ const min = Math.min(r, g, b);
+ let h = 0;
+ let s = 0;
+ const l = (min + max) / 2;
+ const chroma = max - min;
+ if (chroma > 0) {
+ s = Math.min((l <= 0.5 ? chroma / (2 * l) : chroma / (2 - (2 * l))), 1);
+ switch (max) {
+ case r:
+ h = (g - b) / chroma + (g < b ? 6 : 0);
+ break;
+ case g:
+ h = (b - r) / chroma + 2;
+ break;
+ case b:
+ h = (r - g) / chroma + 4;
+ break;
+ }
+ h *= 60;
+ h = Math.round(h);
+ }
+ return new HSLA(h, s, l, a);
+ }
+ static _hue2rgb(p, q, t) {
+ if (t < 0) {
+ t += 1;
+ }
+ if (t > 1) {
+ t -= 1;
+ }
+ if (t < 1 / 6) {
+ return p + (q - p) * 6 * t;
+ }
+ if (t < 1 / 2) {
+ return q;
+ }
+ if (t < 2 / 3) {
+ return p + (q - p) * (2 / 3 - t) * 6;
+ }
+ return p;
+ }
+ /**
+ * Converts an HSL color value to RGB. Conversion formula
+ * adapted from http://en.wikipedia.org/wiki/HSL_color_space.
+ * Assumes h in the set [0, 360] s, and l are contained in the set [0, 1] and
+ * returns r, g, and b in the set [0, 255].
+ */
+ static toRGBA(hsla) {
+ const h = hsla.h / 360;
+ const { s, l, a } = hsla;
+ let r, g, b;
+ if (s === 0) {
+ r = g = b = l; // achromatic
+ }
+ else {
+ const q = l < 0.5 ? l * (1 + s) : l + s - l * s;
+ const p = 2 * l - q;
+ r = HSLA._hue2rgb(p, q, h + 1 / 3);
+ g = HSLA._hue2rgb(p, q, h);
+ b = HSLA._hue2rgb(p, q, h - 1 / 3);
+ }
+ return new RGBA(Math.round(r * 255), Math.round(g * 255), Math.round(b * 255), a);
+ }
+}
+class HSVA {
+ constructor(h, s, v, a) {
+ this._hsvaBrand = undefined;
+ this.h = Math.max(Math.min(360, h), 0) | 0;
+ this.s = roundFloat(Math.max(Math.min(1, s), 0), 3);
+ this.v = roundFloat(Math.max(Math.min(1, v), 0), 3);
+ this.a = roundFloat(Math.max(Math.min(1, a), 0), 3);
+ }
+ static equals(a, b) {
+ return a.h === b.h && a.s === b.s && a.v === b.v && a.a === b.a;
+ }
+ // from http://www.rapidtables.com/convert/color/rgb-to-hsv.htm
+ static fromRGBA(rgba) {
+ const r = rgba.r / 255;
+ const g = rgba.g / 255;
+ const b = rgba.b / 255;
+ const cmax = Math.max(r, g, b);
+ const cmin = Math.min(r, g, b);
+ const delta = cmax - cmin;
+ const s = cmax === 0 ? 0 : (delta / cmax);
+ let m;
+ if (delta === 0) {
+ m = 0;
+ }
+ else if (cmax === r) {
+ m = ((((g - b) / delta) % 6) + 6) % 6;
+ }
+ else if (cmax === g) {
+ m = ((b - r) / delta) + 2;
+ }
+ else {
+ m = ((r - g) / delta) + 4;
+ }
+ return new HSVA(Math.round(m * 60), s, cmax, rgba.a);
+ }
+ // from http://www.rapidtables.com/convert/color/hsv-to-rgb.htm
+ static toRGBA(hsva) {
+ const { h, s, v, a } = hsva;
+ const c = v * s;
+ const x = c * (1 - Math.abs((h / 60) % 2 - 1));
+ const m = v - c;
+ let [r, g, b] = [0, 0, 0];
+ if (h < 60) {
+ r = c;
+ g = x;
+ }
+ else if (h < 120) {
+ r = x;
+ g = c;
+ }
+ else if (h < 180) {
+ g = c;
+ b = x;
+ }
+ else if (h < 240) {
+ g = x;
+ b = c;
+ }
+ else if (h < 300) {
+ r = x;
+ b = c;
+ }
+ else if (h <= 360) {
+ r = c;
+ b = x;
+ }
+ r = Math.round((r + m) * 255);
+ g = Math.round((g + m) * 255);
+ b = Math.round((b + m) * 255);
+ return new RGBA(r, g, b, a);
+ }
+}
+class Color {
+ static fromHex(hex) {
+ return Color.Format.CSS.parseHex(hex) || Color.red;
+ }
+ static equals(a, b) {
+ if (!a && !b) {
+ return true;
+ }
+ if (!a || !b) {
+ return false;
+ }
+ return a.equals(b);
+ }
+ get hsla() {
+ if (this._hsla) {
+ return this._hsla;
+ }
+ else {
+ return HSLA.fromRGBA(this.rgba);
+ }
+ }
+ get hsva() {
+ if (this._hsva) {
+ return this._hsva;
+ }
+ return HSVA.fromRGBA(this.rgba);
+ }
+ constructor(arg) {
+ if (!arg) {
+ throw new Error('Color needs a value');
+ }
+ else if (arg instanceof RGBA) {
+ this.rgba = arg;
+ }
+ else if (arg instanceof HSLA) {
+ this._hsla = arg;
+ this.rgba = HSLA.toRGBA(arg);
+ }
+ else if (arg instanceof HSVA) {
+ this._hsva = arg;
+ this.rgba = HSVA.toRGBA(arg);
+ }
+ else {
+ throw new Error('Invalid color ctor argument');
+ }
+ }
+ equals(other) {
+ return !!other && RGBA.equals(this.rgba, other.rgba) && HSLA.equals(this.hsla, other.hsla) && HSVA.equals(this.hsva, other.hsva);
+ }
+ /**
+ * http://www.w3.org/TR/WCAG20/#relativeluminancedef
+ * Returns the number in the set [0, 1]. O => Darkest Black. 1 => Lightest white.
+ */
+ getRelativeLuminance() {
+ const R = Color._relativeLuminanceForComponent(this.rgba.r);
+ const G = Color._relativeLuminanceForComponent(this.rgba.g);
+ const B = Color._relativeLuminanceForComponent(this.rgba.b);
+ const luminance = 0.2126 * R + 0.7152 * G + 0.0722 * B;
+ return roundFloat(luminance, 4);
+ }
+ static _relativeLuminanceForComponent(color) {
+ const c = color / 255;
+ return (c <= 0.03928) ? c / 12.92 : Math.pow(((c + 0.055) / 1.055), 2.4);
+ }
+ /**
+ * http://24ways.org/2010/calculating-color-contrast
+ * Return 'true' if lighter color otherwise 'false'
+ */
+ isLighter() {
+ const yiq = (this.rgba.r * 299 + this.rgba.g * 587 + this.rgba.b * 114) / 1000;
+ return yiq >= 128;
+ }
+ isLighterThan(another) {
+ const lum1 = this.getRelativeLuminance();
+ const lum2 = another.getRelativeLuminance();
+ return lum1 > lum2;
+ }
+ isDarkerThan(another) {
+ const lum1 = this.getRelativeLuminance();
+ const lum2 = another.getRelativeLuminance();
+ return lum1 < lum2;
+ }
+ lighten(factor) {
+ return new Color(new HSLA(this.hsla.h, this.hsla.s, this.hsla.l + this.hsla.l * factor, this.hsla.a));
+ }
+ darken(factor) {
+ return new Color(new HSLA(this.hsla.h, this.hsla.s, this.hsla.l - this.hsla.l * factor, this.hsla.a));
+ }
+ transparent(factor) {
+ const { r, g, b, a } = this.rgba;
+ return new Color(new RGBA(r, g, b, a * factor));
+ }
+ isTransparent() {
+ return this.rgba.a === 0;
+ }
+ isOpaque() {
+ return this.rgba.a === 1;
+ }
+ opposite() {
+ return new Color(new RGBA(255 - this.rgba.r, 255 - this.rgba.g, 255 - this.rgba.b, this.rgba.a));
+ }
+ makeOpaque(opaqueBackground) {
+ if (this.isOpaque() || opaqueBackground.rgba.a !== 1) {
+ // only allow to blend onto a non-opaque color onto a opaque color
+ return this;
+ }
+ const { r, g, b, a } = this.rgba;
+ // https://stackoverflow.com/questions/12228548/finding-equivalent-color-with-opacity
+ return new Color(new RGBA(opaqueBackground.rgba.r - a * (opaqueBackground.rgba.r - r), opaqueBackground.rgba.g - a * (opaqueBackground.rgba.g - g), opaqueBackground.rgba.b - a * (opaqueBackground.rgba.b - b), 1));
+ }
+ toString() {
+ if (!this._toString) {
+ this._toString = Color.Format.CSS.format(this);
+ }
+ return this._toString;
+ }
+ static getLighterColor(of, relative, factor) {
+ if (of.isLighterThan(relative)) {
+ return of;
+ }
+ factor = factor ? factor : 0.5;
+ const lum1 = of.getRelativeLuminance();
+ const lum2 = relative.getRelativeLuminance();
+ factor = factor * (lum2 - lum1) / lum2;
+ return of.lighten(factor);
+ }
+ static getDarkerColor(of, relative, factor) {
+ if (of.isDarkerThan(relative)) {
+ return of;
+ }
+ factor = factor ? factor : 0.5;
+ const lum1 = of.getRelativeLuminance();
+ const lum2 = relative.getRelativeLuminance();
+ factor = factor * (lum1 - lum2) / lum1;
+ return of.darken(factor);
+ }
+}
+Color.white = new Color(new RGBA(255, 255, 255, 1));
+Color.black = new Color(new RGBA(0, 0, 0, 1));
+Color.red = new Color(new RGBA(255, 0, 0, 1));
+Color.blue = new Color(new RGBA(0, 0, 255, 1));
+Color.green = new Color(new RGBA(0, 255, 0, 1));
+Color.cyan = new Color(new RGBA(0, 255, 255, 1));
+Color.lightgrey = new Color(new RGBA(211, 211, 211, 1));
+Color.transparent = new Color(new RGBA(0, 0, 0, 0));
+(function (Color) {
+ let Format;
+ (function (Format) {
+ let CSS;
+ (function (CSS) {
+ function formatRGB(color) {
+ if (color.rgba.a === 1) {
+ return `rgb(${color.rgba.r}, ${color.rgba.g}, ${color.rgba.b})`;
+ }
+ return Color.Format.CSS.formatRGBA(color);
+ }
+ CSS.formatRGB = formatRGB;
+ function formatRGBA(color) {
+ return `rgba(${color.rgba.r}, ${color.rgba.g}, ${color.rgba.b}, ${+(color.rgba.a).toFixed(2)})`;
+ }
+ CSS.formatRGBA = formatRGBA;
+ function formatHSL(color) {
+ if (color.hsla.a === 1) {
+ return `hsl(${color.hsla.h}, ${(color.hsla.s * 100).toFixed(2)}%, ${(color.hsla.l * 100).toFixed(2)}%)`;
+ }
+ return Color.Format.CSS.formatHSLA(color);
+ }
+ CSS.formatHSL = formatHSL;
+ function formatHSLA(color) {
+ return `hsla(${color.hsla.h}, ${(color.hsla.s * 100).toFixed(2)}%, ${(color.hsla.l * 100).toFixed(2)}%, ${color.hsla.a.toFixed(2)})`;
+ }
+ CSS.formatHSLA = formatHSLA;
+ function _toTwoDigitHex(n) {
+ const r = n.toString(16);
+ return r.length !== 2 ? '0' + r : r;
+ }
+ /**
+ * Formats the color as #RRGGBB
+ */
+ function formatHex(color) {
+ return `#${_toTwoDigitHex(color.rgba.r)}${_toTwoDigitHex(color.rgba.g)}${_toTwoDigitHex(color.rgba.b)}`;
+ }
+ CSS.formatHex = formatHex;
+ /**
+ * Formats the color as #RRGGBBAA
+ * If 'compact' is set, colors without transparancy will be printed as #RRGGBB
+ */
+ function formatHexA(color, compact = false) {
+ if (compact && color.rgba.a === 1) {
+ return Color.Format.CSS.formatHex(color);
+ }
+ return `#${_toTwoDigitHex(color.rgba.r)}${_toTwoDigitHex(color.rgba.g)}${_toTwoDigitHex(color.rgba.b)}${_toTwoDigitHex(Math.round(color.rgba.a * 255))}`;
+ }
+ CSS.formatHexA = formatHexA;
+ /**
+ * The default format will use HEX if opaque and RGBA otherwise.
+ */
+ function format(color) {
+ if (color.isOpaque()) {
+ return Color.Format.CSS.formatHex(color);
+ }
+ return Color.Format.CSS.formatRGBA(color);
+ }
+ CSS.format = format;
+ /**
+ * Converts an Hex color value to a Color.
+ * returns r, g, and b are contained in the set [0, 255]
+ * @param hex string (#RGB, #RGBA, #RRGGBB or #RRGGBBAA).
+ */
+ function parseHex(hex) {
+ const length = hex.length;
+ if (length === 0) {
+ // Invalid color
+ return null;
+ }
+ if (hex.charCodeAt(0) !== 35 /* CharCode.Hash */) {
+ // Does not begin with a #
+ return null;
+ }
+ if (length === 7) {
+ // #RRGGBB format
+ const r = 16 * _parseHexDigit(hex.charCodeAt(1)) + _parseHexDigit(hex.charCodeAt(2));
+ const g = 16 * _parseHexDigit(hex.charCodeAt(3)) + _parseHexDigit(hex.charCodeAt(4));
+ const b = 16 * _parseHexDigit(hex.charCodeAt(5)) + _parseHexDigit(hex.charCodeAt(6));
+ return new Color(new RGBA(r, g, b, 1));
+ }
+ if (length === 9) {
+ // #RRGGBBAA format
+ const r = 16 * _parseHexDigit(hex.charCodeAt(1)) + _parseHexDigit(hex.charCodeAt(2));
+ const g = 16 * _parseHexDigit(hex.charCodeAt(3)) + _parseHexDigit(hex.charCodeAt(4));
+ const b = 16 * _parseHexDigit(hex.charCodeAt(5)) + _parseHexDigit(hex.charCodeAt(6));
+ const a = 16 * _parseHexDigit(hex.charCodeAt(7)) + _parseHexDigit(hex.charCodeAt(8));
+ return new Color(new RGBA(r, g, b, a / 255));
+ }
+ if (length === 4) {
+ // #RGB format
+ const r = _parseHexDigit(hex.charCodeAt(1));
+ const g = _parseHexDigit(hex.charCodeAt(2));
+ const b = _parseHexDigit(hex.charCodeAt(3));
+ return new Color(new RGBA(16 * r + r, 16 * g + g, 16 * b + b));
+ }
+ if (length === 5) {
+ // #RGBA format
+ const r = _parseHexDigit(hex.charCodeAt(1));
+ const g = _parseHexDigit(hex.charCodeAt(2));
+ const b = _parseHexDigit(hex.charCodeAt(3));
+ const a = _parseHexDigit(hex.charCodeAt(4));
+ return new Color(new RGBA(16 * r + r, 16 * g + g, 16 * b + b, (16 * a + a) / 255));
+ }
+ // Invalid color
+ return null;
+ }
+ CSS.parseHex = parseHex;
+ function _parseHexDigit(charCode) {
+ switch (charCode) {
+ case 48 /* CharCode.Digit0 */: return 0;
+ case 49 /* CharCode.Digit1 */: return 1;
+ case 50 /* CharCode.Digit2 */: return 2;
+ case 51 /* CharCode.Digit3 */: return 3;
+ case 52 /* CharCode.Digit4 */: return 4;
+ case 53 /* CharCode.Digit5 */: return 5;
+ case 54 /* CharCode.Digit6 */: return 6;
+ case 55 /* CharCode.Digit7 */: return 7;
+ case 56 /* CharCode.Digit8 */: return 8;
+ case 57 /* CharCode.Digit9 */: return 9;
+ case 97 /* CharCode.a */: return 10;
+ case 65 /* CharCode.A */: return 10;
+ case 98 /* CharCode.b */: return 11;
+ case 66 /* CharCode.B */: return 11;
+ case 99 /* CharCode.c */: return 12;
+ case 67 /* CharCode.C */: return 12;
+ case 100 /* CharCode.d */: return 13;
+ case 68 /* CharCode.D */: return 13;
+ case 101 /* CharCode.e */: return 14;
+ case 69 /* CharCode.E */: return 14;
+ case 102 /* CharCode.f */: return 15;
+ case 70 /* CharCode.F */: return 15;
+ }
+ return 0;
+ }
+ })(CSS = Format.CSS || (Format.CSS = {}));
+ })(Format = Color.Format || (Color.Format = {}));
+})(Color || (Color = {}));
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/diff/diff.js":
+/*!********************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/diff/diff.js ***!
+ \********************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ LcsDiff: () => (/* binding */ LcsDiff),
+/* harmony export */ StringDiffSequence: () => (/* binding */ StringDiffSequence),
+/* harmony export */ stringDiff: () => (/* binding */ stringDiff)
+/* harmony export */ });
+/* harmony import */ var _diffChange_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./diffChange.js */ "./node_modules/monaco-editor/esm/vs/base/common/diff/diffChange.js");
+/* 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.
+ *--------------------------------------------------------------------------------------------*/
+
+
+class StringDiffSequence {
+ constructor(source) {
+ this.source = source;
+ }
+ getElements() {
+ const source = this.source;
+ const characters = new Int32Array(source.length);
+ for (let i = 0, len = source.length; i < len; i++) {
+ characters[i] = source.charCodeAt(i);
+ }
+ return characters;
+ }
+}
+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
+//
+class Debug {
+ static Assert(condition, message) {
+ if (!condition) {
+ throw new Error(message);
+ }
+ }
+}
+class 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.
+ */
+ static Copy(sourceArray, sourceIndex, destinationArray, destinationIndex, length) {
+ for (let i = 0; i < length; i++) {
+ destinationArray[destinationIndex + i] = sourceArray[sourceIndex + i];
+ }
+ }
+ static Copy2(sourceArray, sourceIndex, destinationArray, destinationIndex, length) {
+ for (let i = 0; i < length; i++) {
+ destinationArray[destinationIndex + i] = sourceArray[sourceIndex + i];
+ }
+ }
+}
+/**
+ * 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
+ * MarkNextChange() 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.
+ */
+class DiffChangeHelper {
+ /**
+ * Constructs a new DiffChangeHelper for the given DiffSequences.
+ */
+ constructor() {
+ this.m_changes = [];
+ this.m_originalStart = 1073741824 /* Constants.MAX_SAFE_SMALL_INTEGER */;
+ this.m_modifiedStart = 1073741824 /* Constants.MAX_SAFE_SMALL_INTEGER */;
+ this.m_originalCount = 0;
+ this.m_modifiedCount = 0;
+ }
+ /**
+ * Marks the beginning of the next change in the set of differences.
+ */
+ MarkNextChange() {
+ // 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 /* Constants.MAX_SAFE_SMALL_INTEGER */;
+ this.m_modifiedStart = 1073741824 /* Constants.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.
+ */
+ AddOriginalElement(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.
+ */
+ AddModifiedElement(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.
+ */
+ getChanges() {
+ 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
+ */
+ getReverseChanges() {
+ 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;
+ }
+}
+/**
+ * An implementation of the difference algorithm described in
+ * "An O(ND) Difference Algorithm and its variations" by Eugene W. Myers
+ */
+class LcsDiff {
+ /**
+ * Constructs the DiffFinder
+ */
+ constructor(originalSequence, modifiedSequence, continueProcessingPredicate = null) {
+ this.ContinueProcessingPredicate = continueProcessingPredicate;
+ this._originalSequence = originalSequence;
+ this._modifiedSequence = modifiedSequence;
+ const [originalStringElements, originalElementsOrHash, originalHasStrings] = LcsDiff._getElements(originalSequence);
+ const [modifiedStringElements, modifiedElementsOrHash, modifiedHasStrings] = LcsDiff._getElements(modifiedSequence);
+ this._hasStrings = (originalHasStrings && modifiedHasStrings);
+ this._originalStringElements = originalStringElements;
+ this._originalElementsOrHash = originalElementsOrHash;
+ this._modifiedStringElements = modifiedStringElements;
+ this._modifiedElementsOrHash = modifiedElementsOrHash;
+ this.m_forwardHistory = [];
+ this.m_reverseHistory = [];
+ }
+ static _isStringArray(arr) {
+ return (arr.length > 0 && typeof arr[0] === 'string');
+ }
+ static _getElements(sequence) {
+ const elements = sequence.getElements();
+ if (LcsDiff._isStringArray(elements)) {
+ const hashes = new Int32Array(elements.length);
+ for (let i = 0, len = elements.length; i < len; i++) {
+ hashes[i] = (0,_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];
+ }
+ ElementsAreEqual(originalIndex, newIndex) {
+ if (this._originalElementsOrHash[originalIndex] !== this._modifiedElementsOrHash[newIndex]) {
+ return false;
+ }
+ return (this._hasStrings ? this._originalStringElements[originalIndex] === this._modifiedStringElements[newIndex] : true);
+ }
+ ElementsAreStrictEqual(originalIndex, newIndex) {
+ if (!this.ElementsAreEqual(originalIndex, newIndex)) {
+ return false;
+ }
+ const originalElement = LcsDiff._getStrictElement(this._originalSequence, originalIndex);
+ const modifiedElement = LcsDiff._getStrictElement(this._modifiedSequence, newIndex);
+ return (originalElement === modifiedElement);
+ }
+ static _getStrictElement(sequence, index) {
+ if (typeof sequence.getStrictElement === 'function') {
+ return sequence.getStrictElement(index);
+ }
+ return null;
+ }
+ OriginalElementsAreEqual(index1, index2) {
+ if (this._originalElementsOrHash[index1] !== this._originalElementsOrHash[index2]) {
+ return false;
+ }
+ return (this._hasStrings ? this._originalStringElements[index1] === this._originalStringElements[index2] : true);
+ }
+ ModifiedElementsAreEqual(index1, index2) {
+ if (this._modifiedElementsOrHash[index1] !== this._modifiedElementsOrHash[index2]) {
+ return false;
+ }
+ return (this._hasStrings ? this._modifiedStringElements[index1] === this._modifiedStringElements[index2] : true);
+ }
+ ComputeDiff(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.
+ */
+ _ComputeDiff(originalStart, originalEnd, modifiedStart, modifiedEnd, pretty) {
+ const quitEarlyArr = [false];
+ let 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.
+ */
+ ComputeDiffRecursive(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) {
+ let changes;
+ 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.
+ const midOriginalArr = [0];
+ const midModifiedArr = [0];
+ const result = this.ComputeRecursionPoint(originalStart, originalEnd, modifiedStart, modifiedEnd, midOriginalArr, midModifiedArr, quitEarlyArr);
+ const midOriginal = midOriginalArr[0];
+ const 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
+ const leftChanges = this.ComputeDiffRecursive(originalStart, midOriginal, modifiedStart, midModified, quitEarlyArr);
+ let rightChanges = [];
+ if (!quitEarlyArr[0]) {
+ rightChanges = this.ComputeDiffRecursive(midOriginal + 1, originalEnd, midModified + 1, modifiedEnd, quitEarlyArr);
+ }
+ else {
+ // We didn'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)
+ ];
+ }
+ WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr) {
+ let forwardChanges = null;
+ let reverseChanges = null;
+ // First, walk backward through the forward diagonals history
+ let changeHelper = new DiffChangeHelper();
+ let diagonalMin = diagonalForwardStart;
+ let diagonalMax = diagonalForwardEnd;
+ let diagonalRelative = (midOriginalArr[0] - midModifiedArr[0]) - diagonalForwardOffset;
+ let lastOriginalIndex = -1073741824 /* Constants.MIN_SAFE_SMALL_INTEGER */;
+ let historyIndex = this.m_forwardHistory.length - 1;
+ do {
+ // Get the diagonal index from the relative diagonal number
+ const 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
+ let originalStartPoint = midOriginalArr[0] + 1;
+ let modifiedStartPoint = midModifiedArr[0] + 1;
+ if (forwardChanges !== null && forwardChanges.length > 0) {
+ const 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 /* Constants.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
+ const 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
+ */
+ ComputeRecursionPoint(originalStart, originalEnd, modifiedStart, modifiedEnd, midOriginalArr, midModifiedArr, quitEarlyArr) {
+ let originalIndex = 0, modifiedIndex = 0;
+ let diagonalForwardStart = 0, diagonalForwardEnd = 0;
+ let 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.
+ const maxDifferences = (originalEnd - originalStart) + (modifiedEnd - modifiedStart);
+ const numDiagonals = maxDifferences + 1;
+ const forwardPoints = new Int32Array(numDiagonals);
+ const 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)
+ const diagonalForwardBase = (modifiedEnd - modifiedStart);
+ const 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)
+ const diagonalForwardOffset = (originalStart - modifiedStart);
+ const 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
+ const delta = diagonalReverseBase - diagonalForwardBase;
+ const 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 (let numDifferences = 1; numDifferences <= (maxDifferences / 2) + 1; numDifferences++) {
+ let furthestOriginalIndex = 0;
+ let 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 (let 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
+ const 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 /* LocalConstants.MaxDifferencesHistory */ > 0 && numDifferences <= (1447 /* LocalConstants.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.
+ const 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 /* LocalConstants.MaxDifferencesHistory */ > 0 && numDifferences <= (1447 /* LocalConstants.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 quitting 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 (let 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
+ const 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 /* LocalConstants.MaxDifferencesHistory */ > 0 && numDifferences <= (1447 /* LocalConstants.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 /* LocalConstants.MaxDifferencesHistory */) {
+ // We are allocating space for one extra int, which we fill with
+ // the index of the diagonal base index
+ let 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
+ */
+ PrettifyChanges(changes) {
+ // Shift all the changes down first
+ for (let i = 0; i < changes.length; i++) {
+ const change = changes[i];
+ const originalStop = (i < changes.length - 1) ? changes[i + 1].originalStart : this._originalElementsOrHash.length;
+ const modifiedStop = (i < changes.length - 1) ? changes[i + 1].modifiedStart : this._modifiedElementsOrHash.length;
+ const checkOriginal = change.originalLength > 0;
+ const 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))) {
+ const startStrictEqual = this.ElementsAreStrictEqual(change.originalStart, change.modifiedStart);
+ const endStrictEqual = this.ElementsAreStrictEqual(change.originalStart + change.originalLength, change.modifiedStart + change.modifiedLength);
+ if (endStrictEqual && !startStrictEqual) {
+ // moving the change down would create an equal change, but the elements are not strict equal
+ break;
+ }
+ change.originalStart++;
+ change.modifiedStart++;
+ }
+ const 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 (let i = changes.length - 1; i >= 0; i--) {
+ const change = changes[i];
+ let originalStop = 0;
+ let modifiedStop = 0;
+ if (i > 0) {
+ const prevChange = changes[i - 1];
+ originalStop = prevChange.originalStart + prevChange.originalLength;
+ modifiedStop = prevChange.modifiedStart + prevChange.modifiedLength;
+ }
+ const checkOriginal = change.originalLength > 0;
+ const checkModified = change.modifiedLength > 0;
+ let bestDelta = 0;
+ let bestScore = this._boundaryScore(change.originalStart, change.originalLength, change.modifiedStart, change.modifiedLength);
+ for (let delta = 1;; delta++) {
+ const originalStart = change.originalStart - delta;
+ const 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;
+ }
+ const touchingPreviousChange = (originalStart === originalStop && modifiedStart === modifiedStop);
+ const score = ((touchingPreviousChange ? 5 : 0)
+ + this._boundaryScore(originalStart, change.originalLength, modifiedStart, change.modifiedLength));
+ if (score > bestScore) {
+ bestScore = score;
+ bestDelta = delta;
+ }
+ }
+ change.originalStart -= bestDelta;
+ change.modifiedStart -= bestDelta;
+ const mergedChangeArr = [null];
+ if (i > 0 && this.ChangesOverlap(changes[i - 1], changes[i], mergedChangeArr)) {
+ changes[i - 1] = mergedChangeArr[0];
+ changes.splice(i, 1);
+ i++;
+ continue;
+ }
+ }
+ // There could be multiple longest common substrings.
+ // Give preference to the ones containing longer lines
+ if (this._hasStrings) {
+ for (let i = 1, len = changes.length; i < len; i++) {
+ const aChange = changes[i - 1];
+ const bChange = changes[i];
+ const matchedLength = bChange.originalStart - aChange.originalStart - aChange.originalLength;
+ const aOriginalStart = aChange.originalStart;
+ const bOriginalEnd = bChange.originalStart + bChange.originalLength;
+ const abOriginalLength = bOriginalEnd - aOriginalStart;
+ const aModifiedStart = aChange.modifiedStart;
+ const bModifiedEnd = bChange.modifiedStart + bChange.modifiedLength;
+ const abModifiedLength = bModifiedEnd - aModifiedStart;
+ // Avoid wasting a lot of time with these searches
+ if (matchedLength < 5 && abOriginalLength < 20 && abModifiedLength < 20) {
+ const t = this._findBetterContiguousSequence(aOriginalStart, abOriginalLength, aModifiedStart, abModifiedLength, matchedLength);
+ if (t) {
+ const [originalMatchStart, modifiedMatchStart] = t;
+ if (originalMatchStart !== aChange.originalStart + aChange.originalLength || modifiedMatchStart !== aChange.modifiedStart + aChange.modifiedLength) {
+ // switch to another sequence that has a better score
+ aChange.originalLength = originalMatchStart - aChange.originalStart;
+ aChange.modifiedLength = modifiedMatchStart - aChange.modifiedStart;
+ bChange.originalStart = originalMatchStart + matchedLength;
+ bChange.modifiedStart = modifiedMatchStart + matchedLength;
+ bChange.originalLength = bOriginalEnd - bChange.originalStart;
+ bChange.modifiedLength = bModifiedEnd - bChange.modifiedStart;
+ }
+ }
+ }
+ }
+ }
+ return changes;
+ }
+ _findBetterContiguousSequence(originalStart, originalLength, modifiedStart, modifiedLength, desiredLength) {
+ if (originalLength < desiredLength || modifiedLength < desiredLength) {
+ return null;
+ }
+ const originalMax = originalStart + originalLength - desiredLength + 1;
+ const modifiedMax = modifiedStart + modifiedLength - desiredLength + 1;
+ let bestScore = 0;
+ let bestOriginalStart = 0;
+ let bestModifiedStart = 0;
+ for (let i = originalStart; i < originalMax; i++) {
+ for (let j = modifiedStart; j < modifiedMax; j++) {
+ const score = this._contiguousSequenceScore(i, j, desiredLength);
+ if (score > 0 && score > bestScore) {
+ bestScore = score;
+ bestOriginalStart = i;
+ bestModifiedStart = j;
+ }
+ }
+ }
+ if (bestScore > 0) {
+ return [bestOriginalStart, bestModifiedStart];
+ }
+ return null;
+ }
+ _contiguousSequenceScore(originalStart, modifiedStart, length) {
+ let score = 0;
+ for (let l = 0; l < length; l++) {
+ if (!this.ElementsAreEqual(originalStart + l, modifiedStart + l)) {
+ return 0;
+ }
+ score += this._originalStringElements[originalStart + l].length;
+ }
+ return score;
+ }
+ _OriginalIsBoundary(index) {
+ if (index <= 0 || index >= this._originalElementsOrHash.length - 1) {
+ return true;
+ }
+ return (this._hasStrings && /^\s*$/.test(this._originalStringElements[index]));
+ }
+ _OriginalRegionIsBoundary(originalStart, originalLength) {
+ if (this._OriginalIsBoundary(originalStart) || this._OriginalIsBoundary(originalStart - 1)) {
+ return true;
+ }
+ if (originalLength > 0) {
+ const originalEnd = originalStart + originalLength;
+ if (this._OriginalIsBoundary(originalEnd - 1) || this._OriginalIsBoundary(originalEnd)) {
+ return true;
+ }
+ }
+ return false;
+ }
+ _ModifiedIsBoundary(index) {
+ if (index <= 0 || index >= this._modifiedElementsOrHash.length - 1) {
+ return true;
+ }
+ return (this._hasStrings && /^\s*$/.test(this._modifiedStringElements[index]));
+ }
+ _ModifiedRegionIsBoundary(modifiedStart, modifiedLength) {
+ if (this._ModifiedIsBoundary(modifiedStart) || this._ModifiedIsBoundary(modifiedStart - 1)) {
+ return true;
+ }
+ if (modifiedLength > 0) {
+ const modifiedEnd = modifiedStart + modifiedLength;
+ if (this._ModifiedIsBoundary(modifiedEnd - 1) || this._ModifiedIsBoundary(modifiedEnd)) {
+ return true;
+ }
+ }
+ return false;
+ }
+ _boundaryScore(originalStart, originalLength, modifiedStart, modifiedLength) {
+ const originalScore = (this._OriginalRegionIsBoundary(originalStart, originalLength) ? 1 : 0);
+ const 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
+ */
+ ConcatenateChanges(left, right) {
+ const 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
+ const 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 {
+ const 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
+ */
+ ChangesOverlap(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) {
+ const originalStart = left.originalStart;
+ let originalLength = left.originalLength;
+ const modifiedStart = left.modifiedStart;
+ let 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.
+ */
+ ClipDiagonalBound(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
+ const diagonalsBelow = diagonalBaseIndex;
+ const diagonalsAbove = numDiagonals - diagonalBaseIndex - 1;
+ const diffEven = (numDifferences % 2 === 0);
+ if (diagonal < 0) {
+ const lowerBoundEven = (diagonalsBelow % 2 === 0);
+ return (diffEven === lowerBoundEven) ? 0 : 1;
+ }
+ else {
+ const upperBoundEven = (diagonalsAbove % 2 === 0);
+ return (diffEven === upperBoundEven) ? numDiagonals - 1 : numDiagonals - 2;
+ }
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/diff/diffChange.js":
+/*!**************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/diff/diffChange.js ***!
+ \**************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ DiffChange: () => (/* binding */ DiffChange)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * 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.
+ */
+class DiffChange {
+ /**
+ * Constructs a new DiffChange with the given sequence information
+ * and content.
+ */
+ constructor(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.
+ */
+ getOriginalEnd() {
+ return this.originalStart + this.originalLength;
+ }
+ /**
+ * The end point (exclusive) of the change in the modified sequence.
+ */
+ getModifiedEnd() {
+ return this.modifiedStart + this.modifiedLength;
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/errors.js":
+/*!*****************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/errors.js ***!
+ \*****************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ BugIndicatingError: () => (/* binding */ BugIndicatingError),
+/* harmony export */ CancellationError: () => (/* binding */ CancellationError),
+/* harmony export */ ErrorHandler: () => (/* binding */ ErrorHandler),
+/* harmony export */ ErrorNoTelemetry: () => (/* binding */ ErrorNoTelemetry),
+/* harmony export */ NotSupportedError: () => (/* binding */ NotSupportedError),
+/* harmony export */ canceled: () => (/* binding */ canceled),
+/* harmony export */ errorHandler: () => (/* binding */ errorHandler),
+/* harmony export */ illegalArgument: () => (/* binding */ illegalArgument),
+/* harmony export */ illegalState: () => (/* binding */ illegalState),
+/* harmony export */ isCancellationError: () => (/* binding */ isCancellationError),
+/* harmony export */ onUnexpectedError: () => (/* binding */ onUnexpectedError),
+/* harmony export */ onUnexpectedExternalError: () => (/* binding */ onUnexpectedExternalError),
+/* harmony export */ transformErrorForSerialization: () => (/* binding */ transformErrorForSerialization)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * 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.
+class ErrorHandler {
+ constructor() {
+ this.listeners = [];
+ this.unexpectedErrorHandler = function (e) {
+ setTimeout(() => {
+ if (e.stack) {
+ if (ErrorNoTelemetry.isErrorNoTelemetry(e)) {
+ throw new ErrorNoTelemetry(e.message + '\n\n' + e.stack);
+ }
+ throw new Error(e.message + '\n\n' + e.stack);
+ }
+ throw e;
+ }, 0);
+ };
+ }
+ emit(e) {
+ this.listeners.forEach((listener) => {
+ listener(e);
+ });
+ }
+ onUnexpectedError(e) {
+ this.unexpectedErrorHandler(e);
+ this.emit(e);
+ }
+ // For external errors, we don't want the listeners to be called
+ onUnexpectedExternalError(e) {
+ this.unexpectedErrorHandler(e);
+ }
+}
+const errorHandler = new ErrorHandler();
+function onUnexpectedError(e) {
+ // ignore errors from cancelled promises
+ if (!isCancellationError(e)) {
+ errorHandler.onUnexpectedError(e);
+ }
+ return undefined;
+}
+function onUnexpectedExternalError(e) {
+ // ignore errors from cancelled promises
+ if (!isCancellationError(e)) {
+ errorHandler.onUnexpectedExternalError(e);
+ }
+ return undefined;
+}
+function transformErrorForSerialization(error) {
+ if (error instanceof Error) {
+ const { name, message } = error;
+ const stack = error.stacktrace || error.stack;
+ return {
+ $isError: true,
+ name,
+ message,
+ stack,
+ noTelemetry: ErrorNoTelemetry.isErrorNoTelemetry(error)
+ };
+ }
+ // return as is
+ return error;
+}
+const canceledName = 'Canceled';
+/**
+ * Checks if the given error is a promise in canceled state
+ */
+function isCancellationError(error) {
+ if (error instanceof CancellationError) {
+ return true;
+ }
+ return error instanceof Error && error.name === canceledName && error.message === canceledName;
+}
+// !!!IMPORTANT!!!
+// Do NOT change this class because it is also used as an API-type.
+class CancellationError extends Error {
+ constructor() {
+ super(canceledName);
+ this.name = this.message;
+ }
+}
+/**
+ * @deprecated use {@link CancellationError `new CancellationError()`} instead
+ */
+function canceled() {
+ const 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');
+ }
+}
+class NotSupportedError extends Error {
+ constructor(message) {
+ super('NotSupported');
+ if (message) {
+ this.message = message;
+ }
+ }
+}
+/**
+ * Error that when thrown won't be logged in telemetry as an unhandled error.
+ */
+class ErrorNoTelemetry extends Error {
+ constructor(msg) {
+ super(msg);
+ this.name = 'CodeExpectedError';
+ }
+ static fromError(err) {
+ if (err instanceof ErrorNoTelemetry) {
+ return err;
+ }
+ const result = new ErrorNoTelemetry();
+ result.message = err.message;
+ result.stack = err.stack;
+ return result;
+ }
+ static isErrorNoTelemetry(err) {
+ return err.name === 'CodeExpectedError';
+ }
+}
+/**
+ * This error indicates a bug.
+ * Do not throw this for invalid user input.
+ * Only catch this error to recover gracefully from bugs.
+ */
+class BugIndicatingError extends Error {
+ constructor(message) {
+ super(message || 'An unexpected bug occurred.');
+ Object.setPrototypeOf(this, BugIndicatingError.prototype);
+ // Because we know for sure only buggy code throws this,
+ // we definitely want to break here and fix the bug.
+ // eslint-disable-next-line no-debugger
+ // debugger;
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/event.js":
+/*!****************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/event.js ***!
+ \****************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ DebounceEmitter: () => (/* binding */ DebounceEmitter),
+/* harmony export */ Emitter: () => (/* binding */ Emitter),
+/* harmony export */ Event: () => (/* binding */ Event),
+/* harmony export */ EventBufferer: () => (/* binding */ EventBufferer),
+/* harmony export */ EventMultiplexer: () => (/* binding */ EventMultiplexer),
+/* harmony export */ EventProfiling: () => (/* binding */ EventProfiling),
+/* harmony export */ MicrotaskEmitter: () => (/* binding */ MicrotaskEmitter),
+/* harmony export */ PauseableEmitter: () => (/* binding */ PauseableEmitter),
+/* harmony export */ Relay: () => (/* binding */ Relay),
+/* harmony export */ createEventDeliveryQueue: () => (/* binding */ createEventDeliveryQueue)
+/* harmony export */ });
+/* harmony import */ var _errors_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./errors.js */ "./node_modules/monaco-editor/esm/vs/base/common/errors.js");
+/* 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");
+/* harmony import */ var _stopwatch_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./stopwatch.js */ "./node_modules/monaco-editor/esm/vs/base/common/stopwatch.js");
+
+
+
+
+
+// -----------------------------------------------------------------------------------------------------------------------
+// Uncomment the next line to print warnings whenever an emitter with listeners is disposed. That is a sign of code smell.
+// -----------------------------------------------------------------------------------------------------------------------
+const _enableDisposeWithListenerWarning = false;
+// _enableDisposeWithListenerWarning = Boolean("TRUE"); // causes a linter warning so that it cannot be pushed
+// -----------------------------------------------------------------------------------------------------------------------
+// Uncomment the next line to print warnings whenever a snapshotted event is used repeatedly without cleanup.
+// See https://github.com/microsoft/vscode/issues/142851
+// -----------------------------------------------------------------------------------------------------------------------
+const _enableSnapshotPotentialLeakWarning = false;
+var Event;
+(function (Event) {
+ Event.None = () => _lifecycle_js__WEBPACK_IMPORTED_MODULE_2__.Disposable.None;
+ function _addLeakageTraceLogic(options) {
+ if (_enableSnapshotPotentialLeakWarning) {
+ const { onDidAddListener: origListenerDidAdd } = options;
+ const stack = Stacktrace.create();
+ let count = 0;
+ options.onDidAddListener = () => {
+ if (++count === 2) {
+ console.warn('snapshotted emitter LIKELY used public and SHOULD HAVE BEEN created with DisposableStore. snapshotted here');
+ stack.print();
+ }
+ origListenerDidAdd === null || origListenerDidAdd === void 0 ? void 0 : origListenerDidAdd();
+ };
+ }
+ }
+ /**
+ * Given an event, returns another event which debounces calls and defers the listeners to a later task via a shared
+ * `setTimeout`. The event is converted into a signal (`Event`) to avoid additional object creation as a
+ * result of merging events and to try prevent race conditions that could arise when using related deferred and
+ * non-deferred events.
+ *
+ * This is useful for deferring non-critical work (eg. general UI updates) to ensure it does not block critical work
+ * (eg. latency of keypress to text rendered).
+ *
+ * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned
+ * event is accessible to "third parties", e.g the event is a public property. Otherwise a leaked listener on the
+ * returned event causes this utility to leak a listener on the original event.
+ *
+ * @param event The event source for the new event.
+ * @param disposable A disposable store to add the new EventEmitter to.
+ */
+ function defer(event, disposable) {
+ return debounce(event, () => void 0, 0, undefined, true, undefined, disposable);
+ }
+ Event.defer = defer;
+ /**
+ * Given an event, returns another event which only fires once.
+ *
+ * @param event The event source for the new event.
+ */
+ function once(event) {
+ return (listener, thisArgs = null, disposables) => {
+ // we need this, in case the event fires during the listener call
+ let didFire = false;
+ let result = undefined;
+ result = event(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;
+ /**
+ * Maps an event of one type into an event of another type using a mapping function, similar to how
+ * `Array.prototype.map` works.
+ *
+ * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned
+ * event is accessible to "third parties", e.g the event is a public property. Otherwise a leaked listener on the
+ * returned event causes this utility to leak a listener on the original event.
+ *
+ * @param event The event source for the new event.
+ * @param map The mapping function.
+ * @param disposable A disposable store to add the new EventEmitter to.
+ */
+ function map(event, map, disposable) {
+ return snapshot((listener, thisArgs = null, disposables) => event(i => listener.call(thisArgs, map(i)), null, disposables), disposable);
+ }
+ Event.map = map;
+ /**
+ * Wraps an event in another event that performs some function on the event object before firing.
+ *
+ * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned
+ * event is accessible to "third parties", e.g the event is a public property. Otherwise a leaked listener on the
+ * returned event causes this utility to leak a listener on the original event.
+ *
+ * @param event The event source for the new event.
+ * @param each The function to perform on the event object.
+ * @param disposable A disposable store to add the new EventEmitter to.
+ */
+ function forEach(event, each, disposable) {
+ return snapshot((listener, thisArgs = null, disposables) => event(i => { each(i); listener.call(thisArgs, i); }, null, disposables), disposable);
+ }
+ Event.forEach = forEach;
+ function filter(event, filter, disposable) {
+ return snapshot((listener, thisArgs = null, disposables) => event(e => filter(e) && listener.call(thisArgs, e), null, disposables), disposable);
+ }
+ Event.filter = filter;
+ /**
+ * Given an event, returns the same event but typed as `Event`.
+ */
+ function signal(event) {
+ return event;
+ }
+ Event.signal = signal;
+ function any(...events) {
+ return (listener, thisArgs = null, disposables) => {
+ const disposable = (0,_lifecycle_js__WEBPACK_IMPORTED_MODULE_2__.combinedDisposable)(...events.map(event => event(e => listener.call(thisArgs, e))));
+ return addAndReturnDisposable(disposable, disposables);
+ };
+ }
+ Event.any = any;
+ /**
+ * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned
+ * event is accessible to "third parties", e.g the event is a public property. Otherwise a leaked listener on the
+ * returned event causes this utility to leak a listener on the original event.
+ */
+ function reduce(event, merge, initial, disposable) {
+ let output = initial;
+ return map(event, e => {
+ output = merge(output, e);
+ return output;
+ }, disposable);
+ }
+ Event.reduce = reduce;
+ function snapshot(event, disposable) {
+ let listener;
+ const options = {
+ onWillAddFirstListener() {
+ listener = event(emitter.fire, emitter);
+ },
+ onDidRemoveLastListener() {
+ listener === null || listener === void 0 ? void 0 : listener.dispose();
+ }
+ };
+ if (!disposable) {
+ _addLeakageTraceLogic(options);
+ }
+ const emitter = new Emitter(options);
+ disposable === null || disposable === void 0 ? void 0 : disposable.add(emitter);
+ return emitter.event;
+ }
+ /**
+ * Adds the IDisposable to the store if it's set, and returns it. Useful to
+ * Event function implementation.
+ */
+ function addAndReturnDisposable(d, store) {
+ if (store instanceof Array) {
+ store.push(d);
+ }
+ else if (store) {
+ store.add(d);
+ }
+ return d;
+ }
+ function debounce(event, merge, delay = 100, leading = false, flushOnListenerRemove = false, leakWarningThreshold, disposable) {
+ let subscription;
+ let output = undefined;
+ let handle = undefined;
+ let numDebouncedCalls = 0;
+ let doFire;
+ const options = {
+ leakWarningThreshold,
+ onWillAddFirstListener() {
+ subscription = event(cur => {
+ numDebouncedCalls++;
+ output = merge(output, cur);
+ if (leading && !handle) {
+ emitter.fire(output);
+ output = undefined;
+ }
+ doFire = () => {
+ const _output = output;
+ output = undefined;
+ handle = undefined;
+ if (!leading || numDebouncedCalls > 1) {
+ emitter.fire(_output);
+ }
+ numDebouncedCalls = 0;
+ };
+ if (typeof delay === 'number') {
+ clearTimeout(handle);
+ handle = setTimeout(doFire, delay);
+ }
+ else {
+ if (handle === undefined) {
+ handle = 0;
+ queueMicrotask(doFire);
+ }
+ }
+ });
+ },
+ onWillRemoveListener() {
+ if (flushOnListenerRemove && numDebouncedCalls > 0) {
+ doFire === null || doFire === void 0 ? void 0 : doFire();
+ }
+ },
+ onDidRemoveLastListener() {
+ doFire = undefined;
+ subscription.dispose();
+ }
+ };
+ if (!disposable) {
+ _addLeakageTraceLogic(options);
+ }
+ const emitter = new Emitter(options);
+ disposable === null || disposable === void 0 ? void 0 : disposable.add(emitter);
+ return emitter.event;
+ }
+ Event.debounce = debounce;
+ /**
+ * Debounces an event, firing after some delay (default=0) with an array of all event original objects.
+ *
+ * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned
+ * event is accessible to "third parties", e.g the event is a public property. Otherwise a leaked listener on the
+ * returned event causes this utility to leak a listener on the original event.
+ */
+ function accumulate(event, delay = 0, disposable) {
+ return Event.debounce(event, (last, e) => {
+ if (!last) {
+ return [e];
+ }
+ last.push(e);
+ return last;
+ }, delay, undefined, true, undefined, disposable);
+ }
+ Event.accumulate = accumulate;
+ /**
+ * Filters an event such that some condition is _not_ met more than once in a row, effectively ensuring duplicate
+ * event objects from different sources do not fire the same event object.
+ *
+ * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned
+ * event is accessible to "third parties", e.g the event is a public property. Otherwise a leaked listener on the
+ * returned event causes this utility to leak a listener on the original event.
+ *
+ * @param event The event source for the new event.
+ * @param equals The equality condition.
+ * @param disposable A disposable store to add the new EventEmitter to.
+ *
+ * @example
+ * ```
+ * // Fire only one time when a single window is opened or focused
+ * Event.latch(Event.any(onDidOpenWindow, onDidFocusWindow))
+ * ```
+ */
+ function latch(event, equals = (a, b) => a === b, disposable) {
+ let firstCall = true;
+ let cache;
+ return filter(event, value => {
+ const shouldEmit = firstCall || !equals(value, cache);
+ firstCall = false;
+ cache = value;
+ return shouldEmit;
+ }, disposable);
+ }
+ Event.latch = latch;
+ /**
+ * Splits an event whose parameter is a union type into 2 separate events for each type in the union.
+ *
+ * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned
+ * event is accessible to "third parties", e.g the event is a public property. Otherwise a leaked listener on the
+ * returned event causes this utility to leak a listener on the original event.
+ *
+ * @example
+ * ```
+ * const event = new EventEmitter().event;
+ * const [numberEvent, undefinedEvent] = Event.split(event, isUndefined);
+ * ```
+ *
+ * @param event The event source for the new event.
+ * @param isT A function that determines what event is of the first type.
+ * @param disposable A disposable store to add the new EventEmitter to.
+ */
+ function split(event, isT, disposable) {
+ return [
+ Event.filter(event, isT, disposable),
+ Event.filter(event, e => !isT(e), disposable),
+ ];
+ }
+ Event.split = split;
+ /**
+ * Buffers an event until it has a listener attached.
+ *
+ * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned
+ * event is accessible to "third parties", e.g the event is a public property. Otherwise a leaked listener on the
+ * returned event causes this utility to leak a listener on the original event.
+ *
+ * @param event The event source for the new event.
+ * @param flushAfterTimeout Determines whether to flush the buffer after a timeout immediately or after a
+ * `setTimeout` when the first event listener is added.
+ * @param _buffer Internal: A source event array used for tests.
+ *
+ * @example
+ * ```
+ * // Start accumulating events, when the first listener is attached, flush
+ * // the event after a timeout such that multiple listeners attached before
+ * // the timeout would receive the event
+ * this.onInstallExtension = Event.buffer(service.onInstallExtension, true);
+ * ```
+ */
+ function buffer(event, flushAfterTimeout = false, _buffer = [], disposable) {
+ let buffer = _buffer.slice();
+ let listener = event(e => {
+ if (buffer) {
+ buffer.push(e);
+ }
+ else {
+ emitter.fire(e);
+ }
+ });
+ if (disposable) {
+ disposable.add(listener);
+ }
+ const flush = () => {
+ buffer === null || buffer === void 0 ? void 0 : buffer.forEach(e => emitter.fire(e));
+ buffer = null;
+ };
+ const emitter = new Emitter({
+ onWillAddFirstListener() {
+ if (!listener) {
+ listener = event(e => emitter.fire(e));
+ if (disposable) {
+ disposable.add(listener);
+ }
+ }
+ },
+ onDidAddFirstListener() {
+ if (buffer) {
+ if (flushAfterTimeout) {
+ setTimeout(flush);
+ }
+ else {
+ flush();
+ }
+ }
+ },
+ onDidRemoveLastListener() {
+ if (listener) {
+ listener.dispose();
+ }
+ listener = null;
+ }
+ });
+ if (disposable) {
+ disposable.add(emitter);
+ }
+ return emitter.event;
+ }
+ Event.buffer = buffer;
+ /**
+ * Wraps the event in an {@link IChainableEvent}, allowing a more functional programming style.
+ *
+ * @example
+ * ```
+ * // Normal
+ * const onEnterPressNormal = Event.filter(
+ * Event.map(onKeyPress.event, e => new StandardKeyboardEvent(e)),
+ * e.keyCode === KeyCode.Enter
+ * ).event;
+ *
+ * // Using chain
+ * const onEnterPressChain = Event.chain(onKeyPress.event, $ => $
+ * .map(e => new StandardKeyboardEvent(e))
+ * .filter(e => e.keyCode === KeyCode.Enter)
+ * );
+ * ```
+ */
+ function chain(event, sythensize) {
+ const fn = (listener, thisArgs, disposables) => {
+ const cs = sythensize(new ChainableSynthesis());
+ return event(function (value) {
+ const result = cs.evaluate(value);
+ if (result !== HaltChainable) {
+ listener.call(thisArgs, result);
+ }
+ }, undefined, disposables);
+ };
+ return fn;
+ }
+ Event.chain = chain;
+ const HaltChainable = Symbol('HaltChainable');
+ class ChainableSynthesis {
+ constructor() {
+ this.steps = [];
+ }
+ map(fn) {
+ this.steps.push(fn);
+ return this;
+ }
+ forEach(fn) {
+ this.steps.push(v => {
+ fn(v);
+ return v;
+ });
+ return this;
+ }
+ filter(fn) {
+ this.steps.push(v => fn(v) ? v : HaltChainable);
+ return this;
+ }
+ reduce(merge, initial) {
+ let last = initial;
+ this.steps.push(v => {
+ last = merge(last, v);
+ return last;
+ });
+ return this;
+ }
+ latch(equals = (a, b) => a === b) {
+ let firstCall = true;
+ let cache;
+ this.steps.push(value => {
+ const shouldEmit = firstCall || !equals(value, cache);
+ firstCall = false;
+ cache = value;
+ return shouldEmit ? value : HaltChainable;
+ });
+ return this;
+ }
+ evaluate(value) {
+ for (const step of this.steps) {
+ value = step(value);
+ if (value === HaltChainable) {
+ break;
+ }
+ }
+ return value;
+ }
+ }
+ /**
+ * Creates an {@link Event} from a node event emitter.
+ */
+ function fromNodeEventEmitter(emitter, eventName, map = id => id) {
+ const fn = (...args) => result.fire(map(...args));
+ const onFirstListenerAdd = () => emitter.on(eventName, fn);
+ const onLastListenerRemove = () => emitter.removeListener(eventName, fn);
+ const result = new Emitter({ onWillAddFirstListener: onFirstListenerAdd, onDidRemoveLastListener: onLastListenerRemove });
+ return result.event;
+ }
+ Event.fromNodeEventEmitter = fromNodeEventEmitter;
+ /**
+ * Creates an {@link Event} from a DOM event emitter.
+ */
+ function fromDOMEventEmitter(emitter, eventName, map = id => id) {
+ const fn = (...args) => result.fire(map(...args));
+ const onFirstListenerAdd = () => emitter.addEventListener(eventName, fn);
+ const onLastListenerRemove = () => emitter.removeEventListener(eventName, fn);
+ const result = new Emitter({ onWillAddFirstListener: onFirstListenerAdd, onDidRemoveLastListener: onLastListenerRemove });
+ return result.event;
+ }
+ Event.fromDOMEventEmitter = fromDOMEventEmitter;
+ /**
+ * Creates a promise out of an event, using the {@link Event.once} helper.
+ */
+ function toPromise(event) {
+ return new Promise(resolve => once(event)(resolve));
+ }
+ Event.toPromise = toPromise;
+ /**
+ * Creates an event out of a promise that fires once when the promise is
+ * resolved with the result of the promise or `undefined`.
+ */
+ function fromPromise(promise) {
+ const result = new Emitter();
+ promise.then(res => {
+ result.fire(res);
+ }, () => {
+ result.fire(undefined);
+ }).finally(() => {
+ result.dispose();
+ });
+ return result.event;
+ }
+ Event.fromPromise = fromPromise;
+ function runAndSubscribe(event, handler, initial) {
+ handler(initial);
+ return event(e => handler(e));
+ }
+ Event.runAndSubscribe = runAndSubscribe;
+ /**
+ * Adds a listener to an event and calls the listener immediately with undefined as the event object. A new
+ * {@link DisposableStore} is passed to the listener which is disposed when the returned disposable is disposed.
+ */
+ function runAndSubscribeWithStore(event, handler) {
+ let store = null;
+ function run(e) {
+ store === null || store === void 0 ? void 0 : store.dispose();
+ store = new _lifecycle_js__WEBPACK_IMPORTED_MODULE_2__.DisposableStore();
+ handler(e, store);
+ }
+ run(undefined);
+ const disposable = event(e => run(e));
+ return (0,_lifecycle_js__WEBPACK_IMPORTED_MODULE_2__.toDisposable)(() => {
+ disposable.dispose();
+ store === null || store === void 0 ? void 0 : store.dispose();
+ });
+ }
+ Event.runAndSubscribeWithStore = runAndSubscribeWithStore;
+ class EmitterObserver {
+ constructor(_observable, store) {
+ this._observable = _observable;
+ this._counter = 0;
+ this._hasChanged = false;
+ const options = {
+ onWillAddFirstListener: () => {
+ _observable.addObserver(this);
+ },
+ onDidRemoveLastListener: () => {
+ _observable.removeObserver(this);
+ }
+ };
+ if (!store) {
+ _addLeakageTraceLogic(options);
+ }
+ this.emitter = new Emitter(options);
+ if (store) {
+ store.add(this.emitter);
+ }
+ }
+ beginUpdate(_observable) {
+ // assert(_observable === this.obs);
+ this._counter++;
+ }
+ handlePossibleChange(_observable) {
+ // assert(_observable === this.obs);
+ }
+ handleChange(_observable, _change) {
+ // assert(_observable === this.obs);
+ this._hasChanged = true;
+ }
+ endUpdate(_observable) {
+ // assert(_observable === this.obs);
+ this._counter--;
+ if (this._counter === 0) {
+ this._observable.reportChanges();
+ if (this._hasChanged) {
+ this._hasChanged = false;
+ this.emitter.fire(this._observable.get());
+ }
+ }
+ }
+ }
+ /**
+ * Creates an event emitter that is fired when the observable changes.
+ * Each listeners subscribes to the emitter.
+ */
+ function fromObservable(obs, store) {
+ const observer = new EmitterObserver(obs, store);
+ return observer.emitter.event;
+ }
+ Event.fromObservable = fromObservable;
+ /**
+ * Each listener is attached to the observable directly.
+ */
+ function fromObservableLight(observable) {
+ return (listener, thisArgs, disposables) => {
+ let count = 0;
+ let didChange = false;
+ const observer = {
+ beginUpdate() {
+ count++;
+ },
+ endUpdate() {
+ count--;
+ if (count === 0) {
+ observable.reportChanges();
+ if (didChange) {
+ didChange = false;
+ listener.call(thisArgs);
+ }
+ }
+ },
+ handlePossibleChange() {
+ // noop
+ },
+ handleChange() {
+ didChange = true;
+ }
+ };
+ observable.addObserver(observer);
+ observable.reportChanges();
+ const disposable = {
+ dispose() {
+ observable.removeObserver(observer);
+ }
+ };
+ if (disposables instanceof _lifecycle_js__WEBPACK_IMPORTED_MODULE_2__.DisposableStore) {
+ disposables.add(disposable);
+ }
+ else if (Array.isArray(disposables)) {
+ disposables.push(disposable);
+ }
+ return disposable;
+ };
+ }
+ Event.fromObservableLight = fromObservableLight;
+})(Event || (Event = {}));
+class EventProfiling {
+ constructor(name) {
+ this.listenerCount = 0;
+ this.invocationCount = 0;
+ this.elapsedOverall = 0;
+ this.durations = [];
+ this.name = `${name}_${EventProfiling._idPool++}`;
+ EventProfiling.all.add(this);
+ }
+ start(listenerCount) {
+ this._stopWatch = new _stopwatch_js__WEBPACK_IMPORTED_MODULE_4__.StopWatch();
+ this.listenerCount = listenerCount;
+ }
+ stop() {
+ if (this._stopWatch) {
+ const elapsed = this._stopWatch.elapsed();
+ this.durations.push(elapsed);
+ this.elapsedOverall += elapsed;
+ this.invocationCount += 1;
+ this._stopWatch = undefined;
+ }
+ }
+}
+EventProfiling.all = new Set();
+EventProfiling._idPool = 0;
+let _globalLeakWarningThreshold = -1;
+class LeakageMonitor {
+ constructor(threshold, name = Math.random().toString(18).slice(2, 5)) {
+ this.threshold = threshold;
+ this.name = name;
+ this._warnCountdown = 0;
+ }
+ dispose() {
+ var _a;
+ (_a = this._stacks) === null || _a === void 0 ? void 0 : _a.clear();
+ }
+ check(stack, listenerCount) {
+ const threshold = this.threshold;
+ if (threshold <= 0 || listenerCount < threshold) {
+ return undefined;
+ }
+ if (!this._stacks) {
+ this._stacks = new Map();
+ }
+ const count = (this._stacks.get(stack.value) || 0);
+ this._stacks.set(stack.value, 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
+ let topStack;
+ let topCount = 0;
+ for (const [stack, count] of this._stacks) {
+ if (!topStack || topCount < count) {
+ topStack = stack;
+ topCount = count;
+ }
+ }
+ console.warn(`[${this.name}] potential listener LEAK detected, having ${listenerCount} listeners already. MOST frequent listener (${topCount}):`);
+ console.warn(topStack);
+ }
+ return () => {
+ const count = (this._stacks.get(stack.value) || 0);
+ this._stacks.set(stack.value, count - 1);
+ };
+ }
+}
+class Stacktrace {
+ static create() {
+ var _a;
+ return new Stacktrace((_a = new Error().stack) !== null && _a !== void 0 ? _a : '');
+ }
+ constructor(value) {
+ this.value = value;
+ }
+ print() {
+ console.warn(this.value.split('\n').slice(2).join('\n'));
+ }
+}
+class UniqueContainer {
+ constructor(value) {
+ this.value = value;
+ }
+}
+const compactionThreshold = 2;
+const forEachListener = (listeners, fn) => {
+ if (listeners instanceof UniqueContainer) {
+ fn(listeners);
+ }
+ else {
+ for (let i = 0; i < listeners.length; i++) {
+ const l = listeners[i];
+ if (l) {
+ fn(l);
+ }
+ }
+ }
+};
+/**
+ * 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);
+ }
+ }
+ */
+class Emitter {
+ constructor(options) {
+ var _a, _b, _c, _d, _e;
+ this._size = 0;
+ this._options = options;
+ this._leakageMon = _globalLeakWarningThreshold > 0 || ((_a = this._options) === null || _a === void 0 ? void 0 : _a.leakWarningThreshold) ? new LeakageMonitor((_c = (_b = this._options) === null || _b === void 0 ? void 0 : _b.leakWarningThreshold) !== null && _c !== void 0 ? _c : _globalLeakWarningThreshold) : undefined;
+ this._perfMon = ((_d = this._options) === null || _d === void 0 ? void 0 : _d._profName) ? new EventProfiling(this._options._profName) : undefined;
+ this._deliveryQueue = (_e = this._options) === null || _e === void 0 ? void 0 : _e.deliveryQueue;
+ }
+ dispose() {
+ var _a, _b, _c, _d;
+ if (!this._disposed) {
+ this._disposed = true;
+ // It is bad to have listeners at the time of disposing an emitter, it is worst to have listeners keep the emitter
+ // alive via the reference that's embedded in their disposables. Therefore we loop over all remaining listeners and
+ // unset their subscriptions/disposables. Looping and blaming remaining listeners is done on next tick because the
+ // the following programming pattern is very popular:
+ //
+ // const someModel = this._disposables.add(new ModelObject()); // (1) create and register model
+ // this._disposables.add(someModel.onDidChange(() => { ... }); // (2) subscribe and register model-event listener
+ // ...later...
+ // this._disposables.dispose(); disposes (1) then (2): don't warn after (1) but after the "overall dispose" is done
+ if (((_a = this._deliveryQueue) === null || _a === void 0 ? void 0 : _a.current) === this) {
+ this._deliveryQueue.reset();
+ }
+ if (this._listeners) {
+ if (_enableDisposeWithListenerWarning) {
+ const listeners = this._listeners;
+ queueMicrotask(() => {
+ forEachListener(listeners, l => { var _a; return (_a = l.stack) === null || _a === void 0 ? void 0 : _a.print(); });
+ });
+ }
+ this._listeners = undefined;
+ this._size = 0;
+ }
+ (_c = (_b = this._options) === null || _b === void 0 ? void 0 : _b.onDidRemoveLastListener) === null || _c === void 0 ? void 0 : _c.call(_b);
+ (_d = this._leakageMon) === null || _d === void 0 ? void 0 : _d.dispose();
+ }
+ }
+ /**
+ * For the public to allow to subscribe
+ * to events from this Emitter
+ */
+ get event() {
+ var _a;
+ (_a = this._event) !== null && _a !== void 0 ? _a : (this._event = (callback, thisArgs, disposables) => {
+ var _a, _b, _c, _d, _e;
+ if (this._leakageMon && this._size > this._leakageMon.threshold * 3) {
+ console.warn(`[${this._leakageMon.name}] REFUSES to accept new listeners because it exceeded its threshold by far`);
+ return _lifecycle_js__WEBPACK_IMPORTED_MODULE_2__.Disposable.None;
+ }
+ if (this._disposed) {
+ // todo: should we warn if a listener is added to a disposed emitter? This happens often
+ return _lifecycle_js__WEBPACK_IMPORTED_MODULE_2__.Disposable.None;
+ }
+ if (thisArgs) {
+ callback = callback.bind(thisArgs);
+ }
+ const contained = new UniqueContainer(callback);
+ let removeMonitor;
+ let stack;
+ if (this._leakageMon && this._size >= Math.ceil(this._leakageMon.threshold * 0.2)) {
+ // check and record this emitter for potential leakage
+ contained.stack = Stacktrace.create();
+ removeMonitor = this._leakageMon.check(contained.stack, this._size + 1);
+ }
+ if (_enableDisposeWithListenerWarning) {
+ contained.stack = stack !== null && stack !== void 0 ? stack : Stacktrace.create();
+ }
+ if (!this._listeners) {
+ (_b = (_a = this._options) === null || _a === void 0 ? void 0 : _a.onWillAddFirstListener) === null || _b === void 0 ? void 0 : _b.call(_a, this);
+ this._listeners = contained;
+ (_d = (_c = this._options) === null || _c === void 0 ? void 0 : _c.onDidAddFirstListener) === null || _d === void 0 ? void 0 : _d.call(_c, this);
+ }
+ else if (this._listeners instanceof UniqueContainer) {
+ (_e = this._deliveryQueue) !== null && _e !== void 0 ? _e : (this._deliveryQueue = new EventDeliveryQueuePrivate());
+ this._listeners = [this._listeners, contained];
+ }
+ else {
+ this._listeners.push(contained);
+ }
+ this._size++;
+ const result = (0,_lifecycle_js__WEBPACK_IMPORTED_MODULE_2__.toDisposable)(() => { removeMonitor === null || removeMonitor === void 0 ? void 0 : removeMonitor(); this._removeListener(contained); });
+ 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;
+ }
+ _removeListener(listener) {
+ var _a, _b, _c, _d;
+ (_b = (_a = this._options) === null || _a === void 0 ? void 0 : _a.onWillRemoveListener) === null || _b === void 0 ? void 0 : _b.call(_a, this);
+ if (!this._listeners) {
+ return; // expected if a listener gets disposed
+ }
+ if (this._size === 1) {
+ this._listeners = undefined;
+ (_d = (_c = this._options) === null || _c === void 0 ? void 0 : _c.onDidRemoveLastListener) === null || _d === void 0 ? void 0 : _d.call(_c, this);
+ this._size = 0;
+ return;
+ }
+ // size > 1 which requires that listeners be a list:
+ const listeners = this._listeners;
+ const index = listeners.indexOf(listener);
+ if (index === -1) {
+ console.log('disposed?', this._disposed);
+ console.log('size?', this._size);
+ console.log('arr?', JSON.stringify(this._listeners));
+ throw new Error('Attempted to dispose unknown listener');
+ }
+ this._size--;
+ listeners[index] = undefined;
+ const adjustDeliveryQueue = this._deliveryQueue.current === this;
+ if (this._size * compactionThreshold <= listeners.length) {
+ let n = 0;
+ for (let i = 0; i < listeners.length; i++) {
+ if (listeners[i]) {
+ listeners[n++] = listeners[i];
+ }
+ else if (adjustDeliveryQueue) {
+ this._deliveryQueue.end--;
+ if (n < this._deliveryQueue.i) {
+ this._deliveryQueue.i--;
+ }
+ }
+ }
+ listeners.length = n;
+ }
+ }
+ _deliver(listener, value) {
+ var _a;
+ if (!listener) {
+ return;
+ }
+ const errorHandler = ((_a = this._options) === null || _a === void 0 ? void 0 : _a.onListenerError) || _errors_js__WEBPACK_IMPORTED_MODULE_0__.onUnexpectedError;
+ if (!errorHandler) {
+ listener.value(value);
+ return;
+ }
+ try {
+ listener.value(value);
+ }
+ catch (e) {
+ errorHandler(e);
+ }
+ }
+ /** Delivers items in the queue. Assumes the queue is ready to go. */
+ _deliverQueue(dq) {
+ const listeners = dq.current._listeners;
+ while (dq.i < dq.end) {
+ // important: dq.i is incremented before calling deliver() because it might reenter deliverQueue()
+ this._deliver(listeners[dq.i++], dq.value);
+ }
+ dq.reset();
+ }
+ /**
+ * To be kept private to fire an event to
+ * subscribers
+ */
+ fire(event) {
+ var _a, _b, _c, _d;
+ if ((_a = this._deliveryQueue) === null || _a === void 0 ? void 0 : _a.current) {
+ this._deliverQueue(this._deliveryQueue);
+ (_b = this._perfMon) === null || _b === void 0 ? void 0 : _b.stop(); // last fire() will have starting perfmon, stop it before starting the next dispatch
+ }
+ (_c = this._perfMon) === null || _c === void 0 ? void 0 : _c.start(this._size);
+ if (!this._listeners) {
+ // no-op
+ }
+ else if (this._listeners instanceof UniqueContainer) {
+ this._deliver(this._listeners, event);
+ }
+ else {
+ const dq = this._deliveryQueue;
+ dq.enqueue(this, event, this._listeners.length);
+ this._deliverQueue(dq);
+ }
+ (_d = this._perfMon) === null || _d === void 0 ? void 0 : _d.stop();
+ }
+ hasListeners() {
+ return this._size > 0;
+ }
+}
+const createEventDeliveryQueue = () => new EventDeliveryQueuePrivate();
+class EventDeliveryQueuePrivate {
+ constructor() {
+ /**
+ * Index in current's listener list.
+ */
+ this.i = -1;
+ /**
+ * The last index in the listener's list to deliver.
+ */
+ this.end = 0;
+ }
+ enqueue(emitter, value, end) {
+ this.i = 0;
+ this.end = end;
+ this.current = emitter;
+ this.value = value;
+ }
+ reset() {
+ this.i = this.end; // force any current emission loop to stop, mainly for during dispose
+ this.current = undefined;
+ this.value = undefined;
+ }
+}
+class PauseableEmitter extends Emitter {
+ constructor(options) {
+ super(options);
+ this._isPaused = 0;
+ this._eventQueue = new _linkedList_js__WEBPACK_IMPORTED_MODULE_3__.LinkedList();
+ this._mergeFn = options === null || options === void 0 ? void 0 : options.merge;
+ }
+ pause() {
+ this._isPaused++;
+ }
+ resume() {
+ 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
+ if (this._eventQueue.size > 0) {
+ const events = Array.from(this._eventQueue);
+ this._eventQueue.clear();
+ super.fire(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.fire(this._eventQueue.shift());
+ }
+ }
+ }
+ }
+ fire(event) {
+ if (this._size) {
+ if (this._isPaused !== 0) {
+ this._eventQueue.push(event);
+ }
+ else {
+ super.fire(event);
+ }
+ }
+ }
+}
+class DebounceEmitter extends PauseableEmitter {
+ constructor(options) {
+ var _a;
+ super(options);
+ this._delay = (_a = options.delay) !== null && _a !== void 0 ? _a : 100;
+ }
+ fire(event) {
+ if (!this._handle) {
+ this.pause();
+ this._handle = setTimeout(() => {
+ this._handle = undefined;
+ this.resume();
+ }, this._delay);
+ }
+ super.fire(event);
+ }
+}
+/**
+ * An emitter which queue all events and then process them at the
+ * end of the event loop.
+ */
+class MicrotaskEmitter extends Emitter {
+ constructor(options) {
+ super(options);
+ this._queuedEvents = [];
+ this._mergeFn = options === null || options === void 0 ? void 0 : options.merge;
+ }
+ fire(event) {
+ if (!this.hasListeners()) {
+ return;
+ }
+ this._queuedEvents.push(event);
+ if (this._queuedEvents.length === 1) {
+ queueMicrotask(() => {
+ if (this._mergeFn) {
+ super.fire(this._mergeFn(this._queuedEvents));
+ }
+ else {
+ this._queuedEvents.forEach(e => super.fire(e));
+ }
+ this._queuedEvents = [];
+ });
+ }
+ }
+}
+/**
+ * An event emitter that multiplexes many events into a single event.
+ *
+ * @example Listen to the `onData` event of all `Thing`s, dynamically adding and removing `Thing`s
+ * to the multiplexer as needed.
+ *
+ * ```typescript
+ * const anythingDataMultiplexer = new EventMultiplexer<{ data: string }>();
+ *
+ * const thingListeners = DisposableMap();
+ *
+ * thingService.onDidAddThing(thing => {
+ * thingListeners.set(thing, anythingDataMultiplexer.add(thing.onData);
+ * });
+ * thingService.onDidRemoveThing(thing => {
+ * thingListeners.deleteAndDispose(thing);
+ * });
+ *
+ * anythingDataMultiplexer.event(e => {
+ * console.log('Something fired data ' + e.data)
+ * });
+ * ```
+ */
+class EventMultiplexer {
+ constructor() {
+ this.hasListeners = false;
+ this.events = [];
+ this.emitter = new Emitter({
+ onWillAddFirstListener: () => this.onFirstListenerAdd(),
+ onDidRemoveLastListener: () => this.onLastListenerRemove()
+ });
+ }
+ get event() {
+ return this.emitter.event;
+ }
+ add(event) {
+ const e = { event: event, listener: null };
+ this.events.push(e);
+ if (this.hasListeners) {
+ this.hook(e);
+ }
+ const dispose = () => {
+ if (this.hasListeners) {
+ this.unhook(e);
+ }
+ const idx = this.events.indexOf(e);
+ this.events.splice(idx, 1);
+ };
+ return (0,_lifecycle_js__WEBPACK_IMPORTED_MODULE_2__.toDisposable)((0,_functional_js__WEBPACK_IMPORTED_MODULE_1__.createSingleCallFunction)(dispose));
+ }
+ onFirstListenerAdd() {
+ this.hasListeners = true;
+ this.events.forEach(e => this.hook(e));
+ }
+ onLastListenerRemove() {
+ this.hasListeners = false;
+ this.events.forEach(e => this.unhook(e));
+ }
+ hook(e) {
+ e.listener = e.event(r => this.emitter.fire(r));
+ }
+ unhook(e) {
+ if (e.listener) {
+ e.listener.dispose();
+ }
+ e.listener = null;
+ }
+ dispose() {
+ this.emitter.dispose();
+ }
+}
+/**
+ * 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
+ * ```
+ */
+class EventBufferer {
+ constructor() {
+ this.buffers = [];
+ }
+ wrapEvent(event) {
+ return (listener, thisArgs, disposables) => {
+ return event(i => {
+ const buffer = this.buffers[this.buffers.length - 1];
+ if (buffer) {
+ buffer.push(() => listener.call(thisArgs, i));
+ }
+ else {
+ listener.call(thisArgs, i);
+ }
+ }, undefined, disposables);
+ };
+ }
+ bufferEvents(fn) {
+ const buffer = [];
+ this.buffers.push(buffer);
+ const r = fn();
+ this.buffers.pop();
+ buffer.forEach(flush => flush());
+ return r;
+ }
+}
+/**
+ * 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.
+ */
+class Relay {
+ constructor() {
+ this.listening = false;
+ this.inputEvent = Event.None;
+ this.inputEventListener = _lifecycle_js__WEBPACK_IMPORTED_MODULE_2__.Disposable.None;
+ this.emitter = new Emitter({
+ onDidAddFirstListener: () => {
+ this.listening = true;
+ this.inputEventListener = this.inputEvent(this.emitter.fire, this.emitter);
+ },
+ onDidRemoveLastListener: () => {
+ this.listening = false;
+ this.inputEventListener.dispose();
+ }
+ });
+ this.event = this.emitter.event;
+ }
+ set input(event) {
+ this.inputEvent = event;
+ if (this.listening) {
+ this.inputEventListener.dispose();
+ this.inputEventListener = event(this.emitter.fire, this.emitter);
+ }
+ }
+ dispose() {
+ this.inputEventListener.dispose();
+ this.emitter.dispose();
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/functional.js":
+/*!*********************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/functional.js ***!
+ \*********************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ createSingleCallFunction: () => (/* binding */ createSingleCallFunction)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+/**
+ * Given a function, returns a function that is only calling that function once.
+ */
+function createSingleCallFunction(fn, fnDidRunCallback) {
+ const _this = this;
+ let didCall = false;
+ let result;
+ return function () {
+ if (didCall) {
+ return result;
+ }
+ didCall = true;
+ if (fnDidRunCallback) {
+ try {
+ result = fn.apply(_this, arguments);
+ }
+ finally {
+ fnDidRunCallback();
+ }
+ }
+ else {
+ 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 ***!
+ \***************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ StringSHA1: () => (/* binding */ StringSHA1),
+/* harmony export */ doHash: () => (/* binding */ doHash),
+/* harmony export */ hash: () => (/* binding */ hash),
+/* harmony export */ numberHash: () => (/* binding */ numberHash),
+/* harmony export */ stringHash: () => (/* binding */ stringHash),
+/* harmony export */ toHexString: () => (/* binding */ toHexString)
+/* harmony export */ });
+/* harmony import */ var _strings_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./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.
+ *--------------------------------------------------------------------------------------------*/
+
+/**
+ * Return a hash value for an object.
+ */
+function hash(obj) {
+ return doHash(obj, 0);
+}
+function doHash(obj, hashVal) {
+ 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(937, hashVal);
+ default:
+ return numberHash(617, hashVal);
+ }
+}
+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 (let i = 0, length = s.length; i < length; i++) {
+ hashVal = numberHash(s.charCodeAt(i), hashVal);
+ }
+ return hashVal;
+}
+function arrayHash(arr, initialHashVal) {
+ initialHashVal = numberHash(104579, initialHashVal);
+ return arr.reduce((hashVal, item) => doHash(item, hashVal), initialHashVal);
+}
+function objectHash(obj, initialHashVal) {
+ initialHashVal = numberHash(181387, initialHashVal);
+ return Object.keys(obj).sort().reduce((hashVal, key) => {
+ hashVal = stringHash(key, hashVal);
+ return doHash(obj[key], hashVal);
+ }, initialHashVal);
+}
+function leftRotate(value, bits, totalBits = 32) {
+ // delta + bits = totalBits
+ const delta = totalBits - bits;
+ // All ones, expect `delta` zeros aligned to the right
+ const mask = ~((1 << delta) - 1);
+ // Join (value left-shifted `bits` bits) with (masked value right-shifted `delta` bits)
+ return ((value << bits) | ((mask & value) >>> delta)) >>> 0;
+}
+function fill(dest, index = 0, count = dest.byteLength, value = 0) {
+ for (let i = 0; i < count; i++) {
+ dest[index + i] = value;
+ }
+}
+function leftPad(value, length, char = '0') {
+ while (value.length < length) {
+ value = char + value;
+ }
+ return value;
+}
+function toHexString(bufferOrValue, bitsize = 32) {
+ if (bufferOrValue instanceof ArrayBuffer) {
+ return Array.from(new Uint8Array(bufferOrValue)).map(b => b.toString(16).padStart(2, '0')).join('');
+ }
+ return leftPad((bufferOrValue >>> 0).toString(16), bitsize / 4);
+}
+/**
+ * A SHA1 implementation that works with strings and does not allocate.
+ */
+class StringSHA1 {
+ constructor() {
+ this._h0 = 0x67452301;
+ this._h1 = 0xEFCDAB89;
+ this._h2 = 0x98BADCFE;
+ this._h3 = 0x10325476;
+ this._h4 = 0xC3D2E1F0;
+ this._buff = new Uint8Array(64 /* SHA1Constant.BLOCK_SIZE */ + 3 /* to fit any utf-8 */);
+ this._buffDV = new DataView(this._buff.buffer);
+ this._buffLen = 0;
+ this._totalLen = 0;
+ this._leftoverHighSurrogate = 0;
+ this._finished = false;
+ }
+ update(str) {
+ const strLen = str.length;
+ if (strLen === 0) {
+ return;
+ }
+ const buff = this._buff;
+ let buffLen = this._buffLen;
+ let leftoverHighSurrogate = this._leftoverHighSurrogate;
+ let charCode;
+ let offset;
+ if (leftoverHighSurrogate !== 0) {
+ charCode = leftoverHighSurrogate;
+ offset = -1;
+ leftoverHighSurrogate = 0;
+ }
+ else {
+ charCode = str.charCodeAt(0);
+ offset = 0;
+ }
+ while (true) {
+ let codePoint = charCode;
+ if (_strings_js__WEBPACK_IMPORTED_MODULE_0__.isHighSurrogate(charCode)) {
+ if (offset + 1 < strLen) {
+ const nextCharCode = str.charCodeAt(offset + 1);
+ if (_strings_js__WEBPACK_IMPORTED_MODULE_0__.isLowSurrogate(nextCharCode)) {
+ offset++;
+ codePoint = _strings_js__WEBPACK_IMPORTED_MODULE_0__.computeCodePoint(charCode, nextCharCode);
+ }
+ else {
+ // illegal => unicode replacement character
+ codePoint = 65533 /* SHA1Constant.UNICODE_REPLACEMENT */;
+ }
+ }
+ else {
+ // last character is a surrogate pair
+ leftoverHighSurrogate = charCode;
+ break;
+ }
+ }
+ else if (_strings_js__WEBPACK_IMPORTED_MODULE_0__.isLowSurrogate(charCode)) {
+ // illegal => unicode replacement character
+ codePoint = 65533 /* SHA1Constant.UNICODE_REPLACEMENT */;
+ }
+ buffLen = this._push(buff, buffLen, codePoint);
+ offset++;
+ if (offset < strLen) {
+ charCode = str.charCodeAt(offset);
+ }
+ else {
+ break;
+ }
+ }
+ this._buffLen = buffLen;
+ this._leftoverHighSurrogate = leftoverHighSurrogate;
+ }
+ _push(buff, buffLen, codePoint) {
+ if (codePoint < 0x0080) {
+ buff[buffLen++] = codePoint;
+ }
+ else if (codePoint < 0x0800) {
+ buff[buffLen++] = 0b11000000 | ((codePoint & 0b00000000000000000000011111000000) >>> 6);
+ buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000000000111111) >>> 0);
+ }
+ else if (codePoint < 0x10000) {
+ buff[buffLen++] = 0b11100000 | ((codePoint & 0b00000000000000001111000000000000) >>> 12);
+ buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000111111000000) >>> 6);
+ buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000000000111111) >>> 0);
+ }
+ else {
+ buff[buffLen++] = 0b11110000 | ((codePoint & 0b00000000000111000000000000000000) >>> 18);
+ buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000111111000000000000) >>> 12);
+ buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000111111000000) >>> 6);
+ buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000000000111111) >>> 0);
+ }
+ if (buffLen >= 64 /* SHA1Constant.BLOCK_SIZE */) {
+ this._step();
+ buffLen -= 64 /* SHA1Constant.BLOCK_SIZE */;
+ this._totalLen += 64 /* SHA1Constant.BLOCK_SIZE */;
+ // take last 3 in case of UTF8 overflow
+ buff[0] = buff[64 /* SHA1Constant.BLOCK_SIZE */ + 0];
+ buff[1] = buff[64 /* SHA1Constant.BLOCK_SIZE */ + 1];
+ buff[2] = buff[64 /* SHA1Constant.BLOCK_SIZE */ + 2];
+ }
+ return buffLen;
+ }
+ digest() {
+ if (!this._finished) {
+ this._finished = true;
+ if (this._leftoverHighSurrogate) {
+ // illegal => unicode replacement character
+ this._leftoverHighSurrogate = 0;
+ this._buffLen = this._push(this._buff, this._buffLen, 65533 /* SHA1Constant.UNICODE_REPLACEMENT */);
+ }
+ this._totalLen += this._buffLen;
+ this._wrapUp();
+ }
+ return toHexString(this._h0) + toHexString(this._h1) + toHexString(this._h2) + toHexString(this._h3) + toHexString(this._h4);
+ }
+ _wrapUp() {
+ this._buff[this._buffLen++] = 0x80;
+ fill(this._buff, this._buffLen);
+ if (this._buffLen > 56) {
+ this._step();
+ fill(this._buff);
+ }
+ // this will fit because the mantissa can cover up to 52 bits
+ const ml = 8 * this._totalLen;
+ this._buffDV.setUint32(56, Math.floor(ml / 4294967296), false);
+ this._buffDV.setUint32(60, ml % 4294967296, false);
+ this._step();
+ }
+ _step() {
+ const bigBlock32 = StringSHA1._bigBlock32;
+ const data = this._buffDV;
+ for (let j = 0; j < 64 /* 16*4 */; j += 4) {
+ bigBlock32.setUint32(j, data.getUint32(j, false), false);
+ }
+ for (let j = 64; j < 320 /* 80*4 */; j += 4) {
+ bigBlock32.setUint32(j, leftRotate((bigBlock32.getUint32(j - 12, false) ^ bigBlock32.getUint32(j - 32, false) ^ bigBlock32.getUint32(j - 56, false) ^ bigBlock32.getUint32(j - 64, false)), 1), false);
+ }
+ let a = this._h0;
+ let b = this._h1;
+ let c = this._h2;
+ let d = this._h3;
+ let e = this._h4;
+ let f, k;
+ let temp;
+ for (let j = 0; j < 80; j++) {
+ if (j < 20) {
+ f = (b & c) | ((~b) & d);
+ k = 0x5A827999;
+ }
+ else if (j < 40) {
+ f = b ^ c ^ d;
+ k = 0x6ED9EBA1;
+ }
+ else if (j < 60) {
+ f = (b & c) | (b & d) | (c & d);
+ k = 0x8F1BBCDC;
+ }
+ else {
+ f = b ^ c ^ d;
+ k = 0xCA62C1D6;
+ }
+ temp = (leftRotate(a, 5) + f + e + k + bigBlock32.getUint32(j * 4, false)) & 0xffffffff;
+ e = d;
+ d = c;
+ c = leftRotate(b, 30);
+ b = a;
+ a = temp;
+ }
+ this._h0 = (this._h0 + a) & 0xffffffff;
+ this._h1 = (this._h1 + b) & 0xffffffff;
+ this._h2 = (this._h2 + c) & 0xffffffff;
+ this._h3 = (this._h3 + d) & 0xffffffff;
+ this._h4 = (this._h4 + e) & 0xffffffff;
+ }
+}
+StringSHA1._bigBlock32 = new DataView(new ArrayBuffer(320)); // 80 * 4 = 320
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/iterator.js":
+/*!*******************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/iterator.js ***!
+ \*******************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ Iterable: () => (/* binding */ Iterable)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+var Iterable;
+(function (Iterable) {
+ function is(thing) {
+ return thing && typeof thing === 'object' && typeof thing[Symbol.iterator] === 'function';
+ }
+ Iterable.is = is;
+ const _empty = Object.freeze([]);
+ function empty() {
+ return _empty;
+ }
+ Iterable.empty = empty;
+ function* single(element) {
+ yield element;
+ }
+ Iterable.single = single;
+ function wrap(iterableOrElement) {
+ if (is(iterableOrElement)) {
+ return iterableOrElement;
+ }
+ else {
+ return single(iterableOrElement);
+ }
+ }
+ Iterable.wrap = wrap;
+ function from(iterable) {
+ return iterable || _empty;
+ }
+ Iterable.from = from;
+ function* reverse(array) {
+ for (let i = array.length - 1; i >= 0; i--) {
+ yield array[i];
+ }
+ }
+ Iterable.reverse = reverse;
+ function isEmpty(iterable) {
+ return !iterable || iterable[Symbol.iterator]().next().done === true;
+ }
+ Iterable.isEmpty = isEmpty;
+ function first(iterable) {
+ return iterable[Symbol.iterator]().next().value;
+ }
+ Iterable.first = first;
+ function some(iterable, predicate) {
+ for (const element of iterable) {
+ if (predicate(element)) {
+ return true;
+ }
+ }
+ return false;
+ }
+ Iterable.some = some;
+ function find(iterable, predicate) {
+ for (const element of iterable) {
+ if (predicate(element)) {
+ return element;
+ }
+ }
+ return undefined;
+ }
+ Iterable.find = find;
+ function* filter(iterable, predicate) {
+ for (const element of iterable) {
+ if (predicate(element)) {
+ yield element;
+ }
+ }
+ }
+ Iterable.filter = filter;
+ function* map(iterable, fn) {
+ let index = 0;
+ for (const element of iterable) {
+ yield fn(element, index++);
+ }
+ }
+ Iterable.map = map;
+ function* concat(...iterables) {
+ for (const iterable of iterables) {
+ yield* iterable;
+ }
+ }
+ Iterable.concat = concat;
+ function reduce(iterable, reducer, initialValue) {
+ let value = initialValue;
+ for (const element of iterable) {
+ value = reducer(value, element);
+ }
+ return value;
+ }
+ Iterable.reduce = reduce;
+ /**
+ * Returns an iterable slice of the array, with the same semantics as `array.slice()`.
+ */
+ function* slice(arr, from, to = arr.length) {
+ if (from < 0) {
+ from += arr.length;
+ }
+ if (to < 0) {
+ to += arr.length;
+ }
+ else if (to > arr.length) {
+ to = arr.length;
+ }
+ for (; from < to; from++) {
+ yield arr[from];
+ }
+ }
+ Iterable.slice = slice;
+ /**
+ * Consumes `atMost` elements from iterable and returns the consumed elements,
+ * and an iterable for the rest of the elements.
+ */
+ function consume(iterable, atMost = Number.POSITIVE_INFINITY) {
+ const consumed = [];
+ if (atMost === 0) {
+ return [consumed, iterable];
+ }
+ const iterator = iterable[Symbol.iterator]();
+ for (let i = 0; i < atMost; i++) {
+ const next = iterator.next();
+ if (next.done) {
+ return [consumed, Iterable.empty()];
+ }
+ consumed.push(next.value);
+ }
+ return [consumed, { [Symbol.iterator]() { return iterator; } }];
+ }
+ Iterable.consume = consume;
+})(Iterable || (Iterable = {}));
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/keyCodes.js":
+/*!*******************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/keyCodes.js ***!
+ \*******************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ EVENT_KEY_CODE_MAP: () => (/* binding */ EVENT_KEY_CODE_MAP),
+/* harmony export */ IMMUTABLE_CODE_TO_KEY_CODE: () => (/* binding */ IMMUTABLE_CODE_TO_KEY_CODE),
+/* harmony export */ IMMUTABLE_KEY_CODE_TO_CODE: () => (/* binding */ IMMUTABLE_KEY_CODE_TO_CODE),
+/* harmony export */ KeyChord: () => (/* binding */ KeyChord),
+/* harmony export */ KeyCodeUtils: () => (/* binding */ KeyCodeUtils),
+/* harmony export */ NATIVE_WINDOWS_KEY_CODE_TO_KEY_CODE: () => (/* binding */ NATIVE_WINDOWS_KEY_CODE_TO_KEY_CODE)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+class KeyCodeStrMap {
+ constructor() {
+ this._keyCodeToStr = [];
+ this._strToKeyCode = Object.create(null);
+ }
+ define(keyCode, str) {
+ this._keyCodeToStr[keyCode] = str;
+ this._strToKeyCode[str.toLowerCase()] = keyCode;
+ }
+ keyCodeToStr(keyCode) {
+ return this._keyCodeToStr[keyCode];
+ }
+ strToKeyCode(str) {
+ return this._strToKeyCode[str.toLowerCase()] || 0 /* KeyCode.Unknown */;
+ }
+}
+const uiMap = new KeyCodeStrMap();
+const userSettingsUSMap = new KeyCodeStrMap();
+const userSettingsGeneralMap = new KeyCodeStrMap();
+const EVENT_KEY_CODE_MAP = new Array(230);
+const NATIVE_WINDOWS_KEY_CODE_TO_KEY_CODE = {};
+const scanCodeIntToStr = [];
+const scanCodeStrToInt = Object.create(null);
+const scanCodeLowerCaseStrToInt = Object.create(null);
+/**
+ * -1 if a ScanCode => KeyCode mapping depends on kb layout.
+ */
+const IMMUTABLE_CODE_TO_KEY_CODE = [];
+/**
+ * -1 if a KeyCode => ScanCode mapping depends on kb layout.
+ */
+const IMMUTABLE_KEY_CODE_TO_CODE = [];
+for (let i = 0; i <= 193 /* ScanCode.MAX_VALUE */; i++) {
+ IMMUTABLE_CODE_TO_KEY_CODE[i] = -1 /* KeyCode.DependsOnKbLayout */;
+}
+for (let i = 0; i <= 132 /* KeyCode.MAX_VALUE */; i++) {
+ IMMUTABLE_KEY_CODE_TO_CODE[i] = -1 /* ScanCode.DependsOnKbLayout */;
+}
+(function () {
+ // See https://msdn.microsoft.com/en-us/library/windows/desktop/dd375731(v=vs.85).aspx
+ // See https://github.com/microsoft/node-native-keymap/blob/88c0b0e5/deps/chromium/keyboard_codes_win.h
+ const empty = '';
+ const mappings = [
+ // immutable, scanCode, scanCodeStr, keyCode, keyCodeStr, eventKeyCode, vkey, usUserSettingsLabel, generalUserSettingsLabel
+ [1, 0 /* ScanCode.None */, 'None', 0 /* KeyCode.Unknown */, 'unknown', 0, 'VK_UNKNOWN', empty, empty],
+ [1, 1 /* ScanCode.Hyper */, 'Hyper', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 2 /* ScanCode.Super */, 'Super', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 3 /* ScanCode.Fn */, 'Fn', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 4 /* ScanCode.FnLock */, 'FnLock', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 5 /* ScanCode.Suspend */, 'Suspend', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 6 /* ScanCode.Resume */, 'Resume', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 7 /* ScanCode.Turbo */, 'Turbo', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 8 /* ScanCode.Sleep */, 'Sleep', 0 /* KeyCode.Unknown */, empty, 0, 'VK_SLEEP', empty, empty],
+ [1, 9 /* ScanCode.WakeUp */, 'WakeUp', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [0, 10 /* ScanCode.KeyA */, 'KeyA', 31 /* KeyCode.KeyA */, 'A', 65, 'VK_A', empty, empty],
+ [0, 11 /* ScanCode.KeyB */, 'KeyB', 32 /* KeyCode.KeyB */, 'B', 66, 'VK_B', empty, empty],
+ [0, 12 /* ScanCode.KeyC */, 'KeyC', 33 /* KeyCode.KeyC */, 'C', 67, 'VK_C', empty, empty],
+ [0, 13 /* ScanCode.KeyD */, 'KeyD', 34 /* KeyCode.KeyD */, 'D', 68, 'VK_D', empty, empty],
+ [0, 14 /* ScanCode.KeyE */, 'KeyE', 35 /* KeyCode.KeyE */, 'E', 69, 'VK_E', empty, empty],
+ [0, 15 /* ScanCode.KeyF */, 'KeyF', 36 /* KeyCode.KeyF */, 'F', 70, 'VK_F', empty, empty],
+ [0, 16 /* ScanCode.KeyG */, 'KeyG', 37 /* KeyCode.KeyG */, 'G', 71, 'VK_G', empty, empty],
+ [0, 17 /* ScanCode.KeyH */, 'KeyH', 38 /* KeyCode.KeyH */, 'H', 72, 'VK_H', empty, empty],
+ [0, 18 /* ScanCode.KeyI */, 'KeyI', 39 /* KeyCode.KeyI */, 'I', 73, 'VK_I', empty, empty],
+ [0, 19 /* ScanCode.KeyJ */, 'KeyJ', 40 /* KeyCode.KeyJ */, 'J', 74, 'VK_J', empty, empty],
+ [0, 20 /* ScanCode.KeyK */, 'KeyK', 41 /* KeyCode.KeyK */, 'K', 75, 'VK_K', empty, empty],
+ [0, 21 /* ScanCode.KeyL */, 'KeyL', 42 /* KeyCode.KeyL */, 'L', 76, 'VK_L', empty, empty],
+ [0, 22 /* ScanCode.KeyM */, 'KeyM', 43 /* KeyCode.KeyM */, 'M', 77, 'VK_M', empty, empty],
+ [0, 23 /* ScanCode.KeyN */, 'KeyN', 44 /* KeyCode.KeyN */, 'N', 78, 'VK_N', empty, empty],
+ [0, 24 /* ScanCode.KeyO */, 'KeyO', 45 /* KeyCode.KeyO */, 'O', 79, 'VK_O', empty, empty],
+ [0, 25 /* ScanCode.KeyP */, 'KeyP', 46 /* KeyCode.KeyP */, 'P', 80, 'VK_P', empty, empty],
+ [0, 26 /* ScanCode.KeyQ */, 'KeyQ', 47 /* KeyCode.KeyQ */, 'Q', 81, 'VK_Q', empty, empty],
+ [0, 27 /* ScanCode.KeyR */, 'KeyR', 48 /* KeyCode.KeyR */, 'R', 82, 'VK_R', empty, empty],
+ [0, 28 /* ScanCode.KeyS */, 'KeyS', 49 /* KeyCode.KeyS */, 'S', 83, 'VK_S', empty, empty],
+ [0, 29 /* ScanCode.KeyT */, 'KeyT', 50 /* KeyCode.KeyT */, 'T', 84, 'VK_T', empty, empty],
+ [0, 30 /* ScanCode.KeyU */, 'KeyU', 51 /* KeyCode.KeyU */, 'U', 85, 'VK_U', empty, empty],
+ [0, 31 /* ScanCode.KeyV */, 'KeyV', 52 /* KeyCode.KeyV */, 'V', 86, 'VK_V', empty, empty],
+ [0, 32 /* ScanCode.KeyW */, 'KeyW', 53 /* KeyCode.KeyW */, 'W', 87, 'VK_W', empty, empty],
+ [0, 33 /* ScanCode.KeyX */, 'KeyX', 54 /* KeyCode.KeyX */, 'X', 88, 'VK_X', empty, empty],
+ [0, 34 /* ScanCode.KeyY */, 'KeyY', 55 /* KeyCode.KeyY */, 'Y', 89, 'VK_Y', empty, empty],
+ [0, 35 /* ScanCode.KeyZ */, 'KeyZ', 56 /* KeyCode.KeyZ */, 'Z', 90, 'VK_Z', empty, empty],
+ [0, 36 /* ScanCode.Digit1 */, 'Digit1', 22 /* KeyCode.Digit1 */, '1', 49, 'VK_1', empty, empty],
+ [0, 37 /* ScanCode.Digit2 */, 'Digit2', 23 /* KeyCode.Digit2 */, '2', 50, 'VK_2', empty, empty],
+ [0, 38 /* ScanCode.Digit3 */, 'Digit3', 24 /* KeyCode.Digit3 */, '3', 51, 'VK_3', empty, empty],
+ [0, 39 /* ScanCode.Digit4 */, 'Digit4', 25 /* KeyCode.Digit4 */, '4', 52, 'VK_4', empty, empty],
+ [0, 40 /* ScanCode.Digit5 */, 'Digit5', 26 /* KeyCode.Digit5 */, '5', 53, 'VK_5', empty, empty],
+ [0, 41 /* ScanCode.Digit6 */, 'Digit6', 27 /* KeyCode.Digit6 */, '6', 54, 'VK_6', empty, empty],
+ [0, 42 /* ScanCode.Digit7 */, 'Digit7', 28 /* KeyCode.Digit7 */, '7', 55, 'VK_7', empty, empty],
+ [0, 43 /* ScanCode.Digit8 */, 'Digit8', 29 /* KeyCode.Digit8 */, '8', 56, 'VK_8', empty, empty],
+ [0, 44 /* ScanCode.Digit9 */, 'Digit9', 30 /* KeyCode.Digit9 */, '9', 57, 'VK_9', empty, empty],
+ [0, 45 /* ScanCode.Digit0 */, 'Digit0', 21 /* KeyCode.Digit0 */, '0', 48, 'VK_0', empty, empty],
+ [1, 46 /* ScanCode.Enter */, 'Enter', 3 /* KeyCode.Enter */, 'Enter', 13, 'VK_RETURN', empty, empty],
+ [1, 47 /* ScanCode.Escape */, 'Escape', 9 /* KeyCode.Escape */, 'Escape', 27, 'VK_ESCAPE', empty, empty],
+ [1, 48 /* ScanCode.Backspace */, 'Backspace', 1 /* KeyCode.Backspace */, 'Backspace', 8, 'VK_BACK', empty, empty],
+ [1, 49 /* ScanCode.Tab */, 'Tab', 2 /* KeyCode.Tab */, 'Tab', 9, 'VK_TAB', empty, empty],
+ [1, 50 /* ScanCode.Space */, 'Space', 10 /* KeyCode.Space */, 'Space', 32, 'VK_SPACE', empty, empty],
+ [0, 51 /* ScanCode.Minus */, 'Minus', 88 /* KeyCode.Minus */, '-', 189, 'VK_OEM_MINUS', '-', 'OEM_MINUS'],
+ [0, 52 /* ScanCode.Equal */, 'Equal', 86 /* KeyCode.Equal */, '=', 187, 'VK_OEM_PLUS', '=', 'OEM_PLUS'],
+ [0, 53 /* ScanCode.BracketLeft */, 'BracketLeft', 92 /* KeyCode.BracketLeft */, '[', 219, 'VK_OEM_4', '[', 'OEM_4'],
+ [0, 54 /* ScanCode.BracketRight */, 'BracketRight', 94 /* KeyCode.BracketRight */, ']', 221, 'VK_OEM_6', ']', 'OEM_6'],
+ [0, 55 /* ScanCode.Backslash */, 'Backslash', 93 /* KeyCode.Backslash */, '\\', 220, 'VK_OEM_5', '\\', 'OEM_5'],
+ [0, 56 /* ScanCode.IntlHash */, 'IntlHash', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty], // has been dropped from the w3c spec
+ [0, 57 /* ScanCode.Semicolon */, 'Semicolon', 85 /* KeyCode.Semicolon */, ';', 186, 'VK_OEM_1', ';', 'OEM_1'],
+ [0, 58 /* ScanCode.Quote */, 'Quote', 95 /* KeyCode.Quote */, '\'', 222, 'VK_OEM_7', '\'', 'OEM_7'],
+ [0, 59 /* ScanCode.Backquote */, 'Backquote', 91 /* KeyCode.Backquote */, '`', 192, 'VK_OEM_3', '`', 'OEM_3'],
+ [0, 60 /* ScanCode.Comma */, 'Comma', 87 /* KeyCode.Comma */, ',', 188, 'VK_OEM_COMMA', ',', 'OEM_COMMA'],
+ [0, 61 /* ScanCode.Period */, 'Period', 89 /* KeyCode.Period */, '.', 190, 'VK_OEM_PERIOD', '.', 'OEM_PERIOD'],
+ [0, 62 /* ScanCode.Slash */, 'Slash', 90 /* KeyCode.Slash */, '/', 191, 'VK_OEM_2', '/', 'OEM_2'],
+ [1, 63 /* ScanCode.CapsLock */, 'CapsLock', 8 /* KeyCode.CapsLock */, 'CapsLock', 20, 'VK_CAPITAL', empty, empty],
+ [1, 64 /* ScanCode.F1 */, 'F1', 59 /* KeyCode.F1 */, 'F1', 112, 'VK_F1', empty, empty],
+ [1, 65 /* ScanCode.F2 */, 'F2', 60 /* KeyCode.F2 */, 'F2', 113, 'VK_F2', empty, empty],
+ [1, 66 /* ScanCode.F3 */, 'F3', 61 /* KeyCode.F3 */, 'F3', 114, 'VK_F3', empty, empty],
+ [1, 67 /* ScanCode.F4 */, 'F4', 62 /* KeyCode.F4 */, 'F4', 115, 'VK_F4', empty, empty],
+ [1, 68 /* ScanCode.F5 */, 'F5', 63 /* KeyCode.F5 */, 'F5', 116, 'VK_F5', empty, empty],
+ [1, 69 /* ScanCode.F6 */, 'F6', 64 /* KeyCode.F6 */, 'F6', 117, 'VK_F6', empty, empty],
+ [1, 70 /* ScanCode.F7 */, 'F7', 65 /* KeyCode.F7 */, 'F7', 118, 'VK_F7', empty, empty],
+ [1, 71 /* ScanCode.F8 */, 'F8', 66 /* KeyCode.F8 */, 'F8', 119, 'VK_F8', empty, empty],
+ [1, 72 /* ScanCode.F9 */, 'F9', 67 /* KeyCode.F9 */, 'F9', 120, 'VK_F9', empty, empty],
+ [1, 73 /* ScanCode.F10 */, 'F10', 68 /* KeyCode.F10 */, 'F10', 121, 'VK_F10', empty, empty],
+ [1, 74 /* ScanCode.F11 */, 'F11', 69 /* KeyCode.F11 */, 'F11', 122, 'VK_F11', empty, empty],
+ [1, 75 /* ScanCode.F12 */, 'F12', 70 /* KeyCode.F12 */, 'F12', 123, 'VK_F12', empty, empty],
+ [1, 76 /* ScanCode.PrintScreen */, 'PrintScreen', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 77 /* ScanCode.ScrollLock */, 'ScrollLock', 84 /* KeyCode.ScrollLock */, 'ScrollLock', 145, 'VK_SCROLL', empty, empty],
+ [1, 78 /* ScanCode.Pause */, 'Pause', 7 /* KeyCode.PauseBreak */, 'PauseBreak', 19, 'VK_PAUSE', empty, empty],
+ [1, 79 /* ScanCode.Insert */, 'Insert', 19 /* KeyCode.Insert */, 'Insert', 45, 'VK_INSERT', empty, empty],
+ [1, 80 /* ScanCode.Home */, 'Home', 14 /* KeyCode.Home */, 'Home', 36, 'VK_HOME', empty, empty],
+ [1, 81 /* ScanCode.PageUp */, 'PageUp', 11 /* KeyCode.PageUp */, 'PageUp', 33, 'VK_PRIOR', empty, empty],
+ [1, 82 /* ScanCode.Delete */, 'Delete', 20 /* KeyCode.Delete */, 'Delete', 46, 'VK_DELETE', empty, empty],
+ [1, 83 /* ScanCode.End */, 'End', 13 /* KeyCode.End */, 'End', 35, 'VK_END', empty, empty],
+ [1, 84 /* ScanCode.PageDown */, 'PageDown', 12 /* KeyCode.PageDown */, 'PageDown', 34, 'VK_NEXT', empty, empty],
+ [1, 85 /* ScanCode.ArrowRight */, 'ArrowRight', 17 /* KeyCode.RightArrow */, 'RightArrow', 39, 'VK_RIGHT', 'Right', empty],
+ [1, 86 /* ScanCode.ArrowLeft */, 'ArrowLeft', 15 /* KeyCode.LeftArrow */, 'LeftArrow', 37, 'VK_LEFT', 'Left', empty],
+ [1, 87 /* ScanCode.ArrowDown */, 'ArrowDown', 18 /* KeyCode.DownArrow */, 'DownArrow', 40, 'VK_DOWN', 'Down', empty],
+ [1, 88 /* ScanCode.ArrowUp */, 'ArrowUp', 16 /* KeyCode.UpArrow */, 'UpArrow', 38, 'VK_UP', 'Up', empty],
+ [1, 89 /* ScanCode.NumLock */, 'NumLock', 83 /* KeyCode.NumLock */, 'NumLock', 144, 'VK_NUMLOCK', empty, empty],
+ [1, 90 /* ScanCode.NumpadDivide */, 'NumpadDivide', 113 /* KeyCode.NumpadDivide */, 'NumPad_Divide', 111, 'VK_DIVIDE', empty, empty],
+ [1, 91 /* ScanCode.NumpadMultiply */, 'NumpadMultiply', 108 /* KeyCode.NumpadMultiply */, 'NumPad_Multiply', 106, 'VK_MULTIPLY', empty, empty],
+ [1, 92 /* ScanCode.NumpadSubtract */, 'NumpadSubtract', 111 /* KeyCode.NumpadSubtract */, 'NumPad_Subtract', 109, 'VK_SUBTRACT', empty, empty],
+ [1, 93 /* ScanCode.NumpadAdd */, 'NumpadAdd', 109 /* KeyCode.NumpadAdd */, 'NumPad_Add', 107, 'VK_ADD', empty, empty],
+ [1, 94 /* ScanCode.NumpadEnter */, 'NumpadEnter', 3 /* KeyCode.Enter */, empty, 0, empty, empty, empty],
+ [1, 95 /* ScanCode.Numpad1 */, 'Numpad1', 99 /* KeyCode.Numpad1 */, 'NumPad1', 97, 'VK_NUMPAD1', empty, empty],
+ [1, 96 /* ScanCode.Numpad2 */, 'Numpad2', 100 /* KeyCode.Numpad2 */, 'NumPad2', 98, 'VK_NUMPAD2', empty, empty],
+ [1, 97 /* ScanCode.Numpad3 */, 'Numpad3', 101 /* KeyCode.Numpad3 */, 'NumPad3', 99, 'VK_NUMPAD3', empty, empty],
+ [1, 98 /* ScanCode.Numpad4 */, 'Numpad4', 102 /* KeyCode.Numpad4 */, 'NumPad4', 100, 'VK_NUMPAD4', empty, empty],
+ [1, 99 /* ScanCode.Numpad5 */, 'Numpad5', 103 /* KeyCode.Numpad5 */, 'NumPad5', 101, 'VK_NUMPAD5', empty, empty],
+ [1, 100 /* ScanCode.Numpad6 */, 'Numpad6', 104 /* KeyCode.Numpad6 */, 'NumPad6', 102, 'VK_NUMPAD6', empty, empty],
+ [1, 101 /* ScanCode.Numpad7 */, 'Numpad7', 105 /* KeyCode.Numpad7 */, 'NumPad7', 103, 'VK_NUMPAD7', empty, empty],
+ [1, 102 /* ScanCode.Numpad8 */, 'Numpad8', 106 /* KeyCode.Numpad8 */, 'NumPad8', 104, 'VK_NUMPAD8', empty, empty],
+ [1, 103 /* ScanCode.Numpad9 */, 'Numpad9', 107 /* KeyCode.Numpad9 */, 'NumPad9', 105, 'VK_NUMPAD9', empty, empty],
+ [1, 104 /* ScanCode.Numpad0 */, 'Numpad0', 98 /* KeyCode.Numpad0 */, 'NumPad0', 96, 'VK_NUMPAD0', empty, empty],
+ [1, 105 /* ScanCode.NumpadDecimal */, 'NumpadDecimal', 112 /* KeyCode.NumpadDecimal */, 'NumPad_Decimal', 110, 'VK_DECIMAL', empty, empty],
+ [0, 106 /* ScanCode.IntlBackslash */, 'IntlBackslash', 97 /* KeyCode.IntlBackslash */, 'OEM_102', 226, 'VK_OEM_102', empty, empty],
+ [1, 107 /* ScanCode.ContextMenu */, 'ContextMenu', 58 /* KeyCode.ContextMenu */, 'ContextMenu', 93, empty, empty, empty],
+ [1, 108 /* ScanCode.Power */, 'Power', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 109 /* ScanCode.NumpadEqual */, 'NumpadEqual', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 110 /* ScanCode.F13 */, 'F13', 71 /* KeyCode.F13 */, 'F13', 124, 'VK_F13', empty, empty],
+ [1, 111 /* ScanCode.F14 */, 'F14', 72 /* KeyCode.F14 */, 'F14', 125, 'VK_F14', empty, empty],
+ [1, 112 /* ScanCode.F15 */, 'F15', 73 /* KeyCode.F15 */, 'F15', 126, 'VK_F15', empty, empty],
+ [1, 113 /* ScanCode.F16 */, 'F16', 74 /* KeyCode.F16 */, 'F16', 127, 'VK_F16', empty, empty],
+ [1, 114 /* ScanCode.F17 */, 'F17', 75 /* KeyCode.F17 */, 'F17', 128, 'VK_F17', empty, empty],
+ [1, 115 /* ScanCode.F18 */, 'F18', 76 /* KeyCode.F18 */, 'F18', 129, 'VK_F18', empty, empty],
+ [1, 116 /* ScanCode.F19 */, 'F19', 77 /* KeyCode.F19 */, 'F19', 130, 'VK_F19', empty, empty],
+ [1, 117 /* ScanCode.F20 */, 'F20', 78 /* KeyCode.F20 */, 'F20', 131, 'VK_F20', empty, empty],
+ [1, 118 /* ScanCode.F21 */, 'F21', 79 /* KeyCode.F21 */, 'F21', 132, 'VK_F21', empty, empty],
+ [1, 119 /* ScanCode.F22 */, 'F22', 80 /* KeyCode.F22 */, 'F22', 133, 'VK_F22', empty, empty],
+ [1, 120 /* ScanCode.F23 */, 'F23', 81 /* KeyCode.F23 */, 'F23', 134, 'VK_F23', empty, empty],
+ [1, 121 /* ScanCode.F24 */, 'F24', 82 /* KeyCode.F24 */, 'F24', 135, 'VK_F24', empty, empty],
+ [1, 122 /* ScanCode.Open */, 'Open', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 123 /* ScanCode.Help */, 'Help', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 124 /* ScanCode.Select */, 'Select', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 125 /* ScanCode.Again */, 'Again', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 126 /* ScanCode.Undo */, 'Undo', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 127 /* ScanCode.Cut */, 'Cut', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 128 /* ScanCode.Copy */, 'Copy', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 129 /* ScanCode.Paste */, 'Paste', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 130 /* ScanCode.Find */, 'Find', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 131 /* ScanCode.AudioVolumeMute */, 'AudioVolumeMute', 117 /* KeyCode.AudioVolumeMute */, 'AudioVolumeMute', 173, 'VK_VOLUME_MUTE', empty, empty],
+ [1, 132 /* ScanCode.AudioVolumeUp */, 'AudioVolumeUp', 118 /* KeyCode.AudioVolumeUp */, 'AudioVolumeUp', 175, 'VK_VOLUME_UP', empty, empty],
+ [1, 133 /* ScanCode.AudioVolumeDown */, 'AudioVolumeDown', 119 /* KeyCode.AudioVolumeDown */, 'AudioVolumeDown', 174, 'VK_VOLUME_DOWN', empty, empty],
+ [1, 134 /* ScanCode.NumpadComma */, 'NumpadComma', 110 /* KeyCode.NUMPAD_SEPARATOR */, 'NumPad_Separator', 108, 'VK_SEPARATOR', empty, empty],
+ [0, 135 /* ScanCode.IntlRo */, 'IntlRo', 115 /* KeyCode.ABNT_C1 */, 'ABNT_C1', 193, 'VK_ABNT_C1', empty, empty],
+ [1, 136 /* ScanCode.KanaMode */, 'KanaMode', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [0, 137 /* ScanCode.IntlYen */, 'IntlYen', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 138 /* ScanCode.Convert */, 'Convert', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 139 /* ScanCode.NonConvert */, 'NonConvert', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 140 /* ScanCode.Lang1 */, 'Lang1', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 141 /* ScanCode.Lang2 */, 'Lang2', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 142 /* ScanCode.Lang3 */, 'Lang3', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 143 /* ScanCode.Lang4 */, 'Lang4', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 144 /* ScanCode.Lang5 */, 'Lang5', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 145 /* ScanCode.Abort */, 'Abort', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 146 /* ScanCode.Props */, 'Props', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 147 /* ScanCode.NumpadParenLeft */, 'NumpadParenLeft', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 148 /* ScanCode.NumpadParenRight */, 'NumpadParenRight', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 149 /* ScanCode.NumpadBackspace */, 'NumpadBackspace', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 150 /* ScanCode.NumpadMemoryStore */, 'NumpadMemoryStore', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 151 /* ScanCode.NumpadMemoryRecall */, 'NumpadMemoryRecall', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 152 /* ScanCode.NumpadMemoryClear */, 'NumpadMemoryClear', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 153 /* ScanCode.NumpadMemoryAdd */, 'NumpadMemoryAdd', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 154 /* ScanCode.NumpadMemorySubtract */, 'NumpadMemorySubtract', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 155 /* ScanCode.NumpadClear */, 'NumpadClear', 131 /* KeyCode.Clear */, 'Clear', 12, 'VK_CLEAR', empty, empty],
+ [1, 156 /* ScanCode.NumpadClearEntry */, 'NumpadClearEntry', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 5 /* KeyCode.Ctrl */, 'Ctrl', 17, 'VK_CONTROL', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 4 /* KeyCode.Shift */, 'Shift', 16, 'VK_SHIFT', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 6 /* KeyCode.Alt */, 'Alt', 18, 'VK_MENU', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 57 /* KeyCode.Meta */, 'Meta', 91, 'VK_COMMAND', empty, empty],
+ [1, 157 /* ScanCode.ControlLeft */, 'ControlLeft', 5 /* KeyCode.Ctrl */, empty, 0, 'VK_LCONTROL', empty, empty],
+ [1, 158 /* ScanCode.ShiftLeft */, 'ShiftLeft', 4 /* KeyCode.Shift */, empty, 0, 'VK_LSHIFT', empty, empty],
+ [1, 159 /* ScanCode.AltLeft */, 'AltLeft', 6 /* KeyCode.Alt */, empty, 0, 'VK_LMENU', empty, empty],
+ [1, 160 /* ScanCode.MetaLeft */, 'MetaLeft', 57 /* KeyCode.Meta */, empty, 0, 'VK_LWIN', empty, empty],
+ [1, 161 /* ScanCode.ControlRight */, 'ControlRight', 5 /* KeyCode.Ctrl */, empty, 0, 'VK_RCONTROL', empty, empty],
+ [1, 162 /* ScanCode.ShiftRight */, 'ShiftRight', 4 /* KeyCode.Shift */, empty, 0, 'VK_RSHIFT', empty, empty],
+ [1, 163 /* ScanCode.AltRight */, 'AltRight', 6 /* KeyCode.Alt */, empty, 0, 'VK_RMENU', empty, empty],
+ [1, 164 /* ScanCode.MetaRight */, 'MetaRight', 57 /* KeyCode.Meta */, empty, 0, 'VK_RWIN', empty, empty],
+ [1, 165 /* ScanCode.BrightnessUp */, 'BrightnessUp', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 166 /* ScanCode.BrightnessDown */, 'BrightnessDown', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 167 /* ScanCode.MediaPlay */, 'MediaPlay', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 168 /* ScanCode.MediaRecord */, 'MediaRecord', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 169 /* ScanCode.MediaFastForward */, 'MediaFastForward', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 170 /* ScanCode.MediaRewind */, 'MediaRewind', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 171 /* ScanCode.MediaTrackNext */, 'MediaTrackNext', 124 /* KeyCode.MediaTrackNext */, 'MediaTrackNext', 176, 'VK_MEDIA_NEXT_TRACK', empty, empty],
+ [1, 172 /* ScanCode.MediaTrackPrevious */, 'MediaTrackPrevious', 125 /* KeyCode.MediaTrackPrevious */, 'MediaTrackPrevious', 177, 'VK_MEDIA_PREV_TRACK', empty, empty],
+ [1, 173 /* ScanCode.MediaStop */, 'MediaStop', 126 /* KeyCode.MediaStop */, 'MediaStop', 178, 'VK_MEDIA_STOP', empty, empty],
+ [1, 174 /* ScanCode.Eject */, 'Eject', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 175 /* ScanCode.MediaPlayPause */, 'MediaPlayPause', 127 /* KeyCode.MediaPlayPause */, 'MediaPlayPause', 179, 'VK_MEDIA_PLAY_PAUSE', empty, empty],
+ [1, 176 /* ScanCode.MediaSelect */, 'MediaSelect', 128 /* KeyCode.LaunchMediaPlayer */, 'LaunchMediaPlayer', 181, 'VK_MEDIA_LAUNCH_MEDIA_SELECT', empty, empty],
+ [1, 177 /* ScanCode.LaunchMail */, 'LaunchMail', 129 /* KeyCode.LaunchMail */, 'LaunchMail', 180, 'VK_MEDIA_LAUNCH_MAIL', empty, empty],
+ [1, 178 /* ScanCode.LaunchApp2 */, 'LaunchApp2', 130 /* KeyCode.LaunchApp2 */, 'LaunchApp2', 183, 'VK_MEDIA_LAUNCH_APP2', empty, empty],
+ [1, 179 /* ScanCode.LaunchApp1 */, 'LaunchApp1', 0 /* KeyCode.Unknown */, empty, 0, 'VK_MEDIA_LAUNCH_APP1', empty, empty],
+ [1, 180 /* ScanCode.SelectTask */, 'SelectTask', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 181 /* ScanCode.LaunchScreenSaver */, 'LaunchScreenSaver', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 182 /* ScanCode.BrowserSearch */, 'BrowserSearch', 120 /* KeyCode.BrowserSearch */, 'BrowserSearch', 170, 'VK_BROWSER_SEARCH', empty, empty],
+ [1, 183 /* ScanCode.BrowserHome */, 'BrowserHome', 121 /* KeyCode.BrowserHome */, 'BrowserHome', 172, 'VK_BROWSER_HOME', empty, empty],
+ [1, 184 /* ScanCode.BrowserBack */, 'BrowserBack', 122 /* KeyCode.BrowserBack */, 'BrowserBack', 166, 'VK_BROWSER_BACK', empty, empty],
+ [1, 185 /* ScanCode.BrowserForward */, 'BrowserForward', 123 /* KeyCode.BrowserForward */, 'BrowserForward', 167, 'VK_BROWSER_FORWARD', empty, empty],
+ [1, 186 /* ScanCode.BrowserStop */, 'BrowserStop', 0 /* KeyCode.Unknown */, empty, 0, 'VK_BROWSER_STOP', empty, empty],
+ [1, 187 /* ScanCode.BrowserRefresh */, 'BrowserRefresh', 0 /* KeyCode.Unknown */, empty, 0, 'VK_BROWSER_REFRESH', empty, empty],
+ [1, 188 /* ScanCode.BrowserFavorites */, 'BrowserFavorites', 0 /* KeyCode.Unknown */, empty, 0, 'VK_BROWSER_FAVORITES', empty, empty],
+ [1, 189 /* ScanCode.ZoomToggle */, 'ZoomToggle', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 190 /* ScanCode.MailReply */, 'MailReply', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 191 /* ScanCode.MailForward */, 'MailForward', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ [1, 192 /* ScanCode.MailSend */, 'MailSend', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],
+ // See https://lists.w3.org/Archives/Public/www-dom/2010JulSep/att-0182/keyCode-spec.html
+ // If an Input Method Editor is processing key input and the event is keydown, return 229.
+ [1, 0 /* ScanCode.None */, empty, 114 /* KeyCode.KEY_IN_COMPOSITION */, 'KeyInComposition', 229, empty, empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 116 /* KeyCode.ABNT_C2 */, 'ABNT_C2', 194, 'VK_ABNT_C2', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 96 /* KeyCode.OEM_8 */, 'OEM_8', 223, 'VK_OEM_8', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_KANA', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_HANGUL', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_JUNJA', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_FINAL', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_HANJA', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_KANJI', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_CONVERT', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_NONCONVERT', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_ACCEPT', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_MODECHANGE', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_SELECT', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_PRINT', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_EXECUTE', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_SNAPSHOT', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_HELP', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_APPS', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_PROCESSKEY', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_PACKET', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_DBE_SBCSCHAR', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_DBE_DBCSCHAR', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_ATTN', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_CRSEL', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_EXSEL', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_EREOF', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_PLAY', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_ZOOM', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_NONAME', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_PA1', empty, empty],
+ [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_OEM_CLEAR', empty, empty],
+ ];
+ const seenKeyCode = [];
+ const seenScanCode = [];
+ for (const mapping of mappings) {
+ const [immutable, scanCode, scanCodeStr, keyCode, keyCodeStr, eventKeyCode, vkey, usUserSettingsLabel, generalUserSettingsLabel] = mapping;
+ if (!seenScanCode[scanCode]) {
+ seenScanCode[scanCode] = true;
+ scanCodeIntToStr[scanCode] = scanCodeStr;
+ scanCodeStrToInt[scanCodeStr] = scanCode;
+ scanCodeLowerCaseStrToInt[scanCodeStr.toLowerCase()] = scanCode;
+ if (immutable) {
+ IMMUTABLE_CODE_TO_KEY_CODE[scanCode] = keyCode;
+ if ((keyCode !== 0 /* KeyCode.Unknown */)
+ && (keyCode !== 3 /* KeyCode.Enter */)
+ && (keyCode !== 5 /* KeyCode.Ctrl */)
+ && (keyCode !== 4 /* KeyCode.Shift */)
+ && (keyCode !== 6 /* KeyCode.Alt */)
+ && (keyCode !== 57 /* KeyCode.Meta */)) {
+ IMMUTABLE_KEY_CODE_TO_CODE[keyCode] = scanCode;
+ }
+ }
+ }
+ if (!seenKeyCode[keyCode]) {
+ seenKeyCode[keyCode] = true;
+ if (!keyCodeStr) {
+ throw new Error(`String representation missing for key code ${keyCode} around scan code ${scanCodeStr}`);
+ }
+ uiMap.define(keyCode, keyCodeStr);
+ userSettingsUSMap.define(keyCode, usUserSettingsLabel || keyCodeStr);
+ userSettingsGeneralMap.define(keyCode, generalUserSettingsLabel || usUserSettingsLabel || keyCodeStr);
+ }
+ if (eventKeyCode) {
+ EVENT_KEY_CODE_MAP[eventKeyCode] = keyCode;
+ }
+ if (vkey) {
+ NATIVE_WINDOWS_KEY_CODE_TO_KEY_CODE[vkey] = keyCode;
+ }
+ }
+ // Manually added due to the exclusion above (due to duplication with NumpadEnter)
+ IMMUTABLE_KEY_CODE_TO_CODE[3 /* KeyCode.Enter */] = 46 /* ScanCode.Enter */;
+})();
+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;
+ function toElectronAccelerator(keyCode) {
+ if (keyCode >= 98 /* KeyCode.Numpad0 */ && keyCode <= 113 /* KeyCode.NumpadDivide */) {
+ // [Electron Accelerators] Electron is able to parse numpad keys, but unfortunately it
+ // renders them just as regular keys in menus. For example, num0 is rendered as "0",
+ // numdiv is rendered as "/", numsub is rendered as "-".
+ //
+ // This can lead to incredible confusion, as it makes numpad based keybindings indistinguishable
+ // from keybindings based on regular keys.
+ //
+ // We therefore need to fall back to custom rendering for numpad keys.
+ return null;
+ }
+ switch (keyCode) {
+ case 16 /* KeyCode.UpArrow */:
+ return 'Up';
+ case 18 /* KeyCode.DownArrow */:
+ return 'Down';
+ case 15 /* KeyCode.LeftArrow */:
+ return 'Left';
+ case 17 /* KeyCode.RightArrow */:
+ return 'Right';
+ }
+ return uiMap.keyCodeToStr(keyCode);
+ }
+ KeyCodeUtils.toElectronAccelerator = toElectronAccelerator;
+})(KeyCodeUtils || (KeyCodeUtils = {}));
+function KeyChord(firstPart, secondPart) {
+ const chordPart = ((secondPart & 0x0000FFFF) << 16) >>> 0;
+ return (firstPart | chordPart) >>> 0;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/lazy.js":
+/*!***************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/lazy.js ***!
+ \***************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ Lazy: () => (/* binding */ Lazy)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+class Lazy {
+ constructor(executor) {
+ this.executor = executor;
+ this._didRun = false;
+ }
+ /**
+ * Get the wrapped value.
+ *
+ * This will force evaluation of the lazy value if it has not been resolved yet. Lazy values are only
+ * resolved once. `getValue` will re-throw exceptions that are hit while resolving the value
+ */
+ get value() {
+ if (!this._didRun) {
+ try {
+ this._value = this.executor();
+ }
+ catch (err) {
+ this._error = err;
+ }
+ finally {
+ this._didRun = true;
+ }
+ }
+ if (this._error) {
+ throw this._error;
+ }
+ return this._value;
+ }
+ /**
+ * Get the wrapped value without forcing evaluation.
+ */
+ get rawValue() { return this._value; }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/lifecycle.js":
+/*!********************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/lifecycle.js ***!
+ \********************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ Disposable: () => (/* binding */ Disposable),
+/* harmony export */ DisposableMap: () => (/* binding */ DisposableMap),
+/* harmony export */ DisposableStore: () => (/* binding */ DisposableStore),
+/* harmony export */ ImmortalReference: () => (/* binding */ ImmortalReference),
+/* harmony export */ MutableDisposable: () => (/* binding */ MutableDisposable),
+/* harmony export */ RefCountedDisposable: () => (/* binding */ RefCountedDisposable),
+/* harmony export */ combinedDisposable: () => (/* binding */ combinedDisposable),
+/* harmony export */ dispose: () => (/* binding */ dispose),
+/* harmony export */ isDisposable: () => (/* binding */ isDisposable),
+/* harmony export */ markAsDisposed: () => (/* binding */ markAsDisposed),
+/* harmony export */ markAsSingleton: () => (/* binding */ markAsSingleton),
+/* harmony export */ setDisposableTracker: () => (/* binding */ setDisposableTracker),
+/* harmony export */ toDisposable: () => (/* binding */ toDisposable),
+/* harmony export */ trackDisposable: () => (/* binding */ trackDisposable)
+/* harmony export */ });
+/* harmony import */ var _functional_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./functional.js */ "./node_modules/monaco-editor/esm/vs/base/common/functional.js");
+/* harmony import */ var _iterator_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./iterator.js */ "./node_modules/monaco-editor/esm/vs/base/common/iterator.js");
+
+
+// #region Disposable Tracking
+/**
+ * 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.
+ */
+const TRACK_DISPOSABLES = false;
+let disposableTracker = null;
+function setDisposableTracker(tracker) {
+ disposableTracker = tracker;
+}
+if (TRACK_DISPOSABLES) {
+ const __is_disposable_tracked__ = '__is_disposable_tracked__';
+ setDisposableTracker(new class {
+ trackDisposable(x) {
+ const stack = new Error('Potentially leaked disposable').stack;
+ setTimeout(() => {
+ if (!x[__is_disposable_tracked__]) {
+ console.log(stack);
+ }
+ }, 3000);
+ }
+ setParent(child, parent) {
+ if (child && child !== Disposable.None) {
+ try {
+ child[__is_disposable_tracked__] = true;
+ }
+ catch (_a) {
+ // noop
+ }
+ }
+ }
+ markAsDisposed(disposable) {
+ if (disposable && disposable !== Disposable.None) {
+ try {
+ disposable[__is_disposable_tracked__] = true;
+ }
+ catch (_a) {
+ // noop
+ }
+ }
+ }
+ markAsSingleton(disposable) { }
+ });
+}
+function trackDisposable(x) {
+ disposableTracker === null || disposableTracker === void 0 ? void 0 : disposableTracker.trackDisposable(x);
+ return x;
+}
+function markAsDisposed(disposable) {
+ disposableTracker === null || disposableTracker === void 0 ? void 0 : disposableTracker.markAsDisposed(disposable);
+}
+function setParentOfDisposable(child, parent) {
+ disposableTracker === null || disposableTracker === void 0 ? void 0 : disposableTracker.setParent(child, parent);
+}
+function setParentOfDisposables(children, parent) {
+ if (!disposableTracker) {
+ return;
+ }
+ for (const child of children) {
+ disposableTracker.setParent(child, parent);
+ }
+}
+/**
+ * Indicates that the given object is a singleton which does not need to be disposed.
+*/
+function markAsSingleton(singleton) {
+ disposableTracker === null || disposableTracker === void 0 ? void 0 : disposableTracker.markAsSingleton(singleton);
+ return singleton;
+}
+/**
+ * Check if `thing` is {@link IDisposable disposable}.
+ */
+function isDisposable(thing) {
+ return typeof thing.dispose === 'function' && thing.dispose.length === 0;
+}
+function dispose(arg) {
+ if (_iterator_js__WEBPACK_IMPORTED_MODULE_1__.Iterable.is(arg)) {
+ const errors = [];
+ for (const d of arg) {
+ if (d) {
+ try {
+ d.dispose();
+ }
+ catch (e) {
+ errors.push(e);
+ }
+ }
+ }
+ if (errors.length === 1) {
+ throw errors[0];
+ }
+ else if (errors.length > 1) {
+ throw new AggregateError(errors, 'Encountered errors while disposing of store');
+ }
+ return Array.isArray(arg) ? [] : arg;
+ }
+ else if (arg) {
+ arg.dispose();
+ return arg;
+ }
+}
+/**
+ * Combine multiple disposable values into a single {@link IDisposable}.
+ */
+function combinedDisposable(...disposables) {
+ const parent = toDisposable(() => dispose(disposables));
+ setParentOfDisposables(disposables, parent);
+ return parent;
+}
+/**
+ * Turn a function that implements dispose into an {@link IDisposable}.
+ *
+ * @param fn Clean up function, guaranteed to be called only **once**.
+ */
+function toDisposable(fn) {
+ const self = trackDisposable({
+ dispose: (0,_functional_js__WEBPACK_IMPORTED_MODULE_0__.createSingleCallFunction)(() => {
+ markAsDisposed(self);
+ fn();
+ })
+ });
+ return self;
+}
+/**
+ * Manages a collection of disposable values.
+ *
+ * This is the preferred way to manage multiple disposables. A `DisposableStore` is safer to work with than an
+ * `IDisposable[]` as it considers edge cases, such as registering the same value multiple times or adding an item to a
+ * store that has already been disposed of.
+ */
+class DisposableStore {
+ constructor() {
+ this._toDispose = new Set();
+ this._isDisposed = false;
+ trackDisposable(this);
+ }
+ /**
+ * Dispose of all registered disposables and mark this object as disposed.
+ *
+ * Any future disposables added to this object will be disposed of on `add`.
+ */
+ dispose() {
+ if (this._isDisposed) {
+ return;
+ }
+ markAsDisposed(this);
+ this._isDisposed = true;
+ this.clear();
+ }
+ /**
+ * @return `true` if this object has been disposed of.
+ */
+ get isDisposed() {
+ return this._isDisposed;
+ }
+ /**
+ * Dispose of all registered disposables but do not mark this object as disposed.
+ */
+ clear() {
+ if (this._toDispose.size === 0) {
+ return;
+ }
+ try {
+ dispose(this._toDispose);
+ }
+ finally {
+ this._toDispose.clear();
+ }
+ }
+ /**
+ * Add a new {@link IDisposable disposable} to the collection.
+ */
+ add(o) {
+ if (!o) {
+ return o;
+ }
+ if (o === this) {
+ throw new Error('Cannot register a disposable on itself!');
+ }
+ setParentOfDisposable(o, this);
+ if (this._isDisposed) {
+ if (!DisposableStore.DISABLE_DISPOSED_WARNING) {
+ 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(o);
+ }
+ return o;
+ }
+ /**
+ * Deletes the value from the store, but does not dispose it.
+ */
+ deleteAndLeak(o) {
+ if (!o) {
+ return;
+ }
+ if (this._toDispose.has(o)) {
+ this._toDispose.delete(o);
+ setParentOfDisposable(o, null);
+ }
+ }
+}
+DisposableStore.DISABLE_DISPOSED_WARNING = false;
+/**
+ * Abstract base class for a {@link IDisposable disposable} object.
+ *
+ * Subclasses can {@linkcode _register} disposables that will be automatically cleaned up when this object is disposed of.
+ */
+class Disposable {
+ constructor() {
+ this._store = new DisposableStore();
+ trackDisposable(this);
+ setParentOfDisposable(this._store, this);
+ }
+ dispose() {
+ markAsDisposed(this);
+ this._store.dispose();
+ }
+ /**
+ * Adds `o` to the collection of disposables managed by this object.
+ */
+ _register(o) {
+ if (o === this) {
+ throw new Error('Cannot register a disposable on itself!');
+ }
+ return this._store.add(o);
+ }
+}
+/**
+ * A disposable that does nothing when it is disposed of.
+ *
+ * TODO: This should not be a static property.
+ */
+Disposable.None = Object.freeze({ dispose() { } });
+/**
+ * Manages the lifecycle of a disposable value that may be changed.
+ *
+ * This ensures that when 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.
+ */
+class MutableDisposable {
+ constructor() {
+ this._isDisposed = false;
+ trackDisposable(this);
+ }
+ get value() {
+ return this._isDisposed ? undefined : this._value;
+ }
+ set value(value) {
+ var _a;
+ if (this._isDisposed || value === this._value) {
+ return;
+ }
+ (_a = this._value) === null || _a === void 0 ? void 0 : _a.dispose();
+ if (value) {
+ setParentOfDisposable(value, this);
+ }
+ this._value = value;
+ }
+ /**
+ * Resets the stored value and disposed of the previously stored value.
+ */
+ clear() {
+ this.value = undefined;
+ }
+ dispose() {
+ var _a;
+ this._isDisposed = true;
+ markAsDisposed(this);
+ (_a = this._value) === null || _a === void 0 ? void 0 : _a.dispose();
+ this._value = undefined;
+ }
+}
+class RefCountedDisposable {
+ constructor(_disposable) {
+ this._disposable = _disposable;
+ this._counter = 1;
+ }
+ acquire() {
+ this._counter++;
+ return this;
+ }
+ release() {
+ if (--this._counter === 0) {
+ this._disposable.dispose();
+ }
+ return this;
+ }
+}
+class ImmortalReference {
+ constructor(object) {
+ this.object = object;
+ }
+ dispose() { }
+}
+/**
+ * A map the manages the lifecycle of the values that it stores.
+ */
+class DisposableMap {
+ constructor() {
+ this._store = new Map();
+ this._isDisposed = false;
+ trackDisposable(this);
+ }
+ /**
+ * Disposes of all stored values and mark this object as disposed.
+ *
+ * Trying to use this object after it has been disposed of is an error.
+ */
+ dispose() {
+ markAsDisposed(this);
+ this._isDisposed = true;
+ this.clearAndDisposeAll();
+ }
+ /**
+ * Disposes of all stored values and clear the map, but DO NOT mark this object as disposed.
+ */
+ clearAndDisposeAll() {
+ if (!this._store.size) {
+ return;
+ }
+ try {
+ dispose(this._store.values());
+ }
+ finally {
+ this._store.clear();
+ }
+ }
+ get(key) {
+ return this._store.get(key);
+ }
+ set(key, value, skipDisposeOnOverwrite = false) {
+ var _a;
+ if (this._isDisposed) {
+ console.warn(new Error('Trying to add a disposable to a DisposableMap that has already been disposed of. The added object will be leaked!').stack);
+ }
+ if (!skipDisposeOnOverwrite) {
+ (_a = this._store.get(key)) === null || _a === void 0 ? void 0 : _a.dispose();
+ }
+ this._store.set(key, value);
+ }
+ /**
+ * Delete the value stored for `key` from this map and also dispose of it.
+ */
+ deleteAndDispose(key) {
+ var _a;
+ (_a = this._store.get(key)) === null || _a === void 0 ? void 0 : _a.dispose();
+ this._store.delete(key);
+ }
+ [Symbol.iterator]() {
+ return this._store[Symbol.iterator]();
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/linkedList.js":
+/*!*********************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/linkedList.js ***!
+ \*********************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ LinkedList: () => (/* binding */ LinkedList)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+class Node {
+ constructor(element) {
+ this.element = element;
+ this.next = Node.Undefined;
+ this.prev = Node.Undefined;
+ }
+}
+Node.Undefined = new Node(undefined);
+class LinkedList {
+ constructor() {
+ this._first = Node.Undefined;
+ this._last = Node.Undefined;
+ this._size = 0;
+ }
+ get size() {
+ return this._size;
+ }
+ isEmpty() {
+ return this._first === Node.Undefined;
+ }
+ clear() {
+ let node = this._first;
+ while (node !== Node.Undefined) {
+ const next = node.next;
+ node.prev = Node.Undefined;
+ node.next = Node.Undefined;
+ node = next;
+ }
+ this._first = Node.Undefined;
+ this._last = Node.Undefined;
+ this._size = 0;
+ }
+ unshift(element) {
+ return this._insert(element, false);
+ }
+ push(element) {
+ return this._insert(element, true);
+ }
+ _insert(element, atTheEnd) {
+ const newNode = new Node(element);
+ if (this._first === Node.Undefined) {
+ this._first = newNode;
+ this._last = newNode;
+ }
+ else if (atTheEnd) {
+ // push
+ const oldLast = this._last;
+ this._last = newNode;
+ newNode.prev = oldLast;
+ oldLast.next = newNode;
+ }
+ else {
+ // unshift
+ const oldFirst = this._first;
+ this._first = newNode;
+ newNode.next = oldFirst;
+ oldFirst.prev = newNode;
+ }
+ this._size += 1;
+ let didRemove = false;
+ return () => {
+ if (!didRemove) {
+ didRemove = true;
+ this._remove(newNode);
+ }
+ };
+ }
+ shift() {
+ if (this._first === Node.Undefined) {
+ return undefined;
+ }
+ else {
+ const res = this._first.element;
+ this._remove(this._first);
+ return res;
+ }
+ }
+ pop() {
+ if (this._last === Node.Undefined) {
+ return undefined;
+ }
+ else {
+ const res = this._last.element;
+ this._remove(this._last);
+ return res;
+ }
+ }
+ _remove(node) {
+ if (node.prev !== Node.Undefined && node.next !== Node.Undefined) {
+ // middle
+ const 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;
+ }
+ *[Symbol.iterator]() {
+ let node = this._first;
+ while (node !== Node.Undefined) {
+ yield node.element;
+ node = node.next;
+ }
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/map.js":
+/*!**************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/map.js ***!
+ \**************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ BidirectionalMap: () => (/* binding */ BidirectionalMap),
+/* harmony export */ LRUCache: () => (/* binding */ LRUCache),
+/* harmony export */ LinkedMap: () => (/* binding */ LinkedMap),
+/* harmony export */ ResourceMap: () => (/* binding */ ResourceMap),
+/* harmony export */ SetMap: () => (/* binding */ SetMap)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+var _a, _b;
+class ResourceMapEntry {
+ constructor(uri, value) {
+ this.uri = uri;
+ this.value = value;
+ }
+}
+function isEntries(arg) {
+ return Array.isArray(arg);
+}
+class ResourceMap {
+ constructor(arg, toKey) {
+ this[_a] = 'ResourceMap';
+ if (arg instanceof ResourceMap) {
+ this.map = new Map(arg.map);
+ this.toKey = toKey !== null && toKey !== void 0 ? toKey : ResourceMap.defaultToKey;
+ }
+ else if (isEntries(arg)) {
+ this.map = new Map();
+ this.toKey = toKey !== null && toKey !== void 0 ? toKey : ResourceMap.defaultToKey;
+ for (const [resource, value] of arg) {
+ this.set(resource, value);
+ }
+ }
+ else {
+ this.map = new Map();
+ this.toKey = arg !== null && arg !== void 0 ? arg : ResourceMap.defaultToKey;
+ }
+ }
+ set(resource, value) {
+ this.map.set(this.toKey(resource), new ResourceMapEntry(resource, value));
+ return this;
+ }
+ get(resource) {
+ var _c;
+ return (_c = this.map.get(this.toKey(resource))) === null || _c === void 0 ? void 0 : _c.value;
+ }
+ has(resource) {
+ return this.map.has(this.toKey(resource));
+ }
+ get size() {
+ return this.map.size;
+ }
+ clear() {
+ this.map.clear();
+ }
+ delete(resource) {
+ return this.map.delete(this.toKey(resource));
+ }
+ forEach(clb, thisArg) {
+ if (typeof thisArg !== 'undefined') {
+ clb = clb.bind(thisArg);
+ }
+ for (const [_, entry] of this.map) {
+ clb(entry.value, entry.uri, this);
+ }
+ }
+ *values() {
+ for (const entry of this.map.values()) {
+ yield entry.value;
+ }
+ }
+ *keys() {
+ for (const entry of this.map.values()) {
+ yield entry.uri;
+ }
+ }
+ *entries() {
+ for (const entry of this.map.values()) {
+ yield [entry.uri, entry.value];
+ }
+ }
+ *[(_a = Symbol.toStringTag, Symbol.iterator)]() {
+ for (const [, entry] of this.map) {
+ yield [entry.uri, entry.value];
+ }
+ }
+}
+ResourceMap.defaultToKey = (resource) => resource.toString();
+class LinkedMap {
+ constructor() {
+ this[_b] = 'LinkedMap';
+ this._map = new Map();
+ this._head = undefined;
+ this._tail = undefined;
+ this._size = 0;
+ this._state = 0;
+ }
+ clear() {
+ this._map.clear();
+ this._head = undefined;
+ this._tail = undefined;
+ this._size = 0;
+ this._state++;
+ }
+ isEmpty() {
+ return !this._head && !this._tail;
+ }
+ get size() {
+ return this._size;
+ }
+ get first() {
+ var _c;
+ return (_c = this._head) === null || _c === void 0 ? void 0 : _c.value;
+ }
+ get last() {
+ var _c;
+ return (_c = this._tail) === null || _c === void 0 ? void 0 : _c.value;
+ }
+ has(key) {
+ return this._map.has(key);
+ }
+ get(key, touch = 0 /* Touch.None */) {
+ const item = this._map.get(key);
+ if (!item) {
+ return undefined;
+ }
+ if (touch !== 0 /* Touch.None */) {
+ this.touch(item, touch);
+ }
+ return item.value;
+ }
+ set(key, value, touch = 0 /* Touch.None */) {
+ let item = this._map.get(key);
+ if (item) {
+ item.value = value;
+ if (touch !== 0 /* Touch.None */) {
+ this.touch(item, touch);
+ }
+ }
+ else {
+ item = { key, value, next: undefined, previous: undefined };
+ switch (touch) {
+ case 0 /* Touch.None */:
+ this.addItemLast(item);
+ break;
+ case 1 /* Touch.AsOld */:
+ this.addItemFirst(item);
+ break;
+ case 2 /* Touch.AsNew */:
+ this.addItemLast(item);
+ break;
+ default:
+ this.addItemLast(item);
+ break;
+ }
+ this._map.set(key, item);
+ this._size++;
+ }
+ return this;
+ }
+ delete(key) {
+ return !!this.remove(key);
+ }
+ remove(key) {
+ const item = this._map.get(key);
+ if (!item) {
+ return undefined;
+ }
+ this._map.delete(key);
+ this.removeItem(item);
+ this._size--;
+ return item.value;
+ }
+ shift() {
+ if (!this._head && !this._tail) {
+ return undefined;
+ }
+ if (!this._head || !this._tail) {
+ throw new Error('Invalid list');
+ }
+ const item = this._head;
+ this._map.delete(item.key);
+ this.removeItem(item);
+ this._size--;
+ return item.value;
+ }
+ forEach(callbackfn, thisArg) {
+ const state = this._state;
+ let current = this._head;
+ while (current) {
+ if (thisArg) {
+ callbackfn.bind(thisArg)(current.value, current.key, this);
+ }
+ else {
+ callbackfn(current.value, current.key, this);
+ }
+ if (this._state !== state) {
+ throw new Error(`LinkedMap got modified during iteration.`);
+ }
+ current = current.next;
+ }
+ }
+ keys() {
+ const map = this;
+ const state = this._state;
+ let current = this._head;
+ const iterator = {
+ [Symbol.iterator]() {
+ return iterator;
+ },
+ next() {
+ if (map._state !== state) {
+ throw new Error(`LinkedMap got modified during iteration.`);
+ }
+ if (current) {
+ const result = { value: current.key, done: false };
+ current = current.next;
+ return result;
+ }
+ else {
+ return { value: undefined, done: true };
+ }
+ }
+ };
+ return iterator;
+ }
+ values() {
+ const map = this;
+ const state = this._state;
+ let current = this._head;
+ const iterator = {
+ [Symbol.iterator]() {
+ return iterator;
+ },
+ next() {
+ if (map._state !== state) {
+ throw new Error(`LinkedMap got modified during iteration.`);
+ }
+ if (current) {
+ const result = { value: current.value, done: false };
+ current = current.next;
+ return result;
+ }
+ else {
+ return { value: undefined, done: true };
+ }
+ }
+ };
+ return iterator;
+ }
+ entries() {
+ const map = this;
+ const state = this._state;
+ let current = this._head;
+ const iterator = {
+ [Symbol.iterator]() {
+ return iterator;
+ },
+ next() {
+ if (map._state !== state) {
+ throw new Error(`LinkedMap got modified during iteration.`);
+ }
+ if (current) {
+ const result = { value: [current.key, current.value], done: false };
+ current = current.next;
+ return result;
+ }
+ else {
+ return { value: undefined, done: true };
+ }
+ }
+ };
+ return iterator;
+ }
+ [(_b = Symbol.toStringTag, Symbol.iterator)]() {
+ return this.entries();
+ }
+ trimOld(newSize) {
+ if (newSize >= this.size) {
+ return;
+ }
+ if (newSize === 0) {
+ this.clear();
+ return;
+ }
+ let current = this._head;
+ let currentSize = this.size;
+ while (current && currentSize > newSize) {
+ this._map.delete(current.key);
+ current = current.next;
+ currentSize--;
+ }
+ this._head = current;
+ this._size = currentSize;
+ if (current) {
+ current.previous = undefined;
+ }
+ this._state++;
+ }
+ addItemFirst(item) {
+ // First time Insert
+ if (!this._head && !this._tail) {
+ this._tail = item;
+ }
+ else if (!this._head) {
+ throw new Error('Invalid list');
+ }
+ else {
+ item.next = this._head;
+ this._head.previous = item;
+ }
+ this._head = item;
+ this._state++;
+ }
+ addItemLast(item) {
+ // First time Insert
+ if (!this._head && !this._tail) {
+ this._head = item;
+ }
+ else if (!this._tail) {
+ throw new Error('Invalid list');
+ }
+ else {
+ item.previous = this._tail;
+ this._tail.next = item;
+ }
+ this._tail = item;
+ this._state++;
+ }
+ removeItem(item) {
+ if (item === this._head && item === this._tail) {
+ this._head = undefined;
+ this._tail = undefined;
+ }
+ else if (item === this._head) {
+ // This can only happen if size === 1 which is handled
+ // by the case above.
+ if (!item.next) {
+ throw new Error('Invalid list');
+ }
+ item.next.previous = undefined;
+ this._head = item.next;
+ }
+ else if (item === this._tail) {
+ // This can only happen if size === 1 which is handled
+ // by the case above.
+ if (!item.previous) {
+ throw new Error('Invalid list');
+ }
+ item.previous.next = undefined;
+ this._tail = item.previous;
+ }
+ else {
+ const next = item.next;
+ const previous = item.previous;
+ if (!next || !previous) {
+ throw new Error('Invalid list');
+ }
+ next.previous = previous;
+ previous.next = next;
+ }
+ item.next = undefined;
+ item.previous = undefined;
+ this._state++;
+ }
+ touch(item, touch) {
+ if (!this._head || !this._tail) {
+ throw new Error('Invalid list');
+ }
+ if ((touch !== 1 /* Touch.AsOld */ && touch !== 2 /* Touch.AsNew */)) {
+ return;
+ }
+ if (touch === 1 /* Touch.AsOld */) {
+ if (item === this._head) {
+ return;
+ }
+ const next = item.next;
+ const previous = item.previous;
+ // Unlink the item
+ if (item === this._tail) {
+ // previous must be defined since item was not head but is tail
+ // So there are more than on item in the map
+ previous.next = undefined;
+ this._tail = previous;
+ }
+ else {
+ // Both next and previous are not undefined since item was neither head nor tail.
+ next.previous = previous;
+ previous.next = next;
+ }
+ // Insert the node at head
+ item.previous = undefined;
+ item.next = this._head;
+ this._head.previous = item;
+ this._head = item;
+ this._state++;
+ }
+ else if (touch === 2 /* Touch.AsNew */) {
+ if (item === this._tail) {
+ return;
+ }
+ const next = item.next;
+ const previous = item.previous;
+ // Unlink the item.
+ if (item === this._head) {
+ // next must be defined since item was not tail but is head
+ // So there are more than on item in the map
+ next.previous = undefined;
+ this._head = next;
+ }
+ else {
+ // Both next and previous are not undefined since item was neither head nor tail.
+ next.previous = previous;
+ previous.next = next;
+ }
+ item.next = undefined;
+ item.previous = this._tail;
+ this._tail.next = item;
+ this._tail = item;
+ this._state++;
+ }
+ }
+ toJSON() {
+ const data = [];
+ this.forEach((value, key) => {
+ data.push([key, value]);
+ });
+ return data;
+ }
+ fromJSON(data) {
+ this.clear();
+ for (const [key, value] of data) {
+ this.set(key, value);
+ }
+ }
+}
+class LRUCache extends LinkedMap {
+ constructor(limit, ratio = 1) {
+ super();
+ this._limit = limit;
+ this._ratio = Math.min(Math.max(0, ratio), 1);
+ }
+ get limit() {
+ return this._limit;
+ }
+ set limit(limit) {
+ this._limit = limit;
+ this.checkTrim();
+ }
+ get(key, touch = 2 /* Touch.AsNew */) {
+ return super.get(key, touch);
+ }
+ peek(key) {
+ return super.get(key, 0 /* Touch.None */);
+ }
+ set(key, value) {
+ super.set(key, value, 2 /* Touch.AsNew */);
+ this.checkTrim();
+ return this;
+ }
+ checkTrim() {
+ if (this.size > this._limit) {
+ this.trimOld(Math.round(this._limit * this._ratio));
+ }
+ }
+}
+/**
+ * A map that allows access both by keys and values.
+ * **NOTE**: values need to be unique.
+ */
+class BidirectionalMap {
+ constructor(entries) {
+ this._m1 = new Map();
+ this._m2 = new Map();
+ if (entries) {
+ for (const [key, value] of entries) {
+ this.set(key, value);
+ }
+ }
+ }
+ clear() {
+ this._m1.clear();
+ this._m2.clear();
+ }
+ set(key, value) {
+ this._m1.set(key, value);
+ this._m2.set(value, key);
+ }
+ get(key) {
+ return this._m1.get(key);
+ }
+ getKey(value) {
+ return this._m2.get(value);
+ }
+ delete(key) {
+ const value = this._m1.get(key);
+ if (value === undefined) {
+ return false;
+ }
+ this._m1.delete(key);
+ this._m2.delete(value);
+ return true;
+ }
+ keys() {
+ return this._m1.keys();
+ }
+ values() {
+ return this._m1.values();
+ }
+}
+class SetMap {
+ constructor() {
+ this.map = new Map();
+ }
+ add(key, value) {
+ let values = this.map.get(key);
+ if (!values) {
+ values = new Set();
+ this.map.set(key, values);
+ }
+ values.add(value);
+ }
+ delete(key, value) {
+ const values = this.map.get(key);
+ if (!values) {
+ return;
+ }
+ values.delete(value);
+ if (values.size === 0) {
+ this.map.delete(key);
+ }
+ }
+ forEach(key, fn) {
+ const values = this.map.get(key);
+ if (!values) {
+ return;
+ }
+ values.forEach(fn);
+ }
+ get(key) {
+ const values = this.map.get(key);
+ if (!values) {
+ return new Set();
+ }
+ return values;
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/objects.js":
+/*!******************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/objects.js ***!
+ \******************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ cloneAndChange: () => (/* binding */ cloneAndChange),
+/* harmony export */ createProxyObject: () => (/* binding */ createProxyObject),
+/* harmony export */ deepClone: () => (/* binding */ deepClone),
+/* harmony export */ deepFreeze: () => (/* binding */ deepFreeze),
+/* harmony export */ equals: () => (/* binding */ equals),
+/* harmony export */ getAllMethodNames: () => (/* binding */ getAllMethodNames),
+/* harmony export */ getAllPropertyNames: () => (/* binding */ getAllPropertyNames),
+/* harmony export */ mixin: () => (/* binding */ mixin)
+/* harmony export */ });
+/* harmony import */ var _types_js__WEBPACK_IMPORTED_MODULE_0__ = __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.
+ *--------------------------------------------------------------------------------------------*/
+
+function deepClone(obj) {
+ if (!obj || typeof obj !== 'object') {
+ return obj;
+ }
+ if (obj instanceof RegExp) {
+ return obj;
+ }
+ const result = Array.isArray(obj) ? [] : {};
+ Object.entries(obj).forEach(([key, value]) => {
+ result[key] = value && typeof value === 'object' ? deepClone(value) : value;
+ });
+ return result;
+}
+function deepFreeze(obj) {
+ if (!obj || typeof obj !== 'object') {
+ return obj;
+ }
+ const stack = [obj];
+ while (stack.length > 0) {
+ const obj = stack.shift();
+ Object.freeze(obj);
+ for (const key in obj) {
+ if (_hasOwnProperty.call(obj, key)) {
+ const prop = obj[key];
+ if (typeof prop === 'object' && !Object.isFrozen(prop) && !(0,_types_js__WEBPACK_IMPORTED_MODULE_0__.isTypedArray)(prop)) {
+ stack.push(prop);
+ }
+ }
+ }
+ }
+ return obj;
+}
+const _hasOwnProperty = Object.prototype.hasOwnProperty;
+function cloneAndChange(obj, changer) {
+ return _cloneAndChange(obj, changer, new Set());
+}
+function _cloneAndChange(obj, changer, seen) {
+ if ((0,_types_js__WEBPACK_IMPORTED_MODULE_0__.isUndefinedOrNull)(obj)) {
+ return obj;
+ }
+ const changed = changer(obj);
+ if (typeof changed !== 'undefined') {
+ return changed;
+ }
+ if (Array.isArray(obj)) {
+ const r1 = [];
+ for (const e of obj) {
+ r1.push(_cloneAndChange(e, changer, seen));
+ }
+ return r1;
+ }
+ if ((0,_types_js__WEBPACK_IMPORTED_MODULE_0__.isObject)(obj)) {
+ if (seen.has(obj)) {
+ throw new Error('Cannot clone recursive data-structure');
+ }
+ seen.add(obj);
+ const r2 = {};
+ for (const i2 in obj) {
+ if (_hasOwnProperty.call(obj, i2)) {
+ r2[i2] = _cloneAndChange(obj[i2], changer, seen);
+ }
+ }
+ seen.delete(obj);
+ return r2;
+ }
+ return obj;
+}
+/**
+ * Copies all properties of source into destination. The optional parameter "overwrite" allows to control
+ * if existing properties on the destination should be overwritten or not. Defaults to true (overwrite).
+ */
+function mixin(destination, source, overwrite = true) {
+ if (!(0,_types_js__WEBPACK_IMPORTED_MODULE_0__.isObject)(destination)) {
+ return source;
+ }
+ if ((0,_types_js__WEBPACK_IMPORTED_MODULE_0__.isObject)(source)) {
+ Object.keys(source).forEach(key => {
+ if (key in destination) {
+ if (overwrite) {
+ if ((0,_types_js__WEBPACK_IMPORTED_MODULE_0__.isObject)(destination[key]) && (0,_types_js__WEBPACK_IMPORTED_MODULE_0__.isObject)(source[key])) {
+ mixin(destination[key], source[key], overwrite);
+ }
+ else {
+ destination[key] = source[key];
+ }
+ }
+ }
+ else {
+ destination[key] = source[key];
+ }
+ });
+ }
+ return destination;
+}
+function equals(one, other) {
+ if (one === other) {
+ return true;
+ }
+ if (one === null || one === undefined || other === null || other === undefined) {
+ return false;
+ }
+ if (typeof one !== typeof other) {
+ return false;
+ }
+ if (typeof one !== 'object') {
+ return false;
+ }
+ if ((Array.isArray(one)) !== (Array.isArray(other))) {
+ return false;
+ }
+ let i;
+ let key;
+ if (Array.isArray(one)) {
+ if (one.length !== other.length) {
+ return false;
+ }
+ for (i = 0; i < one.length; i++) {
+ if (!equals(one[i], other[i])) {
+ return false;
+ }
+ }
+ }
+ else {
+ const oneKeys = [];
+ for (key in one) {
+ oneKeys.push(key);
+ }
+ oneKeys.sort();
+ const otherKeys = [];
+ for (key in other) {
+ otherKeys.push(key);
+ }
+ otherKeys.sort();
+ if (!equals(oneKeys, otherKeys)) {
+ return false;
+ }
+ for (i = 0; i < oneKeys.length; i++) {
+ if (!equals(one[oneKeys[i]], other[oneKeys[i]])) {
+ return false;
+ }
+ }
+ }
+ return true;
+}
+function getAllPropertyNames(obj) {
+ let res = [];
+ while (Object.prototype !== obj) {
+ res = res.concat(Object.getOwnPropertyNames(obj));
+ obj = Object.getPrototypeOf(obj);
+ }
+ return res;
+}
+function getAllMethodNames(obj) {
+ const methods = [];
+ for (const prop of getAllPropertyNames(obj)) {
+ if (typeof obj[prop] === 'function') {
+ methods.push(prop);
+ }
+ }
+ return methods;
+}
+function createProxyObject(methodNames, invoke) {
+ const createProxyMethod = (method) => {
+ return function () {
+ const args = Array.prototype.slice.call(arguments, 0);
+ return invoke(method, args);
+ };
+ };
+ const result = {};
+ for (const methodName of methodNames) {
+ result[methodName] = createProxyMethod(methodName);
+ }
+ return result;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/path.js":
+/*!***************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/path.js ***!
+ \***************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ basename: () => (/* binding */ basename),
+/* harmony export */ dirname: () => (/* binding */ dirname),
+/* harmony export */ extname: () => (/* binding */ extname),
+/* harmony export */ normalize: () => (/* binding */ normalize),
+/* harmony export */ posix: () => (/* binding */ posix),
+/* harmony export */ relative: () => (/* binding */ relative),
+/* harmony export */ resolve: () => (/* binding */ resolve),
+/* harmony export */ sep: () => (/* binding */ sep),
+/* harmony export */ win32: () => (/* binding */ win32)
+/* harmony export */ });
+/* harmony import */ var _process_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./process.js */ "./node_modules/monaco-editor/esm/vs/base/common/process.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+// NOTE: VSCode's copy of nodejs path library to be usable in common (non-node) namespace
+// Copied from: https://github.com/nodejs/node/blob/v16.14.2/lib/path.js
+/**
+ * Copyright Joyent, Inc. and other Node contributors.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the
+ * "Software"), to deal in the Software without restriction, including
+ * without limitation the rights to use, copy, modify, merge, publish,
+ * distribute, sublicense, and/or sell copies of the Software, and to permit
+ * persons to whom the Software is furnished to do so, subject to the
+ * following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included
+ * in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+ * NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+ * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+ * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+ * USE OR OTHER DEALINGS IN THE SOFTWARE.
+ */
+
+const CHAR_UPPERCASE_A = 65; /* A */
+const CHAR_LOWERCASE_A = 97; /* a */
+const CHAR_UPPERCASE_Z = 90; /* Z */
+const CHAR_LOWERCASE_Z = 122; /* z */
+const CHAR_DOT = 46; /* . */
+const CHAR_FORWARD_SLASH = 47; /* / */
+const CHAR_BACKWARD_SLASH = 92; /* \ */
+const CHAR_COLON = 58; /* : */
+const CHAR_QUESTION_MARK = 63; /* ? */
+class ErrorInvalidArgType extends Error {
+ constructor(name, expected, actual) {
+ // determiner: 'must be' or 'must not be'
+ let determiner;
+ if (typeof expected === 'string' && expected.indexOf('not ') === 0) {
+ determiner = 'must not be';
+ expected = expected.replace(/^not /, '');
+ }
+ else {
+ determiner = 'must be';
+ }
+ const type = name.indexOf('.') !== -1 ? 'property' : 'argument';
+ let msg = `The "${name}" ${type} ${determiner} of type ${expected}`;
+ msg += `. Received type ${typeof actual}`;
+ super(msg);
+ this.code = 'ERR_INVALID_ARG_TYPE';
+ }
+}
+function validateObject(pathObject, name) {
+ if (pathObject === null || typeof pathObject !== 'object') {
+ throw new ErrorInvalidArgType(name, 'Object', pathObject);
+ }
+}
+function validateString(value, name) {
+ if (typeof value !== 'string') {
+ throw new ErrorInvalidArgType(name, 'string', value);
+ }
+}
+const platformIsWin32 = (_process_js__WEBPACK_IMPORTED_MODULE_0__.platform === 'win32');
+function isPathSeparator(code) {
+ return code === CHAR_FORWARD_SLASH || code === CHAR_BACKWARD_SLASH;
+}
+function isPosixPathSeparator(code) {
+ return code === CHAR_FORWARD_SLASH;
+}
+function isWindowsDeviceRoot(code) {
+ return (code >= CHAR_UPPERCASE_A && code <= CHAR_UPPERCASE_Z) ||
+ (code >= CHAR_LOWERCASE_A && code <= CHAR_LOWERCASE_Z);
+}
+// Resolves . and .. elements in a path with directory names
+function normalizeString(path, allowAboveRoot, separator, isPathSeparator) {
+ let res = '';
+ let lastSegmentLength = 0;
+ let lastSlash = -1;
+ let dots = 0;
+ let code = 0;
+ for (let i = 0; i <= path.length; ++i) {
+ if (i < path.length) {
+ code = path.charCodeAt(i);
+ }
+ else if (isPathSeparator(code)) {
+ break;
+ }
+ else {
+ code = CHAR_FORWARD_SLASH;
+ }
+ if (isPathSeparator(code)) {
+ if (lastSlash === i - 1 || dots === 1) {
+ // NOOP
+ }
+ else if (dots === 2) {
+ if (res.length < 2 || lastSegmentLength !== 2 ||
+ res.charCodeAt(res.length - 1) !== CHAR_DOT ||
+ res.charCodeAt(res.length - 2) !== CHAR_DOT) {
+ if (res.length > 2) {
+ const lastSlashIndex = res.lastIndexOf(separator);
+ if (lastSlashIndex === -1) {
+ res = '';
+ lastSegmentLength = 0;
+ }
+ else {
+ res = res.slice(0, lastSlashIndex);
+ lastSegmentLength = res.length - 1 - res.lastIndexOf(separator);
+ }
+ lastSlash = i;
+ dots = 0;
+ continue;
+ }
+ else if (res.length !== 0) {
+ res = '';
+ lastSegmentLength = 0;
+ lastSlash = i;
+ dots = 0;
+ continue;
+ }
+ }
+ if (allowAboveRoot) {
+ res += res.length > 0 ? `${separator}..` : '..';
+ lastSegmentLength = 2;
+ }
+ }
+ else {
+ if (res.length > 0) {
+ res += `${separator}${path.slice(lastSlash + 1, i)}`;
+ }
+ else {
+ res = path.slice(lastSlash + 1, i);
+ }
+ lastSegmentLength = i - lastSlash - 1;
+ }
+ lastSlash = i;
+ dots = 0;
+ }
+ else if (code === CHAR_DOT && dots !== -1) {
+ ++dots;
+ }
+ else {
+ dots = -1;
+ }
+ }
+ return res;
+}
+function _format(sep, pathObject) {
+ validateObject(pathObject, 'pathObject');
+ const dir = pathObject.dir || pathObject.root;
+ const base = pathObject.base ||
+ `${pathObject.name || ''}${pathObject.ext || ''}`;
+ if (!dir) {
+ return base;
+ }
+ return dir === pathObject.root ? `${dir}${base}` : `${dir}${sep}${base}`;
+}
+const win32 = {
+ // path.resolve([from ...], to)
+ resolve(...pathSegments) {
+ let resolvedDevice = '';
+ let resolvedTail = '';
+ let resolvedAbsolute = false;
+ for (let i = pathSegments.length - 1; i >= -1; i--) {
+ let path;
+ if (i >= 0) {
+ path = pathSegments[i];
+ validateString(path, 'path');
+ // Skip empty entries
+ if (path.length === 0) {
+ continue;
+ }
+ }
+ else if (resolvedDevice.length === 0) {
+ path = _process_js__WEBPACK_IMPORTED_MODULE_0__.cwd();
+ }
+ else {
+ // Windows has the concept of drive-specific current working
+ // directories. If we've resolved a drive letter but not yet an
+ // absolute path, get cwd for that drive, or the process cwd if
+ // the drive cwd is not available. We're sure the device is not
+ // a UNC path at this points, because UNC paths are always absolute.
+ path = _process_js__WEBPACK_IMPORTED_MODULE_0__.env[`=${resolvedDevice}`] || _process_js__WEBPACK_IMPORTED_MODULE_0__.cwd();
+ // Verify that a cwd was found and that it actually points
+ // to our drive. If not, default to the drive's root.
+ if (path === undefined ||
+ (path.slice(0, 2).toLowerCase() !== resolvedDevice.toLowerCase() &&
+ path.charCodeAt(2) === CHAR_BACKWARD_SLASH)) {
+ path = `${resolvedDevice}\\`;
+ }
+ }
+ const len = path.length;
+ let rootEnd = 0;
+ let device = '';
+ let isAbsolute = false;
+ const code = path.charCodeAt(0);
+ // Try to match a root
+ if (len === 1) {
+ if (isPathSeparator(code)) {
+ // `path` contains just a path separator
+ rootEnd = 1;
+ isAbsolute = true;
+ }
+ }
+ else if (isPathSeparator(code)) {
+ // Possible UNC root
+ // If we started with a separator, we know we at least have an
+ // absolute path of some kind (UNC or otherwise)
+ isAbsolute = true;
+ if (isPathSeparator(path.charCodeAt(1))) {
+ // Matched double path separator at beginning
+ let j = 2;
+ let last = j;
+ // Match 1 or more non-path separators
+ while (j < len && !isPathSeparator(path.charCodeAt(j))) {
+ j++;
+ }
+ if (j < len && j !== last) {
+ const firstPart = path.slice(last, j);
+ // Matched!
+ last = j;
+ // Match 1 or more path separators
+ while (j < len && isPathSeparator(path.charCodeAt(j))) {
+ j++;
+ }
+ if (j < len && j !== last) {
+ // Matched!
+ last = j;
+ // Match 1 or more non-path separators
+ while (j < len && !isPathSeparator(path.charCodeAt(j))) {
+ j++;
+ }
+ if (j === len || j !== last) {
+ // We matched a UNC root
+ device = `\\\\${firstPart}\\${path.slice(last, j)}`;
+ rootEnd = j;
+ }
+ }
+ }
+ }
+ else {
+ rootEnd = 1;
+ }
+ }
+ else if (isWindowsDeviceRoot(code) &&
+ path.charCodeAt(1) === CHAR_COLON) {
+ // Possible device root
+ device = path.slice(0, 2);
+ rootEnd = 2;
+ if (len > 2 && isPathSeparator(path.charCodeAt(2))) {
+ // Treat separator following drive name as an absolute path
+ // indicator
+ isAbsolute = true;
+ rootEnd = 3;
+ }
+ }
+ if (device.length > 0) {
+ if (resolvedDevice.length > 0) {
+ if (device.toLowerCase() !== resolvedDevice.toLowerCase()) {
+ // This path points to another device so it is not applicable
+ continue;
+ }
+ }
+ else {
+ resolvedDevice = device;
+ }
+ }
+ if (resolvedAbsolute) {
+ if (resolvedDevice.length > 0) {
+ break;
+ }
+ }
+ else {
+ resolvedTail = `${path.slice(rootEnd)}\\${resolvedTail}`;
+ resolvedAbsolute = isAbsolute;
+ if (isAbsolute && resolvedDevice.length > 0) {
+ break;
+ }
+ }
+ }
+ // At this point the path should be resolved to a full absolute path,
+ // but handle relative paths to be safe (might happen when process.cwd()
+ // fails)
+ // Normalize the tail path
+ resolvedTail = normalizeString(resolvedTail, !resolvedAbsolute, '\\', isPathSeparator);
+ return resolvedAbsolute ?
+ `${resolvedDevice}\\${resolvedTail}` :
+ `${resolvedDevice}${resolvedTail}` || '.';
+ },
+ normalize(path) {
+ validateString(path, 'path');
+ const len = path.length;
+ if (len === 0) {
+ return '.';
+ }
+ let rootEnd = 0;
+ let device;
+ let isAbsolute = false;
+ const code = path.charCodeAt(0);
+ // Try to match a root
+ if (len === 1) {
+ // `path` contains just a single char, exit early to avoid
+ // unnecessary work
+ return isPosixPathSeparator(code) ? '\\' : path;
+ }
+ if (isPathSeparator(code)) {
+ // Possible UNC root
+ // If we started with a separator, we know we at least have an absolute
+ // path of some kind (UNC or otherwise)
+ isAbsolute = true;
+ if (isPathSeparator(path.charCodeAt(1))) {
+ // Matched double path separator at beginning
+ let j = 2;
+ let last = j;
+ // Match 1 or more non-path separators
+ while (j < len && !isPathSeparator(path.charCodeAt(j))) {
+ j++;
+ }
+ if (j < len && j !== last) {
+ const firstPart = path.slice(last, j);
+ // Matched!
+ last = j;
+ // Match 1 or more path separators
+ while (j < len && isPathSeparator(path.charCodeAt(j))) {
+ j++;
+ }
+ if (j < len && j !== last) {
+ // Matched!
+ last = j;
+ // Match 1 or more non-path separators
+ while (j < len && !isPathSeparator(path.charCodeAt(j))) {
+ j++;
+ }
+ if (j === len) {
+ // We matched a UNC root only
+ // Return the normalized version of the UNC root since there
+ // is nothing left to process
+ return `\\\\${firstPart}\\${path.slice(last)}\\`;
+ }
+ if (j !== last) {
+ // We matched a UNC root with leftovers
+ device = `\\\\${firstPart}\\${path.slice(last, j)}`;
+ rootEnd = j;
+ }
+ }
+ }
+ }
+ else {
+ rootEnd = 1;
+ }
+ }
+ else if (isWindowsDeviceRoot(code) && path.charCodeAt(1) === CHAR_COLON) {
+ // Possible device root
+ device = path.slice(0, 2);
+ rootEnd = 2;
+ if (len > 2 && isPathSeparator(path.charCodeAt(2))) {
+ // Treat separator following drive name as an absolute path
+ // indicator
+ isAbsolute = true;
+ rootEnd = 3;
+ }
+ }
+ let tail = rootEnd < len ?
+ normalizeString(path.slice(rootEnd), !isAbsolute, '\\', isPathSeparator) :
+ '';
+ if (tail.length === 0 && !isAbsolute) {
+ tail = '.';
+ }
+ if (tail.length > 0 && isPathSeparator(path.charCodeAt(len - 1))) {
+ tail += '\\';
+ }
+ if (device === undefined) {
+ return isAbsolute ? `\\${tail}` : tail;
+ }
+ return isAbsolute ? `${device}\\${tail}` : `${device}${tail}`;
+ },
+ isAbsolute(path) {
+ validateString(path, 'path');
+ const len = path.length;
+ if (len === 0) {
+ return false;
+ }
+ const code = path.charCodeAt(0);
+ return isPathSeparator(code) ||
+ // Possible device root
+ (len > 2 &&
+ isWindowsDeviceRoot(code) &&
+ path.charCodeAt(1) === CHAR_COLON &&
+ isPathSeparator(path.charCodeAt(2)));
+ },
+ join(...paths) {
+ if (paths.length === 0) {
+ return '.';
+ }
+ let joined;
+ let firstPart;
+ for (let i = 0; i < paths.length; ++i) {
+ const arg = paths[i];
+ validateString(arg, 'path');
+ if (arg.length > 0) {
+ if (joined === undefined) {
+ joined = firstPart = arg;
+ }
+ else {
+ joined += `\\${arg}`;
+ }
+ }
+ }
+ if (joined === undefined) {
+ return '.';
+ }
+ // Make sure that the joined path doesn't start with two slashes, because
+ // normalize() will mistake it for a UNC path then.
+ //
+ // This step is skipped when it is very clear that the user actually
+ // intended to point at a UNC path. This is assumed when the first
+ // non-empty string arguments starts with exactly two slashes followed by
+ // at least one more non-slash character.
+ //
+ // Note that for normalize() to treat a path as a UNC path it needs to
+ // have at least 2 components, so we don't filter for that here.
+ // This means that the user can use join to construct UNC paths from
+ // a server name and a share name; for example:
+ // path.join('//server', 'share') -> '\\\\server\\share\\')
+ let needsReplace = true;
+ let slashCount = 0;
+ if (typeof firstPart === 'string' && isPathSeparator(firstPart.charCodeAt(0))) {
+ ++slashCount;
+ const firstLen = firstPart.length;
+ if (firstLen > 1 && isPathSeparator(firstPart.charCodeAt(1))) {
+ ++slashCount;
+ if (firstLen > 2) {
+ if (isPathSeparator(firstPart.charCodeAt(2))) {
+ ++slashCount;
+ }
+ else {
+ // We matched a UNC path in the first part
+ needsReplace = false;
+ }
+ }
+ }
+ }
+ if (needsReplace) {
+ // Find any more consecutive slashes we need to replace
+ while (slashCount < joined.length &&
+ isPathSeparator(joined.charCodeAt(slashCount))) {
+ slashCount++;
+ }
+ // Replace the slashes if needed
+ if (slashCount >= 2) {
+ joined = `\\${joined.slice(slashCount)}`;
+ }
+ }
+ return win32.normalize(joined);
+ },
+ // It will solve the relative path from `from` to `to`, for instance:
+ // from = 'C:\\orandea\\test\\aaa'
+ // to = 'C:\\orandea\\impl\\bbb'
+ // The output of the function should be: '..\\..\\impl\\bbb'
+ relative(from, to) {
+ validateString(from, 'from');
+ validateString(to, 'to');
+ if (from === to) {
+ return '';
+ }
+ const fromOrig = win32.resolve(from);
+ const toOrig = win32.resolve(to);
+ if (fromOrig === toOrig) {
+ return '';
+ }
+ from = fromOrig.toLowerCase();
+ to = toOrig.toLowerCase();
+ if (from === to) {
+ return '';
+ }
+ // Trim any leading backslashes
+ let fromStart = 0;
+ while (fromStart < from.length &&
+ from.charCodeAt(fromStart) === CHAR_BACKWARD_SLASH) {
+ fromStart++;
+ }
+ // Trim trailing backslashes (applicable to UNC paths only)
+ let fromEnd = from.length;
+ while (fromEnd - 1 > fromStart &&
+ from.charCodeAt(fromEnd - 1) === CHAR_BACKWARD_SLASH) {
+ fromEnd--;
+ }
+ const fromLen = fromEnd - fromStart;
+ // Trim any leading backslashes
+ let toStart = 0;
+ while (toStart < to.length &&
+ to.charCodeAt(toStart) === CHAR_BACKWARD_SLASH) {
+ toStart++;
+ }
+ // Trim trailing backslashes (applicable to UNC paths only)
+ let toEnd = to.length;
+ while (toEnd - 1 > toStart &&
+ to.charCodeAt(toEnd - 1) === CHAR_BACKWARD_SLASH) {
+ toEnd--;
+ }
+ const toLen = toEnd - toStart;
+ // Compare paths to find the longest common path from root
+ const length = fromLen < toLen ? fromLen : toLen;
+ let lastCommonSep = -1;
+ let i = 0;
+ for (; i < length; i++) {
+ const fromCode = from.charCodeAt(fromStart + i);
+ if (fromCode !== to.charCodeAt(toStart + i)) {
+ break;
+ }
+ else if (fromCode === CHAR_BACKWARD_SLASH) {
+ lastCommonSep = i;
+ }
+ }
+ // We found a mismatch before the first common path separator was seen, so
+ // return the original `to`.
+ if (i !== length) {
+ if (lastCommonSep === -1) {
+ return toOrig;
+ }
+ }
+ else {
+ if (toLen > length) {
+ if (to.charCodeAt(toStart + i) === CHAR_BACKWARD_SLASH) {
+ // We get here if `from` is the exact base path for `to`.
+ // For example: from='C:\\foo\\bar'; to='C:\\foo\\bar\\baz'
+ return toOrig.slice(toStart + i + 1);
+ }
+ if (i === 2) {
+ // We get here if `from` is the device root.
+ // For example: from='C:\\'; to='C:\\foo'
+ return toOrig.slice(toStart + i);
+ }
+ }
+ if (fromLen > length) {
+ if (from.charCodeAt(fromStart + i) === CHAR_BACKWARD_SLASH) {
+ // We get here if `to` is the exact base path for `from`.
+ // For example: from='C:\\foo\\bar'; to='C:\\foo'
+ lastCommonSep = i;
+ }
+ else if (i === 2) {
+ // We get here if `to` is the device root.
+ // For example: from='C:\\foo\\bar'; to='C:\\'
+ lastCommonSep = 3;
+ }
+ }
+ if (lastCommonSep === -1) {
+ lastCommonSep = 0;
+ }
+ }
+ let out = '';
+ // Generate the relative path based on the path difference between `to` and
+ // `from`
+ for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {
+ if (i === fromEnd || from.charCodeAt(i) === CHAR_BACKWARD_SLASH) {
+ out += out.length === 0 ? '..' : '\\..';
+ }
+ }
+ toStart += lastCommonSep;
+ // Lastly, append the rest of the destination (`to`) path that comes after
+ // the common path parts
+ if (out.length > 0) {
+ return `${out}${toOrig.slice(toStart, toEnd)}`;
+ }
+ if (toOrig.charCodeAt(toStart) === CHAR_BACKWARD_SLASH) {
+ ++toStart;
+ }
+ return toOrig.slice(toStart, toEnd);
+ },
+ toNamespacedPath(path) {
+ // Note: this will *probably* throw somewhere.
+ if (typeof path !== 'string' || path.length === 0) {
+ return path;
+ }
+ const resolvedPath = win32.resolve(path);
+ if (resolvedPath.length <= 2) {
+ return path;
+ }
+ if (resolvedPath.charCodeAt(0) === CHAR_BACKWARD_SLASH) {
+ // Possible UNC root
+ if (resolvedPath.charCodeAt(1) === CHAR_BACKWARD_SLASH) {
+ const code = resolvedPath.charCodeAt(2);
+ if (code !== CHAR_QUESTION_MARK && code !== CHAR_DOT) {
+ // Matched non-long UNC root, convert the path to a long UNC path
+ return `\\\\?\\UNC\\${resolvedPath.slice(2)}`;
+ }
+ }
+ }
+ else if (isWindowsDeviceRoot(resolvedPath.charCodeAt(0)) &&
+ resolvedPath.charCodeAt(1) === CHAR_COLON &&
+ resolvedPath.charCodeAt(2) === CHAR_BACKWARD_SLASH) {
+ // Matched device root, convert the path to a long UNC path
+ return `\\\\?\\${resolvedPath}`;
+ }
+ return path;
+ },
+ dirname(path) {
+ validateString(path, 'path');
+ const len = path.length;
+ if (len === 0) {
+ return '.';
+ }
+ let rootEnd = -1;
+ let offset = 0;
+ const code = path.charCodeAt(0);
+ if (len === 1) {
+ // `path` contains just a path separator, exit early to avoid
+ // unnecessary work or a dot.
+ return isPathSeparator(code) ? path : '.';
+ }
+ // Try to match a root
+ if (isPathSeparator(code)) {
+ // Possible UNC root
+ rootEnd = offset = 1;
+ if (isPathSeparator(path.charCodeAt(1))) {
+ // Matched double path separator at beginning
+ let j = 2;
+ let last = j;
+ // Match 1 or more non-path separators
+ while (j < len && !isPathSeparator(path.charCodeAt(j))) {
+ j++;
+ }
+ if (j < len && j !== last) {
+ // Matched!
+ last = j;
+ // Match 1 or more path separators
+ while (j < len && isPathSeparator(path.charCodeAt(j))) {
+ j++;
+ }
+ if (j < len && j !== last) {
+ // Matched!
+ last = j;
+ // Match 1 or more non-path separators
+ while (j < len && !isPathSeparator(path.charCodeAt(j))) {
+ j++;
+ }
+ if (j === len) {
+ // We matched a UNC root only
+ return path;
+ }
+ if (j !== last) {
+ // We matched a UNC root with leftovers
+ // Offset by 1 to include the separator after the UNC root to
+ // treat it as a "normal root" on top of a (UNC) root
+ rootEnd = offset = j + 1;
+ }
+ }
+ }
+ }
+ // Possible device root
+ }
+ else if (isWindowsDeviceRoot(code) && path.charCodeAt(1) === CHAR_COLON) {
+ rootEnd = len > 2 && isPathSeparator(path.charCodeAt(2)) ? 3 : 2;
+ offset = rootEnd;
+ }
+ let end = -1;
+ let matchedSlash = true;
+ for (let i = len - 1; i >= offset; --i) {
+ if (isPathSeparator(path.charCodeAt(i))) {
+ if (!matchedSlash) {
+ end = i;
+ break;
+ }
+ }
+ else {
+ // We saw the first non-path separator
+ matchedSlash = false;
+ }
+ }
+ if (end === -1) {
+ if (rootEnd === -1) {
+ return '.';
+ }
+ end = rootEnd;
+ }
+ return path.slice(0, end);
+ },
+ basename(path, ext) {
+ if (ext !== undefined) {
+ validateString(ext, 'ext');
+ }
+ validateString(path, 'path');
+ let start = 0;
+ let end = -1;
+ let matchedSlash = true;
+ let i;
+ // Check for a drive letter prefix so as not to mistake the following
+ // path separator as an extra separator at the end of the path that can be
+ // disregarded
+ if (path.length >= 2 &&
+ isWindowsDeviceRoot(path.charCodeAt(0)) &&
+ path.charCodeAt(1) === CHAR_COLON) {
+ start = 2;
+ }
+ if (ext !== undefined && ext.length > 0 && ext.length <= path.length) {
+ if (ext === path) {
+ return '';
+ }
+ let extIdx = ext.length - 1;
+ let firstNonSlashEnd = -1;
+ for (i = path.length - 1; i >= start; --i) {
+ const code = path.charCodeAt(i);
+ if (isPathSeparator(code)) {
+ // If we reached a path separator that was not part of a set of path
+ // separators at the end of the string, stop now
+ if (!matchedSlash) {
+ start = i + 1;
+ break;
+ }
+ }
+ else {
+ if (firstNonSlashEnd === -1) {
+ // We saw the first non-path separator, remember this index in case
+ // we need it if the extension ends up not matching
+ matchedSlash = false;
+ firstNonSlashEnd = i + 1;
+ }
+ if (extIdx >= 0) {
+ // Try to match the explicit extension
+ if (code === ext.charCodeAt(extIdx)) {
+ if (--extIdx === -1) {
+ // We matched the extension, so mark this as the end of our path
+ // component
+ end = i;
+ }
+ }
+ else {
+ // Extension does not match, so our result is the entire path
+ // component
+ extIdx = -1;
+ end = firstNonSlashEnd;
+ }
+ }
+ }
+ }
+ if (start === end) {
+ end = firstNonSlashEnd;
+ }
+ else if (end === -1) {
+ end = path.length;
+ }
+ return path.slice(start, end);
+ }
+ for (i = path.length - 1; i >= start; --i) {
+ if (isPathSeparator(path.charCodeAt(i))) {
+ // If we reached a path separator that was not part of a set of path
+ // separators at the end of the string, stop now
+ if (!matchedSlash) {
+ start = i + 1;
+ break;
+ }
+ }
+ else if (end === -1) {
+ // We saw the first non-path separator, mark this as the end of our
+ // path component
+ matchedSlash = false;
+ end = i + 1;
+ }
+ }
+ if (end === -1) {
+ return '';
+ }
+ return path.slice(start, end);
+ },
+ extname(path) {
+ validateString(path, 'path');
+ let start = 0;
+ let startDot = -1;
+ let startPart = 0;
+ let end = -1;
+ let matchedSlash = true;
+ // Track the state of characters (if any) we see before our first dot and
+ // after any path separator we find
+ let preDotState = 0;
+ // Check for a drive letter prefix so as not to mistake the following
+ // path separator as an extra separator at the end of the path that can be
+ // disregarded
+ if (path.length >= 2 &&
+ path.charCodeAt(1) === CHAR_COLON &&
+ isWindowsDeviceRoot(path.charCodeAt(0))) {
+ start = startPart = 2;
+ }
+ for (let i = path.length - 1; i >= start; --i) {
+ const code = path.charCodeAt(i);
+ if (isPathSeparator(code)) {
+ // If we reached a path separator that was not part of a set of path
+ // separators at the end of the string, stop now
+ if (!matchedSlash) {
+ startPart = i + 1;
+ break;
+ }
+ continue;
+ }
+ if (end === -1) {
+ // We saw the first non-path separator, mark this as the end of our
+ // extension
+ matchedSlash = false;
+ end = i + 1;
+ }
+ if (code === CHAR_DOT) {
+ // If this is our first dot, mark it as the start of our extension
+ if (startDot === -1) {
+ startDot = i;
+ }
+ else if (preDotState !== 1) {
+ preDotState = 1;
+ }
+ }
+ else if (startDot !== -1) {
+ // We saw a non-dot and non-path separator before our dot, so we should
+ // have a good chance at having a non-empty extension
+ preDotState = -1;
+ }
+ }
+ if (startDot === -1 ||
+ end === -1 ||
+ // We saw a non-dot character immediately before the dot
+ preDotState === 0 ||
+ // The (right-most) trimmed path component is exactly '..'
+ (preDotState === 1 &&
+ startDot === end - 1 &&
+ startDot === startPart + 1)) {
+ return '';
+ }
+ return path.slice(startDot, end);
+ },
+ format: _format.bind(null, '\\'),
+ parse(path) {
+ validateString(path, 'path');
+ const ret = { root: '', dir: '', base: '', ext: '', name: '' };
+ if (path.length === 0) {
+ return ret;
+ }
+ const len = path.length;
+ let rootEnd = 0;
+ let code = path.charCodeAt(0);
+ if (len === 1) {
+ if (isPathSeparator(code)) {
+ // `path` contains just a path separator, exit early to avoid
+ // unnecessary work
+ ret.root = ret.dir = path;
+ return ret;
+ }
+ ret.base = ret.name = path;
+ return ret;
+ }
+ // Try to match a root
+ if (isPathSeparator(code)) {
+ // Possible UNC root
+ rootEnd = 1;
+ if (isPathSeparator(path.charCodeAt(1))) {
+ // Matched double path separator at beginning
+ let j = 2;
+ let last = j;
+ // Match 1 or more non-path separators
+ while (j < len && !isPathSeparator(path.charCodeAt(j))) {
+ j++;
+ }
+ if (j < len && j !== last) {
+ // Matched!
+ last = j;
+ // Match 1 or more path separators
+ while (j < len && isPathSeparator(path.charCodeAt(j))) {
+ j++;
+ }
+ if (j < len && j !== last) {
+ // Matched!
+ last = j;
+ // Match 1 or more non-path separators
+ while (j < len && !isPathSeparator(path.charCodeAt(j))) {
+ j++;
+ }
+ if (j === len) {
+ // We matched a UNC root only
+ rootEnd = j;
+ }
+ else if (j !== last) {
+ // We matched a UNC root with leftovers
+ rootEnd = j + 1;
+ }
+ }
+ }
+ }
+ }
+ else if (isWindowsDeviceRoot(code) && path.charCodeAt(1) === CHAR_COLON) {
+ // Possible device root
+ if (len <= 2) {
+ // `path` contains just a drive root, exit early to avoid
+ // unnecessary work
+ ret.root = ret.dir = path;
+ return ret;
+ }
+ rootEnd = 2;
+ if (isPathSeparator(path.charCodeAt(2))) {
+ if (len === 3) {
+ // `path` contains just a drive root, exit early to avoid
+ // unnecessary work
+ ret.root = ret.dir = path;
+ return ret;
+ }
+ rootEnd = 3;
+ }
+ }
+ if (rootEnd > 0) {
+ ret.root = path.slice(0, rootEnd);
+ }
+ let startDot = -1;
+ let startPart = rootEnd;
+ let end = -1;
+ let matchedSlash = true;
+ let i = path.length - 1;
+ // Track the state of characters (if any) we see before our first dot and
+ // after any path separator we find
+ let preDotState = 0;
+ // Get non-dir info
+ for (; i >= rootEnd; --i) {
+ code = path.charCodeAt(i);
+ if (isPathSeparator(code)) {
+ // If we reached a path separator that was not part of a set of path
+ // separators at the end of the string, stop now
+ if (!matchedSlash) {
+ startPart = i + 1;
+ break;
+ }
+ continue;
+ }
+ if (end === -1) {
+ // We saw the first non-path separator, mark this as the end of our
+ // extension
+ matchedSlash = false;
+ end = i + 1;
+ }
+ if (code === CHAR_DOT) {
+ // If this is our first dot, mark it as the start of our extension
+ if (startDot === -1) {
+ startDot = i;
+ }
+ else if (preDotState !== 1) {
+ preDotState = 1;
+ }
+ }
+ else if (startDot !== -1) {
+ // We saw a non-dot and non-path separator before our dot, so we should
+ // have a good chance at having a non-empty extension
+ preDotState = -1;
+ }
+ }
+ if (end !== -1) {
+ if (startDot === -1 ||
+ // We saw a non-dot character immediately before the dot
+ preDotState === 0 ||
+ // The (right-most) trimmed path component is exactly '..'
+ (preDotState === 1 &&
+ startDot === end - 1 &&
+ startDot === startPart + 1)) {
+ ret.base = ret.name = path.slice(startPart, end);
+ }
+ else {
+ ret.name = path.slice(startPart, startDot);
+ ret.base = path.slice(startPart, end);
+ ret.ext = path.slice(startDot, end);
+ }
+ }
+ // If the directory is the root, use the entire root as the `dir` including
+ // the trailing slash if any (`C:\abc` -> `C:\`). Otherwise, strip out the
+ // trailing slash (`C:\abc\def` -> `C:\abc`).
+ if (startPart > 0 && startPart !== rootEnd) {
+ ret.dir = path.slice(0, startPart - 1);
+ }
+ else {
+ ret.dir = ret.root;
+ }
+ return ret;
+ },
+ sep: '\\',
+ delimiter: ';',
+ win32: null,
+ posix: null
+};
+const posixCwd = (() => {
+ if (platformIsWin32) {
+ // Converts Windows' backslash path separators to POSIX forward slashes
+ // and truncates any drive indicator
+ const regexp = /\\/g;
+ return () => {
+ const cwd = _process_js__WEBPACK_IMPORTED_MODULE_0__.cwd().replace(regexp, '/');
+ return cwd.slice(cwd.indexOf('/'));
+ };
+ }
+ // We're already on POSIX, no need for any transformations
+ return () => _process_js__WEBPACK_IMPORTED_MODULE_0__.cwd();
+})();
+const posix = {
+ // path.resolve([from ...], to)
+ resolve(...pathSegments) {
+ let resolvedPath = '';
+ let resolvedAbsolute = false;
+ for (let i = pathSegments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
+ const path = i >= 0 ? pathSegments[i] : posixCwd();
+ validateString(path, 'path');
+ // Skip empty entries
+ if (path.length === 0) {
+ continue;
+ }
+ resolvedPath = `${path}/${resolvedPath}`;
+ resolvedAbsolute = path.charCodeAt(0) === CHAR_FORWARD_SLASH;
+ }
+ // At this point the path should be resolved to a full absolute path, but
+ // handle relative paths to be safe (might happen when process.cwd() fails)
+ // Normalize the path
+ resolvedPath = normalizeString(resolvedPath, !resolvedAbsolute, '/', isPosixPathSeparator);
+ if (resolvedAbsolute) {
+ return `/${resolvedPath}`;
+ }
+ return resolvedPath.length > 0 ? resolvedPath : '.';
+ },
+ normalize(path) {
+ validateString(path, 'path');
+ if (path.length === 0) {
+ return '.';
+ }
+ const isAbsolute = path.charCodeAt(0) === CHAR_FORWARD_SLASH;
+ const trailingSeparator = path.charCodeAt(path.length - 1) === CHAR_FORWARD_SLASH;
+ // Normalize the path
+ path = normalizeString(path, !isAbsolute, '/', isPosixPathSeparator);
+ if (path.length === 0) {
+ if (isAbsolute) {
+ return '/';
+ }
+ return trailingSeparator ? './' : '.';
+ }
+ if (trailingSeparator) {
+ path += '/';
+ }
+ return isAbsolute ? `/${path}` : path;
+ },
+ isAbsolute(path) {
+ validateString(path, 'path');
+ return path.length > 0 && path.charCodeAt(0) === CHAR_FORWARD_SLASH;
+ },
+ join(...paths) {
+ if (paths.length === 0) {
+ return '.';
+ }
+ let joined;
+ for (let i = 0; i < paths.length; ++i) {
+ const arg = paths[i];
+ validateString(arg, 'path');
+ if (arg.length > 0) {
+ if (joined === undefined) {
+ joined = arg;
+ }
+ else {
+ joined += `/${arg}`;
+ }
+ }
+ }
+ if (joined === undefined) {
+ return '.';
+ }
+ return posix.normalize(joined);
+ },
+ relative(from, to) {
+ validateString(from, 'from');
+ validateString(to, 'to');
+ if (from === to) {
+ return '';
+ }
+ // Trim leading forward slashes.
+ from = posix.resolve(from);
+ to = posix.resolve(to);
+ if (from === to) {
+ return '';
+ }
+ const fromStart = 1;
+ const fromEnd = from.length;
+ const fromLen = fromEnd - fromStart;
+ const toStart = 1;
+ const toLen = to.length - toStart;
+ // Compare paths to find the longest common path from root
+ const length = (fromLen < toLen ? fromLen : toLen);
+ let lastCommonSep = -1;
+ let i = 0;
+ for (; i < length; i++) {
+ const fromCode = from.charCodeAt(fromStart + i);
+ if (fromCode !== to.charCodeAt(toStart + i)) {
+ break;
+ }
+ else if (fromCode === CHAR_FORWARD_SLASH) {
+ lastCommonSep = i;
+ }
+ }
+ if (i === length) {
+ if (toLen > length) {
+ if (to.charCodeAt(toStart + i) === CHAR_FORWARD_SLASH) {
+ // We get here if `from` is the exact base path for `to`.
+ // For example: from='/foo/bar'; to='/foo/bar/baz'
+ return to.slice(toStart + i + 1);
+ }
+ if (i === 0) {
+ // We get here if `from` is the root
+ // For example: from='/'; to='/foo'
+ return to.slice(toStart + i);
+ }
+ }
+ else if (fromLen > length) {
+ if (from.charCodeAt(fromStart + i) === CHAR_FORWARD_SLASH) {
+ // We get here if `to` is the exact base path for `from`.
+ // For example: from='/foo/bar/baz'; to='/foo/bar'
+ lastCommonSep = i;
+ }
+ else if (i === 0) {
+ // We get here if `to` is the root.
+ // For example: from='/foo/bar'; to='/'
+ lastCommonSep = 0;
+ }
+ }
+ }
+ let out = '';
+ // Generate the relative path based on the path difference between `to`
+ // and `from`.
+ for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {
+ if (i === fromEnd || from.charCodeAt(i) === CHAR_FORWARD_SLASH) {
+ out += out.length === 0 ? '..' : '/..';
+ }
+ }
+ // Lastly, append the rest of the destination (`to`) path that comes after
+ // the common path parts.
+ return `${out}${to.slice(toStart + lastCommonSep)}`;
+ },
+ toNamespacedPath(path) {
+ // Non-op on posix systems
+ return path;
+ },
+ dirname(path) {
+ validateString(path, 'path');
+ if (path.length === 0) {
+ return '.';
+ }
+ const hasRoot = path.charCodeAt(0) === CHAR_FORWARD_SLASH;
+ let end = -1;
+ let matchedSlash = true;
+ for (let i = path.length - 1; i >= 1; --i) {
+ if (path.charCodeAt(i) === CHAR_FORWARD_SLASH) {
+ if (!matchedSlash) {
+ end = i;
+ break;
+ }
+ }
+ else {
+ // We saw the first non-path separator
+ matchedSlash = false;
+ }
+ }
+ if (end === -1) {
+ return hasRoot ? '/' : '.';
+ }
+ if (hasRoot && end === 1) {
+ return '//';
+ }
+ return path.slice(0, end);
+ },
+ basename(path, ext) {
+ if (ext !== undefined) {
+ validateString(ext, 'ext');
+ }
+ validateString(path, 'path');
+ let start = 0;
+ let end = -1;
+ let matchedSlash = true;
+ let i;
+ if (ext !== undefined && ext.length > 0 && ext.length <= path.length) {
+ if (ext === path) {
+ return '';
+ }
+ let extIdx = ext.length - 1;
+ let firstNonSlashEnd = -1;
+ for (i = path.length - 1; i >= 0; --i) {
+ const code = path.charCodeAt(i);
+ if (code === CHAR_FORWARD_SLASH) {
+ // If we reached a path separator that was not part of a set of path
+ // separators at the end of the string, stop now
+ if (!matchedSlash) {
+ start = i + 1;
+ break;
+ }
+ }
+ else {
+ if (firstNonSlashEnd === -1) {
+ // We saw the first non-path separator, remember this index in case
+ // we need it if the extension ends up not matching
+ matchedSlash = false;
+ firstNonSlashEnd = i + 1;
+ }
+ if (extIdx >= 0) {
+ // Try to match the explicit extension
+ if (code === ext.charCodeAt(extIdx)) {
+ if (--extIdx === -1) {
+ // We matched the extension, so mark this as the end of our path
+ // component
+ end = i;
+ }
+ }
+ else {
+ // Extension does not match, so our result is the entire path
+ // component
+ extIdx = -1;
+ end = firstNonSlashEnd;
+ }
+ }
+ }
+ }
+ if (start === end) {
+ end = firstNonSlashEnd;
+ }
+ else if (end === -1) {
+ end = path.length;
+ }
+ return path.slice(start, end);
+ }
+ for (i = path.length - 1; i >= 0; --i) {
+ if (path.charCodeAt(i) === CHAR_FORWARD_SLASH) {
+ // If we reached a path separator that was not part of a set of path
+ // separators at the end of the string, stop now
+ if (!matchedSlash) {
+ start = i + 1;
+ break;
+ }
+ }
+ else if (end === -1) {
+ // We saw the first non-path separator, mark this as the end of our
+ // path component
+ matchedSlash = false;
+ end = i + 1;
+ }
+ }
+ if (end === -1) {
+ return '';
+ }
+ return path.slice(start, end);
+ },
+ extname(path) {
+ validateString(path, 'path');
+ let startDot = -1;
+ let startPart = 0;
+ let end = -1;
+ let matchedSlash = true;
+ // Track the state of characters (if any) we see before our first dot and
+ // after any path separator we find
+ let preDotState = 0;
+ for (let i = path.length - 1; i >= 0; --i) {
+ const code = path.charCodeAt(i);
+ if (code === CHAR_FORWARD_SLASH) {
+ // If we reached a path separator that was not part of a set of path
+ // separators at the end of the string, stop now
+ if (!matchedSlash) {
+ startPart = i + 1;
+ break;
+ }
+ continue;
+ }
+ if (end === -1) {
+ // We saw the first non-path separator, mark this as the end of our
+ // extension
+ matchedSlash = false;
+ end = i + 1;
+ }
+ if (code === CHAR_DOT) {
+ // If this is our first dot, mark it as the start of our extension
+ if (startDot === -1) {
+ startDot = i;
+ }
+ else if (preDotState !== 1) {
+ preDotState = 1;
+ }
+ }
+ else if (startDot !== -1) {
+ // We saw a non-dot and non-path separator before our dot, so we should
+ // have a good chance at having a non-empty extension
+ preDotState = -1;
+ }
+ }
+ if (startDot === -1 ||
+ end === -1 ||
+ // We saw a non-dot character immediately before the dot
+ preDotState === 0 ||
+ // The (right-most) trimmed path component is exactly '..'
+ (preDotState === 1 &&
+ startDot === end - 1 &&
+ startDot === startPart + 1)) {
+ return '';
+ }
+ return path.slice(startDot, end);
+ },
+ format: _format.bind(null, '/'),
+ parse(path) {
+ validateString(path, 'path');
+ const ret = { root: '', dir: '', base: '', ext: '', name: '' };
+ if (path.length === 0) {
+ return ret;
+ }
+ const isAbsolute = path.charCodeAt(0) === CHAR_FORWARD_SLASH;
+ let start;
+ if (isAbsolute) {
+ ret.root = '/';
+ start = 1;
+ }
+ else {
+ start = 0;
+ }
+ let startDot = -1;
+ let startPart = 0;
+ let end = -1;
+ let matchedSlash = true;
+ let i = path.length - 1;
+ // Track the state of characters (if any) we see before our first dot and
+ // after any path separator we find
+ let preDotState = 0;
+ // Get non-dir info
+ for (; i >= start; --i) {
+ const code = path.charCodeAt(i);
+ if (code === CHAR_FORWARD_SLASH) {
+ // If we reached a path separator that was not part of a set of path
+ // separators at the end of the string, stop now
+ if (!matchedSlash) {
+ startPart = i + 1;
+ break;
+ }
+ continue;
+ }
+ if (end === -1) {
+ // We saw the first non-path separator, mark this as the end of our
+ // extension
+ matchedSlash = false;
+ end = i + 1;
+ }
+ if (code === CHAR_DOT) {
+ // If this is our first dot, mark it as the start of our extension
+ if (startDot === -1) {
+ startDot = i;
+ }
+ else if (preDotState !== 1) {
+ preDotState = 1;
+ }
+ }
+ else if (startDot !== -1) {
+ // We saw a non-dot and non-path separator before our dot, so we should
+ // have a good chance at having a non-empty extension
+ preDotState = -1;
+ }
+ }
+ if (end !== -1) {
+ const start = startPart === 0 && isAbsolute ? 1 : startPart;
+ if (startDot === -1 ||
+ // We saw a non-dot character immediately before the dot
+ preDotState === 0 ||
+ // The (right-most) trimmed path component is exactly '..'
+ (preDotState === 1 &&
+ startDot === end - 1 &&
+ startDot === startPart + 1)) {
+ ret.base = ret.name = path.slice(start, end);
+ }
+ else {
+ ret.name = path.slice(start, startDot);
+ ret.base = path.slice(start, end);
+ ret.ext = path.slice(startDot, end);
+ }
+ }
+ if (startPart > 0) {
+ ret.dir = path.slice(0, startPart - 1);
+ }
+ else if (isAbsolute) {
+ ret.dir = '/';
+ }
+ return ret;
+ },
+ sep: '/',
+ delimiter: ':',
+ win32: null,
+ posix: null
+};
+posix.win32 = win32.win32 = win32;
+posix.posix = win32.posix = posix;
+const normalize = (platformIsWin32 ? win32.normalize : posix.normalize);
+const resolve = (platformIsWin32 ? win32.resolve : posix.resolve);
+const relative = (platformIsWin32 ? win32.relative : posix.relative);
+const dirname = (platformIsWin32 ? win32.dirname : posix.dirname);
+const basename = (platformIsWin32 ? win32.basename : posix.basename);
+const extname = (platformIsWin32 ? win32.extname : posix.extname);
+const sep = (platformIsWin32 ? win32.sep : posix.sep);
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/platform.js":
+/*!*******************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/platform.js ***!
+ \*******************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ LANGUAGE_DEFAULT: () => (/* binding */ LANGUAGE_DEFAULT),
+/* harmony export */ OS: () => (/* binding */ OS),
+/* harmony export */ isAndroid: () => (/* binding */ isAndroid),
+/* harmony export */ isChrome: () => (/* binding */ isChrome),
+/* harmony export */ isEdge: () => (/* binding */ isEdge),
+/* harmony export */ isFirefox: () => (/* binding */ isFirefox),
+/* harmony export */ isIOS: () => (/* binding */ isIOS),
+/* harmony export */ isLinux: () => (/* binding */ isLinux),
+/* harmony export */ isLittleEndian: () => (/* binding */ isLittleEndian),
+/* harmony export */ isMacintosh: () => (/* binding */ isMacintosh),
+/* harmony export */ isMobile: () => (/* binding */ isMobile),
+/* harmony export */ isNative: () => (/* binding */ isNative),
+/* harmony export */ isSafari: () => (/* binding */ isSafari),
+/* harmony export */ isWeb: () => (/* binding */ isWeb),
+/* harmony export */ isWebWorker: () => (/* binding */ isWebWorker),
+/* harmony export */ isWindows: () => (/* binding */ isWindows),
+/* harmony export */ language: () => (/* binding */ language),
+/* harmony export */ setTimeout0: () => (/* binding */ setTimeout0),
+/* harmony export */ setTimeout0IsFaster: () => (/* binding */ setTimeout0IsFaster),
+/* harmony export */ userAgent: () => (/* binding */ userAgent),
+/* harmony export */ webWorkerOrigin: () => (/* binding */ webWorkerOrigin)
+/* harmony export */ });
+/* harmony import */ var _nls_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../nls.js */ "./node_modules/monaco-editor/esm/vs/nls.js");
+var _a;
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+const LANGUAGE_DEFAULT = 'en';
+let _isWindows = false;
+let _isMacintosh = false;
+let _isLinux = false;
+let _isLinuxSnap = false;
+let _isNative = false;
+let _isWeb = false;
+let _isElectron = false;
+let _isIOS = false;
+let _isCI = false;
+let _isMobile = false;
+let _locale = undefined;
+let _language = LANGUAGE_DEFAULT;
+let _platformLocale = LANGUAGE_DEFAULT;
+let _translationsConfigFile = undefined;
+let _userAgent = undefined;
+const $globalThis = globalThis;
+let nodeProcess = undefined;
+if (typeof $globalThis.vscode !== 'undefined' && typeof $globalThis.vscode.process !== 'undefined') {
+ // Native environment (sandboxed)
+ nodeProcess = $globalThis.vscode.process;
+}
+else if (typeof process !== 'undefined') {
+ // Native environment (non-sandboxed)
+ nodeProcess = process;
+}
+const isElectronProcess = typeof ((_a = nodeProcess === null || nodeProcess === void 0 ? void 0 : nodeProcess.versions) === null || _a === void 0 ? void 0 : _a.electron) === 'string';
+const isElectronRenderer = isElectronProcess && (nodeProcess === null || nodeProcess === void 0 ? void 0 : nodeProcess.type) === 'renderer';
+// Web environment
+if (typeof navigator === 'object' && !isElectronRenderer) {
+ _userAgent = navigator.userAgent;
+ _isWindows = _userAgent.indexOf('Windows') >= 0;
+ _isMacintosh = _userAgent.indexOf('Macintosh') >= 0;
+ _isIOS = (_userAgent.indexOf('Macintosh') >= 0 || _userAgent.indexOf('iPad') >= 0 || _userAgent.indexOf('iPhone') >= 0) && !!navigator.maxTouchPoints && navigator.maxTouchPoints > 0;
+ _isLinux = _userAgent.indexOf('Linux') >= 0;
+ _isMobile = (_userAgent === null || _userAgent === void 0 ? void 0 : _userAgent.indexOf('Mobi')) >= 0;
+ _isWeb = true;
+ const configuredLocale = _nls_js__WEBPACK_IMPORTED_MODULE_0__.getConfiguredDefaultLocale(
+ // This call _must_ be done in the file that calls `nls.getConfiguredDefaultLocale`
+ // to ensure that the NLS AMD Loader plugin has been loaded and configured.
+ // This is because the loader plugin decides what the default locale is based on
+ // how it's able to resolve the strings.
+ _nls_js__WEBPACK_IMPORTED_MODULE_0__.localize({ key: 'ensureLoaderPluginIsLoaded', comment: ['{Locked}'] }, '_'));
+ _locale = configuredLocale || LANGUAGE_DEFAULT;
+ _language = _locale;
+ _platformLocale = navigator.language;
+}
+// Native environment
+else if (typeof nodeProcess === 'object') {
+ _isWindows = (nodeProcess.platform === 'win32');
+ _isMacintosh = (nodeProcess.platform === 'darwin');
+ _isLinux = (nodeProcess.platform === 'linux');
+ _isLinuxSnap = _isLinux && !!nodeProcess.env['SNAP'] && !!nodeProcess.env['SNAP_REVISION'];
+ _isElectron = isElectronProcess;
+ _isCI = !!nodeProcess.env['CI'] || !!nodeProcess.env['BUILD_ARTIFACTSTAGINGDIRECTORY'];
+ _locale = LANGUAGE_DEFAULT;
+ _language = LANGUAGE_DEFAULT;
+ const rawNlsConfig = nodeProcess.env['VSCODE_NLS_CONFIG'];
+ if (rawNlsConfig) {
+ try {
+ const nlsConfig = JSON.parse(rawNlsConfig);
+ const resolved = nlsConfig.availableLanguages['*'];
+ _locale = nlsConfig.locale;
+ _platformLocale = nlsConfig.osLocale;
+ // VSCode's default language is 'en'
+ _language = resolved ? resolved : LANGUAGE_DEFAULT;
+ _translationsConfigFile = nlsConfig._translationsConfigFile;
+ }
+ catch (e) {
+ }
+ }
+ _isNative = true;
+}
+// Unknown environment
+else {
+ console.error('Unable to resolve platform.');
+}
+let _platform = 0 /* Platform.Web */;
+if (_isMacintosh) {
+ _platform = 1 /* Platform.Mac */;
+}
+else if (_isWindows) {
+ _platform = 3 /* Platform.Windows */;
+}
+else if (_isLinux) {
+ _platform = 2 /* Platform.Linux */;
+}
+const isWindows = _isWindows;
+const isMacintosh = _isMacintosh;
+const isLinux = _isLinux;
+const isNative = _isNative;
+const isWeb = _isWeb;
+const isWebWorker = (_isWeb && typeof $globalThis.importScripts === 'function');
+const webWorkerOrigin = isWebWorker ? $globalThis.origin : undefined;
+const isIOS = _isIOS;
+const isMobile = _isMobile;
+const userAgent = _userAgent;
+/**
+ * The language used for the user interface. The format of
+ * the string is all lower case (e.g. zh-tw for Traditional
+ * Chinese)
+ */
+const language = _language;
+const setTimeout0IsFaster = (typeof $globalThis.postMessage === 'function' && !$globalThis.importScripts);
+/**
+ * See https://html.spec.whatwg.org/multipage/timers-and-user-prompts.html#:~:text=than%204%2C%20then-,set%20timeout%20to%204,-.
+ *
+ * Works similarly to `setTimeout(0)` but doesn't suffer from the 4ms artificial delay
+ * that browsers set when the nesting level is > 5.
+ */
+const setTimeout0 = (() => {
+ if (setTimeout0IsFaster) {
+ const pending = [];
+ $globalThis.addEventListener('message', (e) => {
+ if (e.data && e.data.vscodeScheduleAsyncWork) {
+ for (let i = 0, len = pending.length; i < len; i++) {
+ const candidate = pending[i];
+ if (candidate.id === e.data.vscodeScheduleAsyncWork) {
+ pending.splice(i, 1);
+ candidate.callback();
+ return;
+ }
+ }
+ }
+ });
+ let lastId = 0;
+ return (callback) => {
+ const myId = ++lastId;
+ pending.push({
+ id: myId,
+ callback: callback
+ });
+ $globalThis.postMessage({ vscodeScheduleAsyncWork: myId }, '*');
+ };
+ }
+ return (callback) => setTimeout(callback);
+})();
+const OS = (_isMacintosh || _isIOS ? 2 /* OperatingSystem.Macintosh */ : (_isWindows ? 1 /* OperatingSystem.Windows */ : 3 /* OperatingSystem.Linux */));
+let _isLittleEndian = true;
+let _isLittleEndianComputed = false;
+function isLittleEndian() {
+ if (!_isLittleEndianComputed) {
+ _isLittleEndianComputed = true;
+ const test = new Uint8Array(2);
+ test[0] = 1;
+ test[1] = 2;
+ const view = new Uint16Array(test.buffer);
+ _isLittleEndian = (view[0] === (2 << 8) + 1);
+ }
+ return _isLittleEndian;
+}
+const isChrome = !!(userAgent && userAgent.indexOf('Chrome') >= 0);
+const isFirefox = !!(userAgent && userAgent.indexOf('Firefox') >= 0);
+const isSafari = !!(!isChrome && (userAgent && userAgent.indexOf('Safari') >= 0));
+const isEdge = !!(userAgent && userAgent.indexOf('Edg/') >= 0);
+const isAndroid = !!(userAgent && userAgent.indexOf('Android') >= 0);
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/process.js":
+/*!******************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/process.js ***!
+ \******************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ cwd: () => (/* binding */ cwd),
+/* harmony export */ env: () => (/* binding */ env),
+/* harmony export */ platform: () => (/* binding */ platform)
+/* harmony export */ });
+/* 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.
+ *--------------------------------------------------------------------------------------------*/
+
+let safeProcess;
+// Native sandbox environment
+const vscodeGlobal = globalThis.vscode;
+if (typeof vscodeGlobal !== 'undefined' && typeof vscodeGlobal.process !== 'undefined') {
+ const sandboxProcess = vscodeGlobal.process;
+ safeProcess = {
+ get platform() { return sandboxProcess.platform; },
+ get arch() { return sandboxProcess.arch; },
+ get env() { return sandboxProcess.env; },
+ cwd() { return sandboxProcess.cwd(); }
+ };
+}
+// Native node.js environment
+else if (typeof process !== 'undefined') {
+ safeProcess = {
+ get platform() { return process.platform; },
+ get arch() { return process.arch; },
+ get env() { return process.env; },
+ cwd() { return process.env['VSCODE_CWD'] || process.cwd(); }
+ };
+}
+// Web environment
+else {
+ safeProcess = {
+ // Supported
+ get platform() { return _platform_js__WEBPACK_IMPORTED_MODULE_0__.isWindows ? 'win32' : _platform_js__WEBPACK_IMPORTED_MODULE_0__.isMacintosh ? 'darwin' : 'linux'; },
+ get arch() { return undefined; /* arch is undefined in web */ },
+ // Unsupported
+ get env() { return {}; },
+ cwd() { return '/'; }
+ };
+}
+/**
+ * Provides safe access to the `cwd` property in node.js, sandboxed or web
+ * environments.
+ *
+ * Note: in web, this property is hardcoded to be `/`.
+ *
+ * @skipMangle
+ */
+const cwd = safeProcess.cwd;
+/**
+ * Provides safe access to the `env` property in node.js, sandboxed or web
+ * environments.
+ *
+ * Note: in web, this property is hardcoded to be `{}`.
+ */
+const env = safeProcess.env;
+/**
+ * Provides safe access to the `platform` property in node.js, sandboxed or web
+ * environments.
+ */
+const platform = safeProcess.platform;
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/stopwatch.js":
+/*!********************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/stopwatch.js ***!
+ \********************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ StopWatch: () => (/* binding */ StopWatch)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+const hasPerformanceNow = (globalThis.performance && typeof globalThis.performance.now === 'function');
+class StopWatch {
+ static create(highResolution) {
+ return new StopWatch(highResolution);
+ }
+ constructor(highResolution) {
+ this._now = hasPerformanceNow && highResolution === false ? Date.now : globalThis.performance.now.bind(globalThis.performance);
+ this._startTime = this._now();
+ this._stopTime = -1;
+ }
+ stop() {
+ this._stopTime = this._now();
+ }
+ elapsed() {
+ if (this._stopTime !== -1) {
+ return this._stopTime - this._startTime;
+ }
+ return this._now() - this._startTime;
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/strings.js":
+/*!******************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/strings.js ***!
+ \******************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ AmbiguousCharacters: () => (/* binding */ AmbiguousCharacters),
+/* harmony export */ CodePointIterator: () => (/* binding */ CodePointIterator),
+/* harmony export */ GraphemeIterator: () => (/* binding */ GraphemeIterator),
+/* harmony export */ InvisibleCharacters: () => (/* binding */ InvisibleCharacters),
+/* harmony export */ UNUSUAL_LINE_TERMINATORS: () => (/* binding */ UNUSUAL_LINE_TERMINATORS),
+/* harmony export */ UTF8_BOM_CHARACTER: () => (/* binding */ UTF8_BOM_CHARACTER),
+/* harmony export */ commonPrefixLength: () => (/* binding */ commonPrefixLength),
+/* harmony export */ commonSuffixLength: () => (/* binding */ commonSuffixLength),
+/* harmony export */ compare: () => (/* binding */ compare),
+/* harmony export */ compareIgnoreCase: () => (/* binding */ compareIgnoreCase),
+/* harmony export */ compareSubstring: () => (/* binding */ compareSubstring),
+/* harmony export */ compareSubstringIgnoreCase: () => (/* binding */ compareSubstringIgnoreCase),
+/* harmony export */ computeCodePoint: () => (/* binding */ computeCodePoint),
+/* harmony export */ containsRTL: () => (/* binding */ containsRTL),
+/* harmony export */ containsUnusualLineTerminators: () => (/* binding */ containsUnusualLineTerminators),
+/* harmony export */ containsUppercaseCharacter: () => (/* binding */ containsUppercaseCharacter),
+/* harmony export */ convertSimple2RegExpPattern: () => (/* binding */ convertSimple2RegExpPattern),
+/* harmony export */ createRegExp: () => (/* binding */ createRegExp),
+/* harmony export */ equalsIgnoreCase: () => (/* binding */ equalsIgnoreCase),
+/* harmony export */ escape: () => (/* binding */ escape),
+/* harmony export */ escapeRegExpCharacters: () => (/* binding */ escapeRegExpCharacters),
+/* harmony export */ firstNonWhitespaceIndex: () => (/* binding */ firstNonWhitespaceIndex),
+/* harmony export */ format: () => (/* binding */ format),
+/* harmony export */ getCharContainingOffset: () => (/* binding */ getCharContainingOffset),
+/* harmony export */ getLeadingWhitespace: () => (/* binding */ getLeadingWhitespace),
+/* harmony export */ getLeftDeleteOffset: () => (/* binding */ getLeftDeleteOffset),
+/* harmony export */ getNextCodePoint: () => (/* binding */ getNextCodePoint),
+/* harmony export */ isAsciiDigit: () => (/* binding */ isAsciiDigit),
+/* harmony export */ isBasicASCII: () => (/* binding */ isBasicASCII),
+/* harmony export */ isEmojiImprecise: () => (/* binding */ isEmojiImprecise),
+/* harmony export */ isFalsyOrWhitespace: () => (/* binding */ isFalsyOrWhitespace),
+/* harmony export */ isFullWidthCharacter: () => (/* binding */ isFullWidthCharacter),
+/* harmony export */ isHighSurrogate: () => (/* binding */ isHighSurrogate),
+/* harmony export */ isLowSurrogate: () => (/* binding */ isLowSurrogate),
+/* harmony export */ isLowerAsciiLetter: () => (/* binding */ isLowerAsciiLetter),
+/* harmony export */ isUpperAsciiLetter: () => (/* binding */ isUpperAsciiLetter),
+/* harmony export */ lastNonWhitespaceIndex: () => (/* binding */ lastNonWhitespaceIndex),
+/* harmony export */ ltrim: () => (/* binding */ ltrim),
+/* harmony export */ nextCharLength: () => (/* binding */ nextCharLength),
+/* harmony export */ noBreakWhitespace: () => (/* binding */ noBreakWhitespace),
+/* harmony export */ prevCharLength: () => (/* binding */ prevCharLength),
+/* harmony export */ regExpLeadsToEndlessLoop: () => (/* binding */ regExpLeadsToEndlessLoop),
+/* harmony export */ rtrim: () => (/* binding */ rtrim),
+/* harmony export */ singleLetterHash: () => (/* binding */ singleLetterHash),
+/* harmony export */ splitLines: () => (/* binding */ splitLines),
+/* harmony export */ startsWithIgnoreCase: () => (/* binding */ startsWithIgnoreCase),
+/* harmony export */ startsWithUTF8BOM: () => (/* binding */ startsWithUTF8BOM),
+/* harmony export */ stripWildcards: () => (/* binding */ stripWildcards),
+/* harmony export */ trim: () => (/* binding */ trim)
+/* harmony export */ });
+/* harmony import */ var _cache_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./cache.js */ "./node_modules/monaco-editor/esm/vs/base/common/cache.js");
+/* harmony import */ var _lazy_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./lazy.js */ "./node_modules/monaco-editor/esm/vs/base/common/lazy.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+var _a;
+
+
+function isFalsyOrWhitespace(str) {
+ if (!str || typeof str !== 'string') {
+ return true;
+ }
+ return str.trim().length === 0;
+}
+const _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, ...args) {
+ if (args.length === 0) {
+ return value;
+ }
+ return value.replace(_formatRegexp, function (match, group) {
+ const 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 = ' ') {
+ const 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;
+ }
+ const needleLen = needle.length;
+ if (needleLen === 0 || haystack.length === 0) {
+ return haystack;
+ }
+ let 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;
+ }
+ const needleLen = needle.length, haystackLen = haystack.length;
+ if (needleLen === 0 || haystackLen === 0) {
+ return haystack;
+ }
+ let 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, '.*');
+}
+function stripWildcards(pattern) {
+ return pattern.replace(/\*/g, '');
+}
+function createRegExp(searchString, isRegex, 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';
+ }
+ }
+ let 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.
+ const match = regexp.exec('');
+ return !!(match && regexp.lastIndex === 0);
+}
+function splitLines(str) {
+ return str.split(/\r\n|\r|\n/);
+}
+/**
+ * Returns first index of the string that is not whitespace.
+ * If string is empty or contains only whitespaces, returns -1
+ */
+function firstNonWhitespaceIndex(str) {
+ for (let i = 0, len = str.length; i < len; i++) {
+ const chCode = str.charCodeAt(i);
+ if (chCode !== 32 /* CharCode.Space */ && chCode !== 9 /* CharCode.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 = 0, end = str.length) {
+ for (let i = start; i < end; i++) {
+ const chCode = str.charCodeAt(i);
+ if (chCode !== 32 /* CharCode.Space */ && chCode !== 9 /* CharCode.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 = str.length - 1) {
+ for (let i = startIndex; i >= 0; i--) {
+ const chCode = str.charCodeAt(i);
+ if (chCode !== 32 /* CharCode.Space */ && chCode !== 9 /* CharCode.Tab */) {
+ return i;
+ }
+ }
+ return -1;
+}
+function compare(a, b) {
+ if (a < b) {
+ return -1;
+ }
+ else if (a > b) {
+ return 1;
+ }
+ else {
+ return 0;
+ }
+}
+function compareSubstring(a, b, aStart = 0, aEnd = a.length, bStart = 0, bEnd = b.length) {
+ for (; aStart < aEnd && bStart < bEnd; aStart++, bStart++) {
+ const codeA = a.charCodeAt(aStart);
+ const codeB = b.charCodeAt(bStart);
+ if (codeA < codeB) {
+ return -1;
+ }
+ else if (codeA > codeB) {
+ return 1;
+ }
+ }
+ const aLen = aEnd - aStart;
+ const bLen = bEnd - bStart;
+ if (aLen < bLen) {
+ return -1;
+ }
+ else if (aLen > bLen) {
+ return 1;
+ }
+ return 0;
+}
+function compareIgnoreCase(a, b) {
+ return compareSubstringIgnoreCase(a, b, 0, a.length, 0, b.length);
+}
+function compareSubstringIgnoreCase(a, b, aStart = 0, aEnd = a.length, bStart = 0, bEnd = b.length) {
+ for (; aStart < aEnd && bStart < bEnd; aStart++, bStart++) {
+ let codeA = a.charCodeAt(aStart);
+ let codeB = b.charCodeAt(bStart);
+ if (codeA === codeB) {
+ // equal
+ continue;
+ }
+ if (codeA >= 128 || codeB >= 128) {
+ // not ASCII letters -> fallback to lower-casing strings
+ return compareSubstring(a.toLowerCase(), b.toLowerCase(), aStart, aEnd, bStart, bEnd);
+ }
+ // mapper lower-case ascii letter onto upper-case varinats
+ // [97-122] (lower ascii) --> [65-90] (upper ascii)
+ if (isLowerAsciiLetter(codeA)) {
+ codeA -= 32;
+ }
+ if (isLowerAsciiLetter(codeB)) {
+ codeB -= 32;
+ }
+ // compare both code points
+ const diff = codeA - codeB;
+ if (diff === 0) {
+ continue;
+ }
+ return diff;
+ }
+ const aLen = aEnd - aStart;
+ const bLen = bEnd - bStart;
+ if (aLen < bLen) {
+ return -1;
+ }
+ else if (aLen > bLen) {
+ return 1;
+ }
+ return 0;
+}
+function isAsciiDigit(code) {
+ return code >= 48 /* CharCode.Digit0 */ && code <= 57 /* CharCode.Digit9 */;
+}
+function isLowerAsciiLetter(code) {
+ return code >= 97 /* CharCode.a */ && code <= 122 /* CharCode.z */;
+}
+function isUpperAsciiLetter(code) {
+ return code >= 65 /* CharCode.A */ && code <= 90 /* CharCode.Z */;
+}
+function equalsIgnoreCase(a, b) {
+ return a.length === b.length && compareSubstringIgnoreCase(a, b) === 0;
+}
+function startsWithIgnoreCase(str, candidate) {
+ const candidateLength = candidate.length;
+ if (candidate.length > str.length) {
+ return false;
+ }
+ return compareSubstringIgnoreCase(str, candidate, 0, candidateLength) === 0;
+}
+/**
+ * @returns the length of the common prefix of the two strings.
+ */
+function commonPrefixLength(a, b) {
+ const len = Math.min(a.length, b.length);
+ let i;
+ 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) {
+ const len = Math.min(a.length, b.length);
+ let i;
+ const aLastIndex = a.length - 1;
+ const bLastIndex = b.length - 1;
+ for (i = 0; i < len; i++) {
+ if (a.charCodeAt(aLastIndex - i) !== b.charCodeAt(bLastIndex - i)) {
+ return i;
+ }
+ }
+ return len;
+}
+/**
+ * See http://en.wikipedia.org/wiki/Surrogate_pair
+ */
+function isHighSurrogate(charCode) {
+ return (0xD800 <= charCode && charCode <= 0xDBFF);
+}
+/**
+ * See http://en.wikipedia.org/wiki/Surrogate_pair
+ */
+function isLowSurrogate(charCode) {
+ return (0xDC00 <= charCode && charCode <= 0xDFFF);
+}
+/**
+ * See http://en.wikipedia.org/wiki/Surrogate_pair
+ */
+function computeCodePoint(highSurrogate, lowSurrogate) {
+ return ((highSurrogate - 0xD800) << 10) + (lowSurrogate - 0xDC00) + 0x10000;
+}
+/**
+ * get the code point that begins at offset `offset`
+ */
+function getNextCodePoint(str, len, offset) {
+ const charCode = str.charCodeAt(offset);
+ if (isHighSurrogate(charCode) && offset + 1 < len) {
+ const nextCharCode = str.charCodeAt(offset + 1);
+ if (isLowSurrogate(nextCharCode)) {
+ return computeCodePoint(charCode, nextCharCode);
+ }
+ }
+ return charCode;
+}
+/**
+ * get the code point that ends right before offset `offset`
+ */
+function getPrevCodePoint(str, offset) {
+ const charCode = str.charCodeAt(offset - 1);
+ if (isLowSurrogate(charCode) && offset > 1) {
+ const prevCharCode = str.charCodeAt(offset - 2);
+ if (isHighSurrogate(prevCharCode)) {
+ return computeCodePoint(prevCharCode, charCode);
+ }
+ }
+ return charCode;
+}
+class CodePointIterator {
+ get offset() {
+ return this._offset;
+ }
+ constructor(str, offset = 0) {
+ this._str = str;
+ this._len = str.length;
+ this._offset = offset;
+ }
+ setOffset(offset) {
+ this._offset = offset;
+ }
+ prevCodePoint() {
+ const codePoint = getPrevCodePoint(this._str, this._offset);
+ this._offset -= (codePoint >= 65536 /* Constants.UNICODE_SUPPLEMENTARY_PLANE_BEGIN */ ? 2 : 1);
+ return codePoint;
+ }
+ nextCodePoint() {
+ const codePoint = getNextCodePoint(this._str, this._len, this._offset);
+ this._offset += (codePoint >= 65536 /* Constants.UNICODE_SUPPLEMENTARY_PLANE_BEGIN */ ? 2 : 1);
+ return codePoint;
+ }
+ eol() {
+ return (this._offset >= this._len);
+ }
+}
+class GraphemeIterator {
+ get offset() {
+ return this._iterator.offset;
+ }
+ constructor(str, offset = 0) {
+ this._iterator = new CodePointIterator(str, offset);
+ }
+ nextGraphemeLength() {
+ const graphemeBreakTree = GraphemeBreakTree.getInstance();
+ const iterator = this._iterator;
+ const initialOffset = iterator.offset;
+ let graphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.nextCodePoint());
+ while (!iterator.eol()) {
+ const offset = iterator.offset;
+ const nextGraphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.nextCodePoint());
+ if (breakBetweenGraphemeBreakType(graphemeBreakType, nextGraphemeBreakType)) {
+ // move iterator back
+ iterator.setOffset(offset);
+ break;
+ }
+ graphemeBreakType = nextGraphemeBreakType;
+ }
+ return (iterator.offset - initialOffset);
+ }
+ prevGraphemeLength() {
+ const graphemeBreakTree = GraphemeBreakTree.getInstance();
+ const iterator = this._iterator;
+ const initialOffset = iterator.offset;
+ let graphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.prevCodePoint());
+ while (iterator.offset > 0) {
+ const offset = iterator.offset;
+ const prevGraphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.prevCodePoint());
+ if (breakBetweenGraphemeBreakType(prevGraphemeBreakType, graphemeBreakType)) {
+ // move iterator back
+ iterator.setOffset(offset);
+ break;
+ }
+ graphemeBreakType = prevGraphemeBreakType;
+ }
+ return (initialOffset - iterator.offset);
+ }
+ eol() {
+ return this._iterator.eol();
+ }
+}
+function nextCharLength(str, initialOffset) {
+ const iterator = new GraphemeIterator(str, initialOffset);
+ return iterator.nextGraphemeLength();
+}
+function prevCharLength(str, initialOffset) {
+ const iterator = new GraphemeIterator(str, initialOffset);
+ return iterator.prevGraphemeLength();
+}
+function getCharContainingOffset(str, offset) {
+ if (offset > 0 && isLowSurrogate(str.charCodeAt(offset))) {
+ offset--;
+ }
+ const endOffset = offset + nextCharLength(str, offset);
+ const startOffset = endOffset - prevCharLength(str, endOffset);
+ return [startOffset, endOffset];
+}
+let CONTAINS_RTL = undefined;
+function makeContainsRtl() {
+ // Generated using https://github.com/alexdima/unicode-utils/blob/main/rtl-test.js
+ return /(?:[\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\u07FE-\u0815\u081A\u0824\u0828\u0830-\u0858\u085E-\u088E\u08A0-\u08C9\u200F\uFB1D\uFB1F-\uFB28\uFB2A-\uFD3D\uFD50-\uFDC7\uFDF0-\uFDFC\uFE70-\uFEFC]|\uD802[\uDC00-\uDD1B\uDD20-\uDE00\uDE10-\uDE35\uDE40-\uDEE4\uDEEB-\uDF35\uDF40-\uDFFF]|\uD803[\uDC00-\uDD23\uDE80-\uDEA9\uDEAD-\uDF45\uDF51-\uDF81\uDF86-\uDFF6]|\uD83A[\uDC00-\uDCCF\uDD00-\uDD43\uDD4B-\uDFFF]|\uD83B[\uDC00-\uDEBB])/;
+}
+/**
+ * Returns true if `str` contains any Unicode character that is classified as "R" or "AL".
+ */
+function containsRTL(str) {
+ if (!CONTAINS_RTL) {
+ CONTAINS_RTL = makeContainsRtl();
+ }
+ return CONTAINS_RTL.test(str);
+}
+const 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);
+}
+const UNUSUAL_LINE_TERMINATORS = /[\u2028\u2029]/; // LINE SEPARATOR (LS) or PARAGRAPH SEPARATOR (PS)
+/**
+ * Returns true if `str` contains unusual line terminators, like LS or PS
+ */
+function containsUnusualLineTerminators(str) {
+ return UNUSUAL_LINE_TERMINATORS.test(str);
+}
+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
+ 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/alexdima/unicode-utils/blob/main/emoji-test.js
+ */
+function isEmojiImprecise(x) {
+ return ((x >= 0x1F1E6 && x <= 0x1F1FF) || (x === 8986) || (x === 8987) || (x === 9200)
+ || (x === 9203) || (x >= 9728 && x <= 10175) || (x === 11088) || (x === 11093)
+ || (x >= 127744 && x <= 128591) || (x >= 128640 && x <= 128764)
+ || (x >= 128992 && x <= 129008) || (x >= 129280 && x <= 129535)
+ || (x >= 129648 && x <= 129782));
+}
+// -- UTF-8 BOM
+const UTF8_BOM_CHARACTER = String.fromCharCode(65279 /* CharCode.UTF8_BOM */);
+function startsWithUTF8BOM(str) {
+ return !!(str && str.length > 0 && str.charCodeAt(0) === 65279 /* CharCode.UTF8_BOM */);
+}
+function containsUppercaseCharacter(target, 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) {
+ const LETTERS_CNT = (90 /* CharCode.Z */ - 65 /* CharCode.A */ + 1);
+ n = n % (2 * LETTERS_CNT);
+ if (n < LETTERS_CNT) {
+ return String.fromCharCode(97 /* CharCode.a */ + n);
+ }
+ return String.fromCharCode(65 /* CharCode.A */ + n - LETTERS_CNT);
+}
+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 /* GraphemeBreakType.Other */) {
+ // see https://www.unicode.org/Public/13.0.0/ucd/auxiliary/GraphemeBreakTest-13.0.0d10.html#table
+ return (breakTypeB !== 5 /* GraphemeBreakType.Extend */ && breakTypeB !== 7 /* GraphemeBreakType.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 /* GraphemeBreakType.CR */) {
+ if (breakTypeB === 3 /* GraphemeBreakType.LF */) {
+ return false; // GB3
+ }
+ }
+ if (breakTypeA === 4 /* GraphemeBreakType.Control */ || breakTypeA === 2 /* GraphemeBreakType.CR */ || breakTypeA === 3 /* GraphemeBreakType.LF */) {
+ return true; // GB4
+ }
+ if (breakTypeB === 4 /* GraphemeBreakType.Control */ || breakTypeB === 2 /* GraphemeBreakType.CR */ || breakTypeB === 3 /* GraphemeBreakType.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 /* GraphemeBreakType.L */) {
+ if (breakTypeB === 8 /* GraphemeBreakType.L */ || breakTypeB === 9 /* GraphemeBreakType.V */ || breakTypeB === 11 /* GraphemeBreakType.LV */ || breakTypeB === 12 /* GraphemeBreakType.LVT */) {
+ return false; // GB6
+ }
+ }
+ if (breakTypeA === 11 /* GraphemeBreakType.LV */ || breakTypeA === 9 /* GraphemeBreakType.V */) {
+ if (breakTypeB === 9 /* GraphemeBreakType.V */ || breakTypeB === 10 /* GraphemeBreakType.T */) {
+ return false; // GB7
+ }
+ }
+ if (breakTypeA === 12 /* GraphemeBreakType.LVT */ || breakTypeA === 10 /* GraphemeBreakType.T */) {
+ if (breakTypeB === 10 /* GraphemeBreakType.T */) {
+ return false; // GB8
+ }
+ }
+ // Do not break before extending characters or ZWJ.
+ // GB9 × (Extend | ZWJ)
+ if (breakTypeB === 5 /* GraphemeBreakType.Extend */ || breakTypeB === 13 /* GraphemeBreakType.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 /* GraphemeBreakType.SpacingMark */) {
+ return false; // GB9a
+ }
+ if (breakTypeA === 1 /* GraphemeBreakType.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 /* GraphemeBreakType.ZWJ */ && breakTypeB === 14 /* GraphemeBreakType.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 /* GraphemeBreakType.Regional_Indicator */ && breakTypeB === 6 /* GraphemeBreakType.Regional_Indicator */) {
+ // Note: we are not implementing the rule entirely here to avoid introducing states
+ return false; // GB12 & GB13
+ }
+ // GB999 Any ÷ Any
+ return true;
+}
+class GraphemeBreakTree {
+ static getInstance() {
+ if (!GraphemeBreakTree._INSTANCE) {
+ GraphemeBreakTree._INSTANCE = new GraphemeBreakTree();
+ }
+ return GraphemeBreakTree._INSTANCE;
+ }
+ constructor() {
+ this._data = getGraphemeBreakRawData();
+ }
+ getGraphemeBreakType(codePoint) {
+ // !!! Let's make 7bit ASCII a bit faster: 0..31
+ if (codePoint < 32) {
+ if (codePoint === 10 /* CharCode.LineFeed */) {
+ return 3 /* GraphemeBreakType.LF */;
+ }
+ if (codePoint === 13 /* CharCode.CarriageReturn */) {
+ return 2 /* GraphemeBreakType.CR */;
+ }
+ return 4 /* GraphemeBreakType.Control */;
+ }
+ // !!! Let's make 7bit ASCII a bit faster: 32..126
+ if (codePoint < 127) {
+ return 0 /* GraphemeBreakType.Other */;
+ }
+ const data = this._data;
+ const nodeCount = data.length / 3;
+ let 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 /* GraphemeBreakType.Other */;
+ }
+}
+GraphemeBreakTree._INSTANCE = null;
+function getGraphemeBreakRawData() {
+ // generated using https://github.com/alexdima/unicode-utils/blob/main/grapheme-break.js
+ return JSON.parse('[0,0,0,51229,51255,12,44061,44087,12,127462,127487,6,7083,7085,5,47645,47671,12,54813,54839,12,128678,128678,14,3270,3270,5,9919,9923,14,45853,45879,12,49437,49463,12,53021,53047,12,71216,71218,7,128398,128399,14,129360,129374,14,2519,2519,5,4448,4519,9,9742,9742,14,12336,12336,14,44957,44983,12,46749,46775,12,48541,48567,12,50333,50359,12,52125,52151,12,53917,53943,12,69888,69890,5,73018,73018,5,127990,127990,14,128558,128559,14,128759,128760,14,129653,129655,14,2027,2035,5,2891,2892,7,3761,3761,5,6683,6683,5,8293,8293,4,9825,9826,14,9999,9999,14,43452,43453,5,44509,44535,12,45405,45431,12,46301,46327,12,47197,47223,12,48093,48119,12,48989,49015,12,49885,49911,12,50781,50807,12,51677,51703,12,52573,52599,12,53469,53495,12,54365,54391,12,65279,65279,4,70471,70472,7,72145,72147,7,119173,119179,5,127799,127818,14,128240,128244,14,128512,128512,14,128652,128652,14,128721,128722,14,129292,129292,14,129445,129450,14,129734,129743,14,1476,1477,5,2366,2368,7,2750,2752,7,3076,3076,5,3415,3415,5,4141,4144,5,6109,6109,5,6964,6964,5,7394,7400,5,9197,9198,14,9770,9770,14,9877,9877,14,9968,9969,14,10084,10084,14,43052,43052,5,43713,43713,5,44285,44311,12,44733,44759,12,45181,45207,12,45629,45655,12,46077,46103,12,46525,46551,12,46973,46999,12,47421,47447,12,47869,47895,12,48317,48343,12,48765,48791,12,49213,49239,12,49661,49687,12,50109,50135,12,50557,50583,12,51005,51031,12,51453,51479,12,51901,51927,12,52349,52375,12,52797,52823,12,53245,53271,12,53693,53719,12,54141,54167,12,54589,54615,12,55037,55063,12,69506,69509,5,70191,70193,5,70841,70841,7,71463,71467,5,72330,72342,5,94031,94031,5,123628,123631,5,127763,127765,14,127941,127941,14,128043,128062,14,128302,128317,14,128465,128467,14,128539,128539,14,128640,128640,14,128662,128662,14,128703,128703,14,128745,128745,14,129004,129007,14,129329,129330,14,129402,129402,14,129483,129483,14,129686,129704,14,130048,131069,14,173,173,4,1757,1757,1,2200,2207,5,2434,2435,7,2631,2632,5,2817,2817,5,3008,3008,5,3201,3201,5,3387,3388,5,3542,3542,5,3902,3903,7,4190,4192,5,6002,6003,5,6439,6440,5,6765,6770,7,7019,7027,5,7154,7155,7,8205,8205,13,8505,8505,14,9654,9654,14,9757,9757,14,9792,9792,14,9852,9853,14,9890,9894,14,9937,9937,14,9981,9981,14,10035,10036,14,11035,11036,14,42654,42655,5,43346,43347,7,43587,43587,5,44006,44007,7,44173,44199,12,44397,44423,12,44621,44647,12,44845,44871,12,45069,45095,12,45293,45319,12,45517,45543,12,45741,45767,12,45965,45991,12,46189,46215,12,46413,46439,12,46637,46663,12,46861,46887,12,47085,47111,12,47309,47335,12,47533,47559,12,47757,47783,12,47981,48007,12,48205,48231,12,48429,48455,12,48653,48679,12,48877,48903,12,49101,49127,12,49325,49351,12,49549,49575,12,49773,49799,12,49997,50023,12,50221,50247,12,50445,50471,12,50669,50695,12,50893,50919,12,51117,51143,12,51341,51367,12,51565,51591,12,51789,51815,12,52013,52039,12,52237,52263,12,52461,52487,12,52685,52711,12,52909,52935,12,53133,53159,12,53357,53383,12,53581,53607,12,53805,53831,12,54029,54055,12,54253,54279,12,54477,54503,12,54701,54727,12,54925,54951,12,55149,55175,12,68101,68102,5,69762,69762,7,70067,70069,7,70371,70378,5,70720,70721,7,71087,71087,5,71341,71341,5,71995,71996,5,72249,72249,7,72850,72871,5,73109,73109,5,118576,118598,5,121505,121519,5,127245,127247,14,127568,127569,14,127777,127777,14,127872,127891,14,127956,127967,14,128015,128016,14,128110,128172,14,128259,128259,14,128367,128368,14,128424,128424,14,128488,128488,14,128530,128532,14,128550,128551,14,128566,128566,14,128647,128647,14,128656,128656,14,128667,128673,14,128691,128693,14,128715,128715,14,128728,128732,14,128752,128752,14,128765,128767,14,129096,129103,14,129311,129311,14,129344,129349,14,129394,129394,14,129413,129425,14,129466,129471,14,129511,129535,14,129664,129666,14,129719,129722,14,129760,129767,14,917536,917631,5,13,13,2,1160,1161,5,1564,1564,4,1807,1807,1,2085,2087,5,2307,2307,7,2382,2383,7,2497,2500,5,2563,2563,7,2677,2677,5,2763,2764,7,2879,2879,5,2914,2915,5,3021,3021,5,3142,3144,5,3263,3263,5,3285,3286,5,3398,3400,7,3530,3530,5,3633,3633,5,3864,3865,5,3974,3975,5,4155,4156,7,4229,4230,5,5909,5909,7,6078,6085,7,6277,6278,5,6451,6456,7,6744,6750,5,6846,6846,5,6972,6972,5,7074,7077,5,7146,7148,7,7222,7223,5,7416,7417,5,8234,8238,4,8417,8417,5,9000,9000,14,9203,9203,14,9730,9731,14,9748,9749,14,9762,9763,14,9776,9783,14,9800,9811,14,9831,9831,14,9872,9873,14,9882,9882,14,9900,9903,14,9929,9933,14,9941,9960,14,9974,9974,14,9989,9989,14,10006,10006,14,10062,10062,14,10160,10160,14,11647,11647,5,12953,12953,14,43019,43019,5,43232,43249,5,43443,43443,5,43567,43568,7,43696,43696,5,43765,43765,7,44013,44013,5,44117,44143,12,44229,44255,12,44341,44367,12,44453,44479,12,44565,44591,12,44677,44703,12,44789,44815,12,44901,44927,12,45013,45039,12,45125,45151,12,45237,45263,12,45349,45375,12,45461,45487,12,45573,45599,12,45685,45711,12,45797,45823,12,45909,45935,12,46021,46047,12,46133,46159,12,46245,46271,12,46357,46383,12,46469,46495,12,46581,46607,12,46693,46719,12,46805,46831,12,46917,46943,12,47029,47055,12,47141,47167,12,47253,47279,12,47365,47391,12,47477,47503,12,47589,47615,12,47701,47727,12,47813,47839,12,47925,47951,12,48037,48063,12,48149,48175,12,48261,48287,12,48373,48399,12,48485,48511,12,48597,48623,12,48709,48735,12,48821,48847,12,48933,48959,12,49045,49071,12,49157,49183,12,49269,49295,12,49381,49407,12,49493,49519,12,49605,49631,12,49717,49743,12,49829,49855,12,49941,49967,12,50053,50079,12,50165,50191,12,50277,50303,12,50389,50415,12,50501,50527,12,50613,50639,12,50725,50751,12,50837,50863,12,50949,50975,12,51061,51087,12,51173,51199,12,51285,51311,12,51397,51423,12,51509,51535,12,51621,51647,12,51733,51759,12,51845,51871,12,51957,51983,12,52069,52095,12,52181,52207,12,52293,52319,12,52405,52431,12,52517,52543,12,52629,52655,12,52741,52767,12,52853,52879,12,52965,52991,12,53077,53103,12,53189,53215,12,53301,53327,12,53413,53439,12,53525,53551,12,53637,53663,12,53749,53775,12,53861,53887,12,53973,53999,12,54085,54111,12,54197,54223,12,54309,54335,12,54421,54447,12,54533,54559,12,54645,54671,12,54757,54783,12,54869,54895,12,54981,55007,12,55093,55119,12,55243,55291,10,66045,66045,5,68325,68326,5,69688,69702,5,69817,69818,5,69957,69958,7,70089,70092,5,70198,70199,5,70462,70462,5,70502,70508,5,70750,70750,5,70846,70846,7,71100,71101,5,71230,71230,7,71351,71351,5,71737,71738,5,72000,72000,7,72160,72160,5,72273,72278,5,72752,72758,5,72882,72883,5,73031,73031,5,73461,73462,7,94192,94193,7,119149,119149,7,121403,121452,5,122915,122916,5,126980,126980,14,127358,127359,14,127535,127535,14,127759,127759,14,127771,127771,14,127792,127793,14,127825,127867,14,127897,127899,14,127945,127945,14,127985,127986,14,128000,128007,14,128021,128021,14,128066,128100,14,128184,128235,14,128249,128252,14,128266,128276,14,128335,128335,14,128379,128390,14,128407,128419,14,128444,128444,14,128481,128481,14,128499,128499,14,128526,128526,14,128536,128536,14,128543,128543,14,128556,128556,14,128564,128564,14,128577,128580,14,128643,128645,14,128649,128649,14,128654,128654,14,128660,128660,14,128664,128664,14,128675,128675,14,128686,128689,14,128695,128696,14,128705,128709,14,128717,128719,14,128725,128725,14,128736,128741,14,128747,128748,14,128755,128755,14,128762,128762,14,128981,128991,14,129009,129023,14,129160,129167,14,129296,129304,14,129320,129327,14,129340,129342,14,129356,129356,14,129388,129392,14,129399,129400,14,129404,129407,14,129432,129442,14,129454,129455,14,129473,129474,14,129485,129487,14,129648,129651,14,129659,129660,14,129671,129679,14,129709,129711,14,129728,129730,14,129751,129753,14,129776,129782,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,2274,2274,1,2363,2363,7,2377,2380,7,2402,2403,5,2494,2494,5,2507,2508,7,2558,2558,5,2622,2624,7,2641,2641,5,2691,2691,7,2759,2760,5,2786,2787,5,2876,2876,5,2881,2884,5,2901,2902,5,3006,3006,5,3014,3016,7,3072,3072,5,3134,3136,5,3157,3158,5,3260,3260,5,3266,3266,5,3274,3275,7,3328,3329,5,3391,3392,7,3405,3405,5,3457,3457,5,3536,3537,7,3551,3551,5,3636,3642,5,3764,3772,5,3895,3895,5,3967,3967,7,3993,4028,5,4146,4151,5,4182,4183,7,4226,4226,5,4253,4253,5,4957,4959,5,5940,5940,7,6070,6070,7,6087,6088,7,6158,6158,4,6432,6434,5,6448,6449,7,6679,6680,5,6742,6742,5,6754,6754,5,6783,6783,5,6912,6915,5,6966,6970,5,6978,6978,5,7042,7042,7,7080,7081,5,7143,7143,7,7150,7150,7,7212,7219,5,7380,7392,5,7412,7412,5,8203,8203,4,8232,8232,4,8265,8265,14,8400,8412,5,8421,8432,5,8617,8618,14,9167,9167,14,9200,9200,14,9410,9410,14,9723,9726,14,9733,9733,14,9745,9745,14,9752,9752,14,9760,9760,14,9766,9766,14,9774,9774,14,9786,9786,14,9794,9794,14,9823,9823,14,9828,9828,14,9833,9850,14,9855,9855,14,9875,9875,14,9880,9880,14,9885,9887,14,9896,9897,14,9906,9916,14,9926,9927,14,9935,9935,14,9939,9939,14,9962,9962,14,9972,9972,14,9978,9978,14,9986,9986,14,9997,9997,14,10002,10002,14,10017,10017,14,10055,10055,14,10071,10071,14,10133,10135,14,10548,10549,14,11093,11093,14,12330,12333,5,12441,12442,5,42608,42610,5,43010,43010,5,43045,43046,5,43188,43203,7,43302,43309,5,43392,43394,5,43446,43449,5,43493,43493,5,43571,43572,7,43597,43597,7,43703,43704,5,43756,43757,5,44003,44004,7,44009,44010,7,44033,44059,12,44089,44115,12,44145,44171,12,44201,44227,12,44257,44283,12,44313,44339,12,44369,44395,12,44425,44451,12,44481,44507,12,44537,44563,12,44593,44619,12,44649,44675,12,44705,44731,12,44761,44787,12,44817,44843,12,44873,44899,12,44929,44955,12,44985,45011,12,45041,45067,12,45097,45123,12,45153,45179,12,45209,45235,12,45265,45291,12,45321,45347,12,45377,45403,12,45433,45459,12,45489,45515,12,45545,45571,12,45601,45627,12,45657,45683,12,45713,45739,12,45769,45795,12,45825,45851,12,45881,45907,12,45937,45963,12,45993,46019,12,46049,46075,12,46105,46131,12,46161,46187,12,46217,46243,12,46273,46299,12,46329,46355,12,46385,46411,12,46441,46467,12,46497,46523,12,46553,46579,12,46609,46635,12,46665,46691,12,46721,46747,12,46777,46803,12,46833,46859,12,46889,46915,12,46945,46971,12,47001,47027,12,47057,47083,12,47113,47139,12,47169,47195,12,47225,47251,12,47281,47307,12,47337,47363,12,47393,47419,12,47449,47475,12,47505,47531,12,47561,47587,12,47617,47643,12,47673,47699,12,47729,47755,12,47785,47811,12,47841,47867,12,47897,47923,12,47953,47979,12,48009,48035,12,48065,48091,12,48121,48147,12,48177,48203,12,48233,48259,12,48289,48315,12,48345,48371,12,48401,48427,12,48457,48483,12,48513,48539,12,48569,48595,12,48625,48651,12,48681,48707,12,48737,48763,12,48793,48819,12,48849,48875,12,48905,48931,12,48961,48987,12,49017,49043,12,49073,49099,12,49129,49155,12,49185,49211,12,49241,49267,12,49297,49323,12,49353,49379,12,49409,49435,12,49465,49491,12,49521,49547,12,49577,49603,12,49633,49659,12,49689,49715,12,49745,49771,12,49801,49827,12,49857,49883,12,49913,49939,12,49969,49995,12,50025,50051,12,50081,50107,12,50137,50163,12,50193,50219,12,50249,50275,12,50305,50331,12,50361,50387,12,50417,50443,12,50473,50499,12,50529,50555,12,50585,50611,12,50641,50667,12,50697,50723,12,50753,50779,12,50809,50835,12,50865,50891,12,50921,50947,12,50977,51003,12,51033,51059,12,51089,51115,12,51145,51171,12,51201,51227,12,51257,51283,12,51313,51339,12,51369,51395,12,51425,51451,12,51481,51507,12,51537,51563,12,51593,51619,12,51649,51675,12,51705,51731,12,51761,51787,12,51817,51843,12,51873,51899,12,51929,51955,12,51985,52011,12,52041,52067,12,52097,52123,12,52153,52179,12,52209,52235,12,52265,52291,12,52321,52347,12,52377,52403,12,52433,52459,12,52489,52515,12,52545,52571,12,52601,52627,12,52657,52683,12,52713,52739,12,52769,52795,12,52825,52851,12,52881,52907,12,52937,52963,12,52993,53019,12,53049,53075,12,53105,53131,12,53161,53187,12,53217,53243,12,53273,53299,12,53329,53355,12,53385,53411,12,53441,53467,12,53497,53523,12,53553,53579,12,53609,53635,12,53665,53691,12,53721,53747,12,53777,53803,12,53833,53859,12,53889,53915,12,53945,53971,12,54001,54027,12,54057,54083,12,54113,54139,12,54169,54195,12,54225,54251,12,54281,54307,12,54337,54363,12,54393,54419,12,54449,54475,12,54505,54531,12,54561,54587,12,54617,54643,12,54673,54699,12,54729,54755,12,54785,54811,12,54841,54867,12,54897,54923,12,54953,54979,12,55009,55035,12,55065,55091,12,55121,55147,12,55177,55203,12,65024,65039,5,65520,65528,4,66422,66426,5,68152,68154,5,69291,69292,5,69633,69633,5,69747,69748,5,69811,69814,5,69826,69826,5,69932,69932,7,70016,70017,5,70079,70080,7,70095,70095,5,70196,70196,5,70367,70367,5,70402,70403,7,70464,70464,5,70487,70487,5,70709,70711,7,70725,70725,7,70833,70834,7,70843,70844,7,70849,70849,7,71090,71093,5,71103,71104,5,71227,71228,7,71339,71339,5,71344,71349,5,71458,71461,5,71727,71735,5,71985,71989,7,71998,71998,5,72002,72002,7,72154,72155,5,72193,72202,5,72251,72254,5,72281,72283,5,72344,72345,5,72766,72766,7,72874,72880,5,72885,72886,5,73023,73029,5,73104,73105,5,73111,73111,5,92912,92916,5,94095,94098,5,113824,113827,4,119142,119142,7,119155,119162,4,119362,119364,5,121476,121476,5,122888,122904,5,123184,123190,5,125252,125258,5,127183,127183,14,127340,127343,14,127377,127386,14,127491,127503,14,127548,127551,14,127744,127756,14,127761,127761,14,127769,127769,14,127773,127774,14,127780,127788,14,127796,127797,14,127820,127823,14,127869,127869,14,127894,127895,14,127902,127903,14,127943,127943,14,127947,127950,14,127972,127972,14,127988,127988,14,127992,127994,14,128009,128011,14,128019,128019,14,128023,128041,14,128064,128064,14,128102,128107,14,128174,128181,14,128238,128238,14,128246,128247,14,128254,128254,14,128264,128264,14,128278,128299,14,128329,128330,14,128348,128359,14,128371,128377,14,128392,128393,14,128401,128404,14,128421,128421,14,128433,128434,14,128450,128452,14,128476,128478,14,128483,128483,14,128495,128495,14,128506,128506,14,128519,128520,14,128528,128528,14,128534,128534,14,128538,128538,14,128540,128542,14,128544,128549,14,128552,128555,14,128557,128557,14,128560,128563,14,128565,128565,14,128567,128576,14,128581,128591,14,128641,128642,14,128646,128646,14,128648,128648,14,128650,128651,14,128653,128653,14,128655,128655,14,128657,128659,14,128661,128661,14,128663,128663,14,128665,128666,14,128674,128674,14,128676,128677,14,128679,128685,14,128690,128690,14,128694,128694,14,128697,128702,14,128704,128704,14,128710,128714,14,128716,128716,14,128720,128720,14,128723,128724,14,128726,128727,14,128733,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,129008,129008,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,129661,129663,14,129667,129670,14,129680,129685,14,129705,129708,14,129712,129718,14,129723,129727,14,129731,129733,14,129744,129750,14,129754,129759,14,129768,129775,14,129783,129791,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,2192,2193,1,2250,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,3132,3132,5,3137,3140,7,3146,3149,5,3170,3171,5,3202,3203,7,3262,3262,7,3264,3265,7,3267,3268,7,3271,3272,7,3276,3277,5,3298,3299,5,3330,3331,7,3390,3390,5,3393,3396,5,3402,3404,7,3406,3406,1,3426,3427,5,3458,3459,7,3535,3535,5,3538,3540,5,3544,3550,7,3570,3571,7,3635,3635,7,3655,3662,5,3763,3763,7,3784,3789,5,3893,3893,5,3897,3897,5,3953,3966,5,3968,3972,5,3981,3991,5,4038,4038,5,4145,4145,7,4153,4154,5,4157,4158,5,4184,4185,5,4209,4212,5,4228,4228,7,4237,4237,5,4352,4447,8,4520,4607,10,5906,5908,5,5938,5939,5,5970,5971,5,6068,6069,5,6071,6077,5,6086,6086,5,6089,6099,5,6155,6157,5,6159,6159,5,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,6862,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,7679,5,8204,8204,5,8206,8207,4,8233,8233,4,8252,8252,14,8288,8292,4,8294,8303,4,8413,8416,5,8418,8420,5,8482,8482,14,8596,8601,14,8986,8987,14,9096,9096,14,9193,9196,14,9199,9199,14,9201,9202,14,9208,9210,14,9642,9643,14,9664,9664,14,9728,9729,14,9732,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,9775,9775,14,9784,9785,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,9874,14,9876,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,9934,14,9936,9936,14,9938,9938,14,9940,9940,14,9961,9961,14,9963,9967,14,9970,9971,14,9973,9973,14,9975,9977,14,9979,9980,14,9982,9985,14,9987,9988,14,9992,9996,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,10083,14,10085,10087,14,10145,10145,14,10175,10175,14,11013,11015,14,11088,11088,14,11503,11505,5,11744,11775,5,12334,12335,5,12349,12349,14,12951,12951,14,42607,42607,5,42612,42621,5,42736,42737,5,43014,43014,5,43043,43044,7,43047,43047,7,43136,43137,7,43204,43205,5,43263,43263,5,43335,43345,5,43360,43388,8,43395,43395,7,43444,43445,7,43450,43451,7,43454,43456,7,43561,43566,5,43569,43570,5,43573,43574,5,43596,43596,5,43644,43644,5,43698,43700,5,43710,43711,5,43755,43755,7,43758,43759,7,43766,43766,5,44005,44005,5,44008,44008,5,44012,44012,7,44032,44032,11,44060,44060,11,44088,44088,11,44116,44116,11,44144,44144,11,44172,44172,11,44200,44200,11,44228,44228,11,44256,44256,11,44284,44284,11,44312,44312,11,44340,44340,11,44368,44368,11,44396,44396,11,44424,44424,11,44452,44452,11,44480,44480,11,44508,44508,11,44536,44536,11,44564,44564,11,44592,44592,11,44620,44620,11,44648,44648,11,44676,44676,11,44704,44704,11,44732,44732,11,44760,44760,11,44788,44788,11,44816,44816,11,44844,44844,11,44872,44872,11,44900,44900,11,44928,44928,11,44956,44956,11,44984,44984,11,45012,45012,11,45040,45040,11,45068,45068,11,45096,45096,11,45124,45124,11,45152,45152,11,45180,45180,11,45208,45208,11,45236,45236,11,45264,45264,11,45292,45292,11,45320,45320,11,45348,45348,11,45376,45376,11,45404,45404,11,45432,45432,11,45460,45460,11,45488,45488,11,45516,45516,11,45544,45544,11,45572,45572,11,45600,45600,11,45628,45628,11,45656,45656,11,45684,45684,11,45712,45712,11,45740,45740,11,45768,45768,11,45796,45796,11,45824,45824,11,45852,45852,11,45880,45880,11,45908,45908,11,45936,45936,11,45964,45964,11,45992,45992,11,46020,46020,11,46048,46048,11,46076,46076,11,46104,46104,11,46132,46132,11,46160,46160,11,46188,46188,11,46216,46216,11,46244,46244,11,46272,46272,11,46300,46300,11,46328,46328,11,46356,46356,11,46384,46384,11,46412,46412,11,46440,46440,11,46468,46468,11,46496,46496,11,46524,46524,11,46552,46552,11,46580,46580,11,46608,46608,11,46636,46636,11,46664,46664,11,46692,46692,11,46720,46720,11,46748,46748,11,46776,46776,11,46804,46804,11,46832,46832,11,46860,46860,11,46888,46888,11,46916,46916,11,46944,46944,11,46972,46972,11,47000,47000,11,47028,47028,11,47056,47056,11,47084,47084,11,47112,47112,11,47140,47140,11,47168,47168,11,47196,47196,11,47224,47224,11,47252,47252,11,47280,47280,11,47308,47308,11,47336,47336,11,47364,47364,11,47392,47392,11,47420,47420,11,47448,47448,11,47476,47476,11,47504,47504,11,47532,47532,11,47560,47560,11,47588,47588,11,47616,47616,11,47644,47644,11,47672,47672,11,47700,47700,11,47728,47728,11,47756,47756,11,47784,47784,11,47812,47812,11,47840,47840,11,47868,47868,11,47896,47896,11,47924,47924,11,47952,47952,11,47980,47980,11,48008,48008,11,48036,48036,11,48064,48064,11,48092,48092,11,48120,48120,11,48148,48148,11,48176,48176,11,48204,48204,11,48232,48232,11,48260,48260,11,48288,48288,11,48316,48316,11,48344,48344,11,48372,48372,11,48400,48400,11,48428,48428,11,48456,48456,11,48484,48484,11,48512,48512,11,48540,48540,11,48568,48568,11,48596,48596,11,48624,48624,11,48652,48652,11,48680,48680,11,48708,48708,11,48736,48736,11,48764,48764,11,48792,48792,11,48820,48820,11,48848,48848,11,48876,48876,11,48904,48904,11,48932,48932,11,48960,48960,11,48988,48988,11,49016,49016,11,49044,49044,11,49072,49072,11,49100,49100,11,49128,49128,11,49156,49156,11,49184,49184,11,49212,49212,11,49240,49240,11,49268,49268,11,49296,49296,11,49324,49324,11,49352,49352,11,49380,49380,11,49408,49408,11,49436,49436,11,49464,49464,11,49492,49492,11,49520,49520,11,49548,49548,11,49576,49576,11,49604,49604,11,49632,49632,11,49660,49660,11,49688,49688,11,49716,49716,11,49744,49744,11,49772,49772,11,49800,49800,11,49828,49828,11,49856,49856,11,49884,49884,11,49912,49912,11,49940,49940,11,49968,49968,11,49996,49996,11,50024,50024,11,50052,50052,11,50080,50080,11,50108,50108,11,50136,50136,11,50164,50164,11,50192,50192,11,50220,50220,11,50248,50248,11,50276,50276,11,50304,50304,11,50332,50332,11,50360,50360,11,50388,50388,11,50416,50416,11,50444,50444,11,50472,50472,11,50500,50500,11,50528,50528,11,50556,50556,11,50584,50584,11,50612,50612,11,50640,50640,11,50668,50668,11,50696,50696,11,50724,50724,11,50752,50752,11,50780,50780,11,50808,50808,11,50836,50836,11,50864,50864,11,50892,50892,11,50920,50920,11,50948,50948,11,50976,50976,11,51004,51004,11,51032,51032,11,51060,51060,11,51088,51088,11,51116,51116,11,51144,51144,11,51172,51172,11,51200,51200,11,51228,51228,11,51256,51256,11,51284,51284,11,51312,51312,11,51340,51340,11,51368,51368,11,51396,51396,11,51424,51424,11,51452,51452,11,51480,51480,11,51508,51508,11,51536,51536,11,51564,51564,11,51592,51592,11,51620,51620,11,51648,51648,11,51676,51676,11,51704,51704,11,51732,51732,11,51760,51760,11,51788,51788,11,51816,51816,11,51844,51844,11,51872,51872,11,51900,51900,11,51928,51928,11,51956,51956,11,51984,51984,11,52012,52012,11,52040,52040,11,52068,52068,11,52096,52096,11,52124,52124,11,52152,52152,11,52180,52180,11,52208,52208,11,52236,52236,11,52264,52264,11,52292,52292,11,52320,52320,11,52348,52348,11,52376,52376,11,52404,52404,11,52432,52432,11,52460,52460,11,52488,52488,11,52516,52516,11,52544,52544,11,52572,52572,11,52600,52600,11,52628,52628,11,52656,52656,11,52684,52684,11,52712,52712,11,52740,52740,11,52768,52768,11,52796,52796,11,52824,52824,11,52852,52852,11,52880,52880,11,52908,52908,11,52936,52936,11,52964,52964,11,52992,52992,11,53020,53020,11,53048,53048,11,53076,53076,11,53104,53104,11,53132,53132,11,53160,53160,11,53188,53188,11,53216,53216,11,53244,53244,11,53272,53272,11,53300,53300,11,53328,53328,11,53356,53356,11,53384,53384,11,53412,53412,11,53440,53440,11,53468,53468,11,53496,53496,11,53524,53524,11,53552,53552,11,53580,53580,11,53608,53608,11,53636,53636,11,53664,53664,11,53692,53692,11,53720,53720,11,53748,53748,11,53776,53776,11,53804,53804,11,53832,53832,11,53860,53860,11,53888,53888,11,53916,53916,11,53944,53944,11,53972,53972,11,54000,54000,11,54028,54028,11,54056,54056,11,54084,54084,11,54112,54112,11,54140,54140,11,54168,54168,11,54196,54196,11,54224,54224,11,54252,54252,11,54280,54280,11,54308,54308,11,54336,54336,11,54364,54364,11,54392,54392,11,54420,54420,11,54448,54448,11,54476,54476,11,54504,54504,11,54532,54532,11,54560,54560,11,54588,54588,11,54616,54616,11,54644,54644,11,54672,54672,11,54700,54700,11,54728,54728,11,54756,54756,11,54784,54784,11,54812,54812,11,54840,54840,11,54868,54868,11,54896,54896,11,54924,54924,11,54952,54952,11,54980,54980,11,55008,55008,11,55036,55036,11,55064,55064,11,55092,55092,11,55120,55120,11,55148,55148,11,55176,55176,11,55216,55238,9,64286,64286,5,65056,65071,5,65438,65439,5,65529,65531,4,66272,66272,5,68097,68099,5,68108,68111,5,68159,68159,5,68900,68903,5,69446,69456,5,69632,69632,7,69634,69634,7,69744,69744,5,69759,69761,5,69808,69810,7,69815,69816,7,69821,69821,1,69837,69837,1,69927,69931,5,69933,69940,5,70003,70003,5,70018,70018,7,70070,70078,5,70082,70083,1,70094,70094,7,70188,70190,7,70194,70195,7,70197,70197,7,70206,70206,5,70368,70370,7,70400,70401,5,70459,70460,5,70463,70463,7,70465,70468,7,70475,70477,7,70498,70499,7,70512,70516,5,70712,70719,5,70722,70724,5,70726,70726,5,70832,70832,5,70835,70840,5,70842,70842,5,70845,70845,5,70847,70848,5,70850,70851,5,71088,71089,7,71096,71099,7,71102,71102,7,71132,71133,5,71219,71226,5,71229,71229,5,71231,71232,5,71340,71340,7,71342,71343,7,71350,71350,7,71453,71455,5,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,118528,118573,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,123566,123566,5,125136,125142,5,126976,126979,14,126981,127182,14,127184,127231,14,127279,127279,14,127344,127345,14,127374,127374,14,127405,127461,14,127489,127490,14,127514,127514,14,127538,127546,14,127561,127567,14,127570,127743,14,127757,127758,14,127760,127760,14,127762,127762,14,127766,127768,14,127770,127770,14,127772,127772,14,127775,127776,14,127778,127779,14,127789,127791,14,127794,127795,14,127798,127798,14,127819,127819,14,127824,127824,14,127868,127868,14,127870,127871,14,127892,127893,14,127896,127896,14,127900,127901,14,127904,127940,14,127942,127942,14,127944,127944,14,127946,127946,14,127951,127955,14,127968,127971,14,127973,127984,14,127987,127987,14,127989,127989,14,127991,127991,14,127995,127999,5,128008,128008,14,128012,128014,14,128017,128018,14,128020,128020,14,128022,128022,14,128042,128042,14,128063,128063,14,128065,128065,14,128101,128101,14,128108,128109,14,128173,128173,14,128182,128183,14,128236,128237,14,128239,128239,14,128245,128245,14,128248,128248,14,128253,128253,14,128255,128258,14,128260,128263,14,128265,128265,14,128277,128277,14,128300,128301,14,128326,128328,14,128331,128334,14,128336,128347,14,128360,128366,14,128369,128370,14,128378,128378,14,128391,128391,14,128394,128397,14,128400,128400,14,128405,128406,14,128420,128420,14,128422,128423,14,128425,128432,14,128435,128443,14,128445,128449,14,128453,128464,14,128468,128475,14,128479,128480,14,128482,128482,14,128484,128487,14,128489,128494,14,128496,128498,14,128500,128505,14,128507,128511,14,128513,128518,14,128521,128525,14,128527,128527,14,128529,128529,14,128533,128533,14,128535,128535,14,128537,128537,14]');
+}
+//#endregion
+/**
+ * Computes the offset after performing a left delete on the given string,
+ * while considering unicode grapheme/emoji rules.
+*/
+function getLeftDeleteOffset(offset, str) {
+ if (offset === 0) {
+ return 0;
+ }
+ // Try to delete emoji part.
+ const emojiOffset = getOffsetBeforeLastEmojiComponent(offset, str);
+ if (emojiOffset !== undefined) {
+ return emojiOffset;
+ }
+ // Otherwise, just skip a single code point.
+ const iterator = new CodePointIterator(str, offset);
+ iterator.prevCodePoint();
+ return iterator.offset;
+}
+function getOffsetBeforeLastEmojiComponent(initialOffset, str) {
+ // See https://www.unicode.org/reports/tr51/tr51-14.html#EBNF_and_Regex for the
+ // structure of emojis.
+ const iterator = new CodePointIterator(str, initialOffset);
+ let codePoint = iterator.prevCodePoint();
+ // Skip modifiers
+ while ((isEmojiModifier(codePoint) || codePoint === 65039 /* CodePoint.emojiVariantSelector */ || codePoint === 8419 /* CodePoint.enclosingKeyCap */)) {
+ if (iterator.offset === 0) {
+ // Cannot skip modifier, no preceding emoji base.
+ return undefined;
+ }
+ codePoint = iterator.prevCodePoint();
+ }
+ // Expect base emoji
+ if (!isEmojiImprecise(codePoint)) {
+ // Unexpected code point, not a valid emoji.
+ return undefined;
+ }
+ let resultOffset = iterator.offset;
+ if (resultOffset > 0) {
+ // Skip optional ZWJ code points that combine multiple emojis.
+ // In theory, we should check if that ZWJ actually combines multiple emojis
+ // to prevent deleting ZWJs in situations we didn't account for.
+ const optionalZwjCodePoint = iterator.prevCodePoint();
+ if (optionalZwjCodePoint === 8205 /* CodePoint.zwj */) {
+ resultOffset = iterator.offset;
+ }
+ }
+ return resultOffset;
+}
+function isEmojiModifier(codePoint) {
+ return 0x1F3FB <= codePoint && codePoint <= 0x1F3FF;
+}
+const noBreakWhitespace = '\xa0';
+class AmbiguousCharacters {
+ static getInstance(locales) {
+ return _a.cache.get(Array.from(locales));
+ }
+ static getLocales() {
+ return _a._locales.value;
+ }
+ constructor(confusableDictionary) {
+ this.confusableDictionary = confusableDictionary;
+ }
+ isAmbiguous(codePoint) {
+ return this.confusableDictionary.has(codePoint);
+ }
+ /**
+ * Returns the non basic ASCII code point that the given code point can be confused,
+ * or undefined if such code point does note exist.
+ */
+ getPrimaryConfusable(codePoint) {
+ return this.confusableDictionary.get(codePoint);
+ }
+ getConfusableCodePoints() {
+ return new Set(this.confusableDictionary.keys());
+ }
+}
+_a = AmbiguousCharacters;
+AmbiguousCharacters.ambiguousCharacterData = new _lazy_js__WEBPACK_IMPORTED_MODULE_1__.Lazy(() => {
+ // Generated using https://github.com/hediet/vscode-unicode-data
+ // Stored as key1, value1, key2, value2, ...
+ return JSON.parse('{\"_common\":[8232,32,8233,32,5760,32,8192,32,8193,32,8194,32,8195,32,8196,32,8197,32,8198,32,8200,32,8201,32,8202,32,8287,32,8199,32,8239,32,2042,95,65101,95,65102,95,65103,95,8208,45,8209,45,8210,45,65112,45,1748,45,8259,45,727,45,8722,45,10134,45,11450,45,1549,44,1643,44,8218,44,184,44,42233,44,894,59,2307,58,2691,58,1417,58,1795,58,1796,58,5868,58,65072,58,6147,58,6153,58,8282,58,1475,58,760,58,42889,58,8758,58,720,58,42237,58,451,33,11601,33,660,63,577,63,2429,63,5038,63,42731,63,119149,46,8228,46,1793,46,1794,46,42510,46,68176,46,1632,46,1776,46,42232,46,1373,96,65287,96,8219,96,8242,96,1370,96,1523,96,8175,96,65344,96,900,96,8189,96,8125,96,8127,96,8190,96,697,96,884,96,712,96,714,96,715,96,756,96,699,96,701,96,700,96,702,96,42892,96,1497,96,2036,96,2037,96,5194,96,5836,96,94033,96,94034,96,65339,91,10088,40,10098,40,12308,40,64830,40,65341,93,10089,41,10099,41,12309,41,64831,41,10100,123,119060,123,10101,125,65342,94,8270,42,1645,42,8727,42,66335,42,5941,47,8257,47,8725,47,8260,47,9585,47,10187,47,10744,47,119354,47,12755,47,12339,47,11462,47,20031,47,12035,47,65340,92,65128,92,8726,92,10189,92,10741,92,10745,92,119311,92,119355,92,12756,92,20022,92,12034,92,42872,38,708,94,710,94,5869,43,10133,43,66203,43,8249,60,10094,60,706,60,119350,60,5176,60,5810,60,5120,61,11840,61,12448,61,42239,61,8250,62,10095,62,707,62,119351,62,5171,62,94015,62,8275,126,732,126,8128,126,8764,126,65372,124,65293,45,120784,50,120794,50,120804,50,120814,50,120824,50,130034,50,42842,50,423,50,1000,50,42564,50,5311,50,42735,50,119302,51,120785,51,120795,51,120805,51,120815,51,120825,51,130035,51,42923,51,540,51,439,51,42858,51,11468,51,1248,51,94011,51,71882,51,120786,52,120796,52,120806,52,120816,52,120826,52,130036,52,5070,52,71855,52,120787,53,120797,53,120807,53,120817,53,120827,53,130037,53,444,53,71867,53,120788,54,120798,54,120808,54,120818,54,120828,54,130038,54,11474,54,5102,54,71893,54,119314,55,120789,55,120799,55,120809,55,120819,55,120829,55,130039,55,66770,55,71878,55,2819,56,2538,56,2666,56,125131,56,120790,56,120800,56,120810,56,120820,56,120830,56,130040,56,547,56,546,56,66330,56,2663,57,2920,57,2541,57,3437,57,120791,57,120801,57,120811,57,120821,57,120831,57,130041,57,42862,57,11466,57,71884,57,71852,57,71894,57,9082,97,65345,97,119834,97,119886,97,119938,97,119990,97,120042,97,120094,97,120146,97,120198,97,120250,97,120302,97,120354,97,120406,97,120458,97,593,97,945,97,120514,97,120572,97,120630,97,120688,97,120746,97,65313,65,119808,65,119860,65,119912,65,119964,65,120016,65,120068,65,120120,65,120172,65,120224,65,120276,65,120328,65,120380,65,120432,65,913,65,120488,65,120546,65,120604,65,120662,65,120720,65,5034,65,5573,65,42222,65,94016,65,66208,65,119835,98,119887,98,119939,98,119991,98,120043,98,120095,98,120147,98,120199,98,120251,98,120303,98,120355,98,120407,98,120459,98,388,98,5071,98,5234,98,5551,98,65314,66,8492,66,119809,66,119861,66,119913,66,120017,66,120069,66,120121,66,120173,66,120225,66,120277,66,120329,66,120381,66,120433,66,42932,66,914,66,120489,66,120547,66,120605,66,120663,66,120721,66,5108,66,5623,66,42192,66,66178,66,66209,66,66305,66,65347,99,8573,99,119836,99,119888,99,119940,99,119992,99,120044,99,120096,99,120148,99,120200,99,120252,99,120304,99,120356,99,120408,99,120460,99,7428,99,1010,99,11429,99,43951,99,66621,99,128844,67,71922,67,71913,67,65315,67,8557,67,8450,67,8493,67,119810,67,119862,67,119914,67,119966,67,120018,67,120174,67,120226,67,120278,67,120330,67,120382,67,120434,67,1017,67,11428,67,5087,67,42202,67,66210,67,66306,67,66581,67,66844,67,8574,100,8518,100,119837,100,119889,100,119941,100,119993,100,120045,100,120097,100,120149,100,120201,100,120253,100,120305,100,120357,100,120409,100,120461,100,1281,100,5095,100,5231,100,42194,100,8558,68,8517,68,119811,68,119863,68,119915,68,119967,68,120019,68,120071,68,120123,68,120175,68,120227,68,120279,68,120331,68,120383,68,120435,68,5024,68,5598,68,5610,68,42195,68,8494,101,65349,101,8495,101,8519,101,119838,101,119890,101,119942,101,120046,101,120098,101,120150,101,120202,101,120254,101,120306,101,120358,101,120410,101,120462,101,43826,101,1213,101,8959,69,65317,69,8496,69,119812,69,119864,69,119916,69,120020,69,120072,69,120124,69,120176,69,120228,69,120280,69,120332,69,120384,69,120436,69,917,69,120492,69,120550,69,120608,69,120666,69,120724,69,11577,69,5036,69,42224,69,71846,69,71854,69,66182,69,119839,102,119891,102,119943,102,119995,102,120047,102,120099,102,120151,102,120203,102,120255,102,120307,102,120359,102,120411,102,120463,102,43829,102,42905,102,383,102,7837,102,1412,102,119315,70,8497,70,119813,70,119865,70,119917,70,120021,70,120073,70,120125,70,120177,70,120229,70,120281,70,120333,70,120385,70,120437,70,42904,70,988,70,120778,70,5556,70,42205,70,71874,70,71842,70,66183,70,66213,70,66853,70,65351,103,8458,103,119840,103,119892,103,119944,103,120048,103,120100,103,120152,103,120204,103,120256,103,120308,103,120360,103,120412,103,120464,103,609,103,7555,103,397,103,1409,103,119814,71,119866,71,119918,71,119970,71,120022,71,120074,71,120126,71,120178,71,120230,71,120282,71,120334,71,120386,71,120438,71,1292,71,5056,71,5107,71,42198,71,65352,104,8462,104,119841,104,119945,104,119997,104,120049,104,120101,104,120153,104,120205,104,120257,104,120309,104,120361,104,120413,104,120465,104,1211,104,1392,104,5058,104,65320,72,8459,72,8460,72,8461,72,119815,72,119867,72,119919,72,120023,72,120179,72,120231,72,120283,72,120335,72,120387,72,120439,72,919,72,120494,72,120552,72,120610,72,120668,72,120726,72,11406,72,5051,72,5500,72,42215,72,66255,72,731,105,9075,105,65353,105,8560,105,8505,105,8520,105,119842,105,119894,105,119946,105,119998,105,120050,105,120102,105,120154,105,120206,105,120258,105,120310,105,120362,105,120414,105,120466,105,120484,105,618,105,617,105,953,105,8126,105,890,105,120522,105,120580,105,120638,105,120696,105,120754,105,1110,105,42567,105,1231,105,43893,105,5029,105,71875,105,65354,106,8521,106,119843,106,119895,106,119947,106,119999,106,120051,106,120103,106,120155,106,120207,106,120259,106,120311,106,120363,106,120415,106,120467,106,1011,106,1112,106,65322,74,119817,74,119869,74,119921,74,119973,74,120025,74,120077,74,120129,74,120181,74,120233,74,120285,74,120337,74,120389,74,120441,74,42930,74,895,74,1032,74,5035,74,5261,74,42201,74,119844,107,119896,107,119948,107,120000,107,120052,107,120104,107,120156,107,120208,107,120260,107,120312,107,120364,107,120416,107,120468,107,8490,75,65323,75,119818,75,119870,75,119922,75,119974,75,120026,75,120078,75,120130,75,120182,75,120234,75,120286,75,120338,75,120390,75,120442,75,922,75,120497,75,120555,75,120613,75,120671,75,120729,75,11412,75,5094,75,5845,75,42199,75,66840,75,1472,108,8739,73,9213,73,65512,73,1633,108,1777,73,66336,108,125127,108,120783,73,120793,73,120803,73,120813,73,120823,73,130033,73,65321,73,8544,73,8464,73,8465,73,119816,73,119868,73,119920,73,120024,73,120128,73,120180,73,120232,73,120284,73,120336,73,120388,73,120440,73,65356,108,8572,73,8467,108,119845,108,119897,108,119949,108,120001,108,120053,108,120105,73,120157,73,120209,73,120261,73,120313,73,120365,73,120417,73,120469,73,448,73,120496,73,120554,73,120612,73,120670,73,120728,73,11410,73,1030,73,1216,73,1493,108,1503,108,1575,108,126464,108,126592,108,65166,108,65165,108,1994,108,11599,73,5825,73,42226,73,93992,73,66186,124,66313,124,119338,76,8556,76,8466,76,119819,76,119871,76,119923,76,120027,76,120079,76,120131,76,120183,76,120235,76,120287,76,120339,76,120391,76,120443,76,11472,76,5086,76,5290,76,42209,76,93974,76,71843,76,71858,76,66587,76,66854,76,65325,77,8559,77,8499,77,119820,77,119872,77,119924,77,120028,77,120080,77,120132,77,120184,77,120236,77,120288,77,120340,77,120392,77,120444,77,924,77,120499,77,120557,77,120615,77,120673,77,120731,77,1018,77,11416,77,5047,77,5616,77,5846,77,42207,77,66224,77,66321,77,119847,110,119899,110,119951,110,120003,110,120055,110,120107,110,120159,110,120211,110,120263,110,120315,110,120367,110,120419,110,120471,110,1400,110,1404,110,65326,78,8469,78,119821,78,119873,78,119925,78,119977,78,120029,78,120081,78,120185,78,120237,78,120289,78,120341,78,120393,78,120445,78,925,78,120500,78,120558,78,120616,78,120674,78,120732,78,11418,78,42208,78,66835,78,3074,111,3202,111,3330,111,3458,111,2406,111,2662,111,2790,111,3046,111,3174,111,3302,111,3430,111,3664,111,3792,111,4160,111,1637,111,1781,111,65359,111,8500,111,119848,111,119900,111,119952,111,120056,111,120108,111,120160,111,120212,111,120264,111,120316,111,120368,111,120420,111,120472,111,7439,111,7441,111,43837,111,959,111,120528,111,120586,111,120644,111,120702,111,120760,111,963,111,120532,111,120590,111,120648,111,120706,111,120764,111,11423,111,4351,111,1413,111,1505,111,1607,111,126500,111,126564,111,126596,111,65259,111,65260,111,65258,111,65257,111,1726,111,64428,111,64429,111,64427,111,64426,111,1729,111,64424,111,64425,111,64423,111,64422,111,1749,111,3360,111,4125,111,66794,111,71880,111,71895,111,66604,111,1984,79,2534,79,2918,79,12295,79,70864,79,71904,79,120782,79,120792,79,120802,79,120812,79,120822,79,130032,79,65327,79,119822,79,119874,79,119926,79,119978,79,120030,79,120082,79,120134,79,120186,79,120238,79,120290,79,120342,79,120394,79,120446,79,927,79,120502,79,120560,79,120618,79,120676,79,120734,79,11422,79,1365,79,11604,79,4816,79,2848,79,66754,79,42227,79,71861,79,66194,79,66219,79,66564,79,66838,79,9076,112,65360,112,119849,112,119901,112,119953,112,120005,112,120057,112,120109,112,120161,112,120213,112,120265,112,120317,112,120369,112,120421,112,120473,112,961,112,120530,112,120544,112,120588,112,120602,112,120646,112,120660,112,120704,112,120718,112,120762,112,120776,112,11427,112,65328,80,8473,80,119823,80,119875,80,119927,80,119979,80,120031,80,120083,80,120187,80,120239,80,120291,80,120343,80,120395,80,120447,80,929,80,120504,80,120562,80,120620,80,120678,80,120736,80,11426,80,5090,80,5229,80,42193,80,66197,80,119850,113,119902,113,119954,113,120006,113,120058,113,120110,113,120162,113,120214,113,120266,113,120318,113,120370,113,120422,113,120474,113,1307,113,1379,113,1382,113,8474,81,119824,81,119876,81,119928,81,119980,81,120032,81,120084,81,120188,81,120240,81,120292,81,120344,81,120396,81,120448,81,11605,81,119851,114,119903,114,119955,114,120007,114,120059,114,120111,114,120163,114,120215,114,120267,114,120319,114,120371,114,120423,114,120475,114,43847,114,43848,114,7462,114,11397,114,43905,114,119318,82,8475,82,8476,82,8477,82,119825,82,119877,82,119929,82,120033,82,120189,82,120241,82,120293,82,120345,82,120397,82,120449,82,422,82,5025,82,5074,82,66740,82,5511,82,42211,82,94005,82,65363,115,119852,115,119904,115,119956,115,120008,115,120060,115,120112,115,120164,115,120216,115,120268,115,120320,115,120372,115,120424,115,120476,115,42801,115,445,115,1109,115,43946,115,71873,115,66632,115,65331,83,119826,83,119878,83,119930,83,119982,83,120034,83,120086,83,120138,83,120190,83,120242,83,120294,83,120346,83,120398,83,120450,83,1029,83,1359,83,5077,83,5082,83,42210,83,94010,83,66198,83,66592,83,119853,116,119905,116,119957,116,120009,116,120061,116,120113,116,120165,116,120217,116,120269,116,120321,116,120373,116,120425,116,120477,116,8868,84,10201,84,128872,84,65332,84,119827,84,119879,84,119931,84,119983,84,120035,84,120087,84,120139,84,120191,84,120243,84,120295,84,120347,84,120399,84,120451,84,932,84,120507,84,120565,84,120623,84,120681,84,120739,84,11430,84,5026,84,42196,84,93962,84,71868,84,66199,84,66225,84,66325,84,119854,117,119906,117,119958,117,120010,117,120062,117,120114,117,120166,117,120218,117,120270,117,120322,117,120374,117,120426,117,120478,117,42911,117,7452,117,43854,117,43858,117,651,117,965,117,120534,117,120592,117,120650,117,120708,117,120766,117,1405,117,66806,117,71896,117,8746,85,8899,85,119828,85,119880,85,119932,85,119984,85,120036,85,120088,85,120140,85,120192,85,120244,85,120296,85,120348,85,120400,85,120452,85,1357,85,4608,85,66766,85,5196,85,42228,85,94018,85,71864,85,8744,118,8897,118,65366,118,8564,118,119855,118,119907,118,119959,118,120011,118,120063,118,120115,118,120167,118,120219,118,120271,118,120323,118,120375,118,120427,118,120479,118,7456,118,957,118,120526,118,120584,118,120642,118,120700,118,120758,118,1141,118,1496,118,71430,118,43945,118,71872,118,119309,86,1639,86,1783,86,8548,86,119829,86,119881,86,119933,86,119985,86,120037,86,120089,86,120141,86,120193,86,120245,86,120297,86,120349,86,120401,86,120453,86,1140,86,11576,86,5081,86,5167,86,42719,86,42214,86,93960,86,71840,86,66845,86,623,119,119856,119,119908,119,119960,119,120012,119,120064,119,120116,119,120168,119,120220,119,120272,119,120324,119,120376,119,120428,119,120480,119,7457,119,1121,119,1309,119,1377,119,71434,119,71438,119,71439,119,43907,119,71919,87,71910,87,119830,87,119882,87,119934,87,119986,87,120038,87,120090,87,120142,87,120194,87,120246,87,120298,87,120350,87,120402,87,120454,87,1308,87,5043,87,5076,87,42218,87,5742,120,10539,120,10540,120,10799,120,65368,120,8569,120,119857,120,119909,120,119961,120,120013,120,120065,120,120117,120,120169,120,120221,120,120273,120,120325,120,120377,120,120429,120,120481,120,5441,120,5501,120,5741,88,9587,88,66338,88,71916,88,65336,88,8553,88,119831,88,119883,88,119935,88,119987,88,120039,88,120091,88,120143,88,120195,88,120247,88,120299,88,120351,88,120403,88,120455,88,42931,88,935,88,120510,88,120568,88,120626,88,120684,88,120742,88,11436,88,11613,88,5815,88,42219,88,66192,88,66228,88,66327,88,66855,88,611,121,7564,121,65369,121,119858,121,119910,121,119962,121,120014,121,120066,121,120118,121,120170,121,120222,121,120274,121,120326,121,120378,121,120430,121,120482,121,655,121,7935,121,43866,121,947,121,8509,121,120516,121,120574,121,120632,121,120690,121,120748,121,1199,121,4327,121,71900,121,65337,89,119832,89,119884,89,119936,89,119988,89,120040,89,120092,89,120144,89,120196,89,120248,89,120300,89,120352,89,120404,89,120456,89,933,89,978,89,120508,89,120566,89,120624,89,120682,89,120740,89,11432,89,1198,89,5033,89,5053,89,42220,89,94019,89,71844,89,66226,89,119859,122,119911,122,119963,122,120015,122,120067,122,120119,122,120171,122,120223,122,120275,122,120327,122,120379,122,120431,122,120483,122,7458,122,43923,122,71876,122,66293,90,71909,90,65338,90,8484,90,8488,90,119833,90,119885,90,119937,90,119989,90,120041,90,120197,90,120249,90,120301,90,120353,90,120405,90,120457,90,918,90,120493,90,120551,90,120609,90,120667,90,120725,90,5059,90,42204,90,71849,90,65282,34,65284,36,65285,37,65286,38,65290,42,65291,43,65294,46,65295,47,65296,48,65297,49,65298,50,65299,51,65300,52,65301,53,65302,54,65303,55,65304,56,65305,57,65308,60,65309,61,65310,62,65312,64,65316,68,65318,70,65319,71,65324,76,65329,81,65330,82,65333,85,65334,86,65335,87,65343,95,65346,98,65348,100,65350,102,65355,107,65357,109,65358,110,65361,113,65362,114,65364,116,65365,117,65367,119,65370,122,65371,123,65373,125,119846,109],\"_default\":[160,32,8211,45,65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\"cs\":[65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\"de\":[65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\"es\":[8211,45,65374,126,65306,58,65281,33,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\"fr\":[65374,126,65306,58,65281,33,8216,96,8245,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\"it\":[160,32,8211,45,65374,126,65306,58,65281,33,8216,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\"ja\":[8211,45,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65292,44,65307,59],\"ko\":[8211,45,65374,126,65306,58,65281,33,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\"pl\":[65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\"pt-BR\":[65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\"qps-ploc\":[160,32,8211,45,65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\"ru\":[65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,305,105,921,73,1009,112,215,120,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\"tr\":[160,32,8211,45,65374,126,65306,58,65281,33,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\"zh-hans\":[65374,126,65306,58,65281,33,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65288,40,65289,41],\"zh-hant\":[8211,45,65374,126,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65307,59]}');
+});
+AmbiguousCharacters.cache = new _cache_js__WEBPACK_IMPORTED_MODULE_0__.LRUCachedFunction((locales) => {
+ function arrayToMap(arr) {
+ const result = new Map();
+ for (let i = 0; i < arr.length; i += 2) {
+ result.set(arr[i], arr[i + 1]);
+ }
+ return result;
+ }
+ function mergeMaps(map1, map2) {
+ const result = new Map(map1);
+ for (const [key, value] of map2) {
+ result.set(key, value);
+ }
+ return result;
+ }
+ function intersectMaps(map1, map2) {
+ if (!map1) {
+ return map2;
+ }
+ const result = new Map();
+ for (const [key, value] of map1) {
+ if (map2.has(key)) {
+ result.set(key, value);
+ }
+ }
+ return result;
+ }
+ const data = _a.ambiguousCharacterData.value;
+ let filteredLocales = locales.filter((l) => !l.startsWith('_') && l in data);
+ if (filteredLocales.length === 0) {
+ filteredLocales = ['_default'];
+ }
+ let languageSpecificMap = undefined;
+ for (const locale of filteredLocales) {
+ const map = arrayToMap(data[locale]);
+ languageSpecificMap = intersectMaps(languageSpecificMap, map);
+ }
+ const commonMap = arrayToMap(data['_common']);
+ const map = mergeMaps(commonMap, languageSpecificMap);
+ return new _a(map);
+});
+AmbiguousCharacters._locales = new _lazy_js__WEBPACK_IMPORTED_MODULE_1__.Lazy(() => Object.keys(_a.ambiguousCharacterData.value).filter((k) => !k.startsWith('_')));
+class InvisibleCharacters {
+ static getRawData() {
+ // Generated using https://github.com/hediet/vscode-unicode-data
+ return JSON.parse('[9,10,11,12,13,32,127,160,173,847,1564,4447,4448,6068,6069,6155,6156,6157,6158,7355,7356,8192,8193,8194,8195,8196,8197,8198,8199,8200,8201,8202,8203,8204,8205,8206,8207,8234,8235,8236,8237,8238,8239,8287,8288,8289,8290,8291,8292,8293,8294,8295,8296,8297,8298,8299,8300,8301,8302,8303,10240,12288,12644,65024,65025,65026,65027,65028,65029,65030,65031,65032,65033,65034,65035,65036,65037,65038,65039,65279,65440,65520,65521,65522,65523,65524,65525,65526,65527,65528,65532,78844,119155,119156,119157,119158,119159,119160,119161,119162,917504,917505,917506,917507,917508,917509,917510,917511,917512,917513,917514,917515,917516,917517,917518,917519,917520,917521,917522,917523,917524,917525,917526,917527,917528,917529,917530,917531,917532,917533,917534,917535,917536,917537,917538,917539,917540,917541,917542,917543,917544,917545,917546,917547,917548,917549,917550,917551,917552,917553,917554,917555,917556,917557,917558,917559,917560,917561,917562,917563,917564,917565,917566,917567,917568,917569,917570,917571,917572,917573,917574,917575,917576,917577,917578,917579,917580,917581,917582,917583,917584,917585,917586,917587,917588,917589,917590,917591,917592,917593,917594,917595,917596,917597,917598,917599,917600,917601,917602,917603,917604,917605,917606,917607,917608,917609,917610,917611,917612,917613,917614,917615,917616,917617,917618,917619,917620,917621,917622,917623,917624,917625,917626,917627,917628,917629,917630,917631,917760,917761,917762,917763,917764,917765,917766,917767,917768,917769,917770,917771,917772,917773,917774,917775,917776,917777,917778,917779,917780,917781,917782,917783,917784,917785,917786,917787,917788,917789,917790,917791,917792,917793,917794,917795,917796,917797,917798,917799,917800,917801,917802,917803,917804,917805,917806,917807,917808,917809,917810,917811,917812,917813,917814,917815,917816,917817,917818,917819,917820,917821,917822,917823,917824,917825,917826,917827,917828,917829,917830,917831,917832,917833,917834,917835,917836,917837,917838,917839,917840,917841,917842,917843,917844,917845,917846,917847,917848,917849,917850,917851,917852,917853,917854,917855,917856,917857,917858,917859,917860,917861,917862,917863,917864,917865,917866,917867,917868,917869,917870,917871,917872,917873,917874,917875,917876,917877,917878,917879,917880,917881,917882,917883,917884,917885,917886,917887,917888,917889,917890,917891,917892,917893,917894,917895,917896,917897,917898,917899,917900,917901,917902,917903,917904,917905,917906,917907,917908,917909,917910,917911,917912,917913,917914,917915,917916,917917,917918,917919,917920,917921,917922,917923,917924,917925,917926,917927,917928,917929,917930,917931,917932,917933,917934,917935,917936,917937,917938,917939,917940,917941,917942,917943,917944,917945,917946,917947,917948,917949,917950,917951,917952,917953,917954,917955,917956,917957,917958,917959,917960,917961,917962,917963,917964,917965,917966,917967,917968,917969,917970,917971,917972,917973,917974,917975,917976,917977,917978,917979,917980,917981,917982,917983,917984,917985,917986,917987,917988,917989,917990,917991,917992,917993,917994,917995,917996,917997,917998,917999]');
+ }
+ static getData() {
+ if (!this._data) {
+ this._data = new Set(InvisibleCharacters.getRawData());
+ }
+ return this._data;
+ }
+ static isInvisibleCharacter(codePoint) {
+ return InvisibleCharacters.getData().has(codePoint);
+ }
+ static get codePoints() {
+ return InvisibleCharacters.getData();
+ }
+}
+InvisibleCharacters._data = undefined;
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/types.js":
+/*!****************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/types.js ***!
+ \****************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ assertIsDefined: () => (/* binding */ assertIsDefined),
+/* harmony export */ assertType: () => (/* binding */ assertType),
+/* harmony export */ isBoolean: () => (/* binding */ isBoolean),
+/* harmony export */ isDefined: () => (/* binding */ isDefined),
+/* harmony export */ isFunction: () => (/* binding */ isFunction),
+/* harmony export */ isIterable: () => (/* binding */ isIterable),
+/* harmony export */ isNumber: () => (/* binding */ isNumber),
+/* harmony export */ isObject: () => (/* binding */ isObject),
+/* harmony export */ isString: () => (/* binding */ isString),
+/* harmony export */ isTypedArray: () => (/* binding */ isTypedArray),
+/* harmony export */ isUndefined: () => (/* binding */ isUndefined),
+/* harmony export */ isUndefinedOrNull: () => (/* binding */ isUndefinedOrNull),
+/* harmony export */ validateConstraint: () => (/* binding */ validateConstraint),
+/* harmony export */ validateConstraints: () => (/* binding */ validateConstraints)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+/**
+ * @returns whether the provided parameter is a JavaScript String or not.
+ */
+function isString(str) {
+ return (typeof str === 'string');
+}
+/**
+ * @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 === 'object'
+ && obj !== null
+ && !Array.isArray(obj)
+ && !(obj instanceof RegExp)
+ && !(obj instanceof Date);
+}
+/**
+ * @returns whether the provided parameter is of type `Buffer` or Uint8Array dervived type
+ */
+function isTypedArray(obj) {
+ const TypedArray = Object.getPrototypeOf(Uint8Array);
+ return typeof obj === 'object'
+ && obj instanceof TypedArray;
+}
+/**
+ * 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) {
+ return (typeof obj === 'number' && !isNaN(obj));
+}
+/**
+ * @returns whether the provided parameter is an Iterable, casting to the given generic
+ */
+function isIterable(obj) {
+ return !!obj && typeof obj[Symbol.iterator] === 'function';
+}
+/**
+ * @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 === 'undefined');
+}
+/**
+ * @returns whether the provided parameter is defined.
+ */
+function isDefined(arg) {
+ return !isUndefinedOrNull(arg);
+}
+/**
+ * @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');
+ }
+}
+/**
+ * Asserts that the argument passed in is neither undefined nor null.
+ */
+function assertIsDefined(arg) {
+ if (isUndefinedOrNull(arg)) {
+ throw new Error('Assertion Failed: argument is undefined or null');
+ }
+ return arg;
+}
+/**
+ * @returns whether the provided parameter is a JavaScript Function or not.
+ */
+function isFunction(obj) {
+ return (typeof obj === 'function');
+}
+function validateConstraints(args, constraints) {
+ const len = Math.min(args.length, constraints.length);
+ for (let 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`);
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/uint.js":
+/*!***************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/uint.js ***!
+ \***************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ toUint32: () => (/* binding */ toUint32),
+/* harmony export */ toUint8: () => (/* binding */ toUint8)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * 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 /* Constants.MAX_UINT_8 */) {
+ return 255 /* Constants.MAX_UINT_8 */;
+ }
+ return v | 0;
+}
+function toUint32(v) {
+ if (v < 0) {
+ return 0;
+ }
+ if (v > 4294967295 /* Constants.MAX_UINT_32 */) {
+ return 4294967295 /* Constants.MAX_UINT_32 */;
+ }
+ return v | 0;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/uri.js":
+/*!**************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/uri.js ***!
+ \**************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ URI: () => (/* binding */ URI),
+/* harmony export */ uriToFsPath: () => (/* binding */ uriToFsPath)
+/* harmony export */ });
+/* harmony import */ var _path_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./path.js */ "./node_modules/monaco-editor/esm/vs/base/common/path.js");
+/* harmony import */ var _platform_js__WEBPACK_IMPORTED_MODULE_1__ = __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.
+ *--------------------------------------------------------------------------------------------*/
+
+
+const _schemePattern = /^\w[\w\d+.-]*$/;
+const _singleSlashStart = /^\//;
+const _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;
+}
+const _empty = '';
+const _slash = '/';
+const _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.
+ *
+ * ```txt
+ * foo://example.com:8042/over/there?name=ferret#nose
+ * \_/ \______________/\_________/ \_________/ \__/
+ * | | | | |
+ * scheme authority path query fragment
+ * | _____________________|__
+ * / \ / \
+ * urn:example:animal:ferret:nose
+ * ```
+ */
+class URI {
+ static isUri(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 === 'string'
+ && typeof thing.with === 'function'
+ && typeof thing.toString === 'function';
+ }
+ /**
+ * @internal
+ */
+ constructor(schemeOrData, authority, path, query, fragment, _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);
+ }
+ }
+ // ---- 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 fsPath() {
+ // if (this.scheme !== 'file') {
+ // console.warn(`[UriError] calling fsPath with scheme ${this.scheme}`);
+ // }
+ return uriToFsPath(this, false);
+ }
+ // ---- modify to new -------------------------
+ with(change) {
+ if (!change) {
+ return this;
+ }
+ let { scheme, authority, path, query, fragment } = change;
+ 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.example.com/some/path`,
+ * `file:///usr/home`, or `scheme:with/path`.
+ *
+ * @param value A string which represents an URI (see `URI#toString`).
+ */
+ static parse(value, _strict = false) {
+ const 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`)
+ */
+ static file(path) {
+ let 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_1__.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) {
+ const 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);
+ }
+ /**
+ * Creates new URI from uri components.
+ *
+ * Unless `strict` is `true` the scheme is defaults to be `file`. This function performs
+ * validation and should be used for untrusted uri components retrieved from storage,
+ * user input, command arguments etc
+ */
+ static from(components, strict) {
+ const result = new Uri(components.scheme, components.authority, components.path, components.query, components.fragment, strict);
+ return result;
+ }
+ /**
+ * Join a URI path with path fragments and normalizes the resulting path.
+ *
+ * @param uri The input URI.
+ * @param pathFragment The path fragment to add to the URI path.
+ * @returns The resulting URI.
+ */
+ static joinPath(uri, ...pathFragment) {
+ if (!uri.path) {
+ throw new Error(`[UriError]: cannot call joinPath on URI without path`);
+ }
+ let newPath;
+ if (_platform_js__WEBPACK_IMPORTED_MODULE_1__.isWindows && uri.scheme === 'file') {
+ newPath = URI.file(_path_js__WEBPACK_IMPORTED_MODULE_0__.win32.join(uriToFsPath(uri, true), ...pathFragment)).path;
+ }
+ else {
+ newPath = _path_js__WEBPACK_IMPORTED_MODULE_0__.posix.join(uri.path, ...pathFragment);
+ }
+ return uri.with({ path: newPath });
+ }
+ // ---- 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`
+ */
+ toString(skipEncoding = false) {
+ return _asFormatted(this, skipEncoding);
+ }
+ toJSON() {
+ return this;
+ }
+ static revive(data) {
+ var _a, _b;
+ if (!data) {
+ return data;
+ }
+ else if (data instanceof URI) {
+ return data;
+ }
+ else {
+ const result = new Uri(data);
+ result._formatted = (_a = data.external) !== null && _a !== void 0 ? _a : null;
+ result._fsPath = data._sep === _pathSepMarker ? (_b = data.fsPath) !== null && _b !== void 0 ? _b : null : null;
+ return result;
+ }
+ }
+}
+const _pathSepMarker = _platform_js__WEBPACK_IMPORTED_MODULE_1__.isWindows ? 1 : undefined;
+// This class exists so that URI is compatible with vscode.Uri (API).
+class Uri extends URI {
+ constructor() {
+ super(...arguments);
+ this._formatted = null;
+ this._fsPath = null;
+ }
+ get fsPath() {
+ if (!this._fsPath) {
+ this._fsPath = uriToFsPath(this, false);
+ }
+ return this._fsPath;
+ }
+ toString(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);
+ }
+ }
+ toJSON() {
+ const res = {
+ $mid: 1 /* MarshalledId.Uri */
+ };
+ // 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;
+ }
+ // TODO
+ // this isn't correct and can violate the UriComponents contract but
+ // this is part of the vscode.Uri API and we shouldn't change how that
+ // works anymore
+ 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;
+ }
+}
+// reserved characters: https://tools.ietf.org/html/rfc3986#section-2.2
+const encodeTable = {
+ [58 /* CharCode.Colon */]: '%3A', // gen-delims
+ [47 /* CharCode.Slash */]: '%2F',
+ [63 /* CharCode.QuestionMark */]: '%3F',
+ [35 /* CharCode.Hash */]: '%23',
+ [91 /* CharCode.OpenSquareBracket */]: '%5B',
+ [93 /* CharCode.CloseSquareBracket */]: '%5D',
+ [64 /* CharCode.AtSign */]: '%40',
+ [33 /* CharCode.ExclamationMark */]: '%21', // sub-delims
+ [36 /* CharCode.DollarSign */]: '%24',
+ [38 /* CharCode.Ampersand */]: '%26',
+ [39 /* CharCode.SingleQuote */]: '%27',
+ [40 /* CharCode.OpenParen */]: '%28',
+ [41 /* CharCode.CloseParen */]: '%29',
+ [42 /* CharCode.Asterisk */]: '%2A',
+ [43 /* CharCode.Plus */]: '%2B',
+ [44 /* CharCode.Comma */]: '%2C',
+ [59 /* CharCode.Semicolon */]: '%3B',
+ [61 /* CharCode.Equals */]: '%3D',
+ [32 /* CharCode.Space */]: '%20',
+};
+function encodeURIComponentFast(uriComponent, isPath, isAuthority) {
+ let res = undefined;
+ let nativeEncodePos = -1;
+ for (let pos = 0; pos < uriComponent.length; pos++) {
+ const code = uriComponent.charCodeAt(pos);
+ // unreserved characters: https://tools.ietf.org/html/rfc3986#section-2.3
+ if ((code >= 97 /* CharCode.a */ && code <= 122 /* CharCode.z */)
+ || (code >= 65 /* CharCode.A */ && code <= 90 /* CharCode.Z */)
+ || (code >= 48 /* CharCode.Digit0 */ && code <= 57 /* CharCode.Digit9 */)
+ || code === 45 /* CharCode.Dash */
+ || code === 46 /* CharCode.Period */
+ || code === 95 /* CharCode.Underline */
+ || code === 126 /* CharCode.Tilde */
+ || (isPath && code === 47 /* CharCode.Slash */)
+ || (isAuthority && code === 91 /* CharCode.OpenSquareBracket */)
+ || (isAuthority && code === 93 /* CharCode.CloseSquareBracket */)
+ || (isAuthority && code === 58 /* CharCode.Colon */)) {
+ // 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
+ const 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) {
+ let res = undefined;
+ for (let pos = 0; pos < path.length; pos++) {
+ const code = path.charCodeAt(pos);
+ if (code === 35 /* CharCode.Hash */ || code === 63 /* CharCode.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 uriToFsPath(uri, keepDriveLetterCasing) {
+ let 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 /* CharCode.Slash */
+ && (uri.path.charCodeAt(1) >= 65 /* CharCode.A */ && uri.path.charCodeAt(1) <= 90 /* CharCode.Z */ || uri.path.charCodeAt(1) >= 97 /* CharCode.a */ && uri.path.charCodeAt(1) <= 122 /* CharCode.z */)
+ && uri.path.charCodeAt(2) === 58 /* CharCode.Colon */) {
+ if (!keepDriveLetterCasing) {
+ // windows drive letter: file:///c:/far/boo
+ value = uri.path[1].toLowerCase() + uri.path.substr(2);
+ }
+ else {
+ value = uri.path.substr(1);
+ }
+ }
+ else {
+ // other path
+ value = uri.path;
+ }
+ if (_platform_js__WEBPACK_IMPORTED_MODULE_1__.isWindows) {
+ value = value.replace(/\//g, '\\');
+ }
+ return value;
+}
+/**
+ * Create the external version of a uri
+ */
+function _asFormatted(uri, skipEncoding) {
+ const encoder = !skipEncoding
+ ? encodeURIComponentFast
+ : encodeURIComponentMinimal;
+ let res = '';
+ let { scheme, authority, path, query, fragment } = uri;
+ if (scheme) {
+ res += scheme;
+ res += ':';
+ }
+ if (authority || scheme === 'file') {
+ res += _slash;
+ res += _slash;
+ }
+ if (authority) {
+ let idx = authority.indexOf('@');
+ if (idx !== -1) {
+ // @
+ const userinfo = authority.substr(0, idx);
+ authority = authority.substr(idx + 1);
+ idx = userinfo.lastIndexOf(':');
+ if (idx === -1) {
+ res += encoder(userinfo, false, false);
+ }
+ else {
+ // :@
+ res += encoder(userinfo.substr(0, idx), false, false);
+ res += ':';
+ res += encoder(userinfo.substr(idx + 1), false, true);
+ }
+ res += '@';
+ }
+ authority = authority.toLowerCase();
+ idx = authority.lastIndexOf(':');
+ if (idx === -1) {
+ res += encoder(authority, false, true);
+ }
+ else {
+ // :
+ res += encoder(authority.substr(0, idx), false, true);
+ 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 /* CharCode.Slash */ && path.charCodeAt(2) === 58 /* CharCode.Colon */) {
+ const code = path.charCodeAt(1);
+ if (code >= 65 /* CharCode.A */ && code <= 90 /* CharCode.Z */) {
+ path = `/${String.fromCharCode(code + 32)}:${path.substr(3)}`; // "/c:".length === 3
+ }
+ }
+ else if (path.length >= 2 && path.charCodeAt(1) === 58 /* CharCode.Colon */) {
+ const code = path.charCodeAt(0);
+ if (code >= 65 /* CharCode.A */ && code <= 90 /* CharCode.Z */) {
+ path = `${String.fromCharCode(code + 32)}:${path.substr(2)}`; // "/c:".length === 3
+ }
+ }
+ // encode the rest of the path
+ res += encoder(path, true, false);
+ }
+ if (query) {
+ res += '?';
+ res += encoder(query, false, false);
+ }
+ if (fragment) {
+ res += '#';
+ res += !skipEncoding ? encodeURIComponentFast(fragment, false, 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;
+ }
+ }
+}
+const _rEncodedAsHex = /(%[0-9A-Za-z][0-9A-Za-z])+/g;
+function percentDecode(str) {
+ if (!str.match(_rEncodedAsHex)) {
+ return str;
+ }
+ return str.replace(_rEncodedAsHex, (match) => decodeURIComponentGraceful(match));
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/base/common/worker/simpleWorker.js":
+/*!******************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/base/common/worker/simpleWorker.js ***!
+ \******************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ SimpleWorkerClient: () => (/* binding */ SimpleWorkerClient),
+/* harmony export */ SimpleWorkerServer: () => (/* binding */ SimpleWorkerServer),
+/* harmony export */ create: () => (/* binding */ create),
+/* harmony export */ logOnceWebWorkerWarning: () => (/* binding */ logOnceWebWorkerWarning)
+/* harmony export */ });
+/* harmony import */ var _errors_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../errors.js */ "./node_modules/monaco-editor/esm/vs/base/common/errors.js");
+/* harmony import */ var _event_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../event.js */ "./node_modules/monaco-editor/esm/vs/base/common/event.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 _objects_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../objects.js */ "./node_modules/monaco-editor/esm/vs/base/common/objects.js");
+/* harmony import */ var _platform_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../platform.js */ "./node_modules/monaco-editor/esm/vs/base/common/platform.js");
+/* harmony import */ var _strings_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../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.
+ *--------------------------------------------------------------------------------------------*/
+
+
+
+
+
+
+const INITIALIZE = '$initialize';
+let webWorkerWarningLogged = false;
+function logOnceWebWorkerWarning(err) {
+ if (!_platform_js__WEBPACK_IMPORTED_MODULE_4__.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);
+}
+class RequestMessage {
+ constructor(vsWorker, req, method, args) {
+ this.vsWorker = vsWorker;
+ this.req = req;
+ this.method = method;
+ this.args = args;
+ this.type = 0 /* MessageType.Request */;
+ }
+}
+class ReplyMessage {
+ constructor(vsWorker, seq, res, err) {
+ this.vsWorker = vsWorker;
+ this.seq = seq;
+ this.res = res;
+ this.err = err;
+ this.type = 1 /* MessageType.Reply */;
+ }
+}
+class SubscribeEventMessage {
+ constructor(vsWorker, req, eventName, arg) {
+ this.vsWorker = vsWorker;
+ this.req = req;
+ this.eventName = eventName;
+ this.arg = arg;
+ this.type = 2 /* MessageType.SubscribeEvent */;
+ }
+}
+class EventMessage {
+ constructor(vsWorker, req, event) {
+ this.vsWorker = vsWorker;
+ this.req = req;
+ this.event = event;
+ this.type = 3 /* MessageType.Event */;
+ }
+}
+class UnsubscribeEventMessage {
+ constructor(vsWorker, req) {
+ this.vsWorker = vsWorker;
+ this.req = req;
+ this.type = 4 /* MessageType.UnsubscribeEvent */;
+ }
+}
+class SimpleWorkerProtocol {
+ constructor(handler) {
+ this._workerId = -1;
+ this._handler = handler;
+ this._lastSentReq = 0;
+ this._pendingReplies = Object.create(null);
+ this._pendingEmitters = new Map();
+ this._pendingEvents = new Map();
+ }
+ setWorkerId(workerId) {
+ this._workerId = workerId;
+ }
+ sendMessage(method, args) {
+ const req = String(++this._lastSentReq);
+ return new Promise((resolve, reject) => {
+ this._pendingReplies[req] = {
+ resolve: resolve,
+ reject: reject
+ };
+ this._send(new RequestMessage(this._workerId, req, method, args));
+ });
+ }
+ listen(eventName, arg) {
+ let req = null;
+ const emitter = new _event_js__WEBPACK_IMPORTED_MODULE_1__.Emitter({
+ onWillAddFirstListener: () => {
+ req = String(++this._lastSentReq);
+ this._pendingEmitters.set(req, emitter);
+ this._send(new SubscribeEventMessage(this._workerId, req, eventName, arg));
+ },
+ onDidRemoveLastListener: () => {
+ this._pendingEmitters.delete(req);
+ this._send(new UnsubscribeEventMessage(this._workerId, req));
+ req = null;
+ }
+ });
+ return emitter.event;
+ }
+ handleMessage(message) {
+ if (!message || !message.vsWorker) {
+ return;
+ }
+ if (this._workerId !== -1 && message.vsWorker !== this._workerId) {
+ return;
+ }
+ this._handleMessage(message);
+ }
+ _handleMessage(msg) {
+ switch (msg.type) {
+ case 1 /* MessageType.Reply */:
+ return this._handleReplyMessage(msg);
+ case 0 /* MessageType.Request */:
+ return this._handleRequestMessage(msg);
+ case 2 /* MessageType.SubscribeEvent */:
+ return this._handleSubscribeEventMessage(msg);
+ case 3 /* MessageType.Event */:
+ return this._handleEventMessage(msg);
+ case 4 /* MessageType.UnsubscribeEvent */:
+ return this._handleUnsubscribeEventMessage(msg);
+ }
+ }
+ _handleReplyMessage(replyMessage) {
+ if (!this._pendingReplies[replyMessage.seq]) {
+ console.warn('Got reply to unknown seq');
+ return;
+ }
+ const reply = this._pendingReplies[replyMessage.seq];
+ delete this._pendingReplies[replyMessage.seq];
+ if (replyMessage.err) {
+ let 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);
+ }
+ _handleRequestMessage(requestMessage) {
+ const req = requestMessage.req;
+ const result = this._handler.handleMessage(requestMessage.method, requestMessage.args);
+ result.then((r) => {
+ this._send(new ReplyMessage(this._workerId, req, r, undefined));
+ }, (e) => {
+ if (e.detail instanceof Error) {
+ // Loading errors have a detail property that points to the actual error
+ e.detail = (0,_errors_js__WEBPACK_IMPORTED_MODULE_0__.transformErrorForSerialization)(e.detail);
+ }
+ this._send(new ReplyMessage(this._workerId, req, undefined, (0,_errors_js__WEBPACK_IMPORTED_MODULE_0__.transformErrorForSerialization)(e)));
+ });
+ }
+ _handleSubscribeEventMessage(msg) {
+ const req = msg.req;
+ const disposable = this._handler.handleEvent(msg.eventName, msg.arg)((event) => {
+ this._send(new EventMessage(this._workerId, req, event));
+ });
+ this._pendingEvents.set(req, disposable);
+ }
+ _handleEventMessage(msg) {
+ if (!this._pendingEmitters.has(msg.req)) {
+ console.warn('Got event for unknown req');
+ return;
+ }
+ this._pendingEmitters.get(msg.req).fire(msg.event);
+ }
+ _handleUnsubscribeEventMessage(msg) {
+ if (!this._pendingEvents.has(msg.req)) {
+ console.warn('Got unsubscribe for unknown req');
+ return;
+ }
+ this._pendingEvents.get(msg.req).dispose();
+ this._pendingEvents.delete(msg.req);
+ }
+ _send(msg) {
+ const transfer = [];
+ if (msg.type === 0 /* MessageType.Request */) {
+ for (let i = 0; i < msg.args.length; i++) {
+ if (msg.args[i] instanceof ArrayBuffer) {
+ transfer.push(msg.args[i]);
+ }
+ }
+ }
+ else if (msg.type === 1 /* MessageType.Reply */) {
+ if (msg.res instanceof ArrayBuffer) {
+ transfer.push(msg.res);
+ }
+ }
+ this._handler.sendMessage(msg, transfer);
+ }
+}
+/**
+ * Main thread side
+ */
+class SimpleWorkerClient extends _lifecycle_js__WEBPACK_IMPORTED_MODULE_2__.Disposable {
+ constructor(workerFactory, moduleId, host) {
+ super();
+ let lazyProxyReject = null;
+ this._worker = this._register(workerFactory.create('vs/base/common/worker/simpleWorker', (msg) => {
+ this._protocol.handleMessage(msg);
+ }, (err) => {
+ // in Firefox, web workers fail lazily :(
+ // we will reject the proxy
+ lazyProxyReject === null || lazyProxyReject === void 0 ? void 0 : lazyProxyReject(err);
+ }));
+ this._protocol = new SimpleWorkerProtocol({
+ sendMessage: (msg, transfer) => {
+ this._worker.postMessage(msg, transfer);
+ },
+ handleMessage: (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);
+ }
+ },
+ handleEvent: (eventName, arg) => {
+ if (propertyIsDynamicEvent(eventName)) {
+ const event = host[eventName].call(host, arg);
+ if (typeof event !== 'function') {
+ throw new Error(`Missing dynamic event ${eventName} on main thread host.`);
+ }
+ return event;
+ }
+ if (propertyIsEvent(eventName)) {
+ const event = host[eventName];
+ if (typeof event !== 'function') {
+ throw new Error(`Missing event ${eventName} on main thread host.`);
+ }
+ return event;
+ }
+ throw new Error(`Malformed event name ${eventName}`);
+ }
+ });
+ this._protocol.setWorkerId(this._worker.getId());
+ // Gather loader configuration
+ let loaderConfiguration = null;
+ const globalRequire = globalThis.require;
+ if (typeof globalRequire !== 'undefined' && typeof globalRequire.getConfig === 'function') {
+ // Get the configuration from the Monaco AMD Loader
+ loaderConfiguration = globalRequire.getConfig();
+ }
+ else if (typeof globalThis.requirejs !== 'undefined') {
+ // Get the configuration from requirejs
+ loaderConfiguration = globalThis.requirejs.s.contexts._.config;
+ }
+ const hostMethods = (0,_objects_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
+ const proxyMethodRequest = (method, args) => {
+ return this._request(method, args);
+ };
+ const proxyListen = (eventName, arg) => {
+ return this._protocol.listen(eventName, arg);
+ };
+ this._lazyProxy = new Promise((resolve, reject) => {
+ lazyProxyReject = reject;
+ this._onModuleLoaded.then((availableMethods) => {
+ resolve(createProxyObject(availableMethods, proxyMethodRequest, proxyListen));
+ }, (e) => {
+ reject(e);
+ this._onError('Worker failed to load ' + moduleId, e);
+ });
+ });
+ }
+ getProxyObject() {
+ return this._lazyProxy;
+ }
+ _request(method, args) {
+ return new Promise((resolve, reject) => {
+ this._onModuleLoaded.then(() => {
+ this._protocol.sendMessage(method, args).then(resolve, reject);
+ }, reject);
+ });
+ }
+ _onError(message, error) {
+ console.error(message);
+ console.info(error);
+ }
+}
+function propertyIsEvent(name) {
+ // Assume a property is an event if it has a form of "onSomething"
+ return name[0] === 'o' && name[1] === 'n' && _strings_js__WEBPACK_IMPORTED_MODULE_5__.isUpperAsciiLetter(name.charCodeAt(2));
+}
+function propertyIsDynamicEvent(name) {
+ // Assume a property is a dynamic event (a method that returns an event) if it has a form of "onDynamicSomething"
+ return /^onDynamic/.test(name) && _strings_js__WEBPACK_IMPORTED_MODULE_5__.isUpperAsciiLetter(name.charCodeAt(9));
+}
+function createProxyObject(methodNames, invoke, proxyListen) {
+ const createProxyMethod = (method) => {
+ return function () {
+ const args = Array.prototype.slice.call(arguments, 0);
+ return invoke(method, args);
+ };
+ };
+ const createProxyDynamicEvent = (eventName) => {
+ return function (arg) {
+ return proxyListen(eventName, arg);
+ };
+ };
+ const result = {};
+ for (const methodName of methodNames) {
+ if (propertyIsDynamicEvent(methodName)) {
+ result[methodName] = createProxyDynamicEvent(methodName);
+ continue;
+ }
+ if (propertyIsEvent(methodName)) {
+ result[methodName] = proxyListen(methodName, undefined);
+ continue;
+ }
+ result[methodName] = createProxyMethod(methodName);
+ }
+ return result;
+}
+/**
+ * Worker side
+ */
+class SimpleWorkerServer {
+ constructor(postMessage, requestHandlerFactory) {
+ this._requestHandlerFactory = requestHandlerFactory;
+ this._requestHandler = null;
+ this._protocol = new SimpleWorkerProtocol({
+ sendMessage: (msg, transfer) => {
+ postMessage(msg, transfer);
+ },
+ handleMessage: (method, args) => this._handleMessage(method, args),
+ handleEvent: (eventName, arg) => this._handleEvent(eventName, arg)
+ });
+ }
+ onmessage(msg) {
+ this._protocol.handleMessage(msg);
+ }
+ _handleMessage(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);
+ }
+ }
+ _handleEvent(eventName, arg) {
+ if (!this._requestHandler) {
+ throw new Error(`Missing requestHandler`);
+ }
+ if (propertyIsDynamicEvent(eventName)) {
+ const event = this._requestHandler[eventName].call(this._requestHandler, arg);
+ if (typeof event !== 'function') {
+ throw new Error(`Missing dynamic event ${eventName} on request handler.`);
+ }
+ return event;
+ }
+ if (propertyIsEvent(eventName)) {
+ const event = this._requestHandler[eventName];
+ if (typeof event !== 'function') {
+ throw new Error(`Missing event ${eventName} on request handler.`);
+ }
+ return event;
+ }
+ throw new Error(`Malformed event name ${eventName}`);
+ }
+ initialize(workerId, loaderConfig, moduleId, hostMethods) {
+ this._protocol.setWorkerId(workerId);
+ const proxyMethodRequest = (method, args) => {
+ return this._protocol.sendMessage(method, args);
+ };
+ const proxyListen = (eventName, arg) => {
+ return this._protocol.listen(eventName, arg);
+ };
+ const hostProxy = createProxyObject(hostMethods, proxyMethodRequest, proxyListen);
+ if (this._requestHandlerFactory) {
+ // static request handler
+ this._requestHandler = this._requestHandlerFactory(hostProxy);
+ return Promise.resolve((0,_objects_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'];
+ }
+ }
+ if (typeof loaderConfig.trustedTypesPolicy !== undefined) {
+ // don't use, it has been destroyed during serialize
+ delete loaderConfig['trustedTypesPolicy'];
+ }
+ // Since this is in a web worker, enable catching errors
+ loaderConfig.catchError = true;
+ globalThis.require.config(loaderConfig);
+ }
+ return new Promise((resolve, reject) => {
+ // Use the global require to be sure to get the global config
+ // ESM-comment-begin
+ // const req = (globalThis.require || require);
+ // ESM-comment-end
+ // ESM-uncomment-begin
+ const req = globalThis.require;
+ // ESM-uncomment-end
+ req([moduleId], (module) => {
+ this._requestHandler = module.create(hostProxy);
+ if (!this._requestHandler) {
+ reject(new Error(`No RequestHandler!`));
+ return;
+ }
+ resolve((0,_objects_js__WEBPACK_IMPORTED_MODULE_3__.getAllMethodNames)(this._requestHandler));
+ }, reject);
+ });
+ }
+}
+/**
+ * Called on the worker side
+ * @skipMangle
+ */
+function create(postMessage) {
+ return new SimpleWorkerServer(postMessage, null);
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/core/characterClassifier.js":
+/*!*************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/core/characterClassifier.js ***!
+ \*************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ CharacterClassifier: () => (/* binding */ CharacterClassifier),
+/* harmony export */ CharacterSet: () => (/* binding */ CharacterSet)
+/* harmony export */ });
+/* 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.
+ */
+class CharacterClassifier {
+ constructor(_defaultValue) {
+ const defaultValue = (0,_base_common_uint_js__WEBPACK_IMPORTED_MODULE_0__.toUint8)(_defaultValue);
+ this._defaultValue = defaultValue;
+ this._asciiMap = CharacterClassifier._createAsciiMap(defaultValue);
+ this._map = new Map();
+ }
+ static _createAsciiMap(defaultValue) {
+ const asciiMap = new Uint8Array(256);
+ asciiMap.fill(defaultValue);
+ return asciiMap;
+ }
+ set(charCode, _value) {
+ const value = (0,_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);
+ }
+ }
+ get(charCode) {
+ if (charCode >= 0 && charCode < 256) {
+ return this._asciiMap[charCode];
+ }
+ else {
+ return (this._map.get(charCode) || this._defaultValue);
+ }
+ }
+ clear() {
+ this._asciiMap.fill(this._defaultValue);
+ this._map.clear();
+ }
+}
+class CharacterSet {
+ constructor() {
+ this._actual = new CharacterClassifier(0 /* Boolean.False */);
+ }
+ add(charCode) {
+ this._actual.set(charCode, 1 /* Boolean.True */);
+ }
+ has(charCode) {
+ return (this._actual.get(charCode) === 1 /* Boolean.True */);
+ }
+ clear() {
+ return this._actual.clear();
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/core/lineRange.js":
+/*!***************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/core/lineRange.js ***!
+ \***************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ LineRange: () => (/* binding */ LineRange),
+/* harmony export */ LineRangeSet: () => (/* binding */ LineRangeSet)
+/* harmony export */ });
+/* harmony import */ var _base_common_errors_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../../base/common/errors.js */ "./node_modules/monaco-editor/esm/vs/base/common/errors.js");
+/* harmony import */ var _offsetRange_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./offsetRange.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/offsetRange.js");
+/* harmony import */ var _range_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./range.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/range.js");
+/* harmony import */ var _base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../../../base/common/arraysFind.js */ "./node_modules/monaco-editor/esm/vs/base/common/arraysFind.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 of lines (1-based).
+ */
+class LineRange {
+ static fromRange(range) {
+ return new LineRange(range.startLineNumber, range.endLineNumber);
+ }
+ static fromRangeInclusive(range) {
+ return new LineRange(range.startLineNumber, range.endLineNumber + 1);
+ }
+ /**
+ * @param lineRanges An array of sorted line ranges.
+ */
+ static joinMany(lineRanges) {
+ if (lineRanges.length === 0) {
+ return [];
+ }
+ let result = new LineRangeSet(lineRanges[0].slice());
+ for (let i = 1; i < lineRanges.length; i++) {
+ result = result.getUnion(new LineRangeSet(lineRanges[i].slice()));
+ }
+ return result.ranges;
+ }
+ static ofLength(startLineNumber, length) {
+ return new LineRange(startLineNumber, startLineNumber + length);
+ }
+ /**
+ * @internal
+ */
+ static deserialize(lineRange) {
+ return new LineRange(lineRange[0], lineRange[1]);
+ }
+ constructor(startLineNumber, endLineNumberExclusive) {
+ if (startLineNumber > endLineNumberExclusive) {
+ throw new _base_common_errors_js__WEBPACK_IMPORTED_MODULE_0__.BugIndicatingError(`startLineNumber ${startLineNumber} cannot be after endLineNumberExclusive ${endLineNumberExclusive}`);
+ }
+ this.startLineNumber = startLineNumber;
+ this.endLineNumberExclusive = endLineNumberExclusive;
+ }
+ /**
+ * Indicates if this line range contains the given line number.
+ */
+ contains(lineNumber) {
+ return this.startLineNumber <= lineNumber && lineNumber < this.endLineNumberExclusive;
+ }
+ /**
+ * Indicates if this line range is empty.
+ */
+ get isEmpty() {
+ return this.startLineNumber === this.endLineNumberExclusive;
+ }
+ /**
+ * Moves this line range by the given offset of line numbers.
+ */
+ delta(offset) {
+ return new LineRange(this.startLineNumber + offset, this.endLineNumberExclusive + offset);
+ }
+ deltaLength(offset) {
+ return new LineRange(this.startLineNumber, this.endLineNumberExclusive + offset);
+ }
+ /**
+ * The number of lines this line range spans.
+ */
+ get length() {
+ return this.endLineNumberExclusive - this.startLineNumber;
+ }
+ /**
+ * Creates a line range that combines this and the given line range.
+ */
+ join(other) {
+ return new LineRange(Math.min(this.startLineNumber, other.startLineNumber), Math.max(this.endLineNumberExclusive, other.endLineNumberExclusive));
+ }
+ toString() {
+ return `[${this.startLineNumber},${this.endLineNumberExclusive})`;
+ }
+ /**
+ * The resulting range is empty if the ranges do not intersect, but touch.
+ * If the ranges don't even touch, the result is undefined.
+ */
+ intersect(other) {
+ const startLineNumber = Math.max(this.startLineNumber, other.startLineNumber);
+ const endLineNumberExclusive = Math.min(this.endLineNumberExclusive, other.endLineNumberExclusive);
+ if (startLineNumber <= endLineNumberExclusive) {
+ return new LineRange(startLineNumber, endLineNumberExclusive);
+ }
+ return undefined;
+ }
+ intersectsStrict(other) {
+ return this.startLineNumber < other.endLineNumberExclusive && other.startLineNumber < this.endLineNumberExclusive;
+ }
+ overlapOrTouch(other) {
+ return this.startLineNumber <= other.endLineNumberExclusive && other.startLineNumber <= this.endLineNumberExclusive;
+ }
+ equals(b) {
+ return this.startLineNumber === b.startLineNumber && this.endLineNumberExclusive === b.endLineNumberExclusive;
+ }
+ toInclusiveRange() {
+ if (this.isEmpty) {
+ return null;
+ }
+ return new _range_js__WEBPACK_IMPORTED_MODULE_2__.Range(this.startLineNumber, 1, this.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER);
+ }
+ toExclusiveRange() {
+ return new _range_js__WEBPACK_IMPORTED_MODULE_2__.Range(this.startLineNumber, 1, this.endLineNumberExclusive, 1);
+ }
+ mapToLineArray(f) {
+ const result = [];
+ for (let lineNumber = this.startLineNumber; lineNumber < this.endLineNumberExclusive; lineNumber++) {
+ result.push(f(lineNumber));
+ }
+ return result;
+ }
+ forEach(f) {
+ for (let lineNumber = this.startLineNumber; lineNumber < this.endLineNumberExclusive; lineNumber++) {
+ f(lineNumber);
+ }
+ }
+ /**
+ * @internal
+ */
+ serialize() {
+ return [this.startLineNumber, this.endLineNumberExclusive];
+ }
+ includes(lineNumber) {
+ return this.startLineNumber <= lineNumber && lineNumber < this.endLineNumberExclusive;
+ }
+ /**
+ * Converts this 1-based line range to a 0-based offset range (subtracts 1!).
+ * @internal
+ */
+ toOffsetRange() {
+ return new _offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange(this.startLineNumber - 1, this.endLineNumberExclusive - 1);
+ }
+}
+class LineRangeSet {
+ constructor(
+ /**
+ * Sorted by start line number.
+ * No two line ranges are touching or intersecting.
+ */
+ _normalizedRanges = []) {
+ this._normalizedRanges = _normalizedRanges;
+ }
+ get ranges() {
+ return this._normalizedRanges;
+ }
+ addRange(range) {
+ if (range.length === 0) {
+ return;
+ }
+ // Idea: Find joinRange such that:
+ // replaceRange = _normalizedRanges.replaceRange(joinRange, range.joinAll(joinRange.map(idx => this._normalizedRanges[idx])))
+ // idx of first element that touches range or that is after range
+ const joinRangeStartIdx = (0,_base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_3__.findFirstIdxMonotonousOrArrLen)(this._normalizedRanges, r => r.endLineNumberExclusive >= range.startLineNumber);
+ // idx of element after { last element that touches range or that is before range }
+ const joinRangeEndIdxExclusive = (0,_base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_3__.findLastIdxMonotonous)(this._normalizedRanges, r => r.startLineNumber <= range.endLineNumberExclusive) + 1;
+ if (joinRangeStartIdx === joinRangeEndIdxExclusive) {
+ // If there is no element that touches range, then joinRangeStartIdx === joinRangeEndIdxExclusive and that value is the index of the element after range
+ this._normalizedRanges.splice(joinRangeStartIdx, 0, range);
+ }
+ else if (joinRangeStartIdx === joinRangeEndIdxExclusive - 1) {
+ // Else, there is an element that touches range and in this case it is both the first and last element. Thus we can replace it
+ const joinRange = this._normalizedRanges[joinRangeStartIdx];
+ this._normalizedRanges[joinRangeStartIdx] = joinRange.join(range);
+ }
+ else {
+ // First and last element are different - we need to replace the entire range
+ const joinRange = this._normalizedRanges[joinRangeStartIdx].join(this._normalizedRanges[joinRangeEndIdxExclusive - 1]).join(range);
+ this._normalizedRanges.splice(joinRangeStartIdx, joinRangeEndIdxExclusive - joinRangeStartIdx, joinRange);
+ }
+ }
+ contains(lineNumber) {
+ const rangeThatStartsBeforeEnd = (0,_base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_3__.findLastMonotonous)(this._normalizedRanges, r => r.startLineNumber <= lineNumber);
+ return !!rangeThatStartsBeforeEnd && rangeThatStartsBeforeEnd.endLineNumberExclusive > lineNumber;
+ }
+ intersects(range) {
+ const rangeThatStartsBeforeEnd = (0,_base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_3__.findLastMonotonous)(this._normalizedRanges, r => r.startLineNumber < range.endLineNumberExclusive);
+ return !!rangeThatStartsBeforeEnd && rangeThatStartsBeforeEnd.endLineNumberExclusive > range.startLineNumber;
+ }
+ getUnion(other) {
+ if (this._normalizedRanges.length === 0) {
+ return other;
+ }
+ if (other._normalizedRanges.length === 0) {
+ return this;
+ }
+ const result = [];
+ let i1 = 0;
+ let i2 = 0;
+ let current = null;
+ while (i1 < this._normalizedRanges.length || i2 < other._normalizedRanges.length) {
+ let next = null;
+ if (i1 < this._normalizedRanges.length && i2 < other._normalizedRanges.length) {
+ const lineRange1 = this._normalizedRanges[i1];
+ const lineRange2 = other._normalizedRanges[i2];
+ if (lineRange1.startLineNumber < lineRange2.startLineNumber) {
+ next = lineRange1;
+ i1++;
+ }
+ else {
+ next = lineRange2;
+ i2++;
+ }
+ }
+ else if (i1 < this._normalizedRanges.length) {
+ next = this._normalizedRanges[i1];
+ i1++;
+ }
+ else {
+ next = other._normalizedRanges[i2];
+ i2++;
+ }
+ if (current === null) {
+ current = next;
+ }
+ else {
+ if (current.endLineNumberExclusive >= next.startLineNumber) {
+ // merge
+ current = new LineRange(current.startLineNumber, Math.max(current.endLineNumberExclusive, next.endLineNumberExclusive));
+ }
+ else {
+ // push
+ result.push(current);
+ current = next;
+ }
+ }
+ }
+ if (current !== null) {
+ result.push(current);
+ }
+ return new LineRangeSet(result);
+ }
+ /**
+ * Subtracts all ranges in this set from `range` and returns the result.
+ */
+ subtractFrom(range) {
+ // idx of first element that touches range or that is after range
+ const joinRangeStartIdx = (0,_base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_3__.findFirstIdxMonotonousOrArrLen)(this._normalizedRanges, r => r.endLineNumberExclusive >= range.startLineNumber);
+ // idx of element after { last element that touches range or that is before range }
+ const joinRangeEndIdxExclusive = (0,_base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_3__.findLastIdxMonotonous)(this._normalizedRanges, r => r.startLineNumber <= range.endLineNumberExclusive) + 1;
+ if (joinRangeStartIdx === joinRangeEndIdxExclusive) {
+ return new LineRangeSet([range]);
+ }
+ const result = [];
+ let startLineNumber = range.startLineNumber;
+ for (let i = joinRangeStartIdx; i < joinRangeEndIdxExclusive; i++) {
+ const r = this._normalizedRanges[i];
+ if (r.startLineNumber > startLineNumber) {
+ result.push(new LineRange(startLineNumber, r.startLineNumber));
+ }
+ startLineNumber = r.endLineNumberExclusive;
+ }
+ if (startLineNumber < range.endLineNumberExclusive) {
+ result.push(new LineRange(startLineNumber, range.endLineNumberExclusive));
+ }
+ return new LineRangeSet(result);
+ }
+ toString() {
+ return this._normalizedRanges.map(r => r.toString()).join(', ');
+ }
+ getIntersection(other) {
+ const result = [];
+ let i1 = 0;
+ let i2 = 0;
+ while (i1 < this._normalizedRanges.length && i2 < other._normalizedRanges.length) {
+ const r1 = this._normalizedRanges[i1];
+ const r2 = other._normalizedRanges[i2];
+ const i = r1.intersect(r2);
+ if (i && !i.isEmpty) {
+ result.push(i);
+ }
+ if (r1.endLineNumberExclusive < r2.endLineNumberExclusive) {
+ i1++;
+ }
+ else {
+ i2++;
+ }
+ }
+ return new LineRangeSet(result);
+ }
+ getWithDelta(value) {
+ return new LineRangeSet(this._normalizedRanges.map(r => r.delta(value)));
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/core/offsetRange.js":
+/*!*****************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/core/offsetRange.js ***!
+ \*****************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ OffsetRange: () => (/* binding */ OffsetRange),
+/* harmony export */ OffsetRangeSet: () => (/* binding */ OffsetRangeSet)
+/* harmony export */ });
+/* harmony import */ var _base_common_errors_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../../base/common/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.
+ *--------------------------------------------------------------------------------------------*/
+
+/**
+ * A range of offsets (0-based).
+*/
+class OffsetRange {
+ static addRange(range, sortedRanges) {
+ let i = 0;
+ while (i < sortedRanges.length && sortedRanges[i].endExclusive < range.start) {
+ i++;
+ }
+ let j = i;
+ while (j < sortedRanges.length && sortedRanges[j].start <= range.endExclusive) {
+ j++;
+ }
+ if (i === j) {
+ sortedRanges.splice(i, 0, range);
+ }
+ else {
+ const start = Math.min(range.start, sortedRanges[i].start);
+ const end = Math.max(range.endExclusive, sortedRanges[j - 1].endExclusive);
+ sortedRanges.splice(i, j - i, new OffsetRange(start, end));
+ }
+ }
+ static tryCreate(start, endExclusive) {
+ if (start > endExclusive) {
+ return undefined;
+ }
+ return new OffsetRange(start, endExclusive);
+ }
+ static ofLength(length) {
+ return new OffsetRange(0, length);
+ }
+ static ofStartAndLength(start, length) {
+ return new OffsetRange(start, start + length);
+ }
+ constructor(start, endExclusive) {
+ this.start = start;
+ this.endExclusive = endExclusive;
+ if (start > endExclusive) {
+ throw new _base_common_errors_js__WEBPACK_IMPORTED_MODULE_0__.BugIndicatingError(`Invalid range: ${this.toString()}`);
+ }
+ }
+ get isEmpty() {
+ return this.start === this.endExclusive;
+ }
+ delta(offset) {
+ return new OffsetRange(this.start + offset, this.endExclusive + offset);
+ }
+ deltaStart(offset) {
+ return new OffsetRange(this.start + offset, this.endExclusive);
+ }
+ deltaEnd(offset) {
+ return new OffsetRange(this.start, this.endExclusive + offset);
+ }
+ get length() {
+ return this.endExclusive - this.start;
+ }
+ toString() {
+ return `[${this.start}, ${this.endExclusive})`;
+ }
+ equals(other) {
+ return this.start === other.start && this.endExclusive === other.endExclusive;
+ }
+ containsRange(other) {
+ return this.start <= other.start && other.endExclusive <= this.endExclusive;
+ }
+ contains(offset) {
+ return this.start <= offset && offset < this.endExclusive;
+ }
+ /**
+ * for all numbers n: range1.contains(n) or range2.contains(n) => range1.join(range2).contains(n)
+ * The joined range is the smallest range that contains both ranges.
+ */
+ join(other) {
+ return new OffsetRange(Math.min(this.start, other.start), Math.max(this.endExclusive, other.endExclusive));
+ }
+ /**
+ * for all numbers n: range1.contains(n) and range2.contains(n) <=> range1.intersect(range2).contains(n)
+ *
+ * The resulting range is empty if the ranges do not intersect, but touch.
+ * If the ranges don't even touch, the result is undefined.
+ */
+ intersect(other) {
+ const start = Math.max(this.start, other.start);
+ const end = Math.min(this.endExclusive, other.endExclusive);
+ if (start <= end) {
+ return new OffsetRange(start, end);
+ }
+ return undefined;
+ }
+ isBefore(other) {
+ return this.endExclusive <= other.start;
+ }
+ isAfter(other) {
+ return this.start >= other.endExclusive;
+ }
+ slice(arr) {
+ return arr.slice(this.start, this.endExclusive);
+ }
+ /**
+ * Returns the given value if it is contained in this instance, otherwise the closest value that is contained.
+ * The range must not be empty.
+ */
+ clip(value) {
+ if (this.isEmpty) {
+ throw new _base_common_errors_js__WEBPACK_IMPORTED_MODULE_0__.BugIndicatingError(`Invalid clipping range: ${this.toString()}`);
+ }
+ return Math.max(this.start, Math.min(this.endExclusive - 1, value));
+ }
+ /**
+ * Returns `r := value + k * length` such that `r` is contained in this range.
+ * The range must not be empty.
+ *
+ * E.g. `[5, 10).clipCyclic(10) === 5`, `[5, 10).clipCyclic(11) === 6` and `[5, 10).clipCyclic(4) === 9`.
+ */
+ clipCyclic(value) {
+ if (this.isEmpty) {
+ throw new _base_common_errors_js__WEBPACK_IMPORTED_MODULE_0__.BugIndicatingError(`Invalid clipping range: ${this.toString()}`);
+ }
+ if (value < this.start) {
+ return this.endExclusive - ((this.start - value) % this.length);
+ }
+ if (value >= this.endExclusive) {
+ return this.start + ((value - this.start) % this.length);
+ }
+ return value;
+ }
+ forEach(f) {
+ for (let i = this.start; i < this.endExclusive; i++) {
+ f(i);
+ }
+ }
+}
+class OffsetRangeSet {
+ constructor() {
+ this._sortedRanges = [];
+ }
+ addRange(range) {
+ let i = 0;
+ while (i < this._sortedRanges.length && this._sortedRanges[i].endExclusive < range.start) {
+ i++;
+ }
+ let j = i;
+ while (j < this._sortedRanges.length && this._sortedRanges[j].start <= range.endExclusive) {
+ j++;
+ }
+ if (i === j) {
+ this._sortedRanges.splice(i, 0, range);
+ }
+ else {
+ const start = Math.min(range.start, this._sortedRanges[i].start);
+ const end = Math.max(range.endExclusive, this._sortedRanges[j - 1].endExclusive);
+ this._sortedRanges.splice(i, j - i, new OffsetRange(start, end));
+ }
+ }
+ toString() {
+ return this._sortedRanges.map(r => r.toString()).join(', ');
+ }
+ /**
+ * Returns of there is a value that is contained in this instance and the given range.
+ */
+ intersectsStrict(other) {
+ // TODO use binary search
+ let i = 0;
+ while (i < this._sortedRanges.length && this._sortedRanges[i].endExclusive <= other.start) {
+ i++;
+ }
+ return i < this._sortedRanges.length && this._sortedRanges[i].start < other.endExclusive;
+ }
+ intersectWithRange(other) {
+ // TODO use binary search + slice
+ const result = new OffsetRangeSet();
+ for (const range of this._sortedRanges) {
+ const intersection = range.intersect(other);
+ if (intersection) {
+ result.addRange(intersection);
+ }
+ }
+ return result;
+ }
+ intersectWithRangeLength(other) {
+ return this.intersectWithRange(other).length;
+ }
+ get length() {
+ return this._sortedRanges.reduce((prev, cur) => prev + cur.length, 0);
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/core/position.js":
+/*!**************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/core/position.js ***!
+ \**************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ Position: () => (/* binding */ Position)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * 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.
+ */
+class Position {
+ constructor(lineNumber, column) {
+ this.lineNumber = lineNumber;
+ this.column = column;
+ }
+ /**
+ * Create a new position from this position.
+ *
+ * @param newLineNumber new line number
+ * @param newColumn new column
+ */
+ with(newLineNumber = this.lineNumber, 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
+ */
+ delta(deltaLineNumber = 0, deltaColumn = 0) {
+ return this.with(this.lineNumber + deltaLineNumber, this.column + deltaColumn);
+ }
+ /**
+ * Test if this position equals other position
+ */
+ equals(other) {
+ return Position.equals(this, other);
+ }
+ /**
+ * Test if position `a` equals position `b`
+ */
+ static equals(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.
+ */
+ isBefore(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.
+ */
+ static isBefore(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.
+ */
+ isBeforeOrEqual(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.
+ */
+ static isBeforeOrEqual(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
+ */
+ static compare(a, b) {
+ const aLineNumber = a.lineNumber | 0;
+ const bLineNumber = b.lineNumber | 0;
+ if (aLineNumber === bLineNumber) {
+ const aColumn = a.column | 0;
+ const bColumn = b.column | 0;
+ return aColumn - bColumn;
+ }
+ return aLineNumber - bLineNumber;
+ }
+ /**
+ * Clone this position.
+ */
+ clone() {
+ return new Position(this.lineNumber, this.column);
+ }
+ /**
+ * Convert to a human-readable representation.
+ */
+ toString() {
+ return '(' + this.lineNumber + ',' + this.column + ')';
+ }
+ // ---
+ /**
+ * Create a `Position` from an `IPosition`.
+ */
+ static lift(pos) {
+ return new Position(pos.lineNumber, pos.column);
+ }
+ /**
+ * Test if `obj` is an `IPosition`.
+ */
+ static isIPosition(obj) {
+ return (obj
+ && (typeof obj.lineNumber === 'number')
+ && (typeof obj.column === 'number'));
+ }
+ toJSON() {
+ return {
+ lineNumber: this.lineNumber,
+ column: this.column
+ };
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/core/range.js":
+/*!***********************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/core/range.js ***!
+ \***********************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ Range: () => (/* binding */ Range)
+/* harmony export */ });
+/* 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)
+ */
+class Range {
+ constructor(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.
+ */
+ isEmpty() {
+ return Range.isEmpty(this);
+ }
+ /**
+ * Test if `range` is empty.
+ */
+ static isEmpty(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.
+ */
+ containsPosition(position) {
+ return Range.containsPosition(this, position);
+ }
+ /**
+ * Test if `position` is in `range`. If the position is at the edges, will return true.
+ */
+ static containsPosition(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 `position` is in `range`. If the position is at the edges, will return false.
+ * @internal
+ */
+ static strictContainsPosition(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.
+ */
+ containsRange(range) {
+ return Range.containsRange(this, range);
+ }
+ /**
+ * Test if `otherRange` is in `range`. If the ranges are equal, will return true.
+ */
+ static containsRange(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.
+ */
+ strictContainsRange(range) {
+ return Range.strictContainsRange(this, range);
+ }
+ /**
+ * Test if `otherRange` is strictly in `range` (must start after, and end before). If the ranges are equal, will return false.
+ */
+ static strictContainsRange(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.
+ */
+ plusRange(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.
+ */
+ static plusRange(a, b) {
+ let startLineNumber;
+ let startColumn;
+ let endLineNumber;
+ let 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.
+ */
+ intersectRanges(range) {
+ return Range.intersectRanges(this, range);
+ }
+ /**
+ * A intersection of the two ranges.
+ */
+ static intersectRanges(a, b) {
+ let resultStartLineNumber = a.startLineNumber;
+ let resultStartColumn = a.startColumn;
+ let resultEndLineNumber = a.endLineNumber;
+ let resultEndColumn = a.endColumn;
+ const otherStartLineNumber = b.startLineNumber;
+ const otherStartColumn = b.startColumn;
+ const otherEndLineNumber = b.endLineNumber;
+ const 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.
+ */
+ equalsRange(other) {
+ return Range.equalsRange(this, other);
+ }
+ /**
+ * Test if range `a` equals `b`.
+ */
+ static equalsRange(a, b) {
+ if (!a && !b) {
+ return true;
+ }
+ 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)
+ */
+ getEndPosition() {
+ return Range.getEndPosition(this);
+ }
+ /**
+ * Return the end position (which will be after or equal to the start position)
+ */
+ static getEndPosition(range) {
+ return new _position_js__WEBPACK_IMPORTED_MODULE_0__.Position(range.endLineNumber, range.endColumn);
+ }
+ /**
+ * Return the start position (which will be before or equal to the end position)
+ */
+ getStartPosition() {
+ return Range.getStartPosition(this);
+ }
+ /**
+ * Return the start position (which will be before or equal to the end position)
+ */
+ static getStartPosition(range) {
+ return new _position_js__WEBPACK_IMPORTED_MODULE_0__.Position(range.startLineNumber, range.startColumn);
+ }
+ /**
+ * Transform to a user presentable string representation.
+ */
+ toString() {
+ 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.
+ */
+ setEndPosition(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.
+ */
+ setStartPosition(startLineNumber, startColumn) {
+ return new Range(startLineNumber, startColumn, this.endLineNumber, this.endColumn);
+ }
+ /**
+ * Create a new empty range using this range's start position.
+ */
+ collapseToStart() {
+ return Range.collapseToStart(this);
+ }
+ /**
+ * Create a new empty range using this range's start position.
+ */
+ static collapseToStart(range) {
+ return new Range(range.startLineNumber, range.startColumn, range.startLineNumber, range.startColumn);
+ }
+ /**
+ * Create a new empty range using this range's end position.
+ */
+ collapseToEnd() {
+ return Range.collapseToEnd(this);
+ }
+ /**
+ * Create a new empty range using this range's end position.
+ */
+ static collapseToEnd(range) {
+ return new Range(range.endLineNumber, range.endColumn, range.endLineNumber, range.endColumn);
+ }
+ /**
+ * Moves the range by the given amount of lines.
+ */
+ delta(lineCount) {
+ return new Range(this.startLineNumber + lineCount, this.startColumn, this.endLineNumber + lineCount, this.endColumn);
+ }
+ // ---
+ static fromPositions(start, end = start) {
+ return new Range(start.lineNumber, start.column, end.lineNumber, end.column);
+ }
+ static lift(range) {
+ if (!range) {
+ return null;
+ }
+ return new Range(range.startLineNumber, range.startColumn, range.endLineNumber, range.endColumn);
+ }
+ /**
+ * Test if `obj` is an `IRange`.
+ */
+ static isIRange(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.
+ */
+ static areIntersectingOrTouching(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.
+ */
+ static areIntersecting(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
+ */
+ static compareRangesUsingStarts(a, b) {
+ if (a && b) {
+ const aStartLineNumber = a.startLineNumber | 0;
+ const bStartLineNumber = b.startLineNumber | 0;
+ if (aStartLineNumber === bStartLineNumber) {
+ const aStartColumn = a.startColumn | 0;
+ const bStartColumn = b.startColumn | 0;
+ if (aStartColumn === bStartColumn) {
+ const aEndLineNumber = a.endLineNumber | 0;
+ const bEndLineNumber = b.endLineNumber | 0;
+ if (aEndLineNumber === bEndLineNumber) {
+ const aEndColumn = a.endColumn | 0;
+ const bEndColumn = b.endColumn | 0;
+ return aEndColumn - bEndColumn;
+ }
+ return aEndLineNumber - bEndLineNumber;
+ }
+ return aStartColumn - bStartColumn;
+ }
+ return aStartLineNumber - bStartLineNumber;
+ }
+ const aExists = (a ? 1 : 0);
+ const 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
+ */
+ static compareRangesUsingEnds(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.
+ */
+ static spansMultipleLines(range) {
+ return range.endLineNumber > range.startLineNumber;
+ }
+ toJSON() {
+ return this;
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/core/selection.js":
+/*!***************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/core/selection.js ***!
+ \***************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ Selection: () => (/* binding */ Selection)
+/* harmony export */ });
+/* 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.
+ *--------------------------------------------------------------------------------------------*/
+
+
+/**
+ * A selection in the editor.
+ * The selection is a range that has an orientation.
+ */
+class Selection extends _range_js__WEBPACK_IMPORTED_MODULE_1__.Range {
+ constructor(selectionStartLineNumber, selectionStartColumn, positionLineNumber, positionColumn) {
+ super(selectionStartLineNumber, selectionStartColumn, positionLineNumber, positionColumn);
+ this.selectionStartLineNumber = selectionStartLineNumber;
+ this.selectionStartColumn = selectionStartColumn;
+ this.positionLineNumber = positionLineNumber;
+ this.positionColumn = positionColumn;
+ }
+ /**
+ * Transform to a human-readable representation.
+ */
+ toString() {
+ return '[' + this.selectionStartLineNumber + ',' + this.selectionStartColumn + ' -> ' + this.positionLineNumber + ',' + this.positionColumn + ']';
+ }
+ /**
+ * Test if equals other selection.
+ */
+ equalsSelection(other) {
+ return (Selection.selectionsEqual(this, other));
+ }
+ /**
+ * Test if the two selections are equal.
+ */
+ static selectionsEqual(a, b) {
+ return (a.selectionStartLineNumber === b.selectionStartLineNumber &&
+ a.selectionStartColumn === b.selectionStartColumn &&
+ a.positionLineNumber === b.positionLineNumber &&
+ a.positionColumn === b.positionColumn);
+ }
+ /**
+ * Get directions (LTR or RTL).
+ */
+ getDirection() {
+ if (this.selectionStartLineNumber === this.startLineNumber && this.selectionStartColumn === this.startColumn) {
+ return 0 /* SelectionDirection.LTR */;
+ }
+ return 1 /* SelectionDirection.RTL */;
+ }
+ /**
+ * Create a new selection with a different `positionLineNumber` and `positionColumn`.
+ */
+ setEndPosition(endLineNumber, endColumn) {
+ if (this.getDirection() === 0 /* SelectionDirection.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`.
+ */
+ getPosition() {
+ return new _position_js__WEBPACK_IMPORTED_MODULE_0__.Position(this.positionLineNumber, this.positionColumn);
+ }
+ /**
+ * Get the position at the start of the selection.
+ */
+ getSelectionStart() {
+ return new _position_js__WEBPACK_IMPORTED_MODULE_0__.Position(this.selectionStartLineNumber, this.selectionStartColumn);
+ }
+ /**
+ * Create a new selection with a different `selectionStartLineNumber` and `selectionStartColumn`.
+ */
+ setStartPosition(startLineNumber, startColumn) {
+ if (this.getDirection() === 0 /* SelectionDirection.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
+ */
+ static fromPositions(start, end = start) {
+ return new Selection(start.lineNumber, start.column, end.lineNumber, end.column);
+ }
+ /**
+ * Creates a `Selection` from a range, given a direction.
+ */
+ static fromRange(range, direction) {
+ if (direction === 0 /* SelectionDirection.LTR */) {
+ return new Selection(range.startLineNumber, range.startColumn, range.endLineNumber, range.endColumn);
+ }
+ else {
+ return new Selection(range.endLineNumber, range.endColumn, range.startLineNumber, range.startColumn);
+ }
+ }
+ /**
+ * Create a `Selection` from an `ISelection`.
+ */
+ static liftSelection(sel) {
+ return new Selection(sel.selectionStartLineNumber, sel.selectionStartColumn, sel.positionLineNumber, sel.positionColumn);
+ }
+ /**
+ * `a` equals `b`.
+ */
+ static selectionsArrEqual(a, b) {
+ if (a && !b || !a && b) {
+ return false;
+ }
+ if (!a && !b) {
+ return true;
+ }
+ if (a.length !== b.length) {
+ return false;
+ }
+ for (let 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`.
+ */
+ static isISelection(obj) {
+ return (obj
+ && (typeof obj.selectionStartLineNumber === 'number')
+ && (typeof obj.selectionStartColumn === 'number')
+ && (typeof obj.positionLineNumber === 'number')
+ && (typeof obj.positionColumn === 'number'));
+ }
+ /**
+ * Create with a direction.
+ */
+ static createWithDirection(startLineNumber, startColumn, endLineNumber, endColumn, direction) {
+ if (direction === 0 /* SelectionDirection.LTR */) {
+ return new Selection(startLineNumber, startColumn, endLineNumber, endColumn);
+ }
+ return new Selection(endLineNumber, endColumn, startLineNumber, startColumn);
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/core/wordCharacterClassifier.js":
+/*!*****************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/core/wordCharacterClassifier.js ***!
+ \*****************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ WordCharacterClassifier: () => (/* binding */ WordCharacterClassifier),
+/* harmony export */ getMapForWordSeparators: () => (/* binding */ getMapForWordSeparators)
+/* harmony export */ });
+/* harmony import */ var _characterClassifier_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./characterClassifier.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/characterClassifier.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+class WordCharacterClassifier extends _characterClassifier_js__WEBPACK_IMPORTED_MODULE_0__.CharacterClassifier {
+ constructor(wordSeparators) {
+ super(0 /* WordCharacterClass.Regular */);
+ for (let i = 0, len = wordSeparators.length; i < len; i++) {
+ this.set(wordSeparators.charCodeAt(i), 2 /* WordCharacterClass.WordSeparator */);
+ }
+ this.set(32 /* CharCode.Space */, 1 /* WordCharacterClass.Whitespace */);
+ this.set(9 /* CharCode.Tab */, 1 /* WordCharacterClass.Whitespace */);
+ }
+}
+function once(computeFn) {
+ const cache = {}; // TODO@Alex unbounded cache
+ return (input) => {
+ if (!cache.hasOwnProperty(input)) {
+ cache[input] = computeFn(input);
+ }
+ return cache[input];
+ };
+}
+const getMapForWordSeparators = once((input) => new WordCharacterClassifier(input));
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/core/wordHelper.js":
+/*!****************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/core/wordHelper.js ***!
+ \****************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ DEFAULT_WORD_REGEXP: () => (/* binding */ DEFAULT_WORD_REGEXP),
+/* harmony export */ USUAL_WORD_SEPARATORS: () => (/* binding */ USUAL_WORD_SEPARATORS),
+/* harmony export */ ensureValidWordDefinition: () => (/* binding */ ensureValidWordDefinition),
+/* harmony export */ getWordAtText: () => (/* binding */ getWordAtText)
+/* harmony export */ });
+/* harmony import */ var _base_common_iterator_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../../base/common/iterator.js */ "./node_modules/monaco-editor/esm/vs/base/common/iterator.js");
+/* harmony import */ var _base_common_linkedList_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../../base/common/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.
+ *--------------------------------------------------------------------------------------------*/
+
+
+const 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 = '') {
+ let source = '(-?\\d*\\.\\d\\w*)|([^';
+ for (const sep of USUAL_WORD_SEPARATORS) {
+ 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
+const DEFAULT_WORD_REGEXP = createWordRegExp();
+function ensureValidWordDefinition(wordDefinition) {
+ let result = DEFAULT_WORD_REGEXP;
+ if (wordDefinition && (wordDefinition instanceof RegExp)) {
+ if (!wordDefinition.global) {
+ let 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;
+}
+const _defaultConfig = new _base_common_linkedList_js__WEBPACK_IMPORTED_MODULE_1__.LinkedList();
+_defaultConfig.unshift({
+ maxLen: 1000,
+ windowSize: 15,
+ timeBudget: 150
+});
+function getWordAtText(column, wordDefinition, text, textOffset, config) {
+ // Ensure the regex has the 'g' flag, otherwise this will loop forever
+ wordDefinition = ensureValidWordDefinition(wordDefinition);
+ if (!config) {
+ config = _base_common_iterator_js__WEBPACK_IMPORTED_MODULE_0__.Iterable.first(_defaultConfig);
+ }
+ if (text.length > config.maxLen) {
+ // don't throw strings that long at the regexp
+ // but use a sub-string in which a word must occur
+ let start = column - config.maxLen / 2;
+ if (start < 0) {
+ start = 0;
+ }
+ else {
+ textOffset += start;
+ }
+ text = text.substring(start, column + config.maxLen / 2);
+ return getWordAtText(column, wordDefinition, text, textOffset, config);
+ }
+ const t1 = Date.now();
+ const pos = column - 1 - textOffset;
+ let prevRegexIndex = -1;
+ let match = null;
+ for (let i = 1;; i++) {
+ // check time budget
+ if (Date.now() - t1 >= config.timeBudget) {
+ break;
+ }
+ // reset the index at which the regexp should start matching, also know where it
+ // should stop so that subsequent search don't repeat previous searches
+ const regexIndex = pos - config.windowSize * i;
+ wordDefinition.lastIndex = Math.max(0, regexIndex);
+ const thisMatch = _findRegexMatchEnclosingPosition(wordDefinition, text, pos, prevRegexIndex);
+ if (!thisMatch && match) {
+ // stop: we have something
+ break;
+ }
+ match = thisMatch;
+ // stop: searched at start
+ if (regexIndex <= 0) {
+ break;
+ }
+ prevRegexIndex = regexIndex;
+ }
+ if (match) {
+ const result = {
+ word: match[0],
+ startColumn: textOffset + 1 + match.index,
+ endColumn: textOffset + 1 + match.index + match[0].length
+ };
+ wordDefinition.lastIndex = 0;
+ return result;
+ }
+ return null;
+}
+function _findRegexMatchEnclosingPosition(wordDefinition, text, pos, stopPos) {
+ let match;
+ while (match = wordDefinition.exec(text)) {
+ const matchIndex = match.index || 0;
+ if (matchIndex <= pos && wordDefinition.lastIndex >= pos) {
+ return match;
+ }
+ else if (stopPos > 0 && matchIndex > stopPos) {
+ return null;
+ }
+ }
+ return null;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm.js":
+/*!*******************************************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm.js ***!
+ \*******************************************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ DateTimeout: () => (/* binding */ DateTimeout),
+/* harmony export */ DiffAlgorithmResult: () => (/* binding */ DiffAlgorithmResult),
+/* harmony export */ InfiniteTimeout: () => (/* binding */ InfiniteTimeout),
+/* harmony export */ OffsetPair: () => (/* binding */ OffsetPair),
+/* harmony export */ SequenceDiff: () => (/* binding */ SequenceDiff)
+/* harmony export */ });
+/* 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_errors_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../../../../base/common/errors.js */ "./node_modules/monaco-editor/esm/vs/base/common/errors.js");
+/* harmony import */ var _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../../core/offsetRange.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/offsetRange.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+
+
+class DiffAlgorithmResult {
+ static trivial(seq1, seq2) {
+ return new DiffAlgorithmResult([new SequenceDiff(_core_offsetRange_js__WEBPACK_IMPORTED_MODULE_2__.OffsetRange.ofLength(seq1.length), _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_2__.OffsetRange.ofLength(seq2.length))], false);
+ }
+ static trivialTimedOut(seq1, seq2) {
+ return new DiffAlgorithmResult([new SequenceDiff(_core_offsetRange_js__WEBPACK_IMPORTED_MODULE_2__.OffsetRange.ofLength(seq1.length), _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_2__.OffsetRange.ofLength(seq2.length))], true);
+ }
+ constructor(diffs,
+ /**
+ * Indicates if the time out was reached.
+ * In that case, the diffs might be an approximation and the user should be asked to rerun the diff with more time.
+ */
+ hitTimeout) {
+ this.diffs = diffs;
+ this.hitTimeout = hitTimeout;
+ }
+}
+class SequenceDiff {
+ static invert(sequenceDiffs, doc1Length) {
+ const result = [];
+ (0,_base_common_arrays_js__WEBPACK_IMPORTED_MODULE_0__.forEachAdjacent)(sequenceDiffs, (a, b) => {
+ result.push(SequenceDiff.fromOffsetPairs(a ? a.getEndExclusives() : OffsetPair.zero, b ? b.getStarts() : new OffsetPair(doc1Length, (a ? a.seq2Range.endExclusive - a.seq1Range.endExclusive : 0) + doc1Length)));
+ });
+ return result;
+ }
+ static fromOffsetPairs(start, endExclusive) {
+ return new SequenceDiff(new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_2__.OffsetRange(start.offset1, endExclusive.offset1), new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_2__.OffsetRange(start.offset2, endExclusive.offset2));
+ }
+ constructor(seq1Range, seq2Range) {
+ this.seq1Range = seq1Range;
+ this.seq2Range = seq2Range;
+ }
+ swap() {
+ return new SequenceDiff(this.seq2Range, this.seq1Range);
+ }
+ toString() {
+ return `${this.seq1Range} <-> ${this.seq2Range}`;
+ }
+ join(other) {
+ return new SequenceDiff(this.seq1Range.join(other.seq1Range), this.seq2Range.join(other.seq2Range));
+ }
+ delta(offset) {
+ if (offset === 0) {
+ return this;
+ }
+ return new SequenceDiff(this.seq1Range.delta(offset), this.seq2Range.delta(offset));
+ }
+ deltaStart(offset) {
+ if (offset === 0) {
+ return this;
+ }
+ return new SequenceDiff(this.seq1Range.deltaStart(offset), this.seq2Range.deltaStart(offset));
+ }
+ deltaEnd(offset) {
+ if (offset === 0) {
+ return this;
+ }
+ return new SequenceDiff(this.seq1Range.deltaEnd(offset), this.seq2Range.deltaEnd(offset));
+ }
+ intersect(other) {
+ const i1 = this.seq1Range.intersect(other.seq1Range);
+ const i2 = this.seq2Range.intersect(other.seq2Range);
+ if (!i1 || !i2) {
+ return undefined;
+ }
+ return new SequenceDiff(i1, i2);
+ }
+ getStarts() {
+ return new OffsetPair(this.seq1Range.start, this.seq2Range.start);
+ }
+ getEndExclusives() {
+ return new OffsetPair(this.seq1Range.endExclusive, this.seq2Range.endExclusive);
+ }
+}
+class OffsetPair {
+ constructor(offset1, offset2) {
+ this.offset1 = offset1;
+ this.offset2 = offset2;
+ }
+ toString() {
+ return `${this.offset1} <-> ${this.offset2}`;
+ }
+}
+OffsetPair.zero = new OffsetPair(0, 0);
+OffsetPair.max = new OffsetPair(Number.MAX_SAFE_INTEGER, Number.MAX_SAFE_INTEGER);
+class InfiniteTimeout {
+ isValid() {
+ return true;
+ }
+}
+InfiniteTimeout.instance = new InfiniteTimeout();
+class DateTimeout {
+ constructor(timeout) {
+ this.timeout = timeout;
+ this.startTime = Date.now();
+ this.valid = true;
+ if (timeout <= 0) {
+ throw new _base_common_errors_js__WEBPACK_IMPORTED_MODULE_1__.BugIndicatingError('timeout must be positive');
+ }
+ }
+ // Recommendation: Set a log-point `{this.disable()}` in the body
+ isValid() {
+ const valid = Date.now() - this.startTime < this.timeout;
+ if (!valid && this.valid) {
+ this.valid = false; // timeout reached
+ // eslint-disable-next-line no-debugger
+ debugger; // WARNING: Most likely debugging caused the timeout. Call `this.disable()` to continue without timing out.
+ }
+ return this.valid;
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/dynamicProgrammingDiffing.js":
+/*!*******************************************************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/dynamicProgrammingDiffing.js ***!
+ \*******************************************************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ DynamicProgrammingDiffing: () => (/* binding */ DynamicProgrammingDiffing)
+/* harmony export */ });
+/* harmony import */ var _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../../core/offsetRange.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/offsetRange.js");
+/* harmony import */ var _diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./diffAlgorithm.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm.js");
+/* harmony import */ var _utils_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../utils.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/utils.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+
+
+/**
+ * A O(MN) diffing algorithm that supports a score function.
+ * The algorithm can be improved by processing the 2d array diagonally.
+*/
+class DynamicProgrammingDiffing {
+ compute(sequence1, sequence2, timeout = _diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_1__.InfiniteTimeout.instance, equalityScore) {
+ if (sequence1.length === 0 || sequence2.length === 0) {
+ return _diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_1__.DiffAlgorithmResult.trivial(sequence1, sequence2);
+ }
+ /**
+ * lcsLengths.get(i, j): Length of the longest common subsequence of sequence1.substring(0, i + 1) and sequence2.substring(0, j + 1).
+ */
+ const lcsLengths = new _utils_js__WEBPACK_IMPORTED_MODULE_2__.Array2D(sequence1.length, sequence2.length);
+ const directions = new _utils_js__WEBPACK_IMPORTED_MODULE_2__.Array2D(sequence1.length, sequence2.length);
+ const lengths = new _utils_js__WEBPACK_IMPORTED_MODULE_2__.Array2D(sequence1.length, sequence2.length);
+ // ==== Initializing lcsLengths ====
+ for (let s1 = 0; s1 < sequence1.length; s1++) {
+ for (let s2 = 0; s2 < sequence2.length; s2++) {
+ if (!timeout.isValid()) {
+ return _diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_1__.DiffAlgorithmResult.trivialTimedOut(sequence1, sequence2);
+ }
+ const horizontalLen = s1 === 0 ? 0 : lcsLengths.get(s1 - 1, s2);
+ const verticalLen = s2 === 0 ? 0 : lcsLengths.get(s1, s2 - 1);
+ let extendedSeqScore;
+ if (sequence1.getElement(s1) === sequence2.getElement(s2)) {
+ if (s1 === 0 || s2 === 0) {
+ extendedSeqScore = 0;
+ }
+ else {
+ extendedSeqScore = lcsLengths.get(s1 - 1, s2 - 1);
+ }
+ if (s1 > 0 && s2 > 0 && directions.get(s1 - 1, s2 - 1) === 3) {
+ // Prefer consecutive diagonals
+ extendedSeqScore += lengths.get(s1 - 1, s2 - 1);
+ }
+ extendedSeqScore += (equalityScore ? equalityScore(s1, s2) : 1);
+ }
+ else {
+ extendedSeqScore = -1;
+ }
+ const newValue = Math.max(horizontalLen, verticalLen, extendedSeqScore);
+ if (newValue === extendedSeqScore) {
+ // Prefer diagonals
+ const prevLen = s1 > 0 && s2 > 0 ? lengths.get(s1 - 1, s2 - 1) : 0;
+ lengths.set(s1, s2, prevLen + 1);
+ directions.set(s1, s2, 3);
+ }
+ else if (newValue === horizontalLen) {
+ lengths.set(s1, s2, 0);
+ directions.set(s1, s2, 1);
+ }
+ else if (newValue === verticalLen) {
+ lengths.set(s1, s2, 0);
+ directions.set(s1, s2, 2);
+ }
+ lcsLengths.set(s1, s2, newValue);
+ }
+ }
+ // ==== Backtracking ====
+ const result = [];
+ let lastAligningPosS1 = sequence1.length;
+ let lastAligningPosS2 = sequence2.length;
+ function reportDecreasingAligningPositions(s1, s2) {
+ if (s1 + 1 !== lastAligningPosS1 || s2 + 1 !== lastAligningPosS2) {
+ result.push(new _diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_1__.SequenceDiff(new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_0__.OffsetRange(s1 + 1, lastAligningPosS1), new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_0__.OffsetRange(s2 + 1, lastAligningPosS2)));
+ }
+ lastAligningPosS1 = s1;
+ lastAligningPosS2 = s2;
+ }
+ let s1 = sequence1.length - 1;
+ let s2 = sequence2.length - 1;
+ while (s1 >= 0 && s2 >= 0) {
+ if (directions.get(s1, s2) === 3) {
+ reportDecreasingAligningPositions(s1, s2);
+ s1--;
+ s2--;
+ }
+ else {
+ if (directions.get(s1, s2) === 1) {
+ s1--;
+ }
+ else {
+ s2--;
+ }
+ }
+ }
+ reportDecreasingAligningPositions(-1, -1);
+ result.reverse();
+ return new _diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_1__.DiffAlgorithmResult(result, false);
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/myersDiffAlgorithm.js":
+/*!************************************************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/myersDiffAlgorithm.js ***!
+ \************************************************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ MyersDiffAlgorithm: () => (/* binding */ MyersDiffAlgorithm)
+/* harmony export */ });
+/* harmony import */ var _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../../core/offsetRange.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/offsetRange.js");
+/* harmony import */ var _diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./diffAlgorithm.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+
+/**
+ * An O(ND) diff algorithm that has a quadratic space worst-case complexity.
+*/
+class MyersDiffAlgorithm {
+ compute(seq1, seq2, timeout = _diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_1__.InfiniteTimeout.instance) {
+ // These are common special cases.
+ // The early return improves performance dramatically.
+ if (seq1.length === 0 || seq2.length === 0) {
+ return _diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_1__.DiffAlgorithmResult.trivial(seq1, seq2);
+ }
+ const seqX = seq1; // Text on the x axis
+ const seqY = seq2; // Text on the y axis
+ function getXAfterSnake(x, y) {
+ while (x < seqX.length && y < seqY.length && seqX.getElement(x) === seqY.getElement(y)) {
+ x++;
+ y++;
+ }
+ return x;
+ }
+ let d = 0;
+ // V[k]: X value of longest d-line that ends in diagonal k.
+ // d-line: path from (0,0) to (x,y) that uses exactly d non-diagonals.
+ // diagonal k: Set of points (x,y) with x-y = k.
+ // k=1 -> (1,0),(2,1)
+ const V = new FastInt32Array();
+ V.set(0, getXAfterSnake(0, 0));
+ const paths = new FastArrayNegativeIndices();
+ paths.set(0, V.get(0) === 0 ? null : new SnakePath(null, 0, 0, V.get(0)));
+ let k = 0;
+ loop: while (true) {
+ d++;
+ if (!timeout.isValid()) {
+ return _diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_1__.DiffAlgorithmResult.trivialTimedOut(seqX, seqY);
+ }
+ // The paper has `for (k = -d; k <= d; k += 2)`, but we can ignore diagonals that cannot influence the result.
+ const lowerBound = -Math.min(d, seqY.length + (d % 2));
+ const upperBound = Math.min(d, seqX.length + (d % 2));
+ for (k = lowerBound; k <= upperBound; k += 2) {
+ let step = 0;
+ // We can use the X values of (d-1)-lines to compute X value of the longest d-lines.
+ const maxXofDLineTop = k === upperBound ? -1 : V.get(k + 1); // We take a vertical non-diagonal (add a symbol in seqX)
+ const maxXofDLineLeft = k === lowerBound ? -1 : V.get(k - 1) + 1; // We take a horizontal non-diagonal (+1 x) (delete a symbol in seqX)
+ step++;
+ const x = Math.min(Math.max(maxXofDLineTop, maxXofDLineLeft), seqX.length);
+ const y = x - k;
+ step++;
+ if (x > seqX.length || y > seqY.length) {
+ // This diagonal is irrelevant for the result.
+ // TODO: Don't pay the cost for this in the next iteration.
+ continue;
+ }
+ const newMaxX = getXAfterSnake(x, y);
+ V.set(k, newMaxX);
+ const lastPath = x === maxXofDLineTop ? paths.get(k + 1) : paths.get(k - 1);
+ paths.set(k, newMaxX !== x ? new SnakePath(lastPath, x, y, newMaxX - x) : lastPath);
+ if (V.get(k) === seqX.length && V.get(k) - k === seqY.length) {
+ break loop;
+ }
+ }
+ }
+ let path = paths.get(k);
+ const result = [];
+ let lastAligningPosS1 = seqX.length;
+ let lastAligningPosS2 = seqY.length;
+ while (true) {
+ const endX = path ? path.x + path.length : 0;
+ const endY = path ? path.y + path.length : 0;
+ if (endX !== lastAligningPosS1 || endY !== lastAligningPosS2) {
+ result.push(new _diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_1__.SequenceDiff(new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_0__.OffsetRange(endX, lastAligningPosS1), new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_0__.OffsetRange(endY, lastAligningPosS2)));
+ }
+ if (!path) {
+ break;
+ }
+ lastAligningPosS1 = path.x;
+ lastAligningPosS2 = path.y;
+ path = path.prev;
+ }
+ result.reverse();
+ return new _diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_1__.DiffAlgorithmResult(result, false);
+ }
+}
+class SnakePath {
+ constructor(prev, x, y, length) {
+ this.prev = prev;
+ this.x = x;
+ this.y = y;
+ this.length = length;
+ }
+}
+/**
+ * An array that supports fast negative indices.
+*/
+class FastInt32Array {
+ constructor() {
+ this.positiveArr = new Int32Array(10);
+ this.negativeArr = new Int32Array(10);
+ }
+ get(idx) {
+ if (idx < 0) {
+ idx = -idx - 1;
+ return this.negativeArr[idx];
+ }
+ else {
+ return this.positiveArr[idx];
+ }
+ }
+ set(idx, value) {
+ if (idx < 0) {
+ idx = -idx - 1;
+ if (idx >= this.negativeArr.length) {
+ const arr = this.negativeArr;
+ this.negativeArr = new Int32Array(arr.length * 2);
+ this.negativeArr.set(arr);
+ }
+ this.negativeArr[idx] = value;
+ }
+ else {
+ if (idx >= this.positiveArr.length) {
+ const arr = this.positiveArr;
+ this.positiveArr = new Int32Array(arr.length * 2);
+ this.positiveArr.set(arr);
+ }
+ this.positiveArr[idx] = value;
+ }
+ }
+}
+/**
+ * An array that supports fast negative indices.
+*/
+class FastArrayNegativeIndices {
+ constructor() {
+ this.positiveArr = [];
+ this.negativeArr = [];
+ }
+ get(idx) {
+ if (idx < 0) {
+ idx = -idx - 1;
+ return this.negativeArr[idx];
+ }
+ else {
+ return this.positiveArr[idx];
+ }
+ }
+ set(idx, value) {
+ if (idx < 0) {
+ idx = -idx - 1;
+ this.negativeArr[idx] = value;
+ }
+ else {
+ this.positiveArr[idx] = value;
+ }
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/computeMovedLines.js":
+/*!************************************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/computeMovedLines.js ***!
+ \************************************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ computeMovedLines: () => (/* binding */ computeMovedLines)
+/* harmony export */ });
+/* harmony import */ var _algorithms_diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./algorithms/diffAlgorithm.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm.js");
+/* harmony import */ var _rangeMapping_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../rangeMapping.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/rangeMapping.js");
+/* harmony import */ var _base_common_arrays_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../../../base/common/arrays.js */ "./node_modules/monaco-editor/esm/vs/base/common/arrays.js");
+/* harmony import */ var _base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../../../../base/common/arraysFind.js */ "./node_modules/monaco-editor/esm/vs/base/common/arraysFind.js");
+/* harmony import */ var _base_common_map_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../../../../base/common/map.js */ "./node_modules/monaco-editor/esm/vs/base/common/map.js");
+/* harmony import */ var _core_lineRange_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../../core/lineRange.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/lineRange.js");
+/* harmony import */ var _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../../core/offsetRange.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/offsetRange.js");
+/* harmony import */ var _linesSliceCharSequence_js__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./linesSliceCharSequence.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/linesSliceCharSequence.js");
+/* harmony import */ var _utils_js__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./utils.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/utils.js");
+/* harmony import */ var _algorithms_myersDiffAlgorithm_js__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./algorithms/myersDiffAlgorithm.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/myersDiffAlgorithm.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+
+
+
+
+
+
+
+
+
+function computeMovedLines(changes, originalLines, modifiedLines, hashedOriginalLines, hashedModifiedLines, timeout) {
+ let { moves, excludedChanges } = computeMovesFromSimpleDeletionsToSimpleInsertions(changes, originalLines, modifiedLines, timeout);
+ if (!timeout.isValid()) {
+ return [];
+ }
+ const filteredChanges = changes.filter(c => !excludedChanges.has(c));
+ const unchangedMoves = computeUnchangedMoves(filteredChanges, hashedOriginalLines, hashedModifiedLines, originalLines, modifiedLines, timeout);
+ (0,_base_common_arrays_js__WEBPACK_IMPORTED_MODULE_2__.pushMany)(moves, unchangedMoves);
+ moves = joinCloseConsecutiveMoves(moves);
+ // Ignore too short moves
+ moves = moves.filter(current => {
+ const lines = current.original.toOffsetRange().slice(originalLines).map(l => l.trim());
+ const originalText = lines.join('\n');
+ return originalText.length >= 15 && countWhere(lines, l => l.length >= 2) >= 2;
+ });
+ moves = removeMovesInSameDiff(changes, moves);
+ return moves;
+}
+function countWhere(arr, predicate) {
+ let count = 0;
+ for (const t of arr) {
+ if (predicate(t)) {
+ count++;
+ }
+ }
+ return count;
+}
+function computeMovesFromSimpleDeletionsToSimpleInsertions(changes, originalLines, modifiedLines, timeout) {
+ const moves = [];
+ const deletions = changes
+ .filter(c => c.modified.isEmpty && c.original.length >= 3)
+ .map(d => new _utils_js__WEBPACK_IMPORTED_MODULE_8__.LineRangeFragment(d.original, originalLines, d));
+ const insertions = new Set(changes
+ .filter(c => c.original.isEmpty && c.modified.length >= 3)
+ .map(d => new _utils_js__WEBPACK_IMPORTED_MODULE_8__.LineRangeFragment(d.modified, modifiedLines, d)));
+ const excludedChanges = new Set();
+ for (const deletion of deletions) {
+ let highestSimilarity = -1;
+ let best;
+ for (const insertion of insertions) {
+ const similarity = deletion.computeSimilarity(insertion);
+ if (similarity > highestSimilarity) {
+ highestSimilarity = similarity;
+ best = insertion;
+ }
+ }
+ if (highestSimilarity > 0.90 && best) {
+ insertions.delete(best);
+ moves.push(new _rangeMapping_js__WEBPACK_IMPORTED_MODULE_1__.LineRangeMapping(deletion.range, best.range));
+ excludedChanges.add(deletion.source);
+ excludedChanges.add(best.source);
+ }
+ if (!timeout.isValid()) {
+ return { moves, excludedChanges };
+ }
+ }
+ return { moves, excludedChanges };
+}
+function computeUnchangedMoves(changes, hashedOriginalLines, hashedModifiedLines, originalLines, modifiedLines, timeout) {
+ const moves = [];
+ const original3LineHashes = new _base_common_map_js__WEBPACK_IMPORTED_MODULE_4__.SetMap();
+ for (const change of changes) {
+ for (let i = change.original.startLineNumber; i < change.original.endLineNumberExclusive - 2; i++) {
+ const key = `${hashedOriginalLines[i - 1]}:${hashedOriginalLines[i + 1 - 1]}:${hashedOriginalLines[i + 2 - 1]}`;
+ original3LineHashes.add(key, { range: new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_5__.LineRange(i, i + 3) });
+ }
+ }
+ const possibleMappings = [];
+ changes.sort((0,_base_common_arrays_js__WEBPACK_IMPORTED_MODULE_2__.compareBy)(c => c.modified.startLineNumber, _base_common_arrays_js__WEBPACK_IMPORTED_MODULE_2__.numberComparator));
+ for (const change of changes) {
+ let lastMappings = [];
+ for (let i = change.modified.startLineNumber; i < change.modified.endLineNumberExclusive - 2; i++) {
+ const key = `${hashedModifiedLines[i - 1]}:${hashedModifiedLines[i + 1 - 1]}:${hashedModifiedLines[i + 2 - 1]}`;
+ const currentModifiedRange = new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_5__.LineRange(i, i + 3);
+ const nextMappings = [];
+ original3LineHashes.forEach(key, ({ range }) => {
+ for (const lastMapping of lastMappings) {
+ // does this match extend some last match?
+ if (lastMapping.originalLineRange.endLineNumberExclusive + 1 === range.endLineNumberExclusive &&
+ lastMapping.modifiedLineRange.endLineNumberExclusive + 1 === currentModifiedRange.endLineNumberExclusive) {
+ lastMapping.originalLineRange = new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_5__.LineRange(lastMapping.originalLineRange.startLineNumber, range.endLineNumberExclusive);
+ lastMapping.modifiedLineRange = new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_5__.LineRange(lastMapping.modifiedLineRange.startLineNumber, currentModifiedRange.endLineNumberExclusive);
+ nextMappings.push(lastMapping);
+ return;
+ }
+ }
+ const mapping = {
+ modifiedLineRange: currentModifiedRange,
+ originalLineRange: range,
+ };
+ possibleMappings.push(mapping);
+ nextMappings.push(mapping);
+ });
+ lastMappings = nextMappings;
+ }
+ if (!timeout.isValid()) {
+ return [];
+ }
+ }
+ possibleMappings.sort((0,_base_common_arrays_js__WEBPACK_IMPORTED_MODULE_2__.reverseOrder)((0,_base_common_arrays_js__WEBPACK_IMPORTED_MODULE_2__.compareBy)(m => m.modifiedLineRange.length, _base_common_arrays_js__WEBPACK_IMPORTED_MODULE_2__.numberComparator)));
+ const modifiedSet = new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_5__.LineRangeSet();
+ const originalSet = new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_5__.LineRangeSet();
+ for (const mapping of possibleMappings) {
+ const diffOrigToMod = mapping.modifiedLineRange.startLineNumber - mapping.originalLineRange.startLineNumber;
+ const modifiedSections = modifiedSet.subtractFrom(mapping.modifiedLineRange);
+ const originalTranslatedSections = originalSet.subtractFrom(mapping.originalLineRange).getWithDelta(diffOrigToMod);
+ const modifiedIntersectedSections = modifiedSections.getIntersection(originalTranslatedSections);
+ for (const s of modifiedIntersectedSections.ranges) {
+ if (s.length < 3) {
+ continue;
+ }
+ const modifiedLineRange = s;
+ const originalLineRange = s.delta(-diffOrigToMod);
+ moves.push(new _rangeMapping_js__WEBPACK_IMPORTED_MODULE_1__.LineRangeMapping(originalLineRange, modifiedLineRange));
+ modifiedSet.addRange(modifiedLineRange);
+ originalSet.addRange(originalLineRange);
+ }
+ }
+ moves.sort((0,_base_common_arrays_js__WEBPACK_IMPORTED_MODULE_2__.compareBy)(m => m.original.startLineNumber, _base_common_arrays_js__WEBPACK_IMPORTED_MODULE_2__.numberComparator));
+ const monotonousChanges = new _base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_3__.MonotonousArray(changes);
+ for (let i = 0; i < moves.length; i++) {
+ const move = moves[i];
+ const firstTouchingChangeOrig = monotonousChanges.findLastMonotonous(c => c.original.startLineNumber <= move.original.startLineNumber);
+ const firstTouchingChangeMod = (0,_base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_3__.findLastMonotonous)(changes, c => c.modified.startLineNumber <= move.modified.startLineNumber);
+ const linesAbove = Math.max(move.original.startLineNumber - firstTouchingChangeOrig.original.startLineNumber, move.modified.startLineNumber - firstTouchingChangeMod.modified.startLineNumber);
+ const lastTouchingChangeOrig = monotonousChanges.findLastMonotonous(c => c.original.startLineNumber < move.original.endLineNumberExclusive);
+ const lastTouchingChangeMod = (0,_base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_3__.findLastMonotonous)(changes, c => c.modified.startLineNumber < move.modified.endLineNumberExclusive);
+ const linesBelow = Math.max(lastTouchingChangeOrig.original.endLineNumberExclusive - move.original.endLineNumberExclusive, lastTouchingChangeMod.modified.endLineNumberExclusive - move.modified.endLineNumberExclusive);
+ let extendToTop;
+ for (extendToTop = 0; extendToTop < linesAbove; extendToTop++) {
+ const origLine = move.original.startLineNumber - extendToTop - 1;
+ const modLine = move.modified.startLineNumber - extendToTop - 1;
+ if (origLine > originalLines.length || modLine > modifiedLines.length) {
+ break;
+ }
+ if (modifiedSet.contains(modLine) || originalSet.contains(origLine)) {
+ break;
+ }
+ if (!areLinesSimilar(originalLines[origLine - 1], modifiedLines[modLine - 1], timeout)) {
+ break;
+ }
+ }
+ if (extendToTop > 0) {
+ originalSet.addRange(new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_5__.LineRange(move.original.startLineNumber - extendToTop, move.original.startLineNumber));
+ modifiedSet.addRange(new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_5__.LineRange(move.modified.startLineNumber - extendToTop, move.modified.startLineNumber));
+ }
+ let extendToBottom;
+ for (extendToBottom = 0; extendToBottom < linesBelow; extendToBottom++) {
+ const origLine = move.original.endLineNumberExclusive + extendToBottom;
+ const modLine = move.modified.endLineNumberExclusive + extendToBottom;
+ if (origLine > originalLines.length || modLine > modifiedLines.length) {
+ break;
+ }
+ if (modifiedSet.contains(modLine) || originalSet.contains(origLine)) {
+ break;
+ }
+ if (!areLinesSimilar(originalLines[origLine - 1], modifiedLines[modLine - 1], timeout)) {
+ break;
+ }
+ }
+ if (extendToBottom > 0) {
+ originalSet.addRange(new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_5__.LineRange(move.original.endLineNumberExclusive, move.original.endLineNumberExclusive + extendToBottom));
+ modifiedSet.addRange(new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_5__.LineRange(move.modified.endLineNumberExclusive, move.modified.endLineNumberExclusive + extendToBottom));
+ }
+ if (extendToTop > 0 || extendToBottom > 0) {
+ moves[i] = new _rangeMapping_js__WEBPACK_IMPORTED_MODULE_1__.LineRangeMapping(new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_5__.LineRange(move.original.startLineNumber - extendToTop, move.original.endLineNumberExclusive + extendToBottom), new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_5__.LineRange(move.modified.startLineNumber - extendToTop, move.modified.endLineNumberExclusive + extendToBottom));
+ }
+ }
+ return moves;
+}
+function areLinesSimilar(line1, line2, timeout) {
+ if (line1.trim() === line2.trim()) {
+ return true;
+ }
+ if (line1.length > 300 && line2.length > 300) {
+ return false;
+ }
+ const myersDiffingAlgorithm = new _algorithms_myersDiffAlgorithm_js__WEBPACK_IMPORTED_MODULE_9__.MyersDiffAlgorithm();
+ const result = myersDiffingAlgorithm.compute(new _linesSliceCharSequence_js__WEBPACK_IMPORTED_MODULE_7__.LinesSliceCharSequence([line1], new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_6__.OffsetRange(0, 1), false), new _linesSliceCharSequence_js__WEBPACK_IMPORTED_MODULE_7__.LinesSliceCharSequence([line2], new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_6__.OffsetRange(0, 1), false), timeout);
+ let commonNonSpaceCharCount = 0;
+ const inverted = _algorithms_diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_0__.SequenceDiff.invert(result.diffs, line1.length);
+ for (const seq of inverted) {
+ seq.seq1Range.forEach(idx => {
+ if (!(0,_utils_js__WEBPACK_IMPORTED_MODULE_8__.isSpace)(line1.charCodeAt(idx))) {
+ commonNonSpaceCharCount++;
+ }
+ });
+ }
+ function countNonWsChars(str) {
+ let count = 0;
+ for (let i = 0; i < line1.length; i++) {
+ if (!(0,_utils_js__WEBPACK_IMPORTED_MODULE_8__.isSpace)(str.charCodeAt(i))) {
+ count++;
+ }
+ }
+ return count;
+ }
+ const longerLineLength = countNonWsChars(line1.length > line2.length ? line1 : line2);
+ const r = commonNonSpaceCharCount / longerLineLength > 0.6 && longerLineLength > 10;
+ return r;
+}
+function joinCloseConsecutiveMoves(moves) {
+ if (moves.length === 0) {
+ return moves;
+ }
+ moves.sort((0,_base_common_arrays_js__WEBPACK_IMPORTED_MODULE_2__.compareBy)(m => m.original.startLineNumber, _base_common_arrays_js__WEBPACK_IMPORTED_MODULE_2__.numberComparator));
+ const result = [moves[0]];
+ for (let i = 1; i < moves.length; i++) {
+ const last = result[result.length - 1];
+ const current = moves[i];
+ const originalDist = current.original.startLineNumber - last.original.endLineNumberExclusive;
+ const modifiedDist = current.modified.startLineNumber - last.modified.endLineNumberExclusive;
+ const currentMoveAfterLast = originalDist >= 0 && modifiedDist >= 0;
+ if (currentMoveAfterLast && originalDist + modifiedDist <= 2) {
+ result[result.length - 1] = last.join(current);
+ continue;
+ }
+ result.push(current);
+ }
+ return result;
+}
+function removeMovesInSameDiff(changes, moves) {
+ const changesMonotonous = new _base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_3__.MonotonousArray(changes);
+ moves = moves.filter(m => {
+ const diffBeforeEndOfMoveOriginal = changesMonotonous.findLastMonotonous(c => c.original.startLineNumber < m.original.endLineNumberExclusive)
+ || new _rangeMapping_js__WEBPACK_IMPORTED_MODULE_1__.LineRangeMapping(new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_5__.LineRange(1, 1), new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_5__.LineRange(1, 1));
+ const diffBeforeEndOfMoveModified = (0,_base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_3__.findLastMonotonous)(changes, c => c.modified.startLineNumber < m.modified.endLineNumberExclusive);
+ const differentDiffs = diffBeforeEndOfMoveOriginal !== diffBeforeEndOfMoveModified;
+ return differentDiffs;
+ });
+ return moves;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/defaultLinesDiffComputer.js":
+/*!*******************************************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/defaultLinesDiffComputer.js ***!
+ \*******************************************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ DefaultLinesDiffComputer: () => (/* binding */ DefaultLinesDiffComputer),
+/* harmony export */ getLineRangeMapping: () => (/* binding */ getLineRangeMapping),
+/* harmony export */ lineRangeMappingFromRangeMappings: () => (/* binding */ lineRangeMappingFromRangeMappings)
+/* harmony export */ });
+/* 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_assert_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../../../base/common/assert.js */ "./node_modules/monaco-editor/esm/vs/base/common/assert.js");
+/* harmony import */ var _core_lineRange_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../core/lineRange.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/lineRange.js");
+/* harmony import */ var _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../../core/offsetRange.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/offsetRange.js");
+/* harmony import */ var _core_range_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../../core/range.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/range.js");
+/* harmony import */ var _algorithms_diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./algorithms/diffAlgorithm.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm.js");
+/* harmony import */ var _algorithms_dynamicProgrammingDiffing_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./algorithms/dynamicProgrammingDiffing.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/dynamicProgrammingDiffing.js");
+/* harmony import */ var _algorithms_myersDiffAlgorithm_js__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./algorithms/myersDiffAlgorithm.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/myersDiffAlgorithm.js");
+/* harmony import */ var _computeMovedLines_js__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./computeMovedLines.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/computeMovedLines.js");
+/* harmony import */ var _heuristicSequenceOptimizations_js__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./heuristicSequenceOptimizations.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/heuristicSequenceOptimizations.js");
+/* harmony import */ var _linesDiffComputer_js__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../linesDiffComputer.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/linesDiffComputer.js");
+/* harmony import */ var _rangeMapping_js__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../rangeMapping.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/rangeMapping.js");
+/* harmony import */ var _linesSliceCharSequence_js__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./linesSliceCharSequence.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/linesSliceCharSequence.js");
+/* harmony import */ var _lineSequence_js__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ./lineSequence.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/lineSequence.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+class DefaultLinesDiffComputer {
+ constructor() {
+ this.dynamicProgrammingDiffing = new _algorithms_dynamicProgrammingDiffing_js__WEBPACK_IMPORTED_MODULE_6__.DynamicProgrammingDiffing();
+ this.myersDiffingAlgorithm = new _algorithms_myersDiffAlgorithm_js__WEBPACK_IMPORTED_MODULE_7__.MyersDiffAlgorithm();
+ }
+ computeDiff(originalLines, modifiedLines, options) {
+ if (originalLines.length <= 1 && (0,_base_common_arrays_js__WEBPACK_IMPORTED_MODULE_0__.equals)(originalLines, modifiedLines, (a, b) => a === b)) {
+ return new _linesDiffComputer_js__WEBPACK_IMPORTED_MODULE_10__.LinesDiff([], [], false);
+ }
+ if (originalLines.length === 1 && originalLines[0].length === 0 || modifiedLines.length === 1 && modifiedLines[0].length === 0) {
+ return new _linesDiffComputer_js__WEBPACK_IMPORTED_MODULE_10__.LinesDiff([
+ new _rangeMapping_js__WEBPACK_IMPORTED_MODULE_11__.DetailedLineRangeMapping(new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_2__.LineRange(1, originalLines.length + 1), new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_2__.LineRange(1, modifiedLines.length + 1), [
+ new _rangeMapping_js__WEBPACK_IMPORTED_MODULE_11__.RangeMapping(new _core_range_js__WEBPACK_IMPORTED_MODULE_4__.Range(1, 1, originalLines.length, originalLines[0].length + 1), new _core_range_js__WEBPACK_IMPORTED_MODULE_4__.Range(1, 1, modifiedLines.length, modifiedLines[0].length + 1))
+ ])
+ ], [], false);
+ }
+ const timeout = options.maxComputationTimeMs === 0 ? _algorithms_diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_5__.InfiniteTimeout.instance : new _algorithms_diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_5__.DateTimeout(options.maxComputationTimeMs);
+ const considerWhitespaceChanges = !options.ignoreTrimWhitespace;
+ const perfectHashes = new Map();
+ function getOrCreateHash(text) {
+ let hash = perfectHashes.get(text);
+ if (hash === undefined) {
+ hash = perfectHashes.size;
+ perfectHashes.set(text, hash);
+ }
+ return hash;
+ }
+ const originalLinesHashes = originalLines.map((l) => getOrCreateHash(l.trim()));
+ const modifiedLinesHashes = modifiedLines.map((l) => getOrCreateHash(l.trim()));
+ const sequence1 = new _lineSequence_js__WEBPACK_IMPORTED_MODULE_13__.LineSequence(originalLinesHashes, originalLines);
+ const sequence2 = new _lineSequence_js__WEBPACK_IMPORTED_MODULE_13__.LineSequence(modifiedLinesHashes, modifiedLines);
+ const lineAlignmentResult = (() => {
+ if (sequence1.length + sequence2.length < 1700) {
+ // Use the improved algorithm for small files
+ return this.dynamicProgrammingDiffing.compute(sequence1, sequence2, timeout, (offset1, offset2) => originalLines[offset1] === modifiedLines[offset2]
+ ? modifiedLines[offset2].length === 0
+ ? 0.1
+ : 1 + Math.log(1 + modifiedLines[offset2].length)
+ : 0.99);
+ }
+ return this.myersDiffingAlgorithm.compute(sequence1, sequence2);
+ })();
+ let lineAlignments = lineAlignmentResult.diffs;
+ let hitTimeout = lineAlignmentResult.hitTimeout;
+ lineAlignments = (0,_heuristicSequenceOptimizations_js__WEBPACK_IMPORTED_MODULE_9__.optimizeSequenceDiffs)(sequence1, sequence2, lineAlignments);
+ lineAlignments = (0,_heuristicSequenceOptimizations_js__WEBPACK_IMPORTED_MODULE_9__.removeVeryShortMatchingLinesBetweenDiffs)(sequence1, sequence2, lineAlignments);
+ const alignments = [];
+ const scanForWhitespaceChanges = (equalLinesCount) => {
+ if (!considerWhitespaceChanges) {
+ return;
+ }
+ for (let i = 0; i < equalLinesCount; i++) {
+ const seq1Offset = seq1LastStart + i;
+ const seq2Offset = seq2LastStart + i;
+ if (originalLines[seq1Offset] !== modifiedLines[seq2Offset]) {
+ // This is because of whitespace changes, diff these lines
+ const characterDiffs = this.refineDiff(originalLines, modifiedLines, new _algorithms_diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_5__.SequenceDiff(new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_3__.OffsetRange(seq1Offset, seq1Offset + 1), new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_3__.OffsetRange(seq2Offset, seq2Offset + 1)), timeout, considerWhitespaceChanges);
+ for (const a of characterDiffs.mappings) {
+ alignments.push(a);
+ }
+ if (characterDiffs.hitTimeout) {
+ hitTimeout = true;
+ }
+ }
+ }
+ };
+ let seq1LastStart = 0;
+ let seq2LastStart = 0;
+ for (const diff of lineAlignments) {
+ (0,_base_common_assert_js__WEBPACK_IMPORTED_MODULE_1__.assertFn)(() => diff.seq1Range.start - seq1LastStart === diff.seq2Range.start - seq2LastStart);
+ const equalLinesCount = diff.seq1Range.start - seq1LastStart;
+ scanForWhitespaceChanges(equalLinesCount);
+ seq1LastStart = diff.seq1Range.endExclusive;
+ seq2LastStart = diff.seq2Range.endExclusive;
+ const characterDiffs = this.refineDiff(originalLines, modifiedLines, diff, timeout, considerWhitespaceChanges);
+ if (characterDiffs.hitTimeout) {
+ hitTimeout = true;
+ }
+ for (const a of characterDiffs.mappings) {
+ alignments.push(a);
+ }
+ }
+ scanForWhitespaceChanges(originalLines.length - seq1LastStart);
+ const changes = lineRangeMappingFromRangeMappings(alignments, originalLines, modifiedLines);
+ let moves = [];
+ if (options.computeMoves) {
+ moves = this.computeMoves(changes, originalLines, modifiedLines, originalLinesHashes, modifiedLinesHashes, timeout, considerWhitespaceChanges);
+ }
+ // Make sure all ranges are valid
+ (0,_base_common_assert_js__WEBPACK_IMPORTED_MODULE_1__.assertFn)(() => {
+ function validatePosition(pos, lines) {
+ if (pos.lineNumber < 1 || pos.lineNumber > lines.length) {
+ return false;
+ }
+ const line = lines[pos.lineNumber - 1];
+ if (pos.column < 1 || pos.column > line.length + 1) {
+ return false;
+ }
+ return true;
+ }
+ function validateRange(range, lines) {
+ if (range.startLineNumber < 1 || range.startLineNumber > lines.length + 1) {
+ return false;
+ }
+ if (range.endLineNumberExclusive < 1 || range.endLineNumberExclusive > lines.length + 1) {
+ return false;
+ }
+ return true;
+ }
+ for (const c of changes) {
+ if (!c.innerChanges) {
+ return false;
+ }
+ for (const ic of c.innerChanges) {
+ const valid = validatePosition(ic.modifiedRange.getStartPosition(), modifiedLines) && validatePosition(ic.modifiedRange.getEndPosition(), modifiedLines) &&
+ validatePosition(ic.originalRange.getStartPosition(), originalLines) && validatePosition(ic.originalRange.getEndPosition(), originalLines);
+ if (!valid) {
+ return false;
+ }
+ }
+ if (!validateRange(c.modified, modifiedLines) || !validateRange(c.original, originalLines)) {
+ return false;
+ }
+ }
+ return true;
+ });
+ return new _linesDiffComputer_js__WEBPACK_IMPORTED_MODULE_10__.LinesDiff(changes, moves, hitTimeout);
+ }
+ computeMoves(changes, originalLines, modifiedLines, hashedOriginalLines, hashedModifiedLines, timeout, considerWhitespaceChanges) {
+ const moves = (0,_computeMovedLines_js__WEBPACK_IMPORTED_MODULE_8__.computeMovedLines)(changes, originalLines, modifiedLines, hashedOriginalLines, hashedModifiedLines, timeout);
+ const movesWithDiffs = moves.map(m => {
+ const moveChanges = this.refineDiff(originalLines, modifiedLines, new _algorithms_diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_5__.SequenceDiff(m.original.toOffsetRange(), m.modified.toOffsetRange()), timeout, considerWhitespaceChanges);
+ const mappings = lineRangeMappingFromRangeMappings(moveChanges.mappings, originalLines, modifiedLines, true);
+ return new _linesDiffComputer_js__WEBPACK_IMPORTED_MODULE_10__.MovedText(m, mappings);
+ });
+ return movesWithDiffs;
+ }
+ refineDiff(originalLines, modifiedLines, diff, timeout, considerWhitespaceChanges) {
+ const slice1 = new _linesSliceCharSequence_js__WEBPACK_IMPORTED_MODULE_12__.LinesSliceCharSequence(originalLines, diff.seq1Range, considerWhitespaceChanges);
+ const slice2 = new _linesSliceCharSequence_js__WEBPACK_IMPORTED_MODULE_12__.LinesSliceCharSequence(modifiedLines, diff.seq2Range, considerWhitespaceChanges);
+ const diffResult = slice1.length + slice2.length < 500
+ ? this.dynamicProgrammingDiffing.compute(slice1, slice2, timeout)
+ : this.myersDiffingAlgorithm.compute(slice1, slice2, timeout);
+ let diffs = diffResult.diffs;
+ diffs = (0,_heuristicSequenceOptimizations_js__WEBPACK_IMPORTED_MODULE_9__.optimizeSequenceDiffs)(slice1, slice2, diffs);
+ diffs = (0,_heuristicSequenceOptimizations_js__WEBPACK_IMPORTED_MODULE_9__.extendDiffsToEntireWordIfAppropriate)(slice1, slice2, diffs);
+ diffs = (0,_heuristicSequenceOptimizations_js__WEBPACK_IMPORTED_MODULE_9__.removeShortMatches)(slice1, slice2, diffs);
+ diffs = (0,_heuristicSequenceOptimizations_js__WEBPACK_IMPORTED_MODULE_9__.removeVeryShortMatchingTextBetweenLongDiffs)(slice1, slice2, diffs);
+ const result = diffs.map((d) => new _rangeMapping_js__WEBPACK_IMPORTED_MODULE_11__.RangeMapping(slice1.translateRange(d.seq1Range), slice2.translateRange(d.seq2Range)));
+ // Assert: result applied on original should be the same as diff applied to original
+ return {
+ mappings: result,
+ hitTimeout: diffResult.hitTimeout,
+ };
+ }
+}
+function lineRangeMappingFromRangeMappings(alignments, originalLines, modifiedLines, dontAssertStartLine = false) {
+ const changes = [];
+ for (const g of (0,_base_common_arrays_js__WEBPACK_IMPORTED_MODULE_0__.groupAdjacentBy)(alignments.map(a => getLineRangeMapping(a, originalLines, modifiedLines)), (a1, a2) => a1.original.overlapOrTouch(a2.original)
+ || a1.modified.overlapOrTouch(a2.modified))) {
+ const first = g[0];
+ const last = g[g.length - 1];
+ changes.push(new _rangeMapping_js__WEBPACK_IMPORTED_MODULE_11__.DetailedLineRangeMapping(first.original.join(last.original), first.modified.join(last.modified), g.map(a => a.innerChanges[0])));
+ }
+ (0,_base_common_assert_js__WEBPACK_IMPORTED_MODULE_1__.assertFn)(() => {
+ if (!dontAssertStartLine) {
+ if (changes.length > 0 && changes[0].original.startLineNumber !== changes[0].modified.startLineNumber) {
+ return false;
+ }
+ }
+ return (0,_base_common_assert_js__WEBPACK_IMPORTED_MODULE_1__.checkAdjacentItems)(changes, (m1, m2) => m2.original.startLineNumber - m1.original.endLineNumberExclusive === m2.modified.startLineNumber - m1.modified.endLineNumberExclusive &&
+ // There has to be an unchanged line in between (otherwise both diffs should have been joined)
+ m1.original.endLineNumberExclusive < m2.original.startLineNumber &&
+ m1.modified.endLineNumberExclusive < m2.modified.startLineNumber);
+ });
+ return changes;
+}
+function getLineRangeMapping(rangeMapping, originalLines, modifiedLines) {
+ let lineStartDelta = 0;
+ let lineEndDelta = 0;
+ // rangeMapping describes the edit that replaces `rangeMapping.originalRange` with `newText := getText(modifiedLines, rangeMapping.modifiedRange)`.
+ // original: ]xxx \n <- this line is not modified
+ // modified: ]xx \n
+ if (rangeMapping.modifiedRange.endColumn === 1 && rangeMapping.originalRange.endColumn === 1
+ && rangeMapping.originalRange.startLineNumber + lineStartDelta <= rangeMapping.originalRange.endLineNumber
+ && rangeMapping.modifiedRange.startLineNumber + lineStartDelta <= rangeMapping.modifiedRange.endLineNumber) {
+ // We can only do this if the range is not empty yet
+ lineEndDelta = -1;
+ }
+ // original: xxx[ \n <- this line is not modified
+ // modified: xxx[ \n
+ if (rangeMapping.modifiedRange.startColumn - 1 >= modifiedLines[rangeMapping.modifiedRange.startLineNumber - 1].length
+ && rangeMapping.originalRange.startColumn - 1 >= originalLines[rangeMapping.originalRange.startLineNumber - 1].length
+ && rangeMapping.originalRange.startLineNumber <= rangeMapping.originalRange.endLineNumber + lineEndDelta
+ && rangeMapping.modifiedRange.startLineNumber <= rangeMapping.modifiedRange.endLineNumber + lineEndDelta) {
+ // We can only do this if the range is not empty yet
+ lineStartDelta = 1;
+ }
+ const originalLineRange = new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_2__.LineRange(rangeMapping.originalRange.startLineNumber + lineStartDelta, rangeMapping.originalRange.endLineNumber + 1 + lineEndDelta);
+ const modifiedLineRange = new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_2__.LineRange(rangeMapping.modifiedRange.startLineNumber + lineStartDelta, rangeMapping.modifiedRange.endLineNumber + 1 + lineEndDelta);
+ return new _rangeMapping_js__WEBPACK_IMPORTED_MODULE_11__.DetailedLineRangeMapping(originalLineRange, modifiedLineRange, [rangeMapping]);
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/heuristicSequenceOptimizations.js":
+/*!*************************************************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/heuristicSequenceOptimizations.js ***!
+ \*************************************************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ extendDiffsToEntireWordIfAppropriate: () => (/* binding */ extendDiffsToEntireWordIfAppropriate),
+/* harmony export */ optimizeSequenceDiffs: () => (/* binding */ optimizeSequenceDiffs),
+/* harmony export */ removeShortMatches: () => (/* binding */ removeShortMatches),
+/* harmony export */ removeVeryShortMatchingLinesBetweenDiffs: () => (/* binding */ removeVeryShortMatchingLinesBetweenDiffs),
+/* harmony export */ removeVeryShortMatchingTextBetweenLongDiffs: () => (/* binding */ removeVeryShortMatchingTextBetweenLongDiffs)
+/* harmony export */ });
+/* 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 _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../core/offsetRange.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/offsetRange.js");
+/* harmony import */ var _algorithms_diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./algorithms/diffAlgorithm.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+
+
+function optimizeSequenceDiffs(sequence1, sequence2, sequenceDiffs) {
+ let result = sequenceDiffs;
+ result = joinSequenceDiffsByShifting(sequence1, sequence2, result);
+ // Sometimes, calling this function twice improves the result.
+ // Uncomment the second invocation and run the tests to see the difference.
+ result = joinSequenceDiffsByShifting(sequence1, sequence2, result);
+ result = shiftSequenceDiffs(sequence1, sequence2, result);
+ return result;
+}
+/**
+ * This function fixes issues like this:
+ * ```
+ * import { Baz, Bar } from "foo";
+ * ```
+ * <->
+ * ```
+ * import { Baz, Bar, Foo } from "foo";
+ * ```
+ * Computed diff: [ {Add "," after Bar}, {Add "Foo " after space} }
+ * Improved diff: [{Add ", Foo" after Bar}]
+ */
+function joinSequenceDiffsByShifting(sequence1, sequence2, sequenceDiffs) {
+ if (sequenceDiffs.length === 0) {
+ return sequenceDiffs;
+ }
+ const result = [];
+ result.push(sequenceDiffs[0]);
+ // First move them all to the left as much as possible and join them if possible
+ for (let i = 1; i < sequenceDiffs.length; i++) {
+ const prevResult = result[result.length - 1];
+ let cur = sequenceDiffs[i];
+ if (cur.seq1Range.isEmpty || cur.seq2Range.isEmpty) {
+ const length = cur.seq1Range.start - prevResult.seq1Range.endExclusive;
+ let d;
+ for (d = 1; d <= length; d++) {
+ if (sequence1.getElement(cur.seq1Range.start - d) !== sequence1.getElement(cur.seq1Range.endExclusive - d) ||
+ sequence2.getElement(cur.seq2Range.start - d) !== sequence2.getElement(cur.seq2Range.endExclusive - d)) {
+ break;
+ }
+ }
+ d--;
+ if (d === length) {
+ // Merge previous and current diff
+ result[result.length - 1] = new _algorithms_diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_2__.SequenceDiff(new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange(prevResult.seq1Range.start, cur.seq1Range.endExclusive - length), new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange(prevResult.seq2Range.start, cur.seq2Range.endExclusive - length));
+ continue;
+ }
+ cur = cur.delta(-d);
+ }
+ result.push(cur);
+ }
+ const result2 = [];
+ // Then move them all to the right and join them again if possible
+ for (let i = 0; i < result.length - 1; i++) {
+ const nextResult = result[i + 1];
+ let cur = result[i];
+ if (cur.seq1Range.isEmpty || cur.seq2Range.isEmpty) {
+ const length = nextResult.seq1Range.start - cur.seq1Range.endExclusive;
+ let d;
+ for (d = 0; d < length; d++) {
+ if (!sequence1.isStronglyEqual(cur.seq1Range.start + d, cur.seq1Range.endExclusive + d) ||
+ !sequence2.isStronglyEqual(cur.seq2Range.start + d, cur.seq2Range.endExclusive + d)) {
+ break;
+ }
+ }
+ if (d === length) {
+ // Merge previous and current diff, write to result!
+ result[i + 1] = new _algorithms_diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_2__.SequenceDiff(new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange(cur.seq1Range.start + length, nextResult.seq1Range.endExclusive), new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange(cur.seq2Range.start + length, nextResult.seq2Range.endExclusive));
+ continue;
+ }
+ if (d > 0) {
+ cur = cur.delta(d);
+ }
+ }
+ result2.push(cur);
+ }
+ if (result.length > 0) {
+ result2.push(result[result.length - 1]);
+ }
+ return result2;
+}
+// align character level diffs at whitespace characters
+// import { IBar } from "foo";
+// import { I[Arr, I]Bar } from "foo";
+// ->
+// import { [IArr, ]IBar } from "foo";
+// import { ITransaction, observableValue, transaction } from 'vs/base/common/observable';
+// import { ITransaction, observable[FromEvent, observable]Value, transaction } from 'vs/base/common/observable';
+// ->
+// import { ITransaction, [observableFromEvent, ]observableValue, transaction } from 'vs/base/common/observable';
+// collectBrackets(level + 1, levelPerBracketType);
+// collectBrackets(level + 1, levelPerBracket[ + 1, levelPerBracket]Type);
+// ->
+// collectBrackets(level + 1, [levelPerBracket + 1, ]levelPerBracketType);
+function shiftSequenceDiffs(sequence1, sequence2, sequenceDiffs) {
+ if (!sequence1.getBoundaryScore || !sequence2.getBoundaryScore) {
+ return sequenceDiffs;
+ }
+ for (let i = 0; i < sequenceDiffs.length; i++) {
+ const prevDiff = (i > 0 ? sequenceDiffs[i - 1] : undefined);
+ const diff = sequenceDiffs[i];
+ const nextDiff = (i + 1 < sequenceDiffs.length ? sequenceDiffs[i + 1] : undefined);
+ const seq1ValidRange = new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange(prevDiff ? prevDiff.seq1Range.start + 1 : 0, nextDiff ? nextDiff.seq1Range.endExclusive - 1 : sequence1.length);
+ const seq2ValidRange = new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange(prevDiff ? prevDiff.seq2Range.start + 1 : 0, nextDiff ? nextDiff.seq2Range.endExclusive - 1 : sequence2.length);
+ if (diff.seq1Range.isEmpty) {
+ sequenceDiffs[i] = shiftDiffToBetterPosition(diff, sequence1, sequence2, seq1ValidRange, seq2ValidRange);
+ }
+ else if (diff.seq2Range.isEmpty) {
+ sequenceDiffs[i] = shiftDiffToBetterPosition(diff.swap(), sequence2, sequence1, seq2ValidRange, seq1ValidRange).swap();
+ }
+ }
+ return sequenceDiffs;
+}
+function shiftDiffToBetterPosition(diff, sequence1, sequence2, seq1ValidRange, seq2ValidRange) {
+ const maxShiftLimit = 100; // To prevent performance issues
+ // don't touch previous or next!
+ let deltaBefore = 1;
+ while (diff.seq1Range.start - deltaBefore >= seq1ValidRange.start &&
+ diff.seq2Range.start - deltaBefore >= seq2ValidRange.start &&
+ sequence2.isStronglyEqual(diff.seq2Range.start - deltaBefore, diff.seq2Range.endExclusive - deltaBefore) && deltaBefore < maxShiftLimit) {
+ deltaBefore++;
+ }
+ deltaBefore--;
+ let deltaAfter = 0;
+ while (diff.seq1Range.start + deltaAfter < seq1ValidRange.endExclusive &&
+ diff.seq2Range.endExclusive + deltaAfter < seq2ValidRange.endExclusive &&
+ sequence2.isStronglyEqual(diff.seq2Range.start + deltaAfter, diff.seq2Range.endExclusive + deltaAfter) && deltaAfter < maxShiftLimit) {
+ deltaAfter++;
+ }
+ if (deltaBefore === 0 && deltaAfter === 0) {
+ return diff;
+ }
+ // Visualize `[sequence1.text, diff.seq1Range.start + deltaAfter]`
+ // and `[sequence2.text, diff.seq2Range.start + deltaAfter, diff.seq2Range.endExclusive + deltaAfter]`
+ let bestDelta = 0;
+ let bestScore = -1;
+ // find best scored delta
+ for (let delta = -deltaBefore; delta <= deltaAfter; delta++) {
+ const seq2OffsetStart = diff.seq2Range.start + delta;
+ const seq2OffsetEndExclusive = diff.seq2Range.endExclusive + delta;
+ const seq1Offset = diff.seq1Range.start + delta;
+ const score = sequence1.getBoundaryScore(seq1Offset) + sequence2.getBoundaryScore(seq2OffsetStart) + sequence2.getBoundaryScore(seq2OffsetEndExclusive);
+ if (score > bestScore) {
+ bestScore = score;
+ bestDelta = delta;
+ }
+ }
+ return diff.delta(bestDelta);
+}
+function removeShortMatches(sequence1, sequence2, sequenceDiffs) {
+ const result = [];
+ for (const s of sequenceDiffs) {
+ const last = result[result.length - 1];
+ if (!last) {
+ result.push(s);
+ continue;
+ }
+ if (s.seq1Range.start - last.seq1Range.endExclusive <= 2 || s.seq2Range.start - last.seq2Range.endExclusive <= 2) {
+ result[result.length - 1] = new _algorithms_diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_2__.SequenceDiff(last.seq1Range.join(s.seq1Range), last.seq2Range.join(s.seq2Range));
+ }
+ else {
+ result.push(s);
+ }
+ }
+ return result;
+}
+function extendDiffsToEntireWordIfAppropriate(sequence1, sequence2, sequenceDiffs) {
+ const additional = [];
+ let lastModifiedWord = undefined;
+ function maybePushWordToAdditional() {
+ if (!lastModifiedWord) {
+ return;
+ }
+ const originalLength1 = lastModifiedWord.s1Range.length - lastModifiedWord.deleted;
+ const originalLength2 = lastModifiedWord.s2Range.length - lastModifiedWord.added;
+ if (originalLength1 !== originalLength2) {
+ // TODO figure out why this happens
+ }
+ if (Math.max(lastModifiedWord.deleted, lastModifiedWord.added) + (lastModifiedWord.count - 1) > originalLength1) {
+ additional.push(new _algorithms_diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_2__.SequenceDiff(lastModifiedWord.s1Range, lastModifiedWord.s2Range));
+ }
+ lastModifiedWord = undefined;
+ }
+ for (const s of sequenceDiffs) {
+ function processWord(s1Range, s2Range) {
+ var _a, _b, _c, _d;
+ if (!lastModifiedWord || !lastModifiedWord.s1Range.containsRange(s1Range) || !lastModifiedWord.s2Range.containsRange(s2Range)) {
+ if (lastModifiedWord && !(lastModifiedWord.s1Range.endExclusive < s1Range.start && lastModifiedWord.s2Range.endExclusive < s2Range.start)) {
+ const s1Added = _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange.tryCreate(lastModifiedWord.s1Range.endExclusive, s1Range.start);
+ const s2Added = _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange.tryCreate(lastModifiedWord.s2Range.endExclusive, s2Range.start);
+ lastModifiedWord.deleted += (_a = s1Added === null || s1Added === void 0 ? void 0 : s1Added.length) !== null && _a !== void 0 ? _a : 0;
+ lastModifiedWord.added += (_b = s2Added === null || s2Added === void 0 ? void 0 : s2Added.length) !== null && _b !== void 0 ? _b : 0;
+ lastModifiedWord.s1Range = lastModifiedWord.s1Range.join(s1Range);
+ lastModifiedWord.s2Range = lastModifiedWord.s2Range.join(s2Range);
+ }
+ else {
+ maybePushWordToAdditional();
+ lastModifiedWord = { added: 0, deleted: 0, count: 0, s1Range: s1Range, s2Range: s2Range };
+ }
+ }
+ const changedS1 = s1Range.intersect(s.seq1Range);
+ const changedS2 = s2Range.intersect(s.seq2Range);
+ lastModifiedWord.count++;
+ lastModifiedWord.deleted += (_c = changedS1 === null || changedS1 === void 0 ? void 0 : changedS1.length) !== null && _c !== void 0 ? _c : 0;
+ lastModifiedWord.added += (_d = changedS2 === null || changedS2 === void 0 ? void 0 : changedS2.length) !== null && _d !== void 0 ? _d : 0;
+ }
+ const w1Before = sequence1.findWordContaining(s.seq1Range.start - 1);
+ const w2Before = sequence2.findWordContaining(s.seq2Range.start - 1);
+ const w1After = sequence1.findWordContaining(s.seq1Range.endExclusive);
+ const w2After = sequence2.findWordContaining(s.seq2Range.endExclusive);
+ if (w1Before && w1After && w2Before && w2After && w1Before.equals(w1After) && w2Before.equals(w2After)) {
+ processWord(w1Before, w2Before);
+ }
+ else {
+ if (w1Before && w2Before) {
+ processWord(w1Before, w2Before);
+ }
+ if (w1After && w2After) {
+ processWord(w1After, w2After);
+ }
+ }
+ }
+ maybePushWordToAdditional();
+ const merged = mergeSequenceDiffs(sequenceDiffs, additional);
+ return merged;
+}
+function mergeSequenceDiffs(sequenceDiffs1, sequenceDiffs2) {
+ const result = [];
+ while (sequenceDiffs1.length > 0 || sequenceDiffs2.length > 0) {
+ const sd1 = sequenceDiffs1[0];
+ const sd2 = sequenceDiffs2[0];
+ let next;
+ if (sd1 && (!sd2 || sd1.seq1Range.start < sd2.seq1Range.start)) {
+ next = sequenceDiffs1.shift();
+ }
+ else {
+ next = sequenceDiffs2.shift();
+ }
+ if (result.length > 0 && result[result.length - 1].seq1Range.endExclusive >= next.seq1Range.start) {
+ result[result.length - 1] = result[result.length - 1].join(next);
+ }
+ else {
+ result.push(next);
+ }
+ }
+ return result;
+}
+function removeVeryShortMatchingLinesBetweenDiffs(sequence1, _sequence2, sequenceDiffs) {
+ let diffs = sequenceDiffs;
+ if (diffs.length === 0) {
+ return diffs;
+ }
+ let counter = 0;
+ let shouldRepeat;
+ do {
+ shouldRepeat = false;
+ const result = [
+ diffs[0]
+ ];
+ for (let i = 1; i < diffs.length; i++) {
+ const cur = diffs[i];
+ const lastResult = result[result.length - 1];
+ function shouldJoinDiffs(before, after) {
+ const unchangedRange = new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange(lastResult.seq1Range.endExclusive, cur.seq1Range.start);
+ const unchangedText = sequence1.getText(unchangedRange);
+ const unchangedTextWithoutWs = unchangedText.replace(/\s/g, '');
+ if (unchangedTextWithoutWs.length <= 4
+ && (before.seq1Range.length + before.seq2Range.length > 5 || after.seq1Range.length + after.seq2Range.length > 5)) {
+ return true;
+ }
+ return false;
+ }
+ const shouldJoin = shouldJoinDiffs(lastResult, cur);
+ if (shouldJoin) {
+ shouldRepeat = true;
+ result[result.length - 1] = result[result.length - 1].join(cur);
+ }
+ else {
+ result.push(cur);
+ }
+ }
+ diffs = result;
+ } while (counter++ < 10 && shouldRepeat);
+ return diffs;
+}
+function removeVeryShortMatchingTextBetweenLongDiffs(sequence1, sequence2, sequenceDiffs) {
+ let diffs = sequenceDiffs;
+ if (diffs.length === 0) {
+ return diffs;
+ }
+ let counter = 0;
+ let shouldRepeat;
+ do {
+ shouldRepeat = false;
+ const result = [
+ diffs[0]
+ ];
+ for (let i = 1; i < diffs.length; i++) {
+ const cur = diffs[i];
+ const lastResult = result[result.length - 1];
+ function shouldJoinDiffs(before, after) {
+ const unchangedRange = new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange(lastResult.seq1Range.endExclusive, cur.seq1Range.start);
+ const unchangedLineCount = sequence1.countLinesIn(unchangedRange);
+ if (unchangedLineCount > 5 || unchangedRange.length > 500) {
+ return false;
+ }
+ const unchangedText = sequence1.getText(unchangedRange).trim();
+ if (unchangedText.length > 20 || unchangedText.split(/\r\n|\r|\n/).length > 1) {
+ return false;
+ }
+ const beforeLineCount1 = sequence1.countLinesIn(before.seq1Range);
+ const beforeSeq1Length = before.seq1Range.length;
+ const beforeLineCount2 = sequence2.countLinesIn(before.seq2Range);
+ const beforeSeq2Length = before.seq2Range.length;
+ const afterLineCount1 = sequence1.countLinesIn(after.seq1Range);
+ const afterSeq1Length = after.seq1Range.length;
+ const afterLineCount2 = sequence2.countLinesIn(after.seq2Range);
+ const afterSeq2Length = after.seq2Range.length;
+ // TODO: Maybe a neural net can be used to derive the result from these numbers
+ const max = 2 * 40 + 50;
+ function cap(v) {
+ return Math.min(v, max);
+ }
+ if (Math.pow(Math.pow(cap(beforeLineCount1 * 40 + beforeSeq1Length), 1.5) + Math.pow(cap(beforeLineCount2 * 40 + beforeSeq2Length), 1.5), 1.5)
+ + Math.pow(Math.pow(cap(afterLineCount1 * 40 + afterSeq1Length), 1.5) + Math.pow(cap(afterLineCount2 * 40 + afterSeq2Length), 1.5), 1.5) > ((max ** 1.5) ** 1.5) * 1.3) {
+ return true;
+ }
+ return false;
+ }
+ const shouldJoin = shouldJoinDiffs(lastResult, cur);
+ if (shouldJoin) {
+ shouldRepeat = true;
+ result[result.length - 1] = result[result.length - 1].join(cur);
+ }
+ else {
+ result.push(cur);
+ }
+ }
+ diffs = result;
+ } while (counter++ < 10 && shouldRepeat);
+ const newDiffs = [];
+ // Remove short suffixes/prefixes
+ (0,_base_common_arrays_js__WEBPACK_IMPORTED_MODULE_0__.forEachWithNeighbors)(diffs, (prev, cur, next) => {
+ let newDiff = cur;
+ function shouldMarkAsChanged(text) {
+ return text.length > 0 && text.trim().length <= 3 && cur.seq1Range.length + cur.seq2Range.length > 100;
+ }
+ const fullRange1 = sequence1.extendToFullLines(cur.seq1Range);
+ const prefix = sequence1.getText(new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange(fullRange1.start, cur.seq1Range.start));
+ if (shouldMarkAsChanged(prefix)) {
+ newDiff = newDiff.deltaStart(-prefix.length);
+ }
+ const suffix = sequence1.getText(new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange(cur.seq1Range.endExclusive, fullRange1.endExclusive));
+ if (shouldMarkAsChanged(suffix)) {
+ newDiff = newDiff.deltaEnd(suffix.length);
+ }
+ const availableSpace = _algorithms_diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_2__.SequenceDiff.fromOffsetPairs(prev ? prev.getEndExclusives() : _algorithms_diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_2__.OffsetPair.zero, next ? next.getStarts() : _algorithms_diffAlgorithm_js__WEBPACK_IMPORTED_MODULE_2__.OffsetPair.max);
+ const result = newDiff.intersect(availableSpace);
+ newDiffs.push(result);
+ });
+ return newDiffs;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/lineSequence.js":
+/*!*******************************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/lineSequence.js ***!
+ \*******************************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ LineSequence: () => (/* binding */ LineSequence)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+class LineSequence {
+ constructor(trimmedHash, lines) {
+ this.trimmedHash = trimmedHash;
+ this.lines = lines;
+ }
+ getElement(offset) {
+ return this.trimmedHash[offset];
+ }
+ get length() {
+ return this.trimmedHash.length;
+ }
+ getBoundaryScore(length) {
+ const indentationBefore = length === 0 ? 0 : getIndentation(this.lines[length - 1]);
+ const indentationAfter = length === this.lines.length ? 0 : getIndentation(this.lines[length]);
+ return 1000 - (indentationBefore + indentationAfter);
+ }
+ getText(range) {
+ return this.lines.slice(range.start, range.endExclusive).join('\n');
+ }
+ isStronglyEqual(offset1, offset2) {
+ return this.lines[offset1] === this.lines[offset2];
+ }
+}
+function getIndentation(str) {
+ let i = 0;
+ while (i < str.length && (str.charCodeAt(i) === 32 /* CharCode.Space */ || str.charCodeAt(i) === 9 /* CharCode.Tab */)) {
+ i++;
+ }
+ return i;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/linesSliceCharSequence.js":
+/*!*****************************************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/linesSliceCharSequence.js ***!
+ \*****************************************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ LinesSliceCharSequence: () => (/* binding */ LinesSliceCharSequence)
+/* harmony export */ });
+/* harmony import */ var _base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../../../base/common/arraysFind.js */ "./node_modules/monaco-editor/esm/vs/base/common/arraysFind.js");
+/* harmony import */ var _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../core/offsetRange.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/offsetRange.js");
+/* harmony import */ var _core_position_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../core/position.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/position.js");
+/* harmony import */ var _core_range_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../../core/range.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/range.js");
+/* harmony import */ var _utils_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./utils.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/utils.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+
+
+
+
+class LinesSliceCharSequence {
+ constructor(lines, lineRange, considerWhitespaceChanges) {
+ // This slice has to have lineRange.length many \n! (otherwise diffing against an empty slice will be problematic)
+ // (Unless it covers the entire document, in that case the other slice also has to cover the entire document ands it's okay)
+ this.lines = lines;
+ this.considerWhitespaceChanges = considerWhitespaceChanges;
+ this.elements = [];
+ this.firstCharOffsetByLine = [];
+ // To account for trimming
+ this.additionalOffsetByLine = [];
+ // If the slice covers the end, but does not start at the beginning, we include just the \n of the previous line.
+ let trimFirstLineFully = false;
+ if (lineRange.start > 0 && lineRange.endExclusive >= lines.length) {
+ lineRange = new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange(lineRange.start - 1, lineRange.endExclusive);
+ trimFirstLineFully = true;
+ }
+ this.lineRange = lineRange;
+ this.firstCharOffsetByLine[0] = 0;
+ for (let i = this.lineRange.start; i < this.lineRange.endExclusive; i++) {
+ let line = lines[i];
+ let offset = 0;
+ if (trimFirstLineFully) {
+ offset = line.length;
+ line = '';
+ trimFirstLineFully = false;
+ }
+ else if (!considerWhitespaceChanges) {
+ const trimmedStartLine = line.trimStart();
+ offset = line.length - trimmedStartLine.length;
+ line = trimmedStartLine.trimEnd();
+ }
+ this.additionalOffsetByLine.push(offset);
+ for (let i = 0; i < line.length; i++) {
+ this.elements.push(line.charCodeAt(i));
+ }
+ // Don't add an \n that does not exist in the document.
+ if (i < lines.length - 1) {
+ this.elements.push('\n'.charCodeAt(0));
+ this.firstCharOffsetByLine[i - this.lineRange.start + 1] = this.elements.length;
+ }
+ }
+ // To account for the last line
+ this.additionalOffsetByLine.push(0);
+ }
+ toString() {
+ return `Slice: "${this.text}"`;
+ }
+ get text() {
+ return this.getText(new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange(0, this.length));
+ }
+ getText(range) {
+ return this.elements.slice(range.start, range.endExclusive).map(e => String.fromCharCode(e)).join('');
+ }
+ getElement(offset) {
+ return this.elements[offset];
+ }
+ get length() {
+ return this.elements.length;
+ }
+ getBoundaryScore(length) {
+ // a b c , d e f
+ // 11 0 0 12 15 6 13 0 0 11
+ const prevCategory = getCategory(length > 0 ? this.elements[length - 1] : -1);
+ const nextCategory = getCategory(length < this.elements.length ? this.elements[length] : -1);
+ if (prevCategory === 7 /* CharBoundaryCategory.LineBreakCR */ && nextCategory === 8 /* CharBoundaryCategory.LineBreakLF */) {
+ // don't break between \r and \n
+ return 0;
+ }
+ let score = 0;
+ if (prevCategory !== nextCategory) {
+ score += 10;
+ if (prevCategory === 0 /* CharBoundaryCategory.WordLower */ && nextCategory === 1 /* CharBoundaryCategory.WordUpper */) {
+ score += 1;
+ }
+ }
+ score += getCategoryBoundaryScore(prevCategory);
+ score += getCategoryBoundaryScore(nextCategory);
+ return score;
+ }
+ translateOffset(offset) {
+ // find smallest i, so that lineBreakOffsets[i] <= offset using binary search
+ if (this.lineRange.isEmpty) {
+ return new _core_position_js__WEBPACK_IMPORTED_MODULE_2__.Position(this.lineRange.start + 1, 1);
+ }
+ const i = (0,_base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_0__.findLastIdxMonotonous)(this.firstCharOffsetByLine, (value) => value <= offset);
+ return new _core_position_js__WEBPACK_IMPORTED_MODULE_2__.Position(this.lineRange.start + i + 1, offset - this.firstCharOffsetByLine[i] + this.additionalOffsetByLine[i] + 1);
+ }
+ translateRange(range) {
+ return _core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range.fromPositions(this.translateOffset(range.start), this.translateOffset(range.endExclusive));
+ }
+ /**
+ * Finds the word that contains the character at the given offset
+ */
+ findWordContaining(offset) {
+ if (offset < 0 || offset >= this.elements.length) {
+ return undefined;
+ }
+ if (!isWordChar(this.elements[offset])) {
+ return undefined;
+ }
+ // find start
+ let start = offset;
+ while (start > 0 && isWordChar(this.elements[start - 1])) {
+ start--;
+ }
+ // find end
+ let end = offset;
+ while (end < this.elements.length && isWordChar(this.elements[end])) {
+ end++;
+ }
+ return new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange(start, end);
+ }
+ countLinesIn(range) {
+ return this.translateOffset(range.endExclusive).lineNumber - this.translateOffset(range.start).lineNumber;
+ }
+ isStronglyEqual(offset1, offset2) {
+ return this.elements[offset1] === this.elements[offset2];
+ }
+ extendToFullLines(range) {
+ var _a, _b;
+ const start = (_a = (0,_base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_0__.findLastMonotonous)(this.firstCharOffsetByLine, x => x <= range.start)) !== null && _a !== void 0 ? _a : 0;
+ const end = (_b = (0,_base_common_arraysFind_js__WEBPACK_IMPORTED_MODULE_0__.findFirstMonotonous)(this.firstCharOffsetByLine, x => range.endExclusive <= x)) !== null && _b !== void 0 ? _b : this.elements.length;
+ return new _core_offsetRange_js__WEBPACK_IMPORTED_MODULE_1__.OffsetRange(start, end);
+ }
+}
+function isWordChar(charCode) {
+ return charCode >= 97 /* CharCode.a */ && charCode <= 122 /* CharCode.z */
+ || charCode >= 65 /* CharCode.A */ && charCode <= 90 /* CharCode.Z */
+ || charCode >= 48 /* CharCode.Digit0 */ && charCode <= 57 /* CharCode.Digit9 */;
+}
+const score = {
+ [0 /* CharBoundaryCategory.WordLower */]: 0,
+ [1 /* CharBoundaryCategory.WordUpper */]: 0,
+ [2 /* CharBoundaryCategory.WordNumber */]: 0,
+ [3 /* CharBoundaryCategory.End */]: 10,
+ [4 /* CharBoundaryCategory.Other */]: 2,
+ [5 /* CharBoundaryCategory.Separator */]: 3,
+ [6 /* CharBoundaryCategory.Space */]: 3,
+ [7 /* CharBoundaryCategory.LineBreakCR */]: 10,
+ [8 /* CharBoundaryCategory.LineBreakLF */]: 10,
+};
+function getCategoryBoundaryScore(category) {
+ return score[category];
+}
+function getCategory(charCode) {
+ if (charCode === 10 /* CharCode.LineFeed */) {
+ return 8 /* CharBoundaryCategory.LineBreakLF */;
+ }
+ else if (charCode === 13 /* CharCode.CarriageReturn */) {
+ return 7 /* CharBoundaryCategory.LineBreakCR */;
+ }
+ else if ((0,_utils_js__WEBPACK_IMPORTED_MODULE_4__.isSpace)(charCode)) {
+ return 6 /* CharBoundaryCategory.Space */;
+ }
+ else if (charCode >= 97 /* CharCode.a */ && charCode <= 122 /* CharCode.z */) {
+ return 0 /* CharBoundaryCategory.WordLower */;
+ }
+ else if (charCode >= 65 /* CharCode.A */ && charCode <= 90 /* CharCode.Z */) {
+ return 1 /* CharBoundaryCategory.WordUpper */;
+ }
+ else if (charCode >= 48 /* CharCode.Digit0 */ && charCode <= 57 /* CharCode.Digit9 */) {
+ return 2 /* CharBoundaryCategory.WordNumber */;
+ }
+ else if (charCode === -1) {
+ return 3 /* CharBoundaryCategory.End */;
+ }
+ else if (charCode === 44 /* CharCode.Comma */ || charCode === 59 /* CharCode.Semicolon */) {
+ return 5 /* CharBoundaryCategory.Separator */;
+ }
+ else {
+ return 4 /* CharBoundaryCategory.Other */;
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/utils.js":
+/*!************************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/utils.js ***!
+ \************************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ Array2D: () => (/* binding */ Array2D),
+/* harmony export */ LineRangeFragment: () => (/* binding */ LineRangeFragment),
+/* harmony export */ isSpace: () => (/* binding */ isSpace)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+class Array2D {
+ constructor(width, height) {
+ this.width = width;
+ this.height = height;
+ this.array = [];
+ this.array = new Array(width * height);
+ }
+ get(x, y) {
+ return this.array[x + y * this.width];
+ }
+ set(x, y, value) {
+ this.array[x + y * this.width] = value;
+ }
+}
+function isSpace(charCode) {
+ return charCode === 32 /* CharCode.Space */ || charCode === 9 /* CharCode.Tab */;
+}
+class LineRangeFragment {
+ static getKey(chr) {
+ let key = this.chrKeys.get(chr);
+ if (key === undefined) {
+ key = this.chrKeys.size;
+ this.chrKeys.set(chr, key);
+ }
+ return key;
+ }
+ constructor(range, lines, source) {
+ this.range = range;
+ this.lines = lines;
+ this.source = source;
+ this.histogram = [];
+ let counter = 0;
+ for (let i = range.startLineNumber - 1; i < range.endLineNumberExclusive - 1; i++) {
+ const line = lines[i];
+ for (let j = 0; j < line.length; j++) {
+ counter++;
+ const chr = line[j];
+ const key = LineRangeFragment.getKey(chr);
+ this.histogram[key] = (this.histogram[key] || 0) + 1;
+ }
+ counter++;
+ const key = LineRangeFragment.getKey('\n');
+ this.histogram[key] = (this.histogram[key] || 0) + 1;
+ }
+ this.totalCount = counter;
+ }
+ computeSimilarity(other) {
+ var _a, _b;
+ let sumDifferences = 0;
+ const maxLength = Math.max(this.histogram.length, other.histogram.length);
+ for (let i = 0; i < maxLength; i++) {
+ sumDifferences += Math.abs(((_a = this.histogram[i]) !== null && _a !== void 0 ? _a : 0) - ((_b = other.histogram[i]) !== null && _b !== void 0 ? _b : 0));
+ }
+ return 1 - (sumDifferences / (this.totalCount + other.totalCount));
+ }
+}
+LineRangeFragment.chrKeys = new Map();
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/diff/legacyLinesDiffComputer.js":
+/*!*****************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/diff/legacyLinesDiffComputer.js ***!
+ \*****************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ DiffComputer: () => (/* binding */ DiffComputer),
+/* harmony export */ LegacyLinesDiffComputer: () => (/* binding */ LegacyLinesDiffComputer)
+/* harmony export */ });
+/* 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 _linesDiffComputer_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./linesDiffComputer.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/linesDiffComputer.js");
+/* harmony import */ var _rangeMapping_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./rangeMapping.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/rangeMapping.js");
+/* harmony import */ var _base_common_strings_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../../../base/common/strings.js */ "./node_modules/monaco-editor/esm/vs/base/common/strings.js");
+/* harmony import */ var _core_range_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../core/range.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/range.js");
+/* harmony import */ var _base_common_assert_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../../../base/common/assert.js */ "./node_modules/monaco-editor/esm/vs/base/common/assert.js");
+/* harmony import */ var _core_lineRange_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../core/lineRange.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/lineRange.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+
+
+
+
+
+
+const MINIMUM_MATCHING_CHARACTER_LENGTH = 3;
+class LegacyLinesDiffComputer {
+ computeDiff(originalLines, modifiedLines, options) {
+ var _a;
+ const diffComputer = new DiffComputer(originalLines, modifiedLines, {
+ maxComputationTime: options.maxComputationTimeMs,
+ shouldIgnoreTrimWhitespace: options.ignoreTrimWhitespace,
+ shouldComputeCharChanges: true,
+ shouldMakePrettyDiff: true,
+ shouldPostProcessCharChanges: true,
+ });
+ const result = diffComputer.computeDiff();
+ const changes = [];
+ let lastChange = null;
+ for (const c of result.changes) {
+ let originalRange;
+ if (c.originalEndLineNumber === 0) {
+ // Insertion
+ originalRange = new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_6__.LineRange(c.originalStartLineNumber + 1, c.originalStartLineNumber + 1);
+ }
+ else {
+ originalRange = new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_6__.LineRange(c.originalStartLineNumber, c.originalEndLineNumber + 1);
+ }
+ let modifiedRange;
+ if (c.modifiedEndLineNumber === 0) {
+ // Deletion
+ modifiedRange = new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_6__.LineRange(c.modifiedStartLineNumber + 1, c.modifiedStartLineNumber + 1);
+ }
+ else {
+ modifiedRange = new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_6__.LineRange(c.modifiedStartLineNumber, c.modifiedEndLineNumber + 1);
+ }
+ let change = new _rangeMapping_js__WEBPACK_IMPORTED_MODULE_2__.DetailedLineRangeMapping(originalRange, modifiedRange, (_a = c.charChanges) === null || _a === void 0 ? void 0 : _a.map(c => new _rangeMapping_js__WEBPACK_IMPORTED_MODULE_2__.RangeMapping(new _core_range_js__WEBPACK_IMPORTED_MODULE_4__.Range(c.originalStartLineNumber, c.originalStartColumn, c.originalEndLineNumber, c.originalEndColumn), new _core_range_js__WEBPACK_IMPORTED_MODULE_4__.Range(c.modifiedStartLineNumber, c.modifiedStartColumn, c.modifiedEndLineNumber, c.modifiedEndColumn))));
+ if (lastChange) {
+ if (lastChange.modified.endLineNumberExclusive === change.modified.startLineNumber
+ || lastChange.original.endLineNumberExclusive === change.original.startLineNumber) {
+ // join touching diffs. Probably moving diffs up/down in the algorithm causes touching diffs.
+ change = new _rangeMapping_js__WEBPACK_IMPORTED_MODULE_2__.DetailedLineRangeMapping(lastChange.original.join(change.original), lastChange.modified.join(change.modified), lastChange.innerChanges && change.innerChanges ?
+ lastChange.innerChanges.concat(change.innerChanges) : undefined);
+ changes.pop();
+ }
+ }
+ changes.push(change);
+ lastChange = change;
+ }
+ (0,_base_common_assert_js__WEBPACK_IMPORTED_MODULE_5__.assertFn)(() => {
+ return (0,_base_common_assert_js__WEBPACK_IMPORTED_MODULE_5__.checkAdjacentItems)(changes, (m1, m2) => m2.original.startLineNumber - m1.original.endLineNumberExclusive === m2.modified.startLineNumber - m1.modified.endLineNumberExclusive &&
+ // There has to be an unchanged line in between (otherwise both diffs should have been joined)
+ m1.original.endLineNumberExclusive < m2.original.startLineNumber &&
+ m1.modified.endLineNumberExclusive < m2.modified.startLineNumber);
+ });
+ return new _linesDiffComputer_js__WEBPACK_IMPORTED_MODULE_1__.LinesDiff(changes, [], result.quitEarly);
+ }
+}
+function computeDiff(originalSequence, modifiedSequence, continueProcessingPredicate, pretty) {
+ const diffAlgo = new _base_common_diff_diff_js__WEBPACK_IMPORTED_MODULE_0__.LcsDiff(originalSequence, modifiedSequence, continueProcessingPredicate);
+ return diffAlgo.ComputeDiff(pretty);
+}
+class LineSequence {
+ constructor(lines) {
+ const startColumns = [];
+ const endColumns = [];
+ for (let i = 0, length = lines.length; i < length; i++) {
+ startColumns[i] = getFirstNonBlankColumn(lines[i], 1);
+ endColumns[i] = getLastNonBlankColumn(lines[i], 1);
+ }
+ this.lines = lines;
+ this._startColumns = startColumns;
+ this._endColumns = endColumns;
+ }
+ getElements() {
+ const elements = [];
+ for (let 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;
+ }
+ getStrictElement(index) {
+ return this.lines[index];
+ }
+ getStartLineNumber(i) {
+ return i + 1;
+ }
+ getEndLineNumber(i) {
+ return i + 1;
+ }
+ createCharSequence(shouldIgnoreTrimWhitespace, startIndex, endIndex) {
+ const charCodes = [];
+ const lineNumbers = [];
+ const columns = [];
+ let len = 0;
+ for (let index = startIndex; index <= endIndex; index++) {
+ const lineContent = this.lines[index];
+ const startColumn = (shouldIgnoreTrimWhitespace ? this._startColumns[index] : 1);
+ const endColumn = (shouldIgnoreTrimWhitespace ? this._endColumns[index] : lineContent.length + 1);
+ for (let col = startColumn; col < endColumn; col++) {
+ charCodes[len] = lineContent.charCodeAt(col - 1);
+ lineNumbers[len] = index + 1;
+ columns[len] = col;
+ len++;
+ }
+ if (!shouldIgnoreTrimWhitespace && index < endIndex) {
+ // Add \n if trim whitespace is not ignored
+ charCodes[len] = 10 /* CharCode.LineFeed */;
+ lineNumbers[len] = index + 1;
+ columns[len] = lineContent.length + 1;
+ len++;
+ }
+ }
+ return new CharSequence(charCodes, lineNumbers, columns);
+ }
+}
+class CharSequence {
+ constructor(charCodes, lineNumbers, columns) {
+ this._charCodes = charCodes;
+ this._lineNumbers = lineNumbers;
+ this._columns = columns;
+ }
+ toString() {
+ return ('[' + this._charCodes.map((s, idx) => (s === 10 /* CharCode.LineFeed */ ? '\\n' : String.fromCharCode(s)) + `-(${this._lineNumbers[idx]},${this._columns[idx]})`).join(', ') + ']');
+ }
+ _assertIndex(index, arr) {
+ if (index < 0 || index >= arr.length) {
+ throw new Error(`Illegal index`);
+ }
+ }
+ getElements() {
+ return this._charCodes;
+ }
+ getStartLineNumber(i) {
+ if (i > 0 && i === this._lineNumbers.length) {
+ // the start line number of the element after the last element
+ // is the end line number of the last element
+ return this.getEndLineNumber(i - 1);
+ }
+ this._assertIndex(i, this._lineNumbers);
+ return this._lineNumbers[i];
+ }
+ getEndLineNumber(i) {
+ if (i === -1) {
+ // the end line number of the element before the first element
+ // is the start line number of the first element
+ return this.getStartLineNumber(i + 1);
+ }
+ this._assertIndex(i, this._lineNumbers);
+ if (this._charCodes[i] === 10 /* CharCode.LineFeed */) {
+ return this._lineNumbers[i] + 1;
+ }
+ return this._lineNumbers[i];
+ }
+ getStartColumn(i) {
+ if (i > 0 && i === this._columns.length) {
+ // the start column of the element after the last element
+ // is the end column of the last element
+ return this.getEndColumn(i - 1);
+ }
+ this._assertIndex(i, this._columns);
+ return this._columns[i];
+ }
+ getEndColumn(i) {
+ if (i === -1) {
+ // the end column of the element before the first element
+ // is the start column of the first element
+ return this.getStartColumn(i + 1);
+ }
+ this._assertIndex(i, this._columns);
+ if (this._charCodes[i] === 10 /* CharCode.LineFeed */) {
+ return 1;
+ }
+ return this._columns[i] + 1;
+ }
+}
+class CharChange {
+ constructor(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;
+ }
+ static createFromDiffChange(diffChange, originalCharSequence, modifiedCharSequence) {
+ const originalStartLineNumber = originalCharSequence.getStartLineNumber(diffChange.originalStart);
+ const originalStartColumn = originalCharSequence.getStartColumn(diffChange.originalStart);
+ const originalEndLineNumber = originalCharSequence.getEndLineNumber(diffChange.originalStart + diffChange.originalLength - 1);
+ const originalEndColumn = originalCharSequence.getEndColumn(diffChange.originalStart + diffChange.originalLength - 1);
+ const modifiedStartLineNumber = modifiedCharSequence.getStartLineNumber(diffChange.modifiedStart);
+ const modifiedStartColumn = modifiedCharSequence.getStartColumn(diffChange.modifiedStart);
+ const modifiedEndLineNumber = modifiedCharSequence.getEndLineNumber(diffChange.modifiedStart + diffChange.modifiedLength - 1);
+ const modifiedEndColumn = modifiedCharSequence.getEndColumn(diffChange.modifiedStart + diffChange.modifiedLength - 1);
+ return new CharChange(originalStartLineNumber, originalStartColumn, originalEndLineNumber, originalEndColumn, modifiedStartLineNumber, modifiedStartColumn, modifiedEndLineNumber, modifiedEndColumn);
+ }
+}
+function postProcessCharChanges(rawChanges) {
+ if (rawChanges.length <= 1) {
+ return rawChanges;
+ }
+ const result = [rawChanges[0]];
+ let prevChange = result[0];
+ for (let i = 1, len = rawChanges.length; i < len; i++) {
+ const currChange = rawChanges[i];
+ const originalMatchingLength = currChange.originalStart - (prevChange.originalStart + prevChange.originalLength);
+ const modifiedMatchingLength = currChange.modifiedStart - (prevChange.modifiedStart + prevChange.modifiedLength);
+ // Both of the above should be equal, but the continueProcessingPredicate may prevent this from being true
+ const 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;
+}
+class LineChange {
+ constructor(originalStartLineNumber, originalEndLineNumber, modifiedStartLineNumber, modifiedEndLineNumber, charChanges) {
+ this.originalStartLineNumber = originalStartLineNumber;
+ this.originalEndLineNumber = originalEndLineNumber;
+ this.modifiedStartLineNumber = modifiedStartLineNumber;
+ this.modifiedEndLineNumber = modifiedEndLineNumber;
+ this.charChanges = charChanges;
+ }
+ static createFromDiffResult(shouldIgnoreTrimWhitespace, diffChange, originalLineSequence, modifiedLineSequence, continueCharDiff, shouldComputeCharChanges, shouldPostProcessCharChanges) {
+ let originalStartLineNumber;
+ let originalEndLineNumber;
+ let modifiedStartLineNumber;
+ let modifiedEndLineNumber;
+ let 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...
+ const originalCharSequence = originalLineSequence.createCharSequence(shouldIgnoreTrimWhitespace, diffChange.originalStart, diffChange.originalStart + diffChange.originalLength - 1);
+ const modifiedCharSequence = modifiedLineSequence.createCharSequence(shouldIgnoreTrimWhitespace, diffChange.modifiedStart, diffChange.modifiedStart + diffChange.modifiedLength - 1);
+ if (originalCharSequence.getElements().length > 0 && modifiedCharSequence.getElements().length > 0) {
+ let rawChanges = computeDiff(originalCharSequence, modifiedCharSequence, continueCharDiff, true).changes;
+ if (shouldPostProcessCharChanges) {
+ rawChanges = postProcessCharChanges(rawChanges);
+ }
+ charChanges = [];
+ for (let i = 0, length = rawChanges.length; i < length; i++) {
+ charChanges.push(CharChange.createFromDiffChange(rawChanges[i], originalCharSequence, modifiedCharSequence));
+ }
+ }
+ }
+ return new LineChange(originalStartLineNumber, originalEndLineNumber, modifiedStartLineNumber, modifiedEndLineNumber, charChanges);
+ }
+}
+class DiffComputer {
+ constructor(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...
+ }
+ computeDiff() {
+ if (this.original.lines.length === 1 && this.original.lines[0].length === 0) {
+ // empty original => fast path
+ if (this.modified.lines.length === 1 && this.modified.lines[0].length === 0) {
+ return {
+ quitEarly: false,
+ changes: []
+ };
+ }
+ return {
+ quitEarly: false,
+ changes: [{
+ originalStartLineNumber: 1,
+ originalEndLineNumber: 1,
+ modifiedStartLineNumber: 1,
+ modifiedEndLineNumber: this.modified.lines.length,
+ charChanges: undefined
+ }]
+ };
+ }
+ 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: undefined
+ }]
+ };
+ }
+ const diffResult = computeDiff(this.original, this.modified, this.continueLineDiff, this.shouldMakePrettyDiff);
+ const rawChanges = diffResult.changes;
+ const quitEarly = diffResult.quitEarly;
+ // The diff is always computed with ignoring trim whitespace
+ // This ensures we get the prettiest diff
+ if (this.shouldIgnoreTrimWhitespace) {
+ const lineChanges = [];
+ for (let i = 0, length = rawChanges.length; i < length; 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
+ const result = [];
+ let originalLineIndex = 0;
+ let modifiedLineIndex = 0;
+ for (let i = -1 /* !!!! */, len = rawChanges.length; i < len; i++) {
+ const nextChange = (i + 1 < len ? rawChanges[i + 1] : null);
+ const originalStop = (nextChange ? nextChange.originalStart : this.originalLines.length);
+ const modifiedStop = (nextChange ? nextChange.modifiedStart : this.modifiedLines.length);
+ while (originalLineIndex < originalStop && modifiedLineIndex < modifiedStop) {
+ const originalLine = this.originalLines[originalLineIndex];
+ const modifiedLine = this.modifiedLines[modifiedLineIndex];
+ if (originalLine !== modifiedLine) {
+ // These lines differ only in trim whitespace
+ // Check the leading whitespace
+ {
+ let originalStartColumn = getFirstNonBlankColumn(originalLine, 1);
+ let modifiedStartColumn = getFirstNonBlankColumn(modifiedLine, 1);
+ while (originalStartColumn > 1 && modifiedStartColumn > 1) {
+ const originalChar = originalLine.charCodeAt(originalStartColumn - 2);
+ const 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
+ {
+ let originalEndColumn = getLastNonBlankColumn(originalLine, 1);
+ let modifiedEndColumn = getLastNonBlankColumn(modifiedLine, 1);
+ const originalMaxColumn = originalLine.length + 1;
+ const modifiedMaxColumn = modifiedLine.length + 1;
+ while (originalEndColumn < originalMaxColumn && modifiedEndColumn < modifiedMaxColumn) {
+ const originalChar = originalLine.charCodeAt(originalEndColumn - 1);
+ const 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
+ };
+ }
+ _pushTrimWhitespaceCharChange(result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn) {
+ if (this._mergeTrimWhitespaceCharChange(result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn)) {
+ // Merged into previous
+ return;
+ }
+ let 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));
+ }
+ _mergeTrimWhitespaceCharChange(result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn) {
+ const len = result.length;
+ if (len === 0) {
+ return false;
+ }
+ const prevChange = result[len - 1];
+ if (prevChange.originalEndLineNumber === 0 || prevChange.modifiedEndLineNumber === 0) {
+ // Don't merge with inserts/deletes
+ return false;
+ }
+ if (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;
+ }
+ 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;
+ }
+}
+function getFirstNonBlankColumn(txt, defaultValue) {
+ const r = _base_common_strings_js__WEBPACK_IMPORTED_MODULE_3__.firstNonWhitespaceIndex(txt);
+ if (r === -1) {
+ return defaultValue;
+ }
+ return r + 1;
+}
+function getLastNonBlankColumn(txt, defaultValue) {
+ const r = _base_common_strings_js__WEBPACK_IMPORTED_MODULE_3__.lastNonWhitespaceIndex(txt);
+ if (r === -1) {
+ return defaultValue;
+ }
+ return r + 2;
+}
+function createContinueProcessingPredicate(maximumRuntime) {
+ if (maximumRuntime === 0) {
+ return () => true;
+ }
+ const startTime = Date.now();
+ return () => {
+ return Date.now() - startTime < maximumRuntime;
+ };
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/diff/linesDiffComputer.js":
+/*!***********************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/diff/linesDiffComputer.js ***!
+ \***********************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ LinesDiff: () => (/* binding */ LinesDiff),
+/* harmony export */ MovedText: () => (/* binding */ MovedText)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+class LinesDiff {
+ constructor(changes,
+ /**
+ * Sorted by original line ranges.
+ * The original line ranges and the modified line ranges must be disjoint (but can be touching).
+ */
+ moves,
+ /**
+ * Indicates if the time out was reached.
+ * In that case, the diffs might be an approximation and the user should be asked to rerun the diff with more time.
+ */
+ hitTimeout) {
+ this.changes = changes;
+ this.moves = moves;
+ this.hitTimeout = hitTimeout;
+ }
+}
+class MovedText {
+ constructor(lineRangeMapping, changes) {
+ this.lineRangeMapping = lineRangeMapping;
+ this.changes = changes;
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/diff/linesDiffComputers.js":
+/*!************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/diff/linesDiffComputers.js ***!
+ \************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ linesDiffComputers: () => (/* binding */ linesDiffComputers)
+/* harmony export */ });
+/* harmony import */ var _legacyLinesDiffComputer_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./legacyLinesDiffComputer.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/legacyLinesDiffComputer.js");
+/* harmony import */ var _defaultLinesDiffComputer_defaultLinesDiffComputer_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./defaultLinesDiffComputer/defaultLinesDiffComputer.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/defaultLinesDiffComputer.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+
+const linesDiffComputers = {
+ getLegacy: () => new _legacyLinesDiffComputer_js__WEBPACK_IMPORTED_MODULE_0__.LegacyLinesDiffComputer(),
+ getDefault: () => new _defaultLinesDiffComputer_defaultLinesDiffComputer_js__WEBPACK_IMPORTED_MODULE_1__.DefaultLinesDiffComputer(),
+};
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/diff/rangeMapping.js":
+/*!******************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/diff/rangeMapping.js ***!
+ \******************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ DetailedLineRangeMapping: () => (/* binding */ DetailedLineRangeMapping),
+/* harmony export */ LineRangeMapping: () => (/* binding */ LineRangeMapping),
+/* harmony export */ RangeMapping: () => (/* binding */ RangeMapping)
+/* harmony export */ });
+/* harmony import */ var _core_lineRange_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../core/lineRange.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/lineRange.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+/**
+ * Maps a line range in the original text model to a line range in the modified text model.
+ */
+class LineRangeMapping {
+ static inverse(mapping, originalLineCount, modifiedLineCount) {
+ const result = [];
+ let lastOriginalEndLineNumber = 1;
+ let lastModifiedEndLineNumber = 1;
+ for (const m of mapping) {
+ const r = new DetailedLineRangeMapping(new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_0__.LineRange(lastOriginalEndLineNumber, m.original.startLineNumber), new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_0__.LineRange(lastModifiedEndLineNumber, m.modified.startLineNumber), undefined);
+ if (!r.modified.isEmpty) {
+ result.push(r);
+ }
+ lastOriginalEndLineNumber = m.original.endLineNumberExclusive;
+ lastModifiedEndLineNumber = m.modified.endLineNumberExclusive;
+ }
+ const r = new DetailedLineRangeMapping(new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_0__.LineRange(lastOriginalEndLineNumber, originalLineCount + 1), new _core_lineRange_js__WEBPACK_IMPORTED_MODULE_0__.LineRange(lastModifiedEndLineNumber, modifiedLineCount + 1), undefined);
+ if (!r.modified.isEmpty) {
+ result.push(r);
+ }
+ return result;
+ }
+ constructor(originalRange, modifiedRange) {
+ this.original = originalRange;
+ this.modified = modifiedRange;
+ }
+ toString() {
+ return `{${this.original.toString()}->${this.modified.toString()}}`;
+ }
+ flip() {
+ return new LineRangeMapping(this.modified, this.original);
+ }
+ join(other) {
+ return new LineRangeMapping(this.original.join(other.original), this.modified.join(other.modified));
+ }
+}
+/**
+ * Maps a line range in the original text model to a line range in the modified text model.
+ * Also contains inner range mappings.
+ */
+class DetailedLineRangeMapping extends LineRangeMapping {
+ constructor(originalRange, modifiedRange, innerChanges) {
+ super(originalRange, modifiedRange);
+ this.innerChanges = innerChanges;
+ }
+ flip() {
+ var _a;
+ return new DetailedLineRangeMapping(this.modified, this.original, (_a = this.innerChanges) === null || _a === void 0 ? void 0 : _a.map(c => c.flip()));
+ }
+}
+/**
+ * Maps a range in the original text model to a range in the modified text model.
+ */
+class RangeMapping {
+ constructor(originalRange, modifiedRange) {
+ this.originalRange = originalRange;
+ this.modifiedRange = modifiedRange;
+ }
+ toString() {
+ return `{${this.originalRange.toString()}->${this.modifiedRange.toString()}}`;
+ }
+ flip() {
+ return new RangeMapping(this.modifiedRange, this.originalRange);
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/languages.js":
+/*!**********************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/languages.js ***!
+ \**********************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ Command: () => (/* binding */ Command),
+/* harmony export */ CompletionItemKinds: () => (/* binding */ CompletionItemKinds),
+/* harmony export */ DocumentHighlightKind: () => (/* binding */ DocumentHighlightKind),
+/* harmony export */ EncodedTokenizationResult: () => (/* binding */ EncodedTokenizationResult),
+/* harmony export */ FoldingRangeKind: () => (/* binding */ FoldingRangeKind),
+/* harmony export */ InlayHintKind: () => (/* binding */ InlayHintKind),
+/* harmony export */ InlineCompletionTriggerKind: () => (/* binding */ InlineCompletionTriggerKind),
+/* harmony export */ LazyTokenizationSupport: () => (/* binding */ LazyTokenizationSupport),
+/* harmony export */ SelectedSuggestionInfo: () => (/* binding */ SelectedSuggestionInfo),
+/* harmony export */ SignatureHelpTriggerKind: () => (/* binding */ SignatureHelpTriggerKind),
+/* harmony export */ SymbolKinds: () => (/* binding */ SymbolKinds),
+/* harmony export */ TextEdit: () => (/* binding */ TextEdit),
+/* harmony export */ Token: () => (/* binding */ Token),
+/* harmony export */ TokenizationRegistry: () => (/* binding */ TokenizationRegistry),
+/* harmony export */ TokenizationResult: () => (/* binding */ TokenizationResult),
+/* harmony export */ getAriaLabelForSymbol: () => (/* binding */ getAriaLabelForSymbol),
+/* harmony export */ isLocationLink: () => (/* binding */ isLocationLink),
+/* harmony export */ symbolKindNames: () => (/* binding */ symbolKindNames)
+/* harmony export */ });
+/* harmony import */ var _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../base/common/codicons.js */ "./node_modules/monaco-editor/esm/vs/base/common/codicons.js");
+/* harmony import */ var _base_common_uri_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../base/common/uri.js */ "./node_modules/monaco-editor/esm/vs/base/common/uri.js");
+/* harmony import */ var _core_range_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./core/range.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/range.js");
+/* harmony import */ var _tokenizationRegistry_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./tokenizationRegistry.js */ "./node_modules/monaco-editor/esm/vs/editor/common/tokenizationRegistry.js");
+/* harmony import */ var _nls_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../../nls.js */ "./node_modules/monaco-editor/esm/vs/nls.js");
+
+
+
+
+
+class Token {
+ constructor(offset, type, language) {
+ this.offset = offset;
+ this.type = type;
+ this.language = language;
+ this._tokenBrand = undefined;
+ }
+ toString() {
+ return '(' + this.offset + ', ' + this.type + ')';
+ }
+}
+/**
+ * @internal
+ */
+class TokenizationResult {
+ constructor(tokens, endState) {
+ this.tokens = tokens;
+ this.endState = endState;
+ this._tokenizationResultBrand = undefined;
+ }
+}
+/**
+ * @internal
+ */
+class EncodedTokenizationResult {
+ constructor(
+ /**
+ * The tokens in binary format. Each token occupies two array indices. For token i:
+ * - at offset 2*i => startIndex
+ * - at offset 2*i + 1 => metadata
+ *
+ */
+ tokens, endState) {
+ this.tokens = tokens;
+ this.endState = endState;
+ this._encodedTokenizationResultBrand = undefined;
+ }
+}
+/**
+ * @internal
+ */
+var CompletionItemKinds;
+(function (CompletionItemKinds) {
+ const byKind = new Map();
+ byKind.set(0 /* CompletionItemKind.Method */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolMethod);
+ byKind.set(1 /* CompletionItemKind.Function */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolFunction);
+ byKind.set(2 /* CompletionItemKind.Constructor */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolConstructor);
+ byKind.set(3 /* CompletionItemKind.Field */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolField);
+ byKind.set(4 /* CompletionItemKind.Variable */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolVariable);
+ byKind.set(5 /* CompletionItemKind.Class */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolClass);
+ byKind.set(6 /* CompletionItemKind.Struct */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolStruct);
+ byKind.set(7 /* CompletionItemKind.Interface */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolInterface);
+ byKind.set(8 /* CompletionItemKind.Module */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolModule);
+ byKind.set(9 /* CompletionItemKind.Property */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolProperty);
+ byKind.set(10 /* CompletionItemKind.Event */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolEvent);
+ byKind.set(11 /* CompletionItemKind.Operator */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolOperator);
+ byKind.set(12 /* CompletionItemKind.Unit */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolUnit);
+ byKind.set(13 /* CompletionItemKind.Value */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolValue);
+ byKind.set(15 /* CompletionItemKind.Enum */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolEnum);
+ byKind.set(14 /* CompletionItemKind.Constant */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolConstant);
+ byKind.set(15 /* CompletionItemKind.Enum */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolEnum);
+ byKind.set(16 /* CompletionItemKind.EnumMember */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolEnumMember);
+ byKind.set(17 /* CompletionItemKind.Keyword */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolKeyword);
+ byKind.set(27 /* CompletionItemKind.Snippet */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolSnippet);
+ byKind.set(18 /* CompletionItemKind.Text */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolText);
+ byKind.set(19 /* CompletionItemKind.Color */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolColor);
+ byKind.set(20 /* CompletionItemKind.File */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolFile);
+ byKind.set(21 /* CompletionItemKind.Reference */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolReference);
+ byKind.set(22 /* CompletionItemKind.Customcolor */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolCustomColor);
+ byKind.set(23 /* CompletionItemKind.Folder */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolFolder);
+ byKind.set(24 /* CompletionItemKind.TypeParameter */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolTypeParameter);
+ byKind.set(25 /* CompletionItemKind.User */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.account);
+ byKind.set(26 /* CompletionItemKind.Issue */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.issues);
+ /**
+ * @internal
+ */
+ function toIcon(kind) {
+ let codicon = byKind.get(kind);
+ if (!codicon) {
+ console.info('No codicon found for CompletionItemKind ' + kind);
+ codicon = _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolProperty;
+ }
+ return codicon;
+ }
+ CompletionItemKinds.toIcon = toIcon;
+ const data = new Map();
+ data.set('method', 0 /* CompletionItemKind.Method */);
+ data.set('function', 1 /* CompletionItemKind.Function */);
+ data.set('constructor', 2 /* CompletionItemKind.Constructor */);
+ data.set('field', 3 /* CompletionItemKind.Field */);
+ data.set('variable', 4 /* CompletionItemKind.Variable */);
+ data.set('class', 5 /* CompletionItemKind.Class */);
+ data.set('struct', 6 /* CompletionItemKind.Struct */);
+ data.set('interface', 7 /* CompletionItemKind.Interface */);
+ data.set('module', 8 /* CompletionItemKind.Module */);
+ data.set('property', 9 /* CompletionItemKind.Property */);
+ data.set('event', 10 /* CompletionItemKind.Event */);
+ data.set('operator', 11 /* CompletionItemKind.Operator */);
+ data.set('unit', 12 /* CompletionItemKind.Unit */);
+ data.set('value', 13 /* CompletionItemKind.Value */);
+ data.set('constant', 14 /* CompletionItemKind.Constant */);
+ data.set('enum', 15 /* CompletionItemKind.Enum */);
+ data.set('enum-member', 16 /* CompletionItemKind.EnumMember */);
+ data.set('enumMember', 16 /* CompletionItemKind.EnumMember */);
+ data.set('keyword', 17 /* CompletionItemKind.Keyword */);
+ data.set('snippet', 27 /* CompletionItemKind.Snippet */);
+ data.set('text', 18 /* CompletionItemKind.Text */);
+ data.set('color', 19 /* CompletionItemKind.Color */);
+ data.set('file', 20 /* CompletionItemKind.File */);
+ data.set('reference', 21 /* CompletionItemKind.Reference */);
+ data.set('customcolor', 22 /* CompletionItemKind.Customcolor */);
+ data.set('folder', 23 /* CompletionItemKind.Folder */);
+ data.set('type-parameter', 24 /* CompletionItemKind.TypeParameter */);
+ data.set('typeParameter', 24 /* CompletionItemKind.TypeParameter */);
+ data.set('account', 25 /* CompletionItemKind.User */);
+ data.set('issue', 26 /* CompletionItemKind.Issue */);
+ /**
+ * @internal
+ */
+ function fromString(value, strict) {
+ let res = data.get(value);
+ if (typeof res === 'undefined' && !strict) {
+ res = 9 /* CompletionItemKind.Property */;
+ }
+ return res;
+ }
+ CompletionItemKinds.fromString = fromString;
+})(CompletionItemKinds || (CompletionItemKinds = {}));
+/**
+ * How an {@link InlineCompletionsProvider inline completion provider} was triggered.
+ */
+var InlineCompletionTriggerKind;
+(function (InlineCompletionTriggerKind) {
+ /**
+ * Completion was triggered automatically while editing.
+ * It is sufficient to return a single completion item in this case.
+ */
+ InlineCompletionTriggerKind[InlineCompletionTriggerKind["Automatic"] = 0] = "Automatic";
+ /**
+ * Completion was triggered explicitly by a user gesture.
+ * Return multiple completion items to enable cycling through them.
+ */
+ InlineCompletionTriggerKind[InlineCompletionTriggerKind["Explicit"] = 1] = "Explicit";
+})(InlineCompletionTriggerKind || (InlineCompletionTriggerKind = {}));
+class SelectedSuggestionInfo {
+ constructor(range, text, completionKind, isSnippetText) {
+ this.range = range;
+ this.text = text;
+ this.completionKind = completionKind;
+ this.isSnippetText = isSnippetText;
+ }
+ equals(other) {
+ return _core_range_js__WEBPACK_IMPORTED_MODULE_2__.Range.lift(this.range).equalsRange(other.range)
+ && this.text === other.text
+ && this.completionKind === other.completionKind
+ && this.isSnippetText === other.isSnippetText;
+ }
+}
+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 = {}));
+/**
+ * @internal
+ */
+function isLocationLink(thing) {
+ return thing
+ && _base_common_uri_js__WEBPACK_IMPORTED_MODULE_1__.URI.isUri(thing.uri)
+ && _core_range_js__WEBPACK_IMPORTED_MODULE_2__.Range.isIRange(thing.range)
+ && (_core_range_js__WEBPACK_IMPORTED_MODULE_2__.Range.isIRange(thing.originSelectionRange) || _core_range_js__WEBPACK_IMPORTED_MODULE_2__.Range.isIRange(thing.targetSelectionRange));
+}
+/**
+ * @internal
+ */
+const symbolKindNames = {
+ [17 /* SymbolKind.Array */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Array', "array"),
+ [16 /* SymbolKind.Boolean */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Boolean', "boolean"),
+ [4 /* SymbolKind.Class */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Class', "class"),
+ [13 /* SymbolKind.Constant */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Constant', "constant"),
+ [8 /* SymbolKind.Constructor */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Constructor', "constructor"),
+ [9 /* SymbolKind.Enum */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Enum', "enumeration"),
+ [21 /* SymbolKind.EnumMember */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('EnumMember', "enumeration member"),
+ [23 /* SymbolKind.Event */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Event', "event"),
+ [7 /* SymbolKind.Field */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Field', "field"),
+ [0 /* SymbolKind.File */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('File', "file"),
+ [11 /* SymbolKind.Function */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Function', "function"),
+ [10 /* SymbolKind.Interface */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Interface', "interface"),
+ [19 /* SymbolKind.Key */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Key', "key"),
+ [5 /* SymbolKind.Method */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Method', "method"),
+ [1 /* SymbolKind.Module */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Module', "module"),
+ [2 /* SymbolKind.Namespace */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Namespace', "namespace"),
+ [20 /* SymbolKind.Null */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Null', "null"),
+ [15 /* SymbolKind.Number */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Number', "number"),
+ [18 /* SymbolKind.Object */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Object', "object"),
+ [24 /* SymbolKind.Operator */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Operator', "operator"),
+ [3 /* SymbolKind.Package */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Package', "package"),
+ [6 /* SymbolKind.Property */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Property', "property"),
+ [14 /* SymbolKind.String */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('String', "string"),
+ [22 /* SymbolKind.Struct */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Struct', "struct"),
+ [25 /* SymbolKind.TypeParameter */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('TypeParameter', "type parameter"),
+ [12 /* SymbolKind.Variable */]: (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('Variable', "variable"),
+};
+/**
+ * @internal
+ */
+function getAriaLabelForSymbol(symbolName, kind) {
+ return (0,_nls_js__WEBPACK_IMPORTED_MODULE_4__.localize)('symbolAriaLabel', '{0} ({1})', symbolName, symbolKindNames[kind]);
+}
+/**
+ * @internal
+ */
+var SymbolKinds;
+(function (SymbolKinds) {
+ const byKind = new Map();
+ byKind.set(0 /* SymbolKind.File */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolFile);
+ byKind.set(1 /* SymbolKind.Module */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolModule);
+ byKind.set(2 /* SymbolKind.Namespace */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolNamespace);
+ byKind.set(3 /* SymbolKind.Package */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolPackage);
+ byKind.set(4 /* SymbolKind.Class */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolClass);
+ byKind.set(5 /* SymbolKind.Method */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolMethod);
+ byKind.set(6 /* SymbolKind.Property */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolProperty);
+ byKind.set(7 /* SymbolKind.Field */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolField);
+ byKind.set(8 /* SymbolKind.Constructor */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolConstructor);
+ byKind.set(9 /* SymbolKind.Enum */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolEnum);
+ byKind.set(10 /* SymbolKind.Interface */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolInterface);
+ byKind.set(11 /* SymbolKind.Function */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolFunction);
+ byKind.set(12 /* SymbolKind.Variable */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolVariable);
+ byKind.set(13 /* SymbolKind.Constant */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolConstant);
+ byKind.set(14 /* SymbolKind.String */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolString);
+ byKind.set(15 /* SymbolKind.Number */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolNumber);
+ byKind.set(16 /* SymbolKind.Boolean */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolBoolean);
+ byKind.set(17 /* SymbolKind.Array */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolArray);
+ byKind.set(18 /* SymbolKind.Object */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolObject);
+ byKind.set(19 /* SymbolKind.Key */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolKey);
+ byKind.set(20 /* SymbolKind.Null */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolNull);
+ byKind.set(21 /* SymbolKind.EnumMember */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolEnumMember);
+ byKind.set(22 /* SymbolKind.Struct */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolStruct);
+ byKind.set(23 /* SymbolKind.Event */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolEvent);
+ byKind.set(24 /* SymbolKind.Operator */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolOperator);
+ byKind.set(25 /* SymbolKind.TypeParameter */, _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolTypeParameter);
+ /**
+ * @internal
+ */
+ function toIcon(kind) {
+ let icon = byKind.get(kind);
+ if (!icon) {
+ console.info('No codicon found for SymbolKind ' + kind);
+ icon = _base_common_codicons_js__WEBPACK_IMPORTED_MODULE_0__.Codicon.symbolProperty;
+ }
+ return icon;
+ }
+ SymbolKinds.toIcon = toIcon;
+})(SymbolKinds || (SymbolKinds = {}));
+/** @internal */
+class TextEdit {
+}
+class FoldingRangeKind {
+ /**
+ * Returns a {@link FoldingRangeKind} for the given value.
+ *
+ * @param value of the kind.
+ */
+ static fromValue(value) {
+ switch (value) {
+ case 'comment': return FoldingRangeKind.Comment;
+ case 'imports': return FoldingRangeKind.Imports;
+ case 'region': return FoldingRangeKind.Region;
+ }
+ return new FoldingRangeKind(value);
+ }
+ /**
+ * Creates a new {@link FoldingRangeKind}.
+ *
+ * @param value of the kind.
+ */
+ constructor(value) {
+ this.value = value;
+ }
+}
+/**
+ * Kind for folding range representing a comment. The value of the kind is 'comment'.
+ */
+FoldingRangeKind.Comment = new FoldingRangeKind('comment');
+/**
+ * Kind for folding range representing a import. The value of the kind is 'imports'.
+ */
+FoldingRangeKind.Imports = new FoldingRangeKind('imports');
+/**
+ * Kind for folding range representing regions (for example marked by `#region`, `#endregion`).
+ * The value of the kind is 'region'.
+ */
+FoldingRangeKind.Region = new FoldingRangeKind('region');
+/**
+ * @internal
+ */
+var Command;
+(function (Command) {
+ /**
+ * @internal
+ */
+ function is(obj) {
+ if (!obj || typeof obj !== 'object') {
+ return false;
+ }
+ return typeof obj.id === 'string' &&
+ typeof obj.title === 'string';
+ }
+ Command.is = is;
+})(Command || (Command = {}));
+var InlayHintKind;
+(function (InlayHintKind) {
+ InlayHintKind[InlayHintKind["Type"] = 1] = "Type";
+ InlayHintKind[InlayHintKind["Parameter"] = 2] = "Parameter";
+})(InlayHintKind || (InlayHintKind = {}));
+/**
+ * @internal
+ */
+class LazyTokenizationSupport {
+ constructor(createSupport) {
+ this.createSupport = createSupport;
+ this._tokenizationSupport = null;
+ }
+ dispose() {
+ if (this._tokenizationSupport) {
+ this._tokenizationSupport.then((support) => {
+ if (support) {
+ support.dispose();
+ }
+ });
+ }
+ }
+ get tokenizationSupport() {
+ if (!this._tokenizationSupport) {
+ this._tokenizationSupport = this.createSupport();
+ }
+ return this._tokenizationSupport;
+ }
+}
+/**
+ * @internal
+ */
+const TokenizationRegistry = new _tokenizationRegistry_js__WEBPACK_IMPORTED_MODULE_3__.TokenizationRegistry();
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/languages/defaultDocumentColorsComputer.js":
+/*!****************************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/languages/defaultDocumentColorsComputer.js ***!
+ \****************************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ computeDefaultDocumentColors: () => (/* binding */ computeDefaultDocumentColors)
+/* harmony export */ });
+/* harmony import */ var _base_common_color_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../../base/common/color.js */ "./node_modules/monaco-editor/esm/vs/base/common/color.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+function _parseCaptureGroups(captureGroups) {
+ const values = [];
+ for (const captureGroup of captureGroups) {
+ const parsedNumber = Number(captureGroup);
+ if (parsedNumber || parsedNumber === 0 && captureGroup.replace(/\s/g, '') !== '') {
+ values.push(parsedNumber);
+ }
+ }
+ return values;
+}
+function _toIColor(r, g, b, a) {
+ return {
+ red: r / 255,
+ blue: b / 255,
+ green: g / 255,
+ alpha: a
+ };
+}
+function _findRange(model, match) {
+ const index = match.index;
+ const length = match[0].length;
+ if (!index) {
+ return;
+ }
+ const startPosition = model.positionAt(index);
+ const range = {
+ startLineNumber: startPosition.lineNumber,
+ startColumn: startPosition.column,
+ endLineNumber: startPosition.lineNumber,
+ endColumn: startPosition.column + length
+ };
+ return range;
+}
+function _findHexColorInformation(range, hexValue) {
+ if (!range) {
+ return;
+ }
+ const parsedHexColor = _base_common_color_js__WEBPACK_IMPORTED_MODULE_0__.Color.Format.CSS.parseHex(hexValue);
+ if (!parsedHexColor) {
+ return;
+ }
+ return {
+ range: range,
+ color: _toIColor(parsedHexColor.rgba.r, parsedHexColor.rgba.g, parsedHexColor.rgba.b, parsedHexColor.rgba.a)
+ };
+}
+function _findRGBColorInformation(range, matches, isAlpha) {
+ if (!range || matches.length !== 1) {
+ return;
+ }
+ const match = matches[0];
+ const captureGroups = match.values();
+ const parsedRegex = _parseCaptureGroups(captureGroups);
+ return {
+ range: range,
+ color: _toIColor(parsedRegex[0], parsedRegex[1], parsedRegex[2], isAlpha ? parsedRegex[3] : 1)
+ };
+}
+function _findHSLColorInformation(range, matches, isAlpha) {
+ if (!range || matches.length !== 1) {
+ return;
+ }
+ const match = matches[0];
+ const captureGroups = match.values();
+ const parsedRegex = _parseCaptureGroups(captureGroups);
+ const colorEquivalent = new _base_common_color_js__WEBPACK_IMPORTED_MODULE_0__.Color(new _base_common_color_js__WEBPACK_IMPORTED_MODULE_0__.HSLA(parsedRegex[0], parsedRegex[1] / 100, parsedRegex[2] / 100, isAlpha ? parsedRegex[3] : 1));
+ return {
+ range: range,
+ color: _toIColor(colorEquivalent.rgba.r, colorEquivalent.rgba.g, colorEquivalent.rgba.b, colorEquivalent.rgba.a)
+ };
+}
+function _findMatches(model, regex) {
+ if (typeof model === 'string') {
+ return [...model.matchAll(regex)];
+ }
+ else {
+ return model.findMatches(regex);
+ }
+}
+function computeColors(model) {
+ const result = [];
+ // Early validation for RGB and HSL
+ const initialValidationRegex = /\b(rgb|rgba|hsl|hsla)(\([0-9\s,.\%]*\))|(#)([A-Fa-f0-9]{3})\b|(#)([A-Fa-f0-9]{4})\b|(#)([A-Fa-f0-9]{6})\b|(#)([A-Fa-f0-9]{8})\b/gm;
+ const initialValidationMatches = _findMatches(model, initialValidationRegex);
+ // Potential colors have been found, validate the parameters
+ if (initialValidationMatches.length > 0) {
+ for (const initialMatch of initialValidationMatches) {
+ const initialCaptureGroups = initialMatch.filter(captureGroup => captureGroup !== undefined);
+ const colorScheme = initialCaptureGroups[1];
+ const colorParameters = initialCaptureGroups[2];
+ if (!colorParameters) {
+ continue;
+ }
+ let colorInformation;
+ if (colorScheme === 'rgb') {
+ const regexParameters = /^\(\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\s*,\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\s*,\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\s*\)$/gm;
+ colorInformation = _findRGBColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), false);
+ }
+ else if (colorScheme === 'rgba') {
+ const regexParameters = /^\(\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\s*,\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\s*,\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\s*,\s*(0[.][0-9]+|[.][0-9]+|[01][.]|[01])\s*\)$/gm;
+ colorInformation = _findRGBColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), true);
+ }
+ else if (colorScheme === 'hsl') {
+ const regexParameters = /^\(\s*(36[0]|3[0-5][0-9]|[12][0-9][0-9]|[1-9]?[0-9])\s*,\s*(100|\d{1,2}[.]\d*|\d{1,2})%\s*,\s*(100|\d{1,2}[.]\d*|\d{1,2})%\s*\)$/gm;
+ colorInformation = _findHSLColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), false);
+ }
+ else if (colorScheme === 'hsla') {
+ const regexParameters = /^\(\s*(36[0]|3[0-5][0-9]|[12][0-9][0-9]|[1-9]?[0-9])\s*,\s*(100|\d{1,2}[.]\d*|\d{1,2})%\s*,\s*(100|\d{1,2}[.]\d*|\d{1,2})%\s*,\s*(0[.][0-9]+|[.][0-9]+|[01][.]|[01])\s*\)$/gm;
+ colorInformation = _findHSLColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), true);
+ }
+ else if (colorScheme === '#') {
+ colorInformation = _findHexColorInformation(_findRange(model, initialMatch), colorScheme + colorParameters);
+ }
+ if (colorInformation) {
+ result.push(colorInformation);
+ }
+ }
+ }
+ return result;
+}
+/**
+ * Returns an array of all default document colors in the provided document
+ */
+function computeDefaultDocumentColors(model) {
+ if (!model || typeof model.getValue !== 'function' || typeof model.positionAt !== 'function') {
+ // Unknown caller!
+ return [];
+ }
+ return computeColors(model);
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/languages/linkComputer.js":
+/*!***********************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/languages/linkComputer.js ***!
+ \***********************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ LinkComputer: () => (/* binding */ LinkComputer),
+/* harmony export */ StateMachine: () => (/* binding */ StateMachine),
+/* harmony export */ computeLinks: () => (/* binding */ computeLinks)
+/* harmony export */ });
+/* 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");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+class Uint8Matrix {
+ constructor(rows, cols, defaultValue) {
+ const data = new Uint8Array(rows * cols);
+ for (let i = 0, len = rows * cols; i < len; i++) {
+ data[i] = defaultValue;
+ }
+ this._data = data;
+ this.rows = rows;
+ this.cols = cols;
+ }
+ get(row, col) {
+ return this._data[row * this.cols + col];
+ }
+ set(row, col, value) {
+ this._data[row * this.cols + col] = value;
+ }
+}
+class StateMachine {
+ constructor(edges) {
+ let maxCharCode = 0;
+ let maxState = 0 /* State.Invalid */;
+ for (let i = 0, len = edges.length; i < len; i++) {
+ const [from, chCode, to] = edges[i];
+ if (chCode > maxCharCode) {
+ maxCharCode = chCode;
+ }
+ if (from > maxState) {
+ maxState = from;
+ }
+ if (to > maxState) {
+ maxState = to;
+ }
+ }
+ maxCharCode++;
+ maxState++;
+ const states = new Uint8Matrix(maxState, maxCharCode, 0 /* State.Invalid */);
+ for (let i = 0, len = edges.length; i < len; i++) {
+ const [from, chCode, to] = edges[i];
+ states.set(from, chCode, to);
+ }
+ this._states = states;
+ this._maxCharCode = maxCharCode;
+ }
+ nextState(currentState, chCode) {
+ if (chCode < 0 || chCode >= this._maxCharCode) {
+ return 0 /* State.Invalid */;
+ }
+ return this._states.get(currentState, chCode);
+ }
+}
+// State machine for http:// or https:// or file://
+let _stateMachine = null;
+function getStateMachine() {
+ if (_stateMachine === null) {
+ _stateMachine = new StateMachine([
+ [1 /* State.Start */, 104 /* CharCode.h */, 2 /* State.H */],
+ [1 /* State.Start */, 72 /* CharCode.H */, 2 /* State.H */],
+ [1 /* State.Start */, 102 /* CharCode.f */, 6 /* State.F */],
+ [1 /* State.Start */, 70 /* CharCode.F */, 6 /* State.F */],
+ [2 /* State.H */, 116 /* CharCode.t */, 3 /* State.HT */],
+ [2 /* State.H */, 84 /* CharCode.T */, 3 /* State.HT */],
+ [3 /* State.HT */, 116 /* CharCode.t */, 4 /* State.HTT */],
+ [3 /* State.HT */, 84 /* CharCode.T */, 4 /* State.HTT */],
+ [4 /* State.HTT */, 112 /* CharCode.p */, 5 /* State.HTTP */],
+ [4 /* State.HTT */, 80 /* CharCode.P */, 5 /* State.HTTP */],
+ [5 /* State.HTTP */, 115 /* CharCode.s */, 9 /* State.BeforeColon */],
+ [5 /* State.HTTP */, 83 /* CharCode.S */, 9 /* State.BeforeColon */],
+ [5 /* State.HTTP */, 58 /* CharCode.Colon */, 10 /* State.AfterColon */],
+ [6 /* State.F */, 105 /* CharCode.i */, 7 /* State.FI */],
+ [6 /* State.F */, 73 /* CharCode.I */, 7 /* State.FI */],
+ [7 /* State.FI */, 108 /* CharCode.l */, 8 /* State.FIL */],
+ [7 /* State.FI */, 76 /* CharCode.L */, 8 /* State.FIL */],
+ [8 /* State.FIL */, 101 /* CharCode.e */, 9 /* State.BeforeColon */],
+ [8 /* State.FIL */, 69 /* CharCode.E */, 9 /* State.BeforeColon */],
+ [9 /* State.BeforeColon */, 58 /* CharCode.Colon */, 10 /* State.AfterColon */],
+ [10 /* State.AfterColon */, 47 /* CharCode.Slash */, 11 /* State.AlmostThere */],
+ [11 /* State.AlmostThere */, 47 /* CharCode.Slash */, 12 /* State.End */],
+ ]);
+ }
+ return _stateMachine;
+}
+let _classifier = null;
+function getClassifier() {
+ if (_classifier === null) {
+ _classifier = new _core_characterClassifier_js__WEBPACK_IMPORTED_MODULE_0__.CharacterClassifier(0 /* CharacterClass.None */);
+ // allow-any-unicode-next-line
+ const FORCE_TERMINATION_CHARACTERS = ' \t<>\'\"、。。、,.:;‘〈「『〔([{「」}])〕』」〉’`~…';
+ for (let i = 0; i < FORCE_TERMINATION_CHARACTERS.length; i++) {
+ _classifier.set(FORCE_TERMINATION_CHARACTERS.charCodeAt(i), 1 /* CharacterClass.ForceTermination */);
+ }
+ const CANNOT_END_WITH_CHARACTERS = '.,;:';
+ for (let i = 0; i < CANNOT_END_WITH_CHARACTERS.length; i++) {
+ _classifier.set(CANNOT_END_WITH_CHARACTERS.charCodeAt(i), 2 /* CharacterClass.CannotEndIn */);
+ }
+ }
+ return _classifier;
+}
+class LinkComputer {
+ static _createLink(classifier, line, lineNumber, linkBeginIndex, linkEndIndex) {
+ // Do not allow to end link in certain characters...
+ let lastIncludedCharIndex = linkEndIndex - 1;
+ do {
+ const chCode = line.charCodeAt(lastIncludedCharIndex);
+ const chClass = classifier.get(chCode);
+ if (chClass !== 2 /* CharacterClass.CannotEndIn */) {
+ break;
+ }
+ lastIncludedCharIndex--;
+ } while (lastIncludedCharIndex > linkBeginIndex);
+ // Handle links enclosed in parens, square brackets and curlys.
+ if (linkBeginIndex > 0) {
+ const charCodeBeforeLink = line.charCodeAt(linkBeginIndex - 1);
+ const lastCharCodeInLink = line.charCodeAt(lastIncludedCharIndex);
+ if ((charCodeBeforeLink === 40 /* CharCode.OpenParen */ && lastCharCodeInLink === 41 /* CharCode.CloseParen */)
+ || (charCodeBeforeLink === 91 /* CharCode.OpenSquareBracket */ && lastCharCodeInLink === 93 /* CharCode.CloseSquareBracket */)
+ || (charCodeBeforeLink === 123 /* CharCode.OpenCurlyBrace */ && lastCharCodeInLink === 125 /* CharCode.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)
+ };
+ }
+ static computeLinks(model, stateMachine = getStateMachine()) {
+ const classifier = getClassifier();
+ const result = [];
+ for (let i = 1, lineCount = model.getLineCount(); i <= lineCount; i++) {
+ const line = model.getLineContent(i);
+ const len = line.length;
+ let j = 0;
+ let linkBeginIndex = 0;
+ let linkBeginChCode = 0;
+ let state = 1 /* State.Start */;
+ let hasOpenParens = false;
+ let hasOpenSquareBracket = false;
+ let inSquareBrackets = false;
+ let hasOpenCurlyBracket = false;
+ while (j < len) {
+ let resetStateMachine = false;
+ const chCode = line.charCodeAt(j);
+ if (state === 13 /* State.Accept */) {
+ let chClass;
+ switch (chCode) {
+ case 40 /* CharCode.OpenParen */:
+ hasOpenParens = true;
+ chClass = 0 /* CharacterClass.None */;
+ break;
+ case 41 /* CharCode.CloseParen */:
+ chClass = (hasOpenParens ? 0 /* CharacterClass.None */ : 1 /* CharacterClass.ForceTermination */);
+ break;
+ case 91 /* CharCode.OpenSquareBracket */:
+ inSquareBrackets = true;
+ hasOpenSquareBracket = true;
+ chClass = 0 /* CharacterClass.None */;
+ break;
+ case 93 /* CharCode.CloseSquareBracket */:
+ inSquareBrackets = false;
+ chClass = (hasOpenSquareBracket ? 0 /* CharacterClass.None */ : 1 /* CharacterClass.ForceTermination */);
+ break;
+ case 123 /* CharCode.OpenCurlyBrace */:
+ hasOpenCurlyBracket = true;
+ chClass = 0 /* CharacterClass.None */;
+ break;
+ case 125 /* CharCode.CloseCurlyBrace */:
+ chClass = (hasOpenCurlyBracket ? 0 /* CharacterClass.None */ : 1 /* CharacterClass.ForceTermination */);
+ break;
+ // The following three rules make it that ' or " or ` are allowed inside links
+ // only if the link is wrapped by some other quote character
+ case 39 /* CharCode.SingleQuote */:
+ case 34 /* CharCode.DoubleQuote */:
+ case 96 /* CharCode.BackTick */:
+ if (linkBeginChCode === chCode) {
+ chClass = 1 /* CharacterClass.ForceTermination */;
+ }
+ else if (linkBeginChCode === 39 /* CharCode.SingleQuote */ || linkBeginChCode === 34 /* CharCode.DoubleQuote */ || linkBeginChCode === 96 /* CharCode.BackTick */) {
+ chClass = 0 /* CharacterClass.None */;
+ }
+ else {
+ chClass = 1 /* CharacterClass.ForceTermination */;
+ }
+ break;
+ case 42 /* CharCode.Asterisk */:
+ // `*` terminates a link if the link began with `*`
+ chClass = (linkBeginChCode === 42 /* CharCode.Asterisk */) ? 1 /* CharacterClass.ForceTermination */ : 0 /* CharacterClass.None */;
+ break;
+ case 124 /* CharCode.Pipe */:
+ // `|` terminates a link if the link began with `|`
+ chClass = (linkBeginChCode === 124 /* CharCode.Pipe */) ? 1 /* CharacterClass.ForceTermination */ : 0 /* CharacterClass.None */;
+ break;
+ case 32 /* CharCode.Space */:
+ // ` ` allow space in between [ and ]
+ chClass = (inSquareBrackets ? 0 /* CharacterClass.None */ : 1 /* CharacterClass.ForceTermination */);
+ break;
+ default:
+ chClass = classifier.get(chCode);
+ }
+ // Check if character terminates link
+ if (chClass === 1 /* CharacterClass.ForceTermination */) {
+ result.push(LinkComputer._createLink(classifier, line, i, linkBeginIndex, j));
+ resetStateMachine = true;
+ }
+ }
+ else if (state === 12 /* State.End */) {
+ let chClass;
+ if (chCode === 91 /* CharCode.OpenSquareBracket */) {
+ // Allow for the authority part to contain ipv6 addresses which contain [ and ]
+ hasOpenSquareBracket = true;
+ chClass = 0 /* CharacterClass.None */;
+ }
+ else {
+ chClass = classifier.get(chCode);
+ }
+ // Check if character terminates link
+ if (chClass === 1 /* CharacterClass.ForceTermination */) {
+ resetStateMachine = true;
+ }
+ else {
+ state = 13 /* State.Accept */;
+ }
+ }
+ else {
+ state = stateMachine.nextState(state, chCode);
+ if (state === 0 /* State.Invalid */) {
+ resetStateMachine = true;
+ }
+ }
+ if (resetStateMachine) {
+ state = 1 /* State.Start */;
+ hasOpenParens = false;
+ hasOpenSquareBracket = false;
+ hasOpenCurlyBracket = false;
+ // Record where the link started
+ linkBeginIndex = j + 1;
+ linkBeginChCode = chCode;
+ }
+ j++;
+ }
+ if (state === 13 /* State.Accept */) {
+ result.push(LinkComputer._createLink(classifier, line, i, linkBeginIndex, len));
+ }
+ }
+ return result;
+ }
+}
+/**
+ * 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);
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/languages/supports/inplaceReplaceSupport.js":
+/*!*****************************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/languages/supports/inplaceReplaceSupport.js ***!
+ \*****************************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ BasicInplaceReplace: () => (/* binding */ BasicInplaceReplace)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+class BasicInplaceReplace {
+ constructor() {
+ this._defaultValueSet = [
+ ['true', 'false'],
+ ['True', 'False'],
+ ['Private', 'Public', 'Friend', 'ReadOnly', 'Partial', 'Protected', 'WriteOnly'],
+ ['public', 'protected', 'private'],
+ ];
+ }
+ navigateValueSet(range1, text1, range2, text2, up) {
+ if (range1 && text1) {
+ const result = this.doNavigateValueSet(text1, up);
+ if (result) {
+ return {
+ range: range1,
+ value: result
+ };
+ }
+ }
+ if (range2 && text2) {
+ const result = this.doNavigateValueSet(text2, up);
+ if (result) {
+ return {
+ range: range2,
+ value: result
+ };
+ }
+ }
+ return null;
+ }
+ doNavigateValueSet(text, up) {
+ const numberResult = this.numberReplace(text, up);
+ if (numberResult !== null) {
+ return numberResult;
+ }
+ return this.textReplace(text, up);
+ }
+ numberReplace(value, up) {
+ const precision = Math.pow(10, value.length - (value.lastIndexOf('.') + 1));
+ let n1 = Number(value);
+ const 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;
+ }
+ textReplace(value, up) {
+ return this.valueSetsReplace(this._defaultValueSet, value, up);
+ }
+ valueSetsReplace(valueSets, value, up) {
+ let result = null;
+ for (let i = 0, len = valueSets.length; result === null && i < len; i++) {
+ result = this.valueSetReplace(valueSets[i], value, up);
+ }
+ return result;
+ }
+ valueSetReplace(valueSet, value, up) {
+ let 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();
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/model.js":
+/*!******************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/model.js ***!
+ \******************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ ApplyEditsResult: () => (/* binding */ ApplyEditsResult),
+/* harmony export */ FindMatch: () => (/* binding */ FindMatch),
+/* harmony export */ GlyphMarginLane: () => (/* binding */ GlyphMarginLane),
+/* harmony export */ InjectedTextCursorStops: () => (/* binding */ InjectedTextCursorStops),
+/* harmony export */ MinimapPosition: () => (/* binding */ MinimapPosition),
+/* harmony export */ OverviewRulerLane: () => (/* binding */ OverviewRulerLane),
+/* harmony export */ SearchData: () => (/* binding */ SearchData),
+/* harmony export */ TextModelResolvedOptions: () => (/* binding */ TextModelResolvedOptions),
+/* harmony export */ ValidAnnotatedEditOperation: () => (/* binding */ ValidAnnotatedEditOperation),
+/* harmony export */ isITextSnapshot: () => (/* binding */ isITextSnapshot),
+/* harmony export */ shouldSynchronizeModel: () => (/* binding */ shouldSynchronizeModel)
+/* harmony export */ });
+/* harmony import */ var _base_common_objects_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../base/common/objects.js */ "./node_modules/monaco-editor/esm/vs/base/common/objects.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+/**
+ * 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 = {}));
+/**
+ * Vertical Lane in the glyph margin of the editor.
+ */
+var GlyphMarginLane;
+(function (GlyphMarginLane) {
+ GlyphMarginLane[GlyphMarginLane["Left"] = 1] = "Left";
+ GlyphMarginLane[GlyphMarginLane["Right"] = 2] = "Right";
+})(GlyphMarginLane || (GlyphMarginLane = {}));
+/**
+ * Position in the minimap to render the decoration.
+ */
+var MinimapPosition;
+(function (MinimapPosition) {
+ MinimapPosition[MinimapPosition["Inline"] = 1] = "Inline";
+ MinimapPosition[MinimapPosition["Gutter"] = 2] = "Gutter";
+})(MinimapPosition || (MinimapPosition = {}));
+var InjectedTextCursorStops;
+(function (InjectedTextCursorStops) {
+ InjectedTextCursorStops[InjectedTextCursorStops["Both"] = 0] = "Both";
+ InjectedTextCursorStops[InjectedTextCursorStops["Right"] = 1] = "Right";
+ InjectedTextCursorStops[InjectedTextCursorStops["Left"] = 2] = "Left";
+ InjectedTextCursorStops[InjectedTextCursorStops["None"] = 3] = "None";
+})(InjectedTextCursorStops || (InjectedTextCursorStops = {}));
+class TextModelResolvedOptions {
+ get originalIndentSize() {
+ return this._indentSizeIsTabSize ? 'tabSize' : this.indentSize;
+ }
+ /**
+ * @internal
+ */
+ constructor(src) {
+ this._textModelResolvedOptionsBrand = undefined;
+ this.tabSize = Math.max(1, src.tabSize | 0);
+ if (src.indentSize === 'tabSize') {
+ this.indentSize = this.tabSize;
+ this._indentSizeIsTabSize = true;
+ }
+ else {
+ this.indentSize = Math.max(1, src.indentSize | 0);
+ this._indentSizeIsTabSize = false;
+ }
+ this.insertSpaces = Boolean(src.insertSpaces);
+ this.defaultEOL = src.defaultEOL | 0;
+ this.trimAutoWhitespace = Boolean(src.trimAutoWhitespace);
+ this.bracketPairColorizationOptions = src.bracketPairColorizationOptions;
+ }
+ /**
+ * @internal
+ */
+ equals(other) {
+ return (this.tabSize === other.tabSize
+ && this._indentSizeIsTabSize === other._indentSizeIsTabSize
+ && this.indentSize === other.indentSize
+ && this.insertSpaces === other.insertSpaces
+ && this.defaultEOL === other.defaultEOL
+ && this.trimAutoWhitespace === other.trimAutoWhitespace
+ && (0,_base_common_objects_js__WEBPACK_IMPORTED_MODULE_0__.equals)(this.bracketPairColorizationOptions, other.bracketPairColorizationOptions));
+ }
+ /**
+ * @internal
+ */
+ createChangeEvent(newOpts) {
+ return {
+ tabSize: this.tabSize !== newOpts.tabSize,
+ indentSize: this.indentSize !== newOpts.indentSize,
+ insertSpaces: this.insertSpaces !== newOpts.insertSpaces,
+ trimAutoWhitespace: this.trimAutoWhitespace !== newOpts.trimAutoWhitespace,
+ };
+ }
+}
+class FindMatch {
+ /**
+ * @internal
+ */
+ constructor(range, matches) {
+ this._findMatchBrand = undefined;
+ this.range = range;
+ this.matches = matches;
+ }
+}
+/**
+ * @internal
+ */
+function isITextSnapshot(obj) {
+ return (obj && typeof obj.read === 'function');
+}
+/**
+ * @internal
+ */
+class ValidAnnotatedEditOperation {
+ constructor(identifier, range, text, forceMoveMarkers, isAutoWhitespaceEdit, _isTracked) {
+ this.identifier = identifier;
+ this.range = range;
+ this.text = text;
+ this.forceMoveMarkers = forceMoveMarkers;
+ this.isAutoWhitespaceEdit = isAutoWhitespaceEdit;
+ this._isTracked = _isTracked;
+ }
+}
+/**
+ * @internal
+ */
+class SearchData {
+ constructor(regex, wordSeparators, simpleSearch) {
+ this.regex = regex;
+ this.wordSeparators = wordSeparators;
+ this.simpleSearch = simpleSearch;
+ }
+}
+/**
+ * @internal
+ */
+class ApplyEditsResult {
+ constructor(reverseEdits, changes, trimAutoWhitespaceLineNumbers) {
+ this.reverseEdits = reverseEdits;
+ this.changes = changes;
+ this.trimAutoWhitespaceLineNumbers = trimAutoWhitespaceLineNumbers;
+ }
+}
+/**
+ * @internal
+ */
+function shouldSynchronizeModel(model) {
+ return (!model.isTooLargeForSyncing() && !model.isForSimpleWidget);
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/model/mirrorTextModel.js":
+/*!**********************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/model/mirrorTextModel.js ***!
+ \**********************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ MirrorTextModel: () => (/* binding */ MirrorTextModel)
+/* harmony export */ });
+/* harmony import */ var _base_common_strings_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../../base/common/strings.js */ "./node_modules/monaco-editor/esm/vs/base/common/strings.js");
+/* harmony import */ var _core_position_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../core/position.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/position.js");
+/* harmony import */ var _prefixSumComputer_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./prefixSumComputer.js */ "./node_modules/monaco-editor/esm/vs/editor/common/model/prefixSumComputer.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+
+
+class MirrorTextModel {
+ constructor(uri, lines, eol, versionId) {
+ this._uri = uri;
+ this._lines = lines;
+ this._eol = eol;
+ this._versionId = versionId;
+ this._lineStarts = null;
+ this._cachedTextValue = null;
+ }
+ dispose() {
+ this._lines.length = 0;
+ }
+ get version() {
+ return this._versionId;
+ }
+ getText() {
+ if (this._cachedTextValue === null) {
+ this._cachedTextValue = this._lines.join(this._eol);
+ }
+ return this._cachedTextValue;
+ }
+ onEvents(e) {
+ if (e.eol && e.eol !== this._eol) {
+ this._eol = e.eol;
+ this._lineStarts = null;
+ }
+ // Update my lines
+ const changes = e.changes;
+ for (const change of changes) {
+ this._acceptDeleteRange(change.range);
+ this._acceptInsertText(new _core_position_js__WEBPACK_IMPORTED_MODULE_1__.Position(change.range.startLineNumber, change.range.startColumn), change.text);
+ }
+ this._versionId = e.versionId;
+ this._cachedTextValue = null;
+ }
+ _ensureLineStarts() {
+ if (!this._lineStarts) {
+ const eolLength = this._eol.length;
+ const linesLength = this._lines.length;
+ const lineStartValues = new Uint32Array(linesLength);
+ for (let i = 0; i < linesLength; i++) {
+ lineStartValues[i] = this._lines[i].length + eolLength;
+ }
+ this._lineStarts = new _prefixSumComputer_js__WEBPACK_IMPORTED_MODULE_2__.PrefixSumComputer(lineStartValues);
+ }
+ }
+ /**
+ * All changes to a line's text go through this method
+ */
+ _setLineText(lineIndex, newValue) {
+ this._lines[lineIndex] = newValue;
+ if (this._lineStarts) {
+ // update prefix sum
+ this._lineStarts.setValue(lineIndex, this._lines[lineIndex].length + this._eol.length);
+ }
+ }
+ _acceptDeleteRange(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);
+ }
+ }
+ _acceptInsertText(position, insertText) {
+ if (insertText.length === 0) {
+ // Nothing to insert
+ return;
+ }
+ const insertLines = (0,_base_common_strings_js__WEBPACK_IMPORTED_MODULE_0__.splitLines)(insertText);
+ 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
+ const newLengths = new Uint32Array(insertLines.length - 1);
+ for (let 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);
+ }
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/model/prefixSumComputer.js":
+/*!************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/model/prefixSumComputer.js ***!
+ \************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ ConstantTimePrefixSumComputer: () => (/* binding */ ConstantTimePrefixSumComputer),
+/* harmony export */ PrefixSumComputer: () => (/* binding */ PrefixSumComputer),
+/* harmony export */ PrefixSumIndexOfResult: () => (/* binding */ PrefixSumIndexOfResult)
+/* harmony export */ });
+/* 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_uint_js__WEBPACK_IMPORTED_MODULE_1__ = __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.
+ *--------------------------------------------------------------------------------------------*/
+
+
+class PrefixSumComputer {
+ constructor(values) {
+ this.values = values;
+ this.prefixSum = new Uint32Array(values.length);
+ this.prefixSumValidIndex = new Int32Array(1);
+ this.prefixSumValidIndex[0] = -1;
+ }
+ insertValues(insertIndex, insertValues) {
+ insertIndex = (0,_base_common_uint_js__WEBPACK_IMPORTED_MODULE_1__.toUint32)(insertIndex);
+ const oldValues = this.values;
+ const oldPrefixSum = this.prefixSum;
+ const 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;
+ }
+ setValue(index, value) {
+ index = (0,_base_common_uint_js__WEBPACK_IMPORTED_MODULE_1__.toUint32)(index);
+ value = (0,_base_common_uint_js__WEBPACK_IMPORTED_MODULE_1__.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;
+ }
+ removeValues(startIndex, count) {
+ startIndex = (0,_base_common_uint_js__WEBPACK_IMPORTED_MODULE_1__.toUint32)(startIndex);
+ count = (0,_base_common_uint_js__WEBPACK_IMPORTED_MODULE_1__.toUint32)(count);
+ const oldValues = this.values;
+ const oldPrefixSum = this.prefixSum;
+ if (startIndex >= oldValues.length) {
+ return false;
+ }
+ const maxCount = oldValues.length - startIndex;
+ if (count >= maxCount) {
+ count = maxCount;
+ }
+ if (count === 0) {
+ return false;
+ }
+ this.values = new Uint32Array(oldValues.length - count);
+ this.values.set(oldValues.subarray(0, startIndex), 0);
+ this.values.set(oldValues.subarray(startIndex + count), 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;
+ }
+ getTotalSum() {
+ if (this.values.length === 0) {
+ return 0;
+ }
+ return this._getPrefixSum(this.values.length - 1);
+ }
+ /**
+ * Returns the sum of the first `index + 1` many items.
+ * @returns `SUM(0 <= j <= index, values[j])`.
+ */
+ getPrefixSum(index) {
+ if (index < 0) {
+ return 0;
+ }
+ index = (0,_base_common_uint_js__WEBPACK_IMPORTED_MODULE_1__.toUint32)(index);
+ return this._getPrefixSum(index);
+ }
+ _getPrefixSum(index) {
+ if (index <= this.prefixSumValidIndex[0]) {
+ return this.prefixSum[index];
+ }
+ let 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 (let 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];
+ }
+ getIndexOf(sum) {
+ sum = Math.floor(sum);
+ // Compute all sums (to get a fully valid prefixSum)
+ this.getTotalSum();
+ let low = 0;
+ let high = this.values.length - 1;
+ let mid = 0;
+ let midStop = 0;
+ let midStart = 0;
+ while (low <= high) {
+ mid = low + ((high - low) / 2) | 0;
+ midStop = this.prefixSum[mid];
+ midStart = midStop - this.values[mid];
+ if (sum < midStart) {
+ high = mid - 1;
+ }
+ else if (sum >= midStop) {
+ low = mid + 1;
+ }
+ else {
+ break;
+ }
+ }
+ return new PrefixSumIndexOfResult(mid, sum - midStart);
+ }
+}
+/**
+ * {@link getIndexOf} has an amortized runtime complexity of O(1).
+ *
+ * ({@link PrefixSumComputer.getIndexOf} is just O(log n))
+*/
+class ConstantTimePrefixSumComputer {
+ constructor(values) {
+ this._values = values;
+ this._isValid = false;
+ this._validEndIndex = -1;
+ this._prefixSum = [];
+ this._indexBySum = [];
+ }
+ /**
+ * @returns SUM(0 <= j < values.length, values[j])
+ */
+ getTotalSum() {
+ this._ensureValid();
+ return this._indexBySum.length;
+ }
+ /**
+ * Returns the sum of the first `count` many items.
+ * @returns `SUM(0 <= j < count, values[j])`.
+ */
+ getPrefixSum(count) {
+ this._ensureValid();
+ if (count === 0) {
+ return 0;
+ }
+ return this._prefixSum[count - 1];
+ }
+ /**
+ * @returns `result`, such that `getPrefixSum(result.index) + result.remainder = sum`
+ */
+ getIndexOf(sum) {
+ this._ensureValid();
+ const idx = this._indexBySum[sum];
+ const viewLinesAbove = idx > 0 ? this._prefixSum[idx - 1] : 0;
+ return new PrefixSumIndexOfResult(idx, sum - viewLinesAbove);
+ }
+ removeValues(start, deleteCount) {
+ this._values.splice(start, deleteCount);
+ this._invalidate(start);
+ }
+ insertValues(insertIndex, insertArr) {
+ this._values = (0,_base_common_arrays_js__WEBPACK_IMPORTED_MODULE_0__.arrayInsert)(this._values, insertIndex, insertArr);
+ this._invalidate(insertIndex);
+ }
+ _invalidate(index) {
+ this._isValid = false;
+ this._validEndIndex = Math.min(this._validEndIndex, index - 1);
+ }
+ _ensureValid() {
+ if (this._isValid) {
+ return;
+ }
+ for (let i = this._validEndIndex + 1, len = this._values.length; i < len; i++) {
+ const value = this._values[i];
+ const sumAbove = i > 0 ? this._prefixSum[i - 1] : 0;
+ this._prefixSum[i] = sumAbove + value;
+ for (let j = 0; j < value; j++) {
+ this._indexBySum[sumAbove + j] = i;
+ }
+ }
+ // trim things
+ this._prefixSum.length = this._values.length;
+ this._indexBySum.length = this._prefixSum[this._prefixSum.length - 1];
+ // mark as valid
+ this._isValid = true;
+ this._validEndIndex = this._values.length - 1;
+ }
+ setValue(index, value) {
+ if (this._values[index] === value) {
+ // no change
+ return;
+ }
+ this._values[index] = value;
+ this._invalidate(index);
+ }
+}
+class PrefixSumIndexOfResult {
+ constructor(index, remainder) {
+ this.index = index;
+ this.remainder = remainder;
+ this._prefixSumIndexOfResultBrand = undefined;
+ this.index = index;
+ this.remainder = remainder;
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/model/textModelSearch.js":
+/*!**********************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/model/textModelSearch.js ***!
+ \**********************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ SearchParams: () => (/* binding */ SearchParams),
+/* harmony export */ Searcher: () => (/* binding */ Searcher),
+/* harmony export */ TextModelSearch: () => (/* binding */ TextModelSearch),
+/* harmony export */ createFindMatch: () => (/* binding */ createFindMatch),
+/* harmony export */ isMultilineRegexSource: () => (/* binding */ isMultilineRegexSource),
+/* harmony export */ isValidMatch: () => (/* binding */ isValidMatch)
+/* harmony export */ });
+/* harmony import */ var _base_common_strings_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../../base/common/strings.js */ "./node_modules/monaco-editor/esm/vs/base/common/strings.js");
+/* harmony import */ var _core_wordCharacterClassifier_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../core/wordCharacterClassifier.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/wordCharacterClassifier.js");
+/* harmony import */ var _core_position_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../core/position.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/position.js");
+/* harmony import */ var _core_range_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../core/range.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/range.js");
+/* harmony import */ var _model_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../model.js */ "./node_modules/monaco-editor/esm/vs/editor/common/model.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+
+
+
+
+const LIMIT_FIND_COUNT = 999;
+class SearchParams {
+ constructor(searchString, isRegex, matchCase, wordSeparators) {
+ this.searchString = searchString;
+ this.isRegex = isRegex;
+ this.matchCase = matchCase;
+ this.wordSeparators = wordSeparators;
+ }
+ parseSearchRequest() {
+ if (this.searchString === '') {
+ return null;
+ }
+ // Try to create a RegExp out of the params
+ let multiline;
+ if (this.isRegex) {
+ multiline = isMultilineRegexSource(this.searchString);
+ }
+ else {
+ multiline = (this.searchString.indexOf('\n') >= 0);
+ }
+ let regex = null;
+ try {
+ regex = _base_common_strings_js__WEBPACK_IMPORTED_MODULE_0__.createRegExp(this.searchString, this.isRegex, {
+ matchCase: this.matchCase,
+ wholeWord: false,
+ multiline: multiline,
+ global: true,
+ unicode: true
+ });
+ }
+ catch (err) {
+ return null;
+ }
+ if (!regex) {
+ return null;
+ }
+ let canUseSimpleSearch = (!this.isRegex && !multiline);
+ if (canUseSimpleSearch && this.searchString.toLowerCase() !== this.searchString.toUpperCase()) {
+ // casing might make a difference
+ canUseSimpleSearch = this.matchCase;
+ }
+ return new _model_js__WEBPACK_IMPORTED_MODULE_4__.SearchData(regex, this.wordSeparators ? (0,_core_wordCharacterClassifier_js__WEBPACK_IMPORTED_MODULE_1__.getMapForWordSeparators)(this.wordSeparators) : null, canUseSimpleSearch ? this.searchString : null);
+ }
+}
+function isMultilineRegexSource(searchString) {
+ if (!searchString || searchString.length === 0) {
+ return false;
+ }
+ for (let i = 0, len = searchString.length; i < len; i++) {
+ const chCode = searchString.charCodeAt(i);
+ if (chCode === 10 /* CharCode.LineFeed */) {
+ return true;
+ }
+ if (chCode === 92 /* CharCode.Backslash */) {
+ // move to next char
+ i++;
+ if (i >= len) {
+ // string ends with a \
+ break;
+ }
+ const nextChCode = searchString.charCodeAt(i);
+ if (nextChCode === 110 /* CharCode.n */ || nextChCode === 114 /* CharCode.r */ || nextChCode === 87 /* CharCode.W */) {
+ return true;
+ }
+ }
+ }
+ return false;
+}
+function createFindMatch(range, rawMatches, captureMatches) {
+ if (!captureMatches) {
+ return new _model_js__WEBPACK_IMPORTED_MODULE_4__.FindMatch(range, null);
+ }
+ const matches = [];
+ for (let i = 0, len = rawMatches.length; i < len; i++) {
+ matches[i] = rawMatches[i];
+ }
+ return new _model_js__WEBPACK_IMPORTED_MODULE_4__.FindMatch(range, matches);
+}
+class LineFeedCounter {
+ constructor(text) {
+ const lineFeedsOffsets = [];
+ let lineFeedsOffsetsLen = 0;
+ for (let i = 0, textLen = text.length; i < textLen; i++) {
+ if (text.charCodeAt(i) === 10 /* CharCode.LineFeed */) {
+ lineFeedsOffsets[lineFeedsOffsetsLen++] = i;
+ }
+ }
+ this._lineFeedsOffsets = lineFeedsOffsets;
+ }
+ findLineFeedCountBeforeOffset(offset) {
+ const lineFeedsOffsets = this._lineFeedsOffsets;
+ let min = 0;
+ let max = lineFeedsOffsets.length - 1;
+ if (max === -1) {
+ // no line feeds
+ return 0;
+ }
+ if (offset <= lineFeedsOffsets[0]) {
+ // before first line feed
+ return 0;
+ }
+ while (min < max) {
+ const mid = min + ((max - min) / 2 >> 0);
+ if (lineFeedsOffsets[mid] >= offset) {
+ max = mid - 1;
+ }
+ else {
+ if (lineFeedsOffsets[mid + 1] >= offset) {
+ // bingo!
+ min = mid;
+ max = mid;
+ }
+ else {
+ min = mid + 1;
+ }
+ }
+ }
+ return min + 1;
+ }
+}
+class TextModelSearch {
+ static findMatches(model, searchParams, searchRange, captureMatches, limitResultCount) {
+ const searchData = searchParams.parseSearchRequest();
+ if (!searchData) {
+ return [];
+ }
+ if (searchData.regex.multiline) {
+ return this._doFindMatchesMultiline(model, searchRange, new Searcher(searchData.wordSeparators, searchData.regex), captureMatches, limitResultCount);
+ }
+ return this._doFindMatchesLineByLine(model, searchRange, searchData, captureMatches, limitResultCount);
+ }
+ /**
+ * Multiline search always executes on the lines concatenated with \n.
+ * We must therefore compensate for the count of \n in case the model is CRLF
+ */
+ static _getMultilineMatchRange(model, deltaOffset, text, lfCounter, matchIndex, match0) {
+ let startOffset;
+ let lineFeedCountBeforeMatch = 0;
+ if (lfCounter) {
+ lineFeedCountBeforeMatch = lfCounter.findLineFeedCountBeforeOffset(matchIndex);
+ startOffset = deltaOffset + matchIndex + lineFeedCountBeforeMatch /* add as many \r as there were \n */;
+ }
+ else {
+ startOffset = deltaOffset + matchIndex;
+ }
+ let endOffset;
+ if (lfCounter) {
+ const lineFeedCountBeforeEndOfMatch = lfCounter.findLineFeedCountBeforeOffset(matchIndex + match0.length);
+ const lineFeedCountInMatch = lineFeedCountBeforeEndOfMatch - lineFeedCountBeforeMatch;
+ endOffset = startOffset + match0.length + lineFeedCountInMatch /* add as many \r as there were \n */;
+ }
+ else {
+ endOffset = startOffset + match0.length;
+ }
+ const startPosition = model.getPositionAt(startOffset);
+ const endPosition = model.getPositionAt(endOffset);
+ return new _core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range(startPosition.lineNumber, startPosition.column, endPosition.lineNumber, endPosition.column);
+ }
+ static _doFindMatchesMultiline(model, searchRange, searcher, captureMatches, limitResultCount) {
+ const deltaOffset = model.getOffsetAt(searchRange.getStartPosition());
+ // We always execute multiline search over the lines joined with \n
+ // This makes it that \n will match the EOL for both CRLF and LF models
+ // We compensate for offset errors in `_getMultilineMatchRange`
+ const text = model.getValueInRange(searchRange, 1 /* EndOfLinePreference.LF */);
+ const lfCounter = (model.getEOL() === '\r\n' ? new LineFeedCounter(text) : null);
+ const result = [];
+ let counter = 0;
+ let m;
+ searcher.reset(0);
+ while ((m = searcher.next(text))) {
+ result[counter++] = createFindMatch(this._getMultilineMatchRange(model, deltaOffset, text, lfCounter, m.index, m[0]), m, captureMatches);
+ if (counter >= limitResultCount) {
+ return result;
+ }
+ }
+ return result;
+ }
+ static _doFindMatchesLineByLine(model, searchRange, searchData, captureMatches, limitResultCount) {
+ const result = [];
+ let resultLen = 0;
+ // Early case for a search range that starts & stops on the same line number
+ if (searchRange.startLineNumber === searchRange.endLineNumber) {
+ const text = model.getLineContent(searchRange.startLineNumber).substring(searchRange.startColumn - 1, searchRange.endColumn - 1);
+ resultLen = this._findMatchesInLine(searchData, text, searchRange.startLineNumber, searchRange.startColumn - 1, resultLen, result, captureMatches, limitResultCount);
+ return result;
+ }
+ // Collect results from first line
+ const text = model.getLineContent(searchRange.startLineNumber).substring(searchRange.startColumn - 1);
+ resultLen = this._findMatchesInLine(searchData, text, searchRange.startLineNumber, searchRange.startColumn - 1, resultLen, result, captureMatches, limitResultCount);
+ // Collect results from middle lines
+ for (let lineNumber = searchRange.startLineNumber + 1; lineNumber < searchRange.endLineNumber && resultLen < limitResultCount; lineNumber++) {
+ resultLen = this._findMatchesInLine(searchData, model.getLineContent(lineNumber), lineNumber, 0, resultLen, result, captureMatches, limitResultCount);
+ }
+ // Collect results from last line
+ if (resultLen < limitResultCount) {
+ const text = model.getLineContent(searchRange.endLineNumber).substring(0, searchRange.endColumn - 1);
+ resultLen = this._findMatchesInLine(searchData, text, searchRange.endLineNumber, 0, resultLen, result, captureMatches, limitResultCount);
+ }
+ return result;
+ }
+ static _findMatchesInLine(searchData, text, lineNumber, deltaOffset, resultLen, result, captureMatches, limitResultCount) {
+ const wordSeparators = searchData.wordSeparators;
+ if (!captureMatches && searchData.simpleSearch) {
+ const searchString = searchData.simpleSearch;
+ const searchStringLen = searchString.length;
+ const textLength = text.length;
+ let lastMatchIndex = -searchStringLen;
+ while ((lastMatchIndex = text.indexOf(searchString, lastMatchIndex + searchStringLen)) !== -1) {
+ if (!wordSeparators || isValidMatch(wordSeparators, text, textLength, lastMatchIndex, searchStringLen)) {
+ result[resultLen++] = new _model_js__WEBPACK_IMPORTED_MODULE_4__.FindMatch(new _core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range(lineNumber, lastMatchIndex + 1 + deltaOffset, lineNumber, lastMatchIndex + 1 + searchStringLen + deltaOffset), null);
+ if (resultLen >= limitResultCount) {
+ return resultLen;
+ }
+ }
+ }
+ return resultLen;
+ }
+ const searcher = new Searcher(searchData.wordSeparators, searchData.regex);
+ let m;
+ // Reset regex to search from the beginning
+ searcher.reset(0);
+ do {
+ m = searcher.next(text);
+ if (m) {
+ result[resultLen++] = createFindMatch(new _core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range(lineNumber, m.index + 1 + deltaOffset, lineNumber, m.index + 1 + m[0].length + deltaOffset), m, captureMatches);
+ if (resultLen >= limitResultCount) {
+ return resultLen;
+ }
+ }
+ } while (m);
+ return resultLen;
+ }
+ static findNextMatch(model, searchParams, searchStart, captureMatches) {
+ const searchData = searchParams.parseSearchRequest();
+ if (!searchData) {
+ return null;
+ }
+ const searcher = new Searcher(searchData.wordSeparators, searchData.regex);
+ if (searchData.regex.multiline) {
+ return this._doFindNextMatchMultiline(model, searchStart, searcher, captureMatches);
+ }
+ return this._doFindNextMatchLineByLine(model, searchStart, searcher, captureMatches);
+ }
+ static _doFindNextMatchMultiline(model, searchStart, searcher, captureMatches) {
+ const searchTextStart = new _core_position_js__WEBPACK_IMPORTED_MODULE_2__.Position(searchStart.lineNumber, 1);
+ const deltaOffset = model.getOffsetAt(searchTextStart);
+ const lineCount = model.getLineCount();
+ // We always execute multiline search over the lines joined with \n
+ // This makes it that \n will match the EOL for both CRLF and LF models
+ // We compensate for offset errors in `_getMultilineMatchRange`
+ const text = model.getValueInRange(new _core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range(searchTextStart.lineNumber, searchTextStart.column, lineCount, model.getLineMaxColumn(lineCount)), 1 /* EndOfLinePreference.LF */);
+ const lfCounter = (model.getEOL() === '\r\n' ? new LineFeedCounter(text) : null);
+ searcher.reset(searchStart.column - 1);
+ const m = searcher.next(text);
+ if (m) {
+ return createFindMatch(this._getMultilineMatchRange(model, deltaOffset, text, lfCounter, m.index, m[0]), m, captureMatches);
+ }
+ if (searchStart.lineNumber !== 1 || searchStart.column !== 1) {
+ // Try again from the top
+ return this._doFindNextMatchMultiline(model, new _core_position_js__WEBPACK_IMPORTED_MODULE_2__.Position(1, 1), searcher, captureMatches);
+ }
+ return null;
+ }
+ static _doFindNextMatchLineByLine(model, searchStart, searcher, captureMatches) {
+ const lineCount = model.getLineCount();
+ const startLineNumber = searchStart.lineNumber;
+ // Look in first line
+ const text = model.getLineContent(startLineNumber);
+ const r = this._findFirstMatchInLine(searcher, text, startLineNumber, searchStart.column, captureMatches);
+ if (r) {
+ return r;
+ }
+ for (let i = 1; i <= lineCount; i++) {
+ const lineIndex = (startLineNumber + i - 1) % lineCount;
+ const text = model.getLineContent(lineIndex + 1);
+ const r = this._findFirstMatchInLine(searcher, text, lineIndex + 1, 1, captureMatches);
+ if (r) {
+ return r;
+ }
+ }
+ return null;
+ }
+ static _findFirstMatchInLine(searcher, text, lineNumber, fromColumn, captureMatches) {
+ // Set regex to search from column
+ searcher.reset(fromColumn - 1);
+ const m = searcher.next(text);
+ if (m) {
+ return createFindMatch(new _core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range(lineNumber, m.index + 1, lineNumber, m.index + 1 + m[0].length), m, captureMatches);
+ }
+ return null;
+ }
+ static findPreviousMatch(model, searchParams, searchStart, captureMatches) {
+ const searchData = searchParams.parseSearchRequest();
+ if (!searchData) {
+ return null;
+ }
+ const searcher = new Searcher(searchData.wordSeparators, searchData.regex);
+ if (searchData.regex.multiline) {
+ return this._doFindPreviousMatchMultiline(model, searchStart, searcher, captureMatches);
+ }
+ return this._doFindPreviousMatchLineByLine(model, searchStart, searcher, captureMatches);
+ }
+ static _doFindPreviousMatchMultiline(model, searchStart, searcher, captureMatches) {
+ const matches = this._doFindMatchesMultiline(model, new _core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range(1, 1, searchStart.lineNumber, searchStart.column), searcher, captureMatches, 10 * LIMIT_FIND_COUNT);
+ if (matches.length > 0) {
+ return matches[matches.length - 1];
+ }
+ const lineCount = model.getLineCount();
+ if (searchStart.lineNumber !== lineCount || searchStart.column !== model.getLineMaxColumn(lineCount)) {
+ // Try again with all content
+ return this._doFindPreviousMatchMultiline(model, new _core_position_js__WEBPACK_IMPORTED_MODULE_2__.Position(lineCount, model.getLineMaxColumn(lineCount)), searcher, captureMatches);
+ }
+ return null;
+ }
+ static _doFindPreviousMatchLineByLine(model, searchStart, searcher, captureMatches) {
+ const lineCount = model.getLineCount();
+ const startLineNumber = searchStart.lineNumber;
+ // Look in first line
+ const text = model.getLineContent(startLineNumber).substring(0, searchStart.column - 1);
+ const r = this._findLastMatchInLine(searcher, text, startLineNumber, captureMatches);
+ if (r) {
+ return r;
+ }
+ for (let i = 1; i <= lineCount; i++) {
+ const lineIndex = (lineCount + startLineNumber - i - 1) % lineCount;
+ const text = model.getLineContent(lineIndex + 1);
+ const r = this._findLastMatchInLine(searcher, text, lineIndex + 1, captureMatches);
+ if (r) {
+ return r;
+ }
+ }
+ return null;
+ }
+ static _findLastMatchInLine(searcher, text, lineNumber, captureMatches) {
+ let bestResult = null;
+ let m;
+ searcher.reset(0);
+ while ((m = searcher.next(text))) {
+ bestResult = createFindMatch(new _core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range(lineNumber, m.index + 1, lineNumber, m.index + 1 + m[0].length), m, captureMatches);
+ }
+ return bestResult;
+ }
+}
+function leftIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength) {
+ if (matchStartIndex === 0) {
+ // Match starts at start of string
+ return true;
+ }
+ const charBefore = text.charCodeAt(matchStartIndex - 1);
+ if (wordSeparators.get(charBefore) !== 0 /* WordCharacterClass.Regular */) {
+ // The character before the match is a word separator
+ return true;
+ }
+ if (charBefore === 13 /* CharCode.CarriageReturn */ || charBefore === 10 /* CharCode.LineFeed */) {
+ // The character before the match is line break or carriage return.
+ return true;
+ }
+ if (matchLength > 0) {
+ const firstCharInMatch = text.charCodeAt(matchStartIndex);
+ if (wordSeparators.get(firstCharInMatch) !== 0 /* WordCharacterClass.Regular */) {
+ // The first character inside the match is a word separator
+ return true;
+ }
+ }
+ return false;
+}
+function rightIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength) {
+ if (matchStartIndex + matchLength === textLength) {
+ // Match ends at end of string
+ return true;
+ }
+ const charAfter = text.charCodeAt(matchStartIndex + matchLength);
+ if (wordSeparators.get(charAfter) !== 0 /* WordCharacterClass.Regular */) {
+ // The character after the match is a word separator
+ return true;
+ }
+ if (charAfter === 13 /* CharCode.CarriageReturn */ || charAfter === 10 /* CharCode.LineFeed */) {
+ // The character after the match is line break or carriage return.
+ return true;
+ }
+ if (matchLength > 0) {
+ const lastCharInMatch = text.charCodeAt(matchStartIndex + matchLength - 1);
+ if (wordSeparators.get(lastCharInMatch) !== 0 /* WordCharacterClass.Regular */) {
+ // The last character in the match is a word separator
+ return true;
+ }
+ }
+ return false;
+}
+function isValidMatch(wordSeparators, text, textLength, matchStartIndex, matchLength) {
+ return (leftIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength)
+ && rightIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength));
+}
+class Searcher {
+ constructor(wordSeparators, searchRegex) {
+ this._wordSeparators = wordSeparators;
+ this._searchRegex = searchRegex;
+ this._prevMatchStartIndex = -1;
+ this._prevMatchLength = 0;
+ }
+ reset(lastIndex) {
+ this._searchRegex.lastIndex = lastIndex;
+ this._prevMatchStartIndex = -1;
+ this._prevMatchLength = 0;
+ }
+ next(text) {
+ const textLength = text.length;
+ let m;
+ do {
+ if (this._prevMatchStartIndex + this._prevMatchLength === textLength) {
+ // Reached the end of the line
+ return null;
+ }
+ m = this._searchRegex.exec(text);
+ if (!m) {
+ return null;
+ }
+ const matchStartIndex = m.index;
+ const matchLength = m[0].length;
+ if (matchStartIndex === this._prevMatchStartIndex && matchLength === this._prevMatchLength) {
+ if (matchLength === 0) {
+ // the search result is an empty string and won't advance `regex.lastIndex`, so `regex.exec` will stuck here
+ // we attempt to recover from that by advancing by two if surrogate pair found and by one otherwise
+ if (_base_common_strings_js__WEBPACK_IMPORTED_MODULE_0__.getNextCodePoint(text, textLength, this._searchRegex.lastIndex) > 0xFFFF) {
+ this._searchRegex.lastIndex += 2;
+ }
+ else {
+ this._searchRegex.lastIndex += 1;
+ }
+ continue;
+ }
+ // Exit early if the regex matches the same range twice
+ return null;
+ }
+ this._prevMatchStartIndex = matchStartIndex;
+ this._prevMatchLength = matchLength;
+ if (!this._wordSeparators || isValidMatch(this._wordSeparators, text, textLength, matchStartIndex, matchLength)) {
+ return m;
+ }
+ } while (m);
+ return null;
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/services/editorBaseApi.js":
+/*!***********************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/services/editorBaseApi.js ***!
+ \***********************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ KeyMod: () => (/* binding */ KeyMod),
+/* harmony export */ createMonacoBaseAPI: () => (/* binding */ createMonacoBaseAPI)
+/* harmony export */ });
+/* harmony import */ var _base_common_cancellation_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../../base/common/cancellation.js */ "./node_modules/monaco-editor/esm/vs/base/common/cancellation.js");
+/* harmony import */ var _base_common_event_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../../base/common/event.js */ "./node_modules/monaco-editor/esm/vs/base/common/event.js");
+/* harmony import */ var _base_common_keyCodes_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../../base/common/keyCodes.js */ "./node_modules/monaco-editor/esm/vs/base/common/keyCodes.js");
+/* harmony import */ var _base_common_uri_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../../../base/common/uri.js */ "./node_modules/monaco-editor/esm/vs/base/common/uri.js");
+/* harmony import */ var _core_position_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../core/position.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/position.js");
+/* harmony import */ var _core_range_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../core/range.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/range.js");
+/* harmony import */ var _core_selection_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../core/selection.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/selection.js");
+/* harmony import */ var _languages_js__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../languages.js */ "./node_modules/monaco-editor/esm/vs/editor/common/languages.js");
+/* harmony import */ var _standalone_standaloneEnums_js__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../standalone/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.
+ *--------------------------------------------------------------------------------------------*/
+
+
+
+
+
+
+
+
+
+class KeyMod {
+ static chord(firstPart, secondPart) {
+ return (0,_base_common_keyCodes_js__WEBPACK_IMPORTED_MODULE_2__.KeyChord)(firstPart, secondPart);
+ }
+}
+KeyMod.CtrlCmd = 2048 /* ConstKeyMod.CtrlCmd */;
+KeyMod.Shift = 1024 /* ConstKeyMod.Shift */;
+KeyMod.Alt = 512 /* ConstKeyMod.Alt */;
+KeyMod.WinCtrl = 256 /* ConstKeyMod.WinCtrl */;
+function createMonacoBaseAPI() {
+ return {
+ editor: undefined, // undefined override expected here
+ languages: undefined, // undefined override expected here
+ CancellationTokenSource: _base_common_cancellation_js__WEBPACK_IMPORTED_MODULE_0__.CancellationTokenSource,
+ Emitter: _base_common_event_js__WEBPACK_IMPORTED_MODULE_1__.Emitter,
+ KeyCode: _standalone_standaloneEnums_js__WEBPACK_IMPORTED_MODULE_8__.KeyCode,
+ KeyMod: KeyMod,
+ Position: _core_position_js__WEBPACK_IMPORTED_MODULE_4__.Position,
+ Range: _core_range_js__WEBPACK_IMPORTED_MODULE_5__.Range,
+ Selection: _core_selection_js__WEBPACK_IMPORTED_MODULE_6__.Selection,
+ SelectionDirection: _standalone_standaloneEnums_js__WEBPACK_IMPORTED_MODULE_8__.SelectionDirection,
+ MarkerSeverity: _standalone_standaloneEnums_js__WEBPACK_IMPORTED_MODULE_8__.MarkerSeverity,
+ MarkerTag: _standalone_standaloneEnums_js__WEBPACK_IMPORTED_MODULE_8__.MarkerTag,
+ Uri: _base_common_uri_js__WEBPACK_IMPORTED_MODULE_3__.URI,
+ Token: _languages_js__WEBPACK_IMPORTED_MODULE_7__.Token
+ };
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/services/editorSimpleWorker.js":
+/*!****************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/services/editorSimpleWorker.js ***!
+ \****************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ EditorSimpleWorker: () => (/* binding */ EditorSimpleWorker),
+/* harmony export */ create: () => (/* binding */ create)
+/* harmony export */ });
+/* 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_uri_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../../base/common/uri.js */ "./node_modules/monaco-editor/esm/vs/base/common/uri.js");
+/* harmony import */ var _core_position_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../core/position.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/position.js");
+/* harmony import */ var _core_range_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../core/range.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/range.js");
+/* harmony import */ var _model_mirrorTextModel_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../model/mirrorTextModel.js */ "./node_modules/monaco-editor/esm/vs/editor/common/model/mirrorTextModel.js");
+/* harmony import */ var _core_wordHelper_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../core/wordHelper.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/wordHelper.js");
+/* harmony import */ var _languages_linkComputer_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../languages/linkComputer.js */ "./node_modules/monaco-editor/esm/vs/editor/common/languages/linkComputer.js");
+/* harmony import */ var _languages_supports_inplaceReplaceSupport_js__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../languages/supports/inplaceReplaceSupport.js */ "./node_modules/monaco-editor/esm/vs/editor/common/languages/supports/inplaceReplaceSupport.js");
+/* harmony import */ var _editorBaseApi_js__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./editorBaseApi.js */ "./node_modules/monaco-editor/esm/vs/editor/common/services/editorBaseApi.js");
+/* harmony import */ var _base_common_stopwatch_js__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../../../base/common/stopwatch.js */ "./node_modules/monaco-editor/esm/vs/base/common/stopwatch.js");
+/* harmony import */ var _unicodeTextModelHighlighter_js__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./unicodeTextModelHighlighter.js */ "./node_modules/monaco-editor/esm/vs/editor/common/services/unicodeTextModelHighlighter.js");
+/* harmony import */ var _diff_linesDiffComputers_js__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../diff/linesDiffComputers.js */ "./node_modules/monaco-editor/esm/vs/editor/common/diff/linesDiffComputers.js");
+/* harmony import */ var _base_common_objects_js__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ../../../base/common/objects.js */ "./node_modules/monaco-editor/esm/vs/base/common/objects.js");
+/* harmony import */ var _languages_defaultDocumentColorsComputer_js__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ../languages/defaultDocumentColorsComputer.js */ "./node_modules/monaco-editor/esm/vs/editor/common/languages/defaultDocumentColorsComputer.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+/**
+ * @internal
+ */
+class MirrorModel extends _model_mirrorTextModel_js__WEBPACK_IMPORTED_MODULE_4__.MirrorTextModel {
+ get uri() {
+ return this._uri;
+ }
+ get eol() {
+ return this._eol;
+ }
+ getValue() {
+ return this.getText();
+ }
+ findMatches(regex) {
+ const matches = [];
+ for (let i = 0; i < this._lines.length; i++) {
+ const line = this._lines[i];
+ const offsetToAdd = this.offsetAt(new _core_position_js__WEBPACK_IMPORTED_MODULE_2__.Position(i + 1, 1));
+ const iteratorOverMatches = line.matchAll(regex);
+ for (const match of iteratorOverMatches) {
+ if (match.index || match.index === 0) {
+ match.index = match.index + offsetToAdd;
+ }
+ matches.push(match);
+ }
+ }
+ return matches;
+ }
+ getLinesContent() {
+ return this._lines.slice(0);
+ }
+ getLineCount() {
+ return this._lines.length;
+ }
+ getLineContent(lineNumber) {
+ return this._lines[lineNumber - 1];
+ }
+ getWordAtPosition(position, wordDefinition) {
+ const wordAtText = (0,_core_wordHelper_js__WEBPACK_IMPORTED_MODULE_5__.getWordAtText)(position.column, (0,_core_wordHelper_js__WEBPACK_IMPORTED_MODULE_5__.ensureValidWordDefinition)(wordDefinition), this._lines[position.lineNumber - 1], 0);
+ if (wordAtText) {
+ return new _core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range(position.lineNumber, wordAtText.startColumn, position.lineNumber, wordAtText.endColumn);
+ }
+ return null;
+ }
+ words(wordDefinition) {
+ const lines = this._lines;
+ const wordenize = this._wordenize.bind(this);
+ let lineNumber = 0;
+ let lineText = '';
+ let wordRangesIdx = 0;
+ let wordRanges = [];
+ return {
+ *[Symbol.iterator]() {
+ while (true) {
+ if (wordRangesIdx < wordRanges.length) {
+ const value = lineText.substring(wordRanges[wordRangesIdx].start, wordRanges[wordRangesIdx].end);
+ wordRangesIdx += 1;
+ yield value;
+ }
+ else {
+ if (lineNumber < lines.length) {
+ lineText = lines[lineNumber];
+ wordRanges = wordenize(lineText, wordDefinition);
+ wordRangesIdx = 0;
+ lineNumber += 1;
+ }
+ else {
+ break;
+ }
+ }
+ }
+ }
+ };
+ }
+ getLineWords(lineNumber, wordDefinition) {
+ const content = this._lines[lineNumber - 1];
+ const ranges = this._wordenize(content, wordDefinition);
+ const words = [];
+ for (const range of ranges) {
+ words.push({
+ word: content.substring(range.start, range.end),
+ startColumn: range.start + 1,
+ endColumn: range.end + 1
+ });
+ }
+ return words;
+ }
+ _wordenize(content, wordDefinition) {
+ const result = [];
+ let 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;
+ }
+ getValueInRange(range) {
+ range = this._validateRange(range);
+ if (range.startLineNumber === range.endLineNumber) {
+ return this._lines[range.startLineNumber - 1].substring(range.startColumn - 1, range.endColumn - 1);
+ }
+ const lineEnding = this._eol;
+ const startLineIndex = range.startLineNumber - 1;
+ const endLineIndex = range.endLineNumber - 1;
+ const resultLines = [];
+ resultLines.push(this._lines[startLineIndex].substring(range.startColumn - 1));
+ for (let 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);
+ }
+ offsetAt(position) {
+ position = this._validatePosition(position);
+ this._ensureLineStarts();
+ return this._lineStarts.getPrefixSum(position.lineNumber - 2) + (position.column - 1);
+ }
+ positionAt(offset) {
+ offset = Math.floor(offset);
+ offset = Math.max(0, offset);
+ this._ensureLineStarts();
+ const out = this._lineStarts.getIndexOf(offset);
+ const lineLength = this._lines[out.index].length;
+ // Ensure we return a valid position
+ return {
+ lineNumber: 1 + out.index,
+ column: 1 + Math.min(out.remainder, lineLength)
+ };
+ }
+ _validateRange(range) {
+ const start = this._validatePosition({ lineNumber: range.startLineNumber, column: range.startColumn });
+ const 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;
+ }
+ _validatePosition(position) {
+ if (!_core_position_js__WEBPACK_IMPORTED_MODULE_2__.Position.isIPosition(position)) {
+ throw new Error('bad position');
+ }
+ let { lineNumber, column } = position;
+ let 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 {
+ const 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, column };
+ }
+ }
+}
+/**
+ * @internal
+ */
+class EditorSimpleWorker {
+ constructor(host, foreignModuleFactory) {
+ this._host = host;
+ this._models = Object.create(null);
+ this._foreignModuleFactory = foreignModuleFactory;
+ this._foreignModule = null;
+ }
+ dispose() {
+ this._models = Object.create(null);
+ }
+ _getModel(uri) {
+ return this._models[uri];
+ }
+ _getModels() {
+ const all = [];
+ Object.keys(this._models).forEach((key) => all.push(this._models[key]));
+ return all;
+ }
+ acceptNewModel(data) {
+ this._models[data.url] = new MirrorModel(_base_common_uri_js__WEBPACK_IMPORTED_MODULE_1__.URI.parse(data.url), data.lines, data.EOL, data.versionId);
+ }
+ acceptModelChanged(strURL, e) {
+ if (!this._models[strURL]) {
+ return;
+ }
+ const model = this._models[strURL];
+ model.onEvents(e);
+ }
+ acceptRemovedModel(strURL) {
+ if (!this._models[strURL]) {
+ return;
+ }
+ delete this._models[strURL];
+ }
+ async computeUnicodeHighlights(url, options, range) {
+ const model = this._getModel(url);
+ if (!model) {
+ return { ranges: [], hasMore: false, ambiguousCharacterCount: 0, invisibleCharacterCount: 0, nonBasicAsciiCharacterCount: 0 };
+ }
+ return _unicodeTextModelHighlighter_js__WEBPACK_IMPORTED_MODULE_10__.UnicodeTextModelHighlighter.computeUnicodeHighlights(model, options, range);
+ }
+ // ---- BEGIN diff --------------------------------------------------------------------------
+ async computeDiff(originalUrl, modifiedUrl, options, algorithm) {
+ const original = this._getModel(originalUrl);
+ const modified = this._getModel(modifiedUrl);
+ if (!original || !modified) {
+ return null;
+ }
+ return EditorSimpleWorker.computeDiff(original, modified, options, algorithm);
+ }
+ static computeDiff(originalTextModel, modifiedTextModel, options, algorithm) {
+ const diffAlgorithm = algorithm === 'advanced' ? _diff_linesDiffComputers_js__WEBPACK_IMPORTED_MODULE_11__.linesDiffComputers.getDefault() : _diff_linesDiffComputers_js__WEBPACK_IMPORTED_MODULE_11__.linesDiffComputers.getLegacy();
+ const originalLines = originalTextModel.getLinesContent();
+ const modifiedLines = modifiedTextModel.getLinesContent();
+ const result = diffAlgorithm.computeDiff(originalLines, modifiedLines, options);
+ const identical = (result.changes.length > 0 ? false : this._modelsAreIdentical(originalTextModel, modifiedTextModel));
+ function getLineChanges(changes) {
+ return changes.map(m => {
+ var _a;
+ return ([m.original.startLineNumber, m.original.endLineNumberExclusive, m.modified.startLineNumber, m.modified.endLineNumberExclusive, (_a = m.innerChanges) === null || _a === void 0 ? void 0 : _a.map(m => [
+ m.originalRange.startLineNumber,
+ m.originalRange.startColumn,
+ m.originalRange.endLineNumber,
+ m.originalRange.endColumn,
+ m.modifiedRange.startLineNumber,
+ m.modifiedRange.startColumn,
+ m.modifiedRange.endLineNumber,
+ m.modifiedRange.endColumn,
+ ])]);
+ });
+ }
+ return {
+ identical,
+ quitEarly: result.hitTimeout,
+ changes: getLineChanges(result.changes),
+ moves: result.moves.map(m => ([
+ m.lineRangeMapping.original.startLineNumber,
+ m.lineRangeMapping.original.endLineNumberExclusive,
+ m.lineRangeMapping.modified.startLineNumber,
+ m.lineRangeMapping.modified.endLineNumberExclusive,
+ getLineChanges(m.changes)
+ ])),
+ };
+ }
+ static _modelsAreIdentical(original, modified) {
+ const originalLineCount = original.getLineCount();
+ const modifiedLineCount = modified.getLineCount();
+ if (originalLineCount !== modifiedLineCount) {
+ return false;
+ }
+ for (let line = 1; line <= originalLineCount; line++) {
+ const originalLine = original.getLineContent(line);
+ const modifiedLine = modified.getLineContent(line);
+ if (originalLine !== modifiedLine) {
+ return false;
+ }
+ }
+ return true;
+ }
+ async computeMoreMinimalEdits(modelUrl, edits, pretty) {
+ const model = this._getModel(modelUrl);
+ if (!model) {
+ return edits;
+ }
+ const result = [];
+ let lastEol = undefined;
+ edits = edits.slice(0).sort((a, b) => {
+ if (a.range && b.range) {
+ return _core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range.compareRangesUsingStarts(a.range, b.range);
+ }
+ // eol only changes should go to the end
+ const aRng = a.range ? 0 : 1;
+ const bRng = b.range ? 0 : 1;
+ return aRng - bRng;
+ });
+ // merge adjacent edits
+ let writeIndex = 0;
+ for (let readIndex = 1; readIndex < edits.length; readIndex++) {
+ if (_core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range.getEndPosition(edits[writeIndex].range).equals(_core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range.getStartPosition(edits[readIndex].range))) {
+ edits[writeIndex].range = _core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range.fromPositions(_core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range.getStartPosition(edits[writeIndex].range), _core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range.getEndPosition(edits[readIndex].range));
+ edits[writeIndex].text += edits[readIndex].text;
+ }
+ else {
+ writeIndex++;
+ edits[writeIndex] = edits[readIndex];
+ }
+ }
+ edits.length = writeIndex + 1;
+ for (let { range, text, eol } of edits) {
+ if (typeof eol === 'number') {
+ lastEol = eol;
+ }
+ if (_core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range.isEmpty(range) && !text) {
+ // empty change
+ continue;
+ }
+ const 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, text });
+ continue;
+ }
+ // compute diff between original and edit.text
+ const changes = (0,_base_common_diff_diff_js__WEBPACK_IMPORTED_MODULE_0__.stringDiff)(original, text, pretty);
+ const editOffset = model.offsetAt(_core_range_js__WEBPACK_IMPORTED_MODULE_3__.Range.lift(range).getStartPosition());
+ for (const change of changes) {
+ const start = model.positionAt(editOffset + change.originalStart);
+ const end = model.positionAt(editOffset + change.originalStart + change.originalLength);
+ const 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 result;
+ }
+ // ---- END minimal edits ---------------------------------------------------------------
+ async computeLinks(modelUrl) {
+ const model = this._getModel(modelUrl);
+ if (!model) {
+ return null;
+ }
+ return (0,_languages_linkComputer_js__WEBPACK_IMPORTED_MODULE_6__.computeLinks)(model);
+ }
+ // --- BEGIN default document colors -----------------------------------------------------------
+ async computeDefaultDocumentColors(modelUrl) {
+ const model = this._getModel(modelUrl);
+ if (!model) {
+ return null;
+ }
+ return (0,_languages_defaultDocumentColorsComputer_js__WEBPACK_IMPORTED_MODULE_13__.computeDefaultDocumentColors)(model);
+ }
+ async textualSuggest(modelUrls, leadingWord, wordDef, wordDefFlags) {
+ const sw = new _base_common_stopwatch_js__WEBPACK_IMPORTED_MODULE_9__.StopWatch();
+ const wordDefRegExp = new RegExp(wordDef, wordDefFlags);
+ const seen = new Set();
+ outer: for (const url of modelUrls) {
+ const model = this._getModel(url);
+ if (!model) {
+ continue;
+ }
+ for (const word of model.words(wordDefRegExp)) {
+ if (word === leadingWord || !isNaN(Number(word))) {
+ continue;
+ }
+ seen.add(word);
+ if (seen.size > EditorSimpleWorker._suggestionsLimit) {
+ break outer;
+ }
+ }
+ }
+ return { words: Array.from(seen), duration: sw.elapsed() };
+ }
+ // ---- END suggest --------------------------------------------------------------------------
+ //#region -- word ranges --
+ async computeWordRanges(modelUrl, range, wordDef, wordDefFlags) {
+ const model = this._getModel(modelUrl);
+ if (!model) {
+ return Object.create(null);
+ }
+ const wordDefRegExp = new RegExp(wordDef, wordDefFlags);
+ const result = Object.create(null);
+ for (let line = range.startLineNumber; line < range.endLineNumber; line++) {
+ const words = model.getLineWords(line, wordDefRegExp);
+ for (const word of words) {
+ if (!isNaN(Number(word.word))) {
+ continue;
+ }
+ let array = result[word.word];
+ if (!array) {
+ array = [];
+ result[word.word] = array;
+ }
+ array.push({
+ startLineNumber: line,
+ startColumn: word.startColumn,
+ endLineNumber: line,
+ endColumn: word.endColumn
+ });
+ }
+ }
+ return result;
+ }
+ //#endregion
+ async navigateValueSet(modelUrl, range, up, wordDef, wordDefFlags) {
+ const model = this._getModel(modelUrl);
+ if (!model) {
+ return null;
+ }
+ const wordDefRegExp = new RegExp(wordDef, wordDefFlags);
+ if (range.startColumn === range.endColumn) {
+ range = {
+ startLineNumber: range.startLineNumber,
+ startColumn: range.startColumn,
+ endLineNumber: range.endLineNumber,
+ endColumn: range.endColumn + 1
+ };
+ }
+ const selectionText = model.getValueInRange(range);
+ const wordRange = model.getWordAtPosition({ lineNumber: range.startLineNumber, column: range.startColumn }, wordDefRegExp);
+ if (!wordRange) {
+ return null;
+ }
+ const word = model.getValueInRange(wordRange);
+ const result = _languages_supports_inplaceReplaceSupport_js__WEBPACK_IMPORTED_MODULE_7__.BasicInplaceReplace.INSTANCE.navigateValueSet(range, selectionText, wordRange, word, up);
+ return result;
+ }
+ // ---- BEGIN foreign module support --------------------------------------------------------------------------
+ loadForeignModule(moduleId, createData, foreignHostMethods) {
+ const proxyMethodRequest = (method, args) => {
+ return this._host.fhr(method, args);
+ };
+ const foreignHost = (0,_base_common_objects_js__WEBPACK_IMPORTED_MODULE_12__.createProxyObject)(foreignHostMethods, proxyMethodRequest);
+ const ctx = {
+ host: foreignHost,
+ getMirrorModels: () => {
+ return this._getModels();
+ }
+ };
+ if (this._foreignModuleFactory) {
+ this._foreignModule = this._foreignModuleFactory(ctx, createData);
+ // static foreing module
+ return Promise.resolve((0,_base_common_objects_js__WEBPACK_IMPORTED_MODULE_12__.getAllMethodNames)(this._foreignModule));
+ }
+ // ESM-comment-begin
+ // return new Promise((resolve, reject) => {
+ // require([moduleId], (foreignModule: { create: IForeignModuleFactory }) => {
+ // this._foreignModule = foreignModule.create(ctx, createData);
+ //
+ // resolve(getAllMethodNames(this._foreignModule));
+ //
+ // }, reject);
+ // });
+ // ESM-comment-end
+ // ESM-uncomment-begin
+ return Promise.reject(new Error(`Unexpected usage`));
+ // ESM-uncomment-end
+ }
+ // foreign method request
+ fmr(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;
+/**
+ * Called on the worker side
+ * @internal
+ */
+function create(host) {
+ return new EditorSimpleWorker(host, null);
+}
+if (typeof importScripts === 'function') {
+ // Running in a web worker
+ globalThis.monaco = (0,_editorBaseApi_js__WEBPACK_IMPORTED_MODULE_8__.createMonacoBaseAPI)();
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/services/unicodeTextModelHighlighter.js":
+/*!*************************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/services/unicodeTextModelHighlighter.js ***!
+ \*************************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ UnicodeTextModelHighlighter: () => (/* binding */ UnicodeTextModelHighlighter)
+/* harmony export */ });
+/* harmony import */ var _core_range_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../core/range.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/range.js");
+/* harmony import */ var _model_textModelSearch_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../model/textModelSearch.js */ "./node_modules/monaco-editor/esm/vs/editor/common/model/textModelSearch.js");
+/* harmony import */ var _base_common_strings_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../../base/common/strings.js */ "./node_modules/monaco-editor/esm/vs/base/common/strings.js");
+/* harmony import */ var _base_common_assert_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../../../base/common/assert.js */ "./node_modules/monaco-editor/esm/vs/base/common/assert.js");
+/* harmony import */ var _core_wordHelper_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../core/wordHelper.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/wordHelper.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+
+
+
+
+class UnicodeTextModelHighlighter {
+ static computeUnicodeHighlights(model, options, range) {
+ const startLine = range ? range.startLineNumber : 1;
+ const endLine = range ? range.endLineNumber : model.getLineCount();
+ const codePointHighlighter = new CodePointHighlighter(options);
+ const candidates = codePointHighlighter.getCandidateCodePoints();
+ let regex;
+ if (candidates === 'allNonBasicAscii') {
+ regex = new RegExp('[^\\t\\n\\r\\x20-\\x7E]', 'g');
+ }
+ else {
+ regex = new RegExp(`${buildRegExpCharClassExpr(Array.from(candidates))}`, 'g');
+ }
+ const searcher = new _model_textModelSearch_js__WEBPACK_IMPORTED_MODULE_1__.Searcher(null, regex);
+ const ranges = [];
+ let hasMore = false;
+ let m;
+ let ambiguousCharacterCount = 0;
+ let invisibleCharacterCount = 0;
+ let nonBasicAsciiCharacterCount = 0;
+ forLoop: for (let lineNumber = startLine, lineCount = endLine; lineNumber <= lineCount; lineNumber++) {
+ const lineContent = model.getLineContent(lineNumber);
+ const lineLength = lineContent.length;
+ // Reset regex to search from the beginning
+ searcher.reset(0);
+ do {
+ m = searcher.next(lineContent);
+ if (m) {
+ let startIndex = m.index;
+ let endIndex = m.index + m[0].length;
+ // Extend range to entire code point
+ if (startIndex > 0) {
+ const charCodeBefore = lineContent.charCodeAt(startIndex - 1);
+ if (_base_common_strings_js__WEBPACK_IMPORTED_MODULE_2__.isHighSurrogate(charCodeBefore)) {
+ startIndex--;
+ }
+ }
+ if (endIndex + 1 < lineLength) {
+ const charCodeBefore = lineContent.charCodeAt(endIndex - 1);
+ if (_base_common_strings_js__WEBPACK_IMPORTED_MODULE_2__.isHighSurrogate(charCodeBefore)) {
+ endIndex++;
+ }
+ }
+ const str = lineContent.substring(startIndex, endIndex);
+ let word = (0,_core_wordHelper_js__WEBPACK_IMPORTED_MODULE_4__.getWordAtText)(startIndex + 1, _core_wordHelper_js__WEBPACK_IMPORTED_MODULE_4__.DEFAULT_WORD_REGEXP, lineContent, 0);
+ if (word && word.endColumn <= startIndex + 1) {
+ // The word does not include the problematic character, ignore the word
+ word = null;
+ }
+ const highlightReason = codePointHighlighter.shouldHighlightNonBasicASCII(str, word ? word.word : null);
+ if (highlightReason !== 0 /* SimpleHighlightReason.None */) {
+ if (highlightReason === 3 /* SimpleHighlightReason.Ambiguous */) {
+ ambiguousCharacterCount++;
+ }
+ else if (highlightReason === 2 /* SimpleHighlightReason.Invisible */) {
+ invisibleCharacterCount++;
+ }
+ else if (highlightReason === 1 /* SimpleHighlightReason.NonBasicASCII */) {
+ nonBasicAsciiCharacterCount++;
+ }
+ else {
+ (0,_base_common_assert_js__WEBPACK_IMPORTED_MODULE_3__.assertNever)(highlightReason);
+ }
+ const MAX_RESULT_LENGTH = 1000;
+ if (ranges.length >= MAX_RESULT_LENGTH) {
+ hasMore = true;
+ break forLoop;
+ }
+ ranges.push(new _core_range_js__WEBPACK_IMPORTED_MODULE_0__.Range(lineNumber, startIndex + 1, lineNumber, endIndex + 1));
+ }
+ }
+ } while (m);
+ }
+ return {
+ ranges,
+ hasMore,
+ ambiguousCharacterCount,
+ invisibleCharacterCount,
+ nonBasicAsciiCharacterCount
+ };
+ }
+ static computeUnicodeHighlightReason(char, options) {
+ const codePointHighlighter = new CodePointHighlighter(options);
+ const reason = codePointHighlighter.shouldHighlightNonBasicASCII(char, null);
+ switch (reason) {
+ case 0 /* SimpleHighlightReason.None */:
+ return null;
+ case 2 /* SimpleHighlightReason.Invisible */:
+ return { kind: 1 /* UnicodeHighlighterReasonKind.Invisible */ };
+ case 3 /* SimpleHighlightReason.Ambiguous */: {
+ const codePoint = char.codePointAt(0);
+ const primaryConfusable = codePointHighlighter.ambiguousCharacters.getPrimaryConfusable(codePoint);
+ const notAmbiguousInLocales = _base_common_strings_js__WEBPACK_IMPORTED_MODULE_2__.AmbiguousCharacters.getLocales().filter((l) => !_base_common_strings_js__WEBPACK_IMPORTED_MODULE_2__.AmbiguousCharacters.getInstance(new Set([...options.allowedLocales, l])).isAmbiguous(codePoint));
+ return { kind: 0 /* UnicodeHighlighterReasonKind.Ambiguous */, confusableWith: String.fromCodePoint(primaryConfusable), notAmbiguousInLocales };
+ }
+ case 1 /* SimpleHighlightReason.NonBasicASCII */:
+ return { kind: 2 /* UnicodeHighlighterReasonKind.NonBasicAscii */ };
+ }
+ }
+}
+function buildRegExpCharClassExpr(codePoints, flags) {
+ const src = `[${_base_common_strings_js__WEBPACK_IMPORTED_MODULE_2__.escapeRegExpCharacters(codePoints.map((i) => String.fromCodePoint(i)).join(''))}]`;
+ return src;
+}
+class CodePointHighlighter {
+ constructor(options) {
+ this.options = options;
+ this.allowedCodePoints = new Set(options.allowedCodePoints);
+ this.ambiguousCharacters = _base_common_strings_js__WEBPACK_IMPORTED_MODULE_2__.AmbiguousCharacters.getInstance(new Set(options.allowedLocales));
+ }
+ getCandidateCodePoints() {
+ if (this.options.nonBasicASCII) {
+ return 'allNonBasicAscii';
+ }
+ const set = new Set();
+ if (this.options.invisibleCharacters) {
+ for (const cp of _base_common_strings_js__WEBPACK_IMPORTED_MODULE_2__.InvisibleCharacters.codePoints) {
+ if (!isAllowedInvisibleCharacter(String.fromCodePoint(cp))) {
+ set.add(cp);
+ }
+ }
+ }
+ if (this.options.ambiguousCharacters) {
+ for (const cp of this.ambiguousCharacters.getConfusableCodePoints()) {
+ set.add(cp);
+ }
+ }
+ for (const cp of this.allowedCodePoints) {
+ set.delete(cp);
+ }
+ return set;
+ }
+ shouldHighlightNonBasicASCII(character, wordContext) {
+ const codePoint = character.codePointAt(0);
+ if (this.allowedCodePoints.has(codePoint)) {
+ return 0 /* SimpleHighlightReason.None */;
+ }
+ if (this.options.nonBasicASCII) {
+ return 1 /* SimpleHighlightReason.NonBasicASCII */;
+ }
+ let hasBasicASCIICharacters = false;
+ let hasNonConfusableNonBasicAsciiCharacter = false;
+ if (wordContext) {
+ for (const char of wordContext) {
+ const codePoint = char.codePointAt(0);
+ const isBasicASCII = _base_common_strings_js__WEBPACK_IMPORTED_MODULE_2__.isBasicASCII(char);
+ hasBasicASCIICharacters = hasBasicASCIICharacters || isBasicASCII;
+ if (!isBasicASCII &&
+ !this.ambiguousCharacters.isAmbiguous(codePoint) &&
+ !_base_common_strings_js__WEBPACK_IMPORTED_MODULE_2__.InvisibleCharacters.isInvisibleCharacter(codePoint)) {
+ hasNonConfusableNonBasicAsciiCharacter = true;
+ }
+ }
+ }
+ if (
+ /* Don't allow mixing weird looking characters with ASCII */ !hasBasicASCIICharacters &&
+ /* Is there an obviously weird looking character? */ hasNonConfusableNonBasicAsciiCharacter) {
+ return 0 /* SimpleHighlightReason.None */;
+ }
+ if (this.options.invisibleCharacters) {
+ // TODO check for emojis
+ if (!isAllowedInvisibleCharacter(character) && _base_common_strings_js__WEBPACK_IMPORTED_MODULE_2__.InvisibleCharacters.isInvisibleCharacter(codePoint)) {
+ return 2 /* SimpleHighlightReason.Invisible */;
+ }
+ }
+ if (this.options.ambiguousCharacters) {
+ if (this.ambiguousCharacters.isAmbiguous(codePoint)) {
+ return 3 /* SimpleHighlightReason.Ambiguous */;
+ }
+ }
+ return 0 /* SimpleHighlightReason.None */;
+ }
+}
+function isAllowedInvisibleCharacter(character) {
+ return character === ' ' || character === '\n' || character === '\t';
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/standalone/standaloneEnums.js":
+/*!***************************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/standalone/standaloneEnums.js ***!
+ \***************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ AccessibilitySupport: () => (/* binding */ AccessibilitySupport),
+/* harmony export */ CodeActionTriggerType: () => (/* binding */ CodeActionTriggerType),
+/* harmony export */ CompletionItemInsertTextRule: () => (/* binding */ CompletionItemInsertTextRule),
+/* harmony export */ CompletionItemKind: () => (/* binding */ CompletionItemKind),
+/* harmony export */ CompletionItemTag: () => (/* binding */ CompletionItemTag),
+/* harmony export */ CompletionTriggerKind: () => (/* binding */ CompletionTriggerKind),
+/* harmony export */ ContentWidgetPositionPreference: () => (/* binding */ ContentWidgetPositionPreference),
+/* harmony export */ CursorChangeReason: () => (/* binding */ CursorChangeReason),
+/* harmony export */ DefaultEndOfLine: () => (/* binding */ DefaultEndOfLine),
+/* harmony export */ DocumentHighlightKind: () => (/* binding */ DocumentHighlightKind),
+/* harmony export */ EditorAutoIndentStrategy: () => (/* binding */ EditorAutoIndentStrategy),
+/* harmony export */ EditorOption: () => (/* binding */ EditorOption),
+/* harmony export */ EndOfLinePreference: () => (/* binding */ EndOfLinePreference),
+/* harmony export */ EndOfLineSequence: () => (/* binding */ EndOfLineSequence),
+/* harmony export */ GlyphMarginLane: () => (/* binding */ GlyphMarginLane),
+/* harmony export */ IndentAction: () => (/* binding */ IndentAction),
+/* harmony export */ InjectedTextCursorStops: () => (/* binding */ InjectedTextCursorStops),
+/* harmony export */ InlayHintKind: () => (/* binding */ InlayHintKind),
+/* harmony export */ InlineCompletionTriggerKind: () => (/* binding */ InlineCompletionTriggerKind),
+/* harmony export */ KeyCode: () => (/* binding */ KeyCode),
+/* harmony export */ MarkerSeverity: () => (/* binding */ MarkerSeverity),
+/* harmony export */ MarkerTag: () => (/* binding */ MarkerTag),
+/* harmony export */ MinimapPosition: () => (/* binding */ MinimapPosition),
+/* harmony export */ MouseTargetType: () => (/* binding */ MouseTargetType),
+/* harmony export */ OverlayWidgetPositionPreference: () => (/* binding */ OverlayWidgetPositionPreference),
+/* harmony export */ OverviewRulerLane: () => (/* binding */ OverviewRulerLane),
+/* harmony export */ PositionAffinity: () => (/* binding */ PositionAffinity),
+/* harmony export */ RenderLineNumbersType: () => (/* binding */ RenderLineNumbersType),
+/* harmony export */ RenderMinimap: () => (/* binding */ RenderMinimap),
+/* harmony export */ ScrollType: () => (/* binding */ ScrollType),
+/* harmony export */ ScrollbarVisibility: () => (/* binding */ ScrollbarVisibility),
+/* harmony export */ SelectionDirection: () => (/* binding */ SelectionDirection),
+/* harmony export */ ShowAiIconMode: () => (/* binding */ ShowAiIconMode),
+/* harmony export */ SignatureHelpTriggerKind: () => (/* binding */ SignatureHelpTriggerKind),
+/* harmony export */ SymbolKind: () => (/* binding */ SymbolKind),
+/* harmony export */ SymbolTag: () => (/* binding */ SymbolTag),
+/* harmony export */ TextEditorCursorBlinkingStyle: () => (/* binding */ TextEditorCursorBlinkingStyle),
+/* harmony export */ TextEditorCursorStyle: () => (/* binding */ TextEditorCursorStyle),
+/* harmony export */ TrackedRangeStickiness: () => (/* binding */ TrackedRangeStickiness),
+/* harmony export */ WrappingIndent: () => (/* binding */ WrappingIndent)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * 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 AccessibilitySupport;
+(function (AccessibilitySupport) {
+ /**
+ * This should be the browser case where it is not known if a screen reader is attached or no.
+ */
+ AccessibilitySupport[AccessibilitySupport["Unknown"] = 0] = "Unknown";
+ AccessibilitySupport[AccessibilitySupport["Disabled"] = 1] = "Disabled";
+ AccessibilitySupport[AccessibilitySupport["Enabled"] = 2] = "Enabled";
+})(AccessibilitySupport || (AccessibilitySupport = {}));
+var CodeActionTriggerType;
+(function (CodeActionTriggerType) {
+ CodeActionTriggerType[CodeActionTriggerType["Invoke"] = 1] = "Invoke";
+ CodeActionTriggerType[CodeActionTriggerType["Auto"] = 2] = "Auto";
+})(CodeActionTriggerType || (CodeActionTriggerType = {}));
+var CompletionItemInsertTextRule;
+(function (CompletionItemInsertTextRule) {
+ CompletionItemInsertTextRule[CompletionItemInsertTextRule["None"] = 0] = "None";
+ /**
+ * 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 = {}));
+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["User"] = 25] = "User";
+ CompletionItemKind[CompletionItemKind["Issue"] = 26] = "Issue";
+ CompletionItemKind[CompletionItemKind["Snippet"] = 27] = "Snippet";
+})(CompletionItemKind || (CompletionItemKind = {}));
+var CompletionItemTag;
+(function (CompletionItemTag) {
+ CompletionItemTag[CompletionItemTag["Deprecated"] = 1] = "Deprecated";
+})(CompletionItemTag || (CompletionItemTag = {}));
+/**
+ * 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 = {}));
+/**
+ * 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 = {}));
+/**
+ * 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 = {}));
+/**
+ * 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 = {}));
+/**
+ * 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 = {}));
+/**
+ * Configuration options for auto indentation in the editor
+ */
+var EditorAutoIndentStrategy;
+(function (EditorAutoIndentStrategy) {
+ EditorAutoIndentStrategy[EditorAutoIndentStrategy["None"] = 0] = "None";
+ EditorAutoIndentStrategy[EditorAutoIndentStrategy["Keep"] = 1] = "Keep";
+ EditorAutoIndentStrategy[EditorAutoIndentStrategy["Brackets"] = 2] = "Brackets";
+ EditorAutoIndentStrategy[EditorAutoIndentStrategy["Advanced"] = 3] = "Advanced";
+ EditorAutoIndentStrategy[EditorAutoIndentStrategy["Full"] = 4] = "Full";
+})(EditorAutoIndentStrategy || (EditorAutoIndentStrategy = {}));
+var EditorOption;
+(function (EditorOption) {
+ EditorOption[EditorOption["acceptSuggestionOnCommitCharacter"] = 0] = "acceptSuggestionOnCommitCharacter";
+ EditorOption[EditorOption["acceptSuggestionOnEnter"] = 1] = "acceptSuggestionOnEnter";
+ EditorOption[EditorOption["accessibilitySupport"] = 2] = "accessibilitySupport";
+ EditorOption[EditorOption["accessibilityPageSize"] = 3] = "accessibilityPageSize";
+ EditorOption[EditorOption["ariaLabel"] = 4] = "ariaLabel";
+ EditorOption[EditorOption["ariaRequired"] = 5] = "ariaRequired";
+ EditorOption[EditorOption["autoClosingBrackets"] = 6] = "autoClosingBrackets";
+ EditorOption[EditorOption["autoClosingComments"] = 7] = "autoClosingComments";
+ EditorOption[EditorOption["screenReaderAnnounceInlineSuggestion"] = 8] = "screenReaderAnnounceInlineSuggestion";
+ EditorOption[EditorOption["autoClosingDelete"] = 9] = "autoClosingDelete";
+ EditorOption[EditorOption["autoClosingOvertype"] = 10] = "autoClosingOvertype";
+ EditorOption[EditorOption["autoClosingQuotes"] = 11] = "autoClosingQuotes";
+ EditorOption[EditorOption["autoIndent"] = 12] = "autoIndent";
+ EditorOption[EditorOption["automaticLayout"] = 13] = "automaticLayout";
+ EditorOption[EditorOption["autoSurround"] = 14] = "autoSurround";
+ EditorOption[EditorOption["bracketPairColorization"] = 15] = "bracketPairColorization";
+ EditorOption[EditorOption["guides"] = 16] = "guides";
+ EditorOption[EditorOption["codeLens"] = 17] = "codeLens";
+ EditorOption[EditorOption["codeLensFontFamily"] = 18] = "codeLensFontFamily";
+ EditorOption[EditorOption["codeLensFontSize"] = 19] = "codeLensFontSize";
+ EditorOption[EditorOption["colorDecorators"] = 20] = "colorDecorators";
+ EditorOption[EditorOption["colorDecoratorsLimit"] = 21] = "colorDecoratorsLimit";
+ EditorOption[EditorOption["columnSelection"] = 22] = "columnSelection";
+ EditorOption[EditorOption["comments"] = 23] = "comments";
+ EditorOption[EditorOption["contextmenu"] = 24] = "contextmenu";
+ EditorOption[EditorOption["copyWithSyntaxHighlighting"] = 25] = "copyWithSyntaxHighlighting";
+ EditorOption[EditorOption["cursorBlinking"] = 26] = "cursorBlinking";
+ EditorOption[EditorOption["cursorSmoothCaretAnimation"] = 27] = "cursorSmoothCaretAnimation";
+ EditorOption[EditorOption["cursorStyle"] = 28] = "cursorStyle";
+ EditorOption[EditorOption["cursorSurroundingLines"] = 29] = "cursorSurroundingLines";
+ EditorOption[EditorOption["cursorSurroundingLinesStyle"] = 30] = "cursorSurroundingLinesStyle";
+ EditorOption[EditorOption["cursorWidth"] = 31] = "cursorWidth";
+ EditorOption[EditorOption["disableLayerHinting"] = 32] = "disableLayerHinting";
+ EditorOption[EditorOption["disableMonospaceOptimizations"] = 33] = "disableMonospaceOptimizations";
+ EditorOption[EditorOption["domReadOnly"] = 34] = "domReadOnly";
+ EditorOption[EditorOption["dragAndDrop"] = 35] = "dragAndDrop";
+ EditorOption[EditorOption["dropIntoEditor"] = 36] = "dropIntoEditor";
+ EditorOption[EditorOption["emptySelectionClipboard"] = 37] = "emptySelectionClipboard";
+ EditorOption[EditorOption["experimentalWhitespaceRendering"] = 38] = "experimentalWhitespaceRendering";
+ EditorOption[EditorOption["extraEditorClassName"] = 39] = "extraEditorClassName";
+ EditorOption[EditorOption["fastScrollSensitivity"] = 40] = "fastScrollSensitivity";
+ EditorOption[EditorOption["find"] = 41] = "find";
+ EditorOption[EditorOption["fixedOverflowWidgets"] = 42] = "fixedOverflowWidgets";
+ EditorOption[EditorOption["folding"] = 43] = "folding";
+ EditorOption[EditorOption["foldingStrategy"] = 44] = "foldingStrategy";
+ EditorOption[EditorOption["foldingHighlight"] = 45] = "foldingHighlight";
+ EditorOption[EditorOption["foldingImportsByDefault"] = 46] = "foldingImportsByDefault";
+ EditorOption[EditorOption["foldingMaximumRegions"] = 47] = "foldingMaximumRegions";
+ EditorOption[EditorOption["unfoldOnClickAfterEndOfLine"] = 48] = "unfoldOnClickAfterEndOfLine";
+ EditorOption[EditorOption["fontFamily"] = 49] = "fontFamily";
+ EditorOption[EditorOption["fontInfo"] = 50] = "fontInfo";
+ EditorOption[EditorOption["fontLigatures"] = 51] = "fontLigatures";
+ EditorOption[EditorOption["fontSize"] = 52] = "fontSize";
+ EditorOption[EditorOption["fontWeight"] = 53] = "fontWeight";
+ EditorOption[EditorOption["fontVariations"] = 54] = "fontVariations";
+ EditorOption[EditorOption["formatOnPaste"] = 55] = "formatOnPaste";
+ EditorOption[EditorOption["formatOnType"] = 56] = "formatOnType";
+ EditorOption[EditorOption["glyphMargin"] = 57] = "glyphMargin";
+ EditorOption[EditorOption["gotoLocation"] = 58] = "gotoLocation";
+ EditorOption[EditorOption["hideCursorInOverviewRuler"] = 59] = "hideCursorInOverviewRuler";
+ EditorOption[EditorOption["hover"] = 60] = "hover";
+ EditorOption[EditorOption["inDiffEditor"] = 61] = "inDiffEditor";
+ EditorOption[EditorOption["inlineSuggest"] = 62] = "inlineSuggest";
+ EditorOption[EditorOption["letterSpacing"] = 63] = "letterSpacing";
+ EditorOption[EditorOption["lightbulb"] = 64] = "lightbulb";
+ EditorOption[EditorOption["lineDecorationsWidth"] = 65] = "lineDecorationsWidth";
+ EditorOption[EditorOption["lineHeight"] = 66] = "lineHeight";
+ EditorOption[EditorOption["lineNumbers"] = 67] = "lineNumbers";
+ EditorOption[EditorOption["lineNumbersMinChars"] = 68] = "lineNumbersMinChars";
+ EditorOption[EditorOption["linkedEditing"] = 69] = "linkedEditing";
+ EditorOption[EditorOption["links"] = 70] = "links";
+ EditorOption[EditorOption["matchBrackets"] = 71] = "matchBrackets";
+ EditorOption[EditorOption["minimap"] = 72] = "minimap";
+ EditorOption[EditorOption["mouseStyle"] = 73] = "mouseStyle";
+ EditorOption[EditorOption["mouseWheelScrollSensitivity"] = 74] = "mouseWheelScrollSensitivity";
+ EditorOption[EditorOption["mouseWheelZoom"] = 75] = "mouseWheelZoom";
+ EditorOption[EditorOption["multiCursorMergeOverlapping"] = 76] = "multiCursorMergeOverlapping";
+ EditorOption[EditorOption["multiCursorModifier"] = 77] = "multiCursorModifier";
+ EditorOption[EditorOption["multiCursorPaste"] = 78] = "multiCursorPaste";
+ EditorOption[EditorOption["multiCursorLimit"] = 79] = "multiCursorLimit";
+ EditorOption[EditorOption["occurrencesHighlight"] = 80] = "occurrencesHighlight";
+ EditorOption[EditorOption["overviewRulerBorder"] = 81] = "overviewRulerBorder";
+ EditorOption[EditorOption["overviewRulerLanes"] = 82] = "overviewRulerLanes";
+ EditorOption[EditorOption["padding"] = 83] = "padding";
+ EditorOption[EditorOption["pasteAs"] = 84] = "pasteAs";
+ EditorOption[EditorOption["parameterHints"] = 85] = "parameterHints";
+ EditorOption[EditorOption["peekWidgetDefaultFocus"] = 86] = "peekWidgetDefaultFocus";
+ EditorOption[EditorOption["definitionLinkOpensInPeek"] = 87] = "definitionLinkOpensInPeek";
+ EditorOption[EditorOption["quickSuggestions"] = 88] = "quickSuggestions";
+ EditorOption[EditorOption["quickSuggestionsDelay"] = 89] = "quickSuggestionsDelay";
+ EditorOption[EditorOption["readOnly"] = 90] = "readOnly";
+ EditorOption[EditorOption["readOnlyMessage"] = 91] = "readOnlyMessage";
+ EditorOption[EditorOption["renameOnType"] = 92] = "renameOnType";
+ EditorOption[EditorOption["renderControlCharacters"] = 93] = "renderControlCharacters";
+ EditorOption[EditorOption["renderFinalNewline"] = 94] = "renderFinalNewline";
+ EditorOption[EditorOption["renderLineHighlight"] = 95] = "renderLineHighlight";
+ EditorOption[EditorOption["renderLineHighlightOnlyWhenFocus"] = 96] = "renderLineHighlightOnlyWhenFocus";
+ EditorOption[EditorOption["renderValidationDecorations"] = 97] = "renderValidationDecorations";
+ EditorOption[EditorOption["renderWhitespace"] = 98] = "renderWhitespace";
+ EditorOption[EditorOption["revealHorizontalRightPadding"] = 99] = "revealHorizontalRightPadding";
+ EditorOption[EditorOption["roundedSelection"] = 100] = "roundedSelection";
+ EditorOption[EditorOption["rulers"] = 101] = "rulers";
+ EditorOption[EditorOption["scrollbar"] = 102] = "scrollbar";
+ EditorOption[EditorOption["scrollBeyondLastColumn"] = 103] = "scrollBeyondLastColumn";
+ EditorOption[EditorOption["scrollBeyondLastLine"] = 104] = "scrollBeyondLastLine";
+ EditorOption[EditorOption["scrollPredominantAxis"] = 105] = "scrollPredominantAxis";
+ EditorOption[EditorOption["selectionClipboard"] = 106] = "selectionClipboard";
+ EditorOption[EditorOption["selectionHighlight"] = 107] = "selectionHighlight";
+ EditorOption[EditorOption["selectOnLineNumbers"] = 108] = "selectOnLineNumbers";
+ EditorOption[EditorOption["showFoldingControls"] = 109] = "showFoldingControls";
+ EditorOption[EditorOption["showUnused"] = 110] = "showUnused";
+ EditorOption[EditorOption["snippetSuggestions"] = 111] = "snippetSuggestions";
+ EditorOption[EditorOption["smartSelect"] = 112] = "smartSelect";
+ EditorOption[EditorOption["smoothScrolling"] = 113] = "smoothScrolling";
+ EditorOption[EditorOption["stickyScroll"] = 114] = "stickyScroll";
+ EditorOption[EditorOption["stickyTabStops"] = 115] = "stickyTabStops";
+ EditorOption[EditorOption["stopRenderingLineAfter"] = 116] = "stopRenderingLineAfter";
+ EditorOption[EditorOption["suggest"] = 117] = "suggest";
+ EditorOption[EditorOption["suggestFontSize"] = 118] = "suggestFontSize";
+ EditorOption[EditorOption["suggestLineHeight"] = 119] = "suggestLineHeight";
+ EditorOption[EditorOption["suggestOnTriggerCharacters"] = 120] = "suggestOnTriggerCharacters";
+ EditorOption[EditorOption["suggestSelection"] = 121] = "suggestSelection";
+ EditorOption[EditorOption["tabCompletion"] = 122] = "tabCompletion";
+ EditorOption[EditorOption["tabIndex"] = 123] = "tabIndex";
+ EditorOption[EditorOption["unicodeHighlighting"] = 124] = "unicodeHighlighting";
+ EditorOption[EditorOption["unusualLineTerminators"] = 125] = "unusualLineTerminators";
+ EditorOption[EditorOption["useShadowDOM"] = 126] = "useShadowDOM";
+ EditorOption[EditorOption["useTabStops"] = 127] = "useTabStops";
+ EditorOption[EditorOption["wordBreak"] = 128] = "wordBreak";
+ EditorOption[EditorOption["wordSeparators"] = 129] = "wordSeparators";
+ EditorOption[EditorOption["wordWrap"] = 130] = "wordWrap";
+ EditorOption[EditorOption["wordWrapBreakAfterCharacters"] = 131] = "wordWrapBreakAfterCharacters";
+ EditorOption[EditorOption["wordWrapBreakBeforeCharacters"] = 132] = "wordWrapBreakBeforeCharacters";
+ EditorOption[EditorOption["wordWrapColumn"] = 133] = "wordWrapColumn";
+ EditorOption[EditorOption["wordWrapOverride1"] = 134] = "wordWrapOverride1";
+ EditorOption[EditorOption["wordWrapOverride2"] = 135] = "wordWrapOverride2";
+ EditorOption[EditorOption["wrappingIndent"] = 136] = "wrappingIndent";
+ EditorOption[EditorOption["wrappingStrategy"] = 137] = "wrappingStrategy";
+ EditorOption[EditorOption["showDeprecated"] = 138] = "showDeprecated";
+ EditorOption[EditorOption["inlayHints"] = 139] = "inlayHints";
+ EditorOption[EditorOption["editorClassName"] = 140] = "editorClassName";
+ EditorOption[EditorOption["pixelRatio"] = 141] = "pixelRatio";
+ EditorOption[EditorOption["tabFocusMode"] = 142] = "tabFocusMode";
+ EditorOption[EditorOption["layoutInfo"] = 143] = "layoutInfo";
+ EditorOption[EditorOption["wrappingInfo"] = 144] = "wrappingInfo";
+ EditorOption[EditorOption["defaultColorDecorators"] = 145] = "defaultColorDecorators";
+ EditorOption[EditorOption["colorDecoratorsActivatedOn"] = 146] = "colorDecoratorsActivatedOn";
+ EditorOption[EditorOption["inlineCompletionsAccessibilityVerbose"] = 147] = "inlineCompletionsAccessibilityVerbose";
+})(EditorOption || (EditorOption = {}));
+/**
+ * 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 = {}));
+/**
+ * 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 = {}));
+/**
+ * Vertical Lane in the glyph margin of the editor.
+ */
+var GlyphMarginLane;
+(function (GlyphMarginLane) {
+ GlyphMarginLane[GlyphMarginLane["Left"] = 1] = "Left";
+ GlyphMarginLane[GlyphMarginLane["Right"] = 2] = "Right";
+})(GlyphMarginLane || (GlyphMarginLane = {}));
+/**
+ * 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 InjectedTextCursorStops;
+(function (InjectedTextCursorStops) {
+ InjectedTextCursorStops[InjectedTextCursorStops["Both"] = 0] = "Both";
+ InjectedTextCursorStops[InjectedTextCursorStops["Right"] = 1] = "Right";
+ InjectedTextCursorStops[InjectedTextCursorStops["Left"] = 2] = "Left";
+ InjectedTextCursorStops[InjectedTextCursorStops["None"] = 3] = "None";
+})(InjectedTextCursorStops || (InjectedTextCursorStops = {}));
+var InlayHintKind;
+(function (InlayHintKind) {
+ InlayHintKind[InlayHintKind["Type"] = 1] = "Type";
+ InlayHintKind[InlayHintKind["Parameter"] = 2] = "Parameter";
+})(InlayHintKind || (InlayHintKind = {}));
+/**
+ * How an {@link InlineCompletionsProvider inline completion provider} was triggered.
+ */
+var InlineCompletionTriggerKind;
+(function (InlineCompletionTriggerKind) {
+ /**
+ * Completion was triggered automatically while editing.
+ * It is sufficient to return a single completion item in this case.
+ */
+ InlineCompletionTriggerKind[InlineCompletionTriggerKind["Automatic"] = 0] = "Automatic";
+ /**
+ * Completion was triggered explicitly by a user gesture.
+ * Return multiple completion items to enable cycling through them.
+ */
+ InlineCompletionTriggerKind[InlineCompletionTriggerKind["Explicit"] = 1] = "Explicit";
+})(InlineCompletionTriggerKind || (InlineCompletionTriggerKind = {}));
+/**
+ * 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) {
+ KeyCode[KeyCode["DependsOnKbLayout"] = -1] = "DependsOnKbLayout";
+ /**
+ * 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["Digit0"] = 21] = "Digit0";
+ KeyCode[KeyCode["Digit1"] = 22] = "Digit1";
+ KeyCode[KeyCode["Digit2"] = 23] = "Digit2";
+ KeyCode[KeyCode["Digit3"] = 24] = "Digit3";
+ KeyCode[KeyCode["Digit4"] = 25] = "Digit4";
+ KeyCode[KeyCode["Digit5"] = 26] = "Digit5";
+ KeyCode[KeyCode["Digit6"] = 27] = "Digit6";
+ KeyCode[KeyCode["Digit7"] = 28] = "Digit7";
+ KeyCode[KeyCode["Digit8"] = 29] = "Digit8";
+ KeyCode[KeyCode["Digit9"] = 30] = "Digit9";
+ KeyCode[KeyCode["KeyA"] = 31] = "KeyA";
+ KeyCode[KeyCode["KeyB"] = 32] = "KeyB";
+ KeyCode[KeyCode["KeyC"] = 33] = "KeyC";
+ KeyCode[KeyCode["KeyD"] = 34] = "KeyD";
+ KeyCode[KeyCode["KeyE"] = 35] = "KeyE";
+ KeyCode[KeyCode["KeyF"] = 36] = "KeyF";
+ KeyCode[KeyCode["KeyG"] = 37] = "KeyG";
+ KeyCode[KeyCode["KeyH"] = 38] = "KeyH";
+ KeyCode[KeyCode["KeyI"] = 39] = "KeyI";
+ KeyCode[KeyCode["KeyJ"] = 40] = "KeyJ";
+ KeyCode[KeyCode["KeyK"] = 41] = "KeyK";
+ KeyCode[KeyCode["KeyL"] = 42] = "KeyL";
+ KeyCode[KeyCode["KeyM"] = 43] = "KeyM";
+ KeyCode[KeyCode["KeyN"] = 44] = "KeyN";
+ KeyCode[KeyCode["KeyO"] = 45] = "KeyO";
+ KeyCode[KeyCode["KeyP"] = 46] = "KeyP";
+ KeyCode[KeyCode["KeyQ"] = 47] = "KeyQ";
+ KeyCode[KeyCode["KeyR"] = 48] = "KeyR";
+ KeyCode[KeyCode["KeyS"] = 49] = "KeyS";
+ KeyCode[KeyCode["KeyT"] = 50] = "KeyT";
+ KeyCode[KeyCode["KeyU"] = 51] = "KeyU";
+ KeyCode[KeyCode["KeyV"] = 52] = "KeyV";
+ KeyCode[KeyCode["KeyW"] = 53] = "KeyW";
+ KeyCode[KeyCode["KeyX"] = 54] = "KeyX";
+ KeyCode[KeyCode["KeyY"] = 55] = "KeyY";
+ KeyCode[KeyCode["KeyZ"] = 56] = "KeyZ";
+ 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["F20"] = 78] = "F20";
+ KeyCode[KeyCode["F21"] = 79] = "F21";
+ KeyCode[KeyCode["F22"] = 80] = "F22";
+ KeyCode[KeyCode["F23"] = 81] = "F23";
+ KeyCode[KeyCode["F24"] = 82] = "F24";
+ KeyCode[KeyCode["NumLock"] = 83] = "NumLock";
+ KeyCode[KeyCode["ScrollLock"] = 84] = "ScrollLock";
+ /**
+ * Used for miscellaneous characters; it can vary by keyboard.
+ * For the US standard keyboard, the ';:' key
+ */
+ KeyCode[KeyCode["Semicolon"] = 85] = "Semicolon";
+ /**
+ * For any country/region, the '+' key
+ * For the US standard keyboard, the '=+' key
+ */
+ KeyCode[KeyCode["Equal"] = 86] = "Equal";
+ /**
+ * For any country/region, the ',' key
+ * For the US standard keyboard, the ',<' key
+ */
+ KeyCode[KeyCode["Comma"] = 87] = "Comma";
+ /**
+ * For any country/region, the '-' key
+ * For the US standard keyboard, the '-_' key
+ */
+ KeyCode[KeyCode["Minus"] = 88] = "Minus";
+ /**
+ * For any country/region, the '.' key
+ * For the US standard keyboard, the '.>' key
+ */
+ KeyCode[KeyCode["Period"] = 89] = "Period";
+ /**
+ * Used for miscellaneous characters; it can vary by keyboard.
+ * For the US standard keyboard, the '/?' key
+ */
+ KeyCode[KeyCode["Slash"] = 90] = "Slash";
+ /**
+ * Used for miscellaneous characters; it can vary by keyboard.
+ * For the US standard keyboard, the '`~' key
+ */
+ KeyCode[KeyCode["Backquote"] = 91] = "Backquote";
+ /**
+ * Used for miscellaneous characters; it can vary by keyboard.
+ * For the US standard keyboard, the '[{' key
+ */
+ KeyCode[KeyCode["BracketLeft"] = 92] = "BracketLeft";
+ /**
+ * Used for miscellaneous characters; it can vary by keyboard.
+ * For the US standard keyboard, the '\|' key
+ */
+ KeyCode[KeyCode["Backslash"] = 93] = "Backslash";
+ /**
+ * Used for miscellaneous characters; it can vary by keyboard.
+ * For the US standard keyboard, the ']}' key
+ */
+ KeyCode[KeyCode["BracketRight"] = 94] = "BracketRight";
+ /**
+ * Used for miscellaneous characters; it can vary by keyboard.
+ * For the US standard keyboard, the ''"' key
+ */
+ KeyCode[KeyCode["Quote"] = 95] = "Quote";
+ /**
+ * Used for miscellaneous characters; it can vary by keyboard.
+ */
+ KeyCode[KeyCode["OEM_8"] = 96] = "OEM_8";
+ /**
+ * Either the angle bracket key or the backslash key on the RT 102-key keyboard.
+ */
+ KeyCode[KeyCode["IntlBackslash"] = 97] = "IntlBackslash";
+ KeyCode[KeyCode["Numpad0"] = 98] = "Numpad0";
+ KeyCode[KeyCode["Numpad1"] = 99] = "Numpad1";
+ KeyCode[KeyCode["Numpad2"] = 100] = "Numpad2";
+ KeyCode[KeyCode["Numpad3"] = 101] = "Numpad3";
+ KeyCode[KeyCode["Numpad4"] = 102] = "Numpad4";
+ KeyCode[KeyCode["Numpad5"] = 103] = "Numpad5";
+ KeyCode[KeyCode["Numpad6"] = 104] = "Numpad6";
+ KeyCode[KeyCode["Numpad7"] = 105] = "Numpad7";
+ KeyCode[KeyCode["Numpad8"] = 106] = "Numpad8";
+ KeyCode[KeyCode["Numpad9"] = 107] = "Numpad9";
+ KeyCode[KeyCode["NumpadMultiply"] = 108] = "NumpadMultiply";
+ KeyCode[KeyCode["NumpadAdd"] = 109] = "NumpadAdd";
+ KeyCode[KeyCode["NUMPAD_SEPARATOR"] = 110] = "NUMPAD_SEPARATOR";
+ KeyCode[KeyCode["NumpadSubtract"] = 111] = "NumpadSubtract";
+ KeyCode[KeyCode["NumpadDecimal"] = 112] = "NumpadDecimal";
+ KeyCode[KeyCode["NumpadDivide"] = 113] = "NumpadDivide";
+ /**
+ * Cover all key codes when IME is processing input.
+ */
+ KeyCode[KeyCode["KEY_IN_COMPOSITION"] = 114] = "KEY_IN_COMPOSITION";
+ KeyCode[KeyCode["ABNT_C1"] = 115] = "ABNT_C1";
+ KeyCode[KeyCode["ABNT_C2"] = 116] = "ABNT_C2";
+ KeyCode[KeyCode["AudioVolumeMute"] = 117] = "AudioVolumeMute";
+ KeyCode[KeyCode["AudioVolumeUp"] = 118] = "AudioVolumeUp";
+ KeyCode[KeyCode["AudioVolumeDown"] = 119] = "AudioVolumeDown";
+ KeyCode[KeyCode["BrowserSearch"] = 120] = "BrowserSearch";
+ KeyCode[KeyCode["BrowserHome"] = 121] = "BrowserHome";
+ KeyCode[KeyCode["BrowserBack"] = 122] = "BrowserBack";
+ KeyCode[KeyCode["BrowserForward"] = 123] = "BrowserForward";
+ KeyCode[KeyCode["MediaTrackNext"] = 124] = "MediaTrackNext";
+ KeyCode[KeyCode["MediaTrackPrevious"] = 125] = "MediaTrackPrevious";
+ KeyCode[KeyCode["MediaStop"] = 126] = "MediaStop";
+ KeyCode[KeyCode["MediaPlayPause"] = 127] = "MediaPlayPause";
+ KeyCode[KeyCode["LaunchMediaPlayer"] = 128] = "LaunchMediaPlayer";
+ KeyCode[KeyCode["LaunchMail"] = 129] = "LaunchMail";
+ KeyCode[KeyCode["LaunchApp2"] = 130] = "LaunchApp2";
+ /**
+ * VK_CLEAR, 0x0C, CLEAR key
+ */
+ KeyCode[KeyCode["Clear"] = 131] = "Clear";
+ /**
+ * Placed last to cover the length of the enum.
+ * Please do not depend on this value!
+ */
+ KeyCode[KeyCode["MAX_VALUE"] = 132] = "MAX_VALUE";
+})(KeyCode || (KeyCode = {}));
+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 = {}));
+var MarkerTag;
+(function (MarkerTag) {
+ MarkerTag[MarkerTag["Unnecessary"] = 1] = "Unnecessary";
+ MarkerTag[MarkerTag["Deprecated"] = 2] = "Deprecated";
+})(MarkerTag || (MarkerTag = {}));
+/**
+ * Position in the minimap to render the decoration.
+ */
+var MinimapPosition;
+(function (MinimapPosition) {
+ MinimapPosition[MinimapPosition["Inline"] = 1] = "Inline";
+ MinimapPosition[MinimapPosition["Gutter"] = 2] = "Gutter";
+})(MinimapPosition || (MinimapPosition = {}));
+/**
+ * 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 = {}));
+/**
+ * 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 = {}));
+/**
+ * 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 = {}));
+var PositionAffinity;
+(function (PositionAffinity) {
+ /**
+ * Prefers the left most position.
+ */
+ PositionAffinity[PositionAffinity["Left"] = 0] = "Left";
+ /**
+ * Prefers the right most position.
+ */
+ PositionAffinity[PositionAffinity["Right"] = 1] = "Right";
+ /**
+ * No preference.
+ */
+ PositionAffinity[PositionAffinity["None"] = 2] = "None";
+ /**
+ * If the given position is on injected text, prefers the position left of it.
+ */
+ PositionAffinity[PositionAffinity["LeftOfInjectedText"] = 3] = "LeftOfInjectedText";
+ /**
+ * If the given position is on injected text, prefers the position right of it.
+ */
+ PositionAffinity[PositionAffinity["RightOfInjectedText"] = 4] = "RightOfInjectedText";
+})(PositionAffinity || (PositionAffinity = {}));
+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 = {}));
+var RenderMinimap;
+(function (RenderMinimap) {
+ RenderMinimap[RenderMinimap["None"] = 0] = "None";
+ RenderMinimap[RenderMinimap["Text"] = 1] = "Text";
+ RenderMinimap[RenderMinimap["Blocks"] = 2] = "Blocks";
+})(RenderMinimap || (RenderMinimap = {}));
+var ScrollType;
+(function (ScrollType) {
+ ScrollType[ScrollType["Smooth"] = 0] = "Smooth";
+ ScrollType[ScrollType["Immediate"] = 1] = "Immediate";
+})(ScrollType || (ScrollType = {}));
+var ScrollbarVisibility;
+(function (ScrollbarVisibility) {
+ ScrollbarVisibility[ScrollbarVisibility["Auto"] = 1] = "Auto";
+ ScrollbarVisibility[ScrollbarVisibility["Hidden"] = 2] = "Hidden";
+ ScrollbarVisibility[ScrollbarVisibility["Visible"] = 3] = "Visible";
+})(ScrollbarVisibility || (ScrollbarVisibility = {}));
+/**
+ * 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 ShowAiIconMode;
+(function (ShowAiIconMode) {
+ ShowAiIconMode["Off"] = "off";
+ ShowAiIconMode["OnCode"] = "onCode";
+ ShowAiIconMode["On"] = "on";
+})(ShowAiIconMode || (ShowAiIconMode = {}));
+var SignatureHelpTriggerKind;
+(function (SignatureHelpTriggerKind) {
+ SignatureHelpTriggerKind[SignatureHelpTriggerKind["Invoke"] = 1] = "Invoke";
+ SignatureHelpTriggerKind[SignatureHelpTriggerKind["TriggerCharacter"] = 2] = "TriggerCharacter";
+ SignatureHelpTriggerKind[SignatureHelpTriggerKind["ContentChange"] = 3] = "ContentChange";
+})(SignatureHelpTriggerKind || (SignatureHelpTriggerKind = {}));
+/**
+ * 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 = {}));
+/**
+ * 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 = {}));
+/**
+ * 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 = {}));
+/**
+ * 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 = {}));
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/editor/common/tokenizationRegistry.js":
+/*!*********************************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/common/tokenizationRegistry.js ***!
+ \*********************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ TokenizationRegistry: () => (/* binding */ TokenizationRegistry)
+/* harmony export */ });
+/* harmony import */ var _base_common_event_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../base/common/event.js */ "./node_modules/monaco-editor/esm/vs/base/common/event.js");
+/* harmony import */ var _base_common_lifecycle_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../base/common/lifecycle.js */ "./node_modules/monaco-editor/esm/vs/base/common/lifecycle.js");
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+
+class TokenizationRegistry {
+ constructor() {
+ this._tokenizationSupports = new Map();
+ this._factories = new Map();
+ this._onDidChange = new _base_common_event_js__WEBPACK_IMPORTED_MODULE_0__.Emitter();
+ this.onDidChange = this._onDidChange.event;
+ this._colorMap = null;
+ }
+ handleChange(languageIds) {
+ this._onDidChange.fire({
+ changedLanguages: languageIds,
+ changedColorMap: false
+ });
+ }
+ register(languageId, support) {
+ this._tokenizationSupports.set(languageId, support);
+ this.handleChange([languageId]);
+ return (0,_base_common_lifecycle_js__WEBPACK_IMPORTED_MODULE_1__.toDisposable)(() => {
+ if (this._tokenizationSupports.get(languageId) !== support) {
+ return;
+ }
+ this._tokenizationSupports.delete(languageId);
+ this.handleChange([languageId]);
+ });
+ }
+ get(languageId) {
+ return this._tokenizationSupports.get(languageId) || null;
+ }
+ registerFactory(languageId, factory) {
+ var _a;
+ (_a = this._factories.get(languageId)) === null || _a === void 0 ? void 0 : _a.dispose();
+ const myData = new TokenizationSupportFactoryData(this, languageId, factory);
+ this._factories.set(languageId, myData);
+ return (0,_base_common_lifecycle_js__WEBPACK_IMPORTED_MODULE_1__.toDisposable)(() => {
+ const v = this._factories.get(languageId);
+ if (!v || v !== myData) {
+ return;
+ }
+ this._factories.delete(languageId);
+ v.dispose();
+ });
+ }
+ async getOrCreate(languageId) {
+ // check first if the support is already set
+ const tokenizationSupport = this.get(languageId);
+ if (tokenizationSupport) {
+ return tokenizationSupport;
+ }
+ const factory = this._factories.get(languageId);
+ if (!factory || factory.isResolved) {
+ // no factory or factory.resolve already finished
+ return null;
+ }
+ await factory.resolve();
+ return this.get(languageId);
+ }
+ isResolved(languageId) {
+ const tokenizationSupport = this.get(languageId);
+ if (tokenizationSupport) {
+ return true;
+ }
+ const factory = this._factories.get(languageId);
+ if (!factory || factory.isResolved) {
+ return true;
+ }
+ return false;
+ }
+ setColorMap(colorMap) {
+ this._colorMap = colorMap;
+ this._onDidChange.fire({
+ changedLanguages: Array.from(this._tokenizationSupports.keys()),
+ changedColorMap: true
+ });
+ }
+ getColorMap() {
+ return this._colorMap;
+ }
+ getDefaultBackground() {
+ if (this._colorMap && this._colorMap.length > 2 /* ColorId.DefaultBackground */) {
+ return this._colorMap[2 /* ColorId.DefaultBackground */];
+ }
+ return null;
+ }
+}
+class TokenizationSupportFactoryData extends _base_common_lifecycle_js__WEBPACK_IMPORTED_MODULE_1__.Disposable {
+ get isResolved() {
+ return this._isResolved;
+ }
+ constructor(_registry, _languageId, _factory) {
+ super();
+ this._registry = _registry;
+ this._languageId = _languageId;
+ this._factory = _factory;
+ this._isDisposed = false;
+ this._resolvePromise = null;
+ this._isResolved = false;
+ }
+ dispose() {
+ this._isDisposed = true;
+ super.dispose();
+ }
+ async resolve() {
+ if (!this._resolvePromise) {
+ this._resolvePromise = this._create();
+ }
+ return this._resolvePromise;
+ }
+ async _create() {
+ const value = await this._factory.tokenizationSupport;
+ this._isResolved = true;
+ if (value && !this._isDisposed) {
+ this._register(this._registry.register(this._languageId, value));
+ }
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/monaco-editor/esm/vs/nls.js":
+/*!**************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/nls.js ***!
+ \**************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ create: () => (/* binding */ create),
+/* harmony export */ getConfiguredDefaultLocale: () => (/* binding */ getConfiguredDefaultLocale),
+/* harmony export */ load: () => (/* binding */ load),
+/* harmony export */ localize: () => (/* binding */ localize),
+/* harmony export */ localize2: () => (/* binding */ localize2),
+/* harmony export */ setPseudoTranslation: () => (/* binding */ setPseudoTranslation)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+ * Copyright (c) Microsoft Corporation. All rights reserved.
+ * Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+let isPseudo = (typeof document !== 'undefined' && document.location && document.location.hash.indexOf('pseudo=true') >= 0);
+const DEFAULT_TAG = 'i-default';
+function _format(message, args) {
+ let result;
+ if (args.length === 0) {
+ result = message;
+ }
+ else {
+ result = message.replace(/\{(\d+)\}/g, (match, rest) => {
+ const index = rest[0];
+ const arg = args[index];
+ let result = match;
+ if (typeof arg === 'string') {
+ result = arg;
+ }
+ else if (typeof arg === 'number' || typeof arg === 'boolean' || arg === void 0 || arg === null) {
+ result = String(arg);
+ }
+ return result;
+ });
+ }
+ if (isPseudo) {
+ // FF3B and FF3D is the Unicode zenkaku representation for [ and ]
+ result = '\uFF3B' + result.replace(/[aouei]/g, '$&$&') + '\uFF3D';
+ }
+ return result;
+}
+function findLanguageForModule(config, name) {
+ let result = config[name];
+ if (result) {
+ return result;
+ }
+ result = config['*'];
+ if (result) {
+ return result;
+ }
+ return null;
+}
+function endWithSlash(path) {
+ if (path.charAt(path.length - 1) === '/') {
+ return path;
+ }
+ return path + '/';
+}
+async function getMessagesFromTranslationsService(translationServiceUrl, language, name) {
+ const url = endWithSlash(translationServiceUrl) + endWithSlash(language) + 'vscode/' + endWithSlash(name);
+ const res = await fetch(url);
+ if (res.ok) {
+ const messages = await res.json();
+ return messages;
+ }
+ throw new Error(`${res.status} - ${res.statusText}`);
+}
+function createScopedLocalize(scope) {
+ return function (idx, defaultValue) {
+ const restArgs = Array.prototype.slice.call(arguments, 2);
+ return _format(scope[idx], restArgs);
+ };
+}
+function createScopedLocalize2(scope) {
+ return (idx, defaultValue, ...args) => ({
+ value: _format(scope[idx], args),
+ original: _format(defaultValue, args)
+ });
+}
+/**
+ * @skipMangle
+ */
+function localize(data, message, ...args) {
+ return _format(message, args);
+}
+/**
+ * @skipMangle
+ */
+function localize2(data, message, ...args) {
+ const original = _format(message, args);
+ return {
+ value: original,
+ original
+ };
+}
+/**
+ * @skipMangle
+ */
+function getConfiguredDefaultLocale(_) {
+ // This returns undefined because this implementation isn't used and is overwritten by the loader
+ // when loaded.
+ return undefined;
+}
+/**
+ * @skipMangle
+ */
+function setPseudoTranslation(value) {
+ isPseudo = value;
+}
+/**
+ * Invoked in a built product at run-time
+ * @skipMangle
+ */
+function create(key, data) {
+ var _a;
+ return {
+ localize: createScopedLocalize(data[key]),
+ localize2: createScopedLocalize2(data[key]),
+ getConfiguredDefaultLocale: (_a = data.getConfiguredDefaultLocale) !== null && _a !== void 0 ? _a : ((_) => undefined)
+ };
+}
+/**
+ * Invoked by the loader at run-time
+ * @skipMangle
+ */
+function load(name, req, load, config) {
+ var _a;
+ const pluginConfig = (_a = config['vs/nls']) !== null && _a !== void 0 ? _a : {};
+ if (!name || name.length === 0) {
+ // TODO: We need to give back the mangled names here
+ return load({
+ localize: localize,
+ localize2: localize2,
+ getConfiguredDefaultLocale: () => { var _a; return (_a = pluginConfig.availableLanguages) === null || _a === void 0 ? void 0 : _a['*']; }
+ });
+ }
+ const language = pluginConfig.availableLanguages ? findLanguageForModule(pluginConfig.availableLanguages, name) : null;
+ const useDefaultLanguage = language === null || language === DEFAULT_TAG;
+ let suffix = '.nls';
+ if (!useDefaultLanguage) {
+ suffix = suffix + '.' + language;
+ }
+ const messagesLoaded = (messages) => {
+ if (Array.isArray(messages)) {
+ messages.localize = createScopedLocalize(messages);
+ messages.localize2 = createScopedLocalize2(messages);
+ }
+ else {
+ messages.localize = createScopedLocalize(messages[name]);
+ messages.localize2 = createScopedLocalize2(messages[name]);
+ }
+ messages.getConfiguredDefaultLocale = () => { var _a; return (_a = pluginConfig.availableLanguages) === null || _a === void 0 ? void 0 : _a['*']; };
+ load(messages);
+ };
+ if (typeof pluginConfig.loadBundle === 'function') {
+ pluginConfig.loadBundle(name, language, (err, messages) => {
+ // We have an error. Load the English default strings to not fail
+ if (err) {
+ req([name + '.nls'], messagesLoaded);
+ }
+ else {
+ messagesLoaded(messages);
+ }
+ });
+ }
+ else if (pluginConfig.translationServiceUrl && !useDefaultLanguage) {
+ (async () => {
+ var _a;
+ try {
+ const messages = await getMessagesFromTranslationsService(pluginConfig.translationServiceUrl, language, name);
+ return messagesLoaded(messages);
+ }
+ catch (err) {
+ // Language is already as generic as it gets, so require default messages
+ if (!language.includes('-')) {
+ console.error(err);
+ return req([name + '.nls'], messagesLoaded);
+ }
+ try {
+ // Since there is a dash, the language configured is a specific sub-language of the same generic language.
+ // Since we were unable to load the specific language, try to load the generic language. Ex. we failed to find a
+ // Swiss German (de-CH), so try to load the generic German (de) messages instead.
+ const genericLanguage = language.split('-')[0];
+ const messages = await getMessagesFromTranslationsService(pluginConfig.translationServiceUrl, genericLanguage, name);
+ // We got some messages, so we configure the configuration to use the generic language for this session.
+ (_a = pluginConfig.availableLanguages) !== null && _a !== void 0 ? _a : (pluginConfig.availableLanguages = {});
+ pluginConfig.availableLanguages['*'] = genericLanguage;
+ return messagesLoaded(messages);
+ }
+ catch (err) {
+ console.error(err);
+ return req([name + '.nls'], messagesLoaded);
+ }
+ }
+ })();
+ }
+ else {
+ req([name + suffix], messagesLoaded, (err) => {
+ if (suffix === '.nls') {
+ console.error('Failed trying to load default language strings', err);
+ return;
+ }
+ console.error(`Failed to load message bundle for language ${language}. Falling back to the default language:`, err);
+ req([name + '.nls'], messagesLoaded);
+ });
+ }
+}
+
+
+/***/ })
+
+/******/ });
+/************************************************************************/
+/******/ // The module cache
+/******/ var __webpack_module_cache__ = {};
+/******/
+/******/ // The require function
+/******/ function __webpack_require__(moduleId) {
+/******/ // Check if module is in cache
+/******/ var cachedModule = __webpack_module_cache__[moduleId];
+/******/ if (cachedModule !== undefined) {
+/******/ return cachedModule.exports;
+/******/ }
+/******/ // Create a new module (and put it into the cache)
+/******/ var module = __webpack_module_cache__[moduleId] = {
+/******/ // no module.id needed
+/******/ // no module.loaded needed
+/******/ exports: {}
+/******/ };
+/******/
+/******/ // Execute the module function
+/******/ __webpack_modules__[moduleId](module, module.exports, __webpack_require__);
+/******/
+/******/ // Return the exports of the module
+/******/ return module.exports;
+/******/ }
+/******/
+/************************************************************************/
+/******/ /* webpack/runtime/define property getters */
+/******/ (() => {
+/******/ // define getter functions for harmony exports
+/******/ __webpack_require__.d = (exports, definition) => {
+/******/ for(var key in definition) {
+/******/ if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {
+/******/ Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });
+/******/ }
+/******/ }
+/******/ };
+/******/ })();
+/******/
+/******/ /* webpack/runtime/hasOwnProperty shorthand */
+/******/ (() => {
+/******/ __webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))
+/******/ })();
+/******/
+/******/ /* webpack/runtime/make namespace object */
+/******/ (() => {
+/******/ // define __esModule on exports
+/******/ __webpack_require__.r = (exports) => {
+/******/ if(typeof Symbol !== 'undefined' && Symbol.toStringTag) {
+/******/ Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+/******/ }
+/******/ Object.defineProperty(exports, '__esModule', { value: true });
+/******/ };
+/******/ })();
+/******/
+/************************************************************************/
+var __webpack_exports__ = {};
+// This entry need to be wrapped in an IIFE because it need to be isolated against other modules in the chunk.
+(() => {
+/*!*******************************************************************!*\
+ !*** ./node_modules/monaco-editor/esm/vs/editor/editor.worker.js ***!
+ \*******************************************************************/
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ initialize: () => (/* binding */ initialize)
+/* harmony export */ });
+/* 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.
+ *--------------------------------------------------------------------------------------------*/
+
+
+let initialized = false;
+function initialize(foreignModule) {
+ if (initialized) {
+ return;
+ }
+ initialized = true;
+ const simpleWorker = new _base_common_worker_simpleWorker_js__WEBPACK_IMPORTED_MODULE_0__.SimpleWorkerServer((msg) => {
+ globalThis.postMessage(msg);
+ }, (host) => new _common_services_editorSimpleWorker_js__WEBPACK_IMPORTED_MODULE_1__.EditorSimpleWorker(host, foreignModule));
+ globalThis.onmessage = (e) => {
+ simpleWorker.onmessage(e.data);
+ };
+}
+globalThis.onmessage = (e) => {
+ // Ignore first message in this case and initialize if not yet initialized
+ if (!initialized) {
+ initialize(null);
+ }
+};
+
+})();
+
+/******/ })()
+;
+//# sourceMappingURL=editor.worker.js.map
\ No newline at end of file
diff --git a/dist/editor.worker.js.map b/dist/editor.worker.js.map
new file mode 100644
index 00000000..4a95c72c
--- /dev/null
+++ b/dist/editor.worker.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"editor.worker.js","mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sCAAsC,SAAS;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACO;AACP,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACO;AACP;AACA,oBAAoB,kBAAkB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACO;AACP;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,QAAQ;AACnC;AACA;AACA;AACA;AACA,2BAA2B,QAAQ;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA,qCAAqC,eAAe;AACpD;AACA;AACA,oBAAoB,oBAAoB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,sCAAsC;AAChC;AACP;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACA;AACA;AACP;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,kCAAkC;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,iCAAiC;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,mBAAmB,cAAc;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,8DAA8D;;;;;;;;;;;;;;;;;;;;;;;;;;ACrd9D;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACO;AACP,4BAA4B,QAAQ;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA,oBAAoB,kBAAkB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA,oBAAoB,kBAAkB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACO;AACP;AACA;AACA;AACA;AACA,oBAAoB,kBAAkB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;AC9KA;AACA;AACA;AACA;AACoE;AACpE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA,uDAAuD,QAAQ;AAC/D;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA,QAAQ,6DAAiB,KAAK,0DAAkB;AAChD;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;AClDA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;ACvCA;AACA;AACA;AACA;AAC4C;AAC5C;AACA;AACA,aAAa,YAAY;AACzB,CAAC;AACM;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,4CAAK;AACtC,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL,CAAC,8CAA8C;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,8CAAO;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;AC5GsC;AACtC;AACA;AACA,QAAQ,mDAAQ;AAChB;AACA;AACA,+BAA+B,IAAI,iCAAiC,cAAc;AAClF;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;AC9kBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,UAAU;AAC1B;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,aAAa;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,aAAa;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,aAAa;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,aAAa,IAAI,aAAa,IAAI,aAAa;AACjF;AACA;AACA;AACA;AACA;AACA,+BAA+B,aAAa,IAAI,aAAa,IAAI,aAAa,IAAI,2BAA2B;AAC7G;AACA;AACA;AACA;AACA,kCAAkC,aAAa,IAAI,gCAAgC,KAAK,gCAAgC;AACxH;AACA;AACA;AACA;AACA;AACA,+BAA+B,aAAa,IAAI,gCAAgC,KAAK,gCAAgC,KAAK,wBAAwB;AAClJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,6BAA6B,EAAE,6BAA6B,EAAE,6BAA6B;AACtH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,6BAA6B,EAAE,6BAA6B,EAAE,6BAA6B,EAAE,+CAA+C;AACvK;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,sCAAsC;AAC/C,KAAK,6CAA6C;AAClD,CAAC,sBAAsB;;;;;;;;;;;;;;;;;;;AC7cvB;AACA;AACA;AACA;AAC6C;AACL;AACjC;AACP;AACA;AACA;AACA;AACA;AACA;AACA,6CAA6C,SAAS;AACtD;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,YAAY;AACpC;AACA;AACA;AACA;AACA,wBAAwB,YAAY;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC,sDAAU;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mDAAmD,SAAS;AAC5D,4BAA4B,oDAAU;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,sDAAU;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,sDAAU;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,sDAAU;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,sDAAU;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yEAAyE;AACzE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yEAAyE;AACzE;AACA;AACA;AACA,wDAAwD;AACxD;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,sDAAU;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6EAA6E;AAC7E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6EAA6E;AAC7E;AACA;AACA;AACA,4DAA4D;AAC5D;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC,4CAA4C;AACjF;AACA;AACA;AACA;AACA;AACA,sDAAsD,gCAAgC;AACtF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4CAA4C;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,sDAAU;AACtC;AACA;AACA;AACA;AACA;AACA;AACA,sDAAsD,gCAAgC;AACtF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,oBAAoB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yCAAyC,QAAQ;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kDAAkD,SAAS;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC,iBAAiB;AACrD,wCAAwC,iBAAiB;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,YAAY;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC,sDAAU;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;ACl4BA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;AC/BA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACA;AACP;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA,gBAAgB,gBAAgB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,mDAAmD;AACvE;AACO;AACP;AACA;AACA;AACA;AACO;AACP;AACA,8CAA8C,KAAK;AACnD;AACA;AACA;AACA;AACA;AACO;AACP;AACA,2CAA2C,KAAK;AAChD;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACrJgD;AACW;AACoC;AAClD;AACF;AAC3C;AACA;AACA;AACA;AACA,wDAAwD;AACxD;AACA;AACA;AACA;AACA;AACO;AACP;AACA,uBAAuB,qDAAU;AACjC;AACA;AACA,oBAAoB,uCAAuC;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iFAAiF,SAAS,6BAA6B;AACvH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,iEAAkB;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB,aAAa;AACb;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,sBAAsB;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,aAAa;AAChC;AACA;AACA;AACA;AACA;AACA,qCAAqC,2FAA2F;AAChI;AACA;AACA;AACA;AACA,mBAAmB,aAAa;AAChC;AACA;AACA;AACA;AACA;AACA,qCAAqC,2FAA2F;AAChI;AACA;AACA;AACA;AACA,qDAAqD,kBAAkB;AACvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,uBAAuB;AAC/B;AACA;AACA;AACA;AACA;AACA,wBAAwB,0DAAe;AACvC;AACA;AACA;AACA;AACA,eAAe,2DAAY;AAC3B;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uCAAuC,0DAAe;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,sBAAsB;AAChB;AACP;AACA;AACA;AACA;AACA;AACA,uBAAuB,KAAK,GAAG,yBAAyB;AACxD;AACA;AACA;AACA,8BAA8B,oDAAS;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,UAAU,6CAA6C,eAAe,6CAA6C,SAAS;AACzJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,sBAAsB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2EAA2E;AAC3E,mEAAmE,KAAK,GAAG;AAC3E;AACA,4CAA4C;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0DAA0D,QAAQ,wEAAwE;AAC1I,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,sBAAsB;AACvD,uBAAuB,qDAAU;AACjC;AACA;AACA;AACA,uBAAuB,qDAAU;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,2DAAY,SAAS,+EAA+E,kCAAkC;AACjK,uCAAuC,0DAAe;AACtD;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,sBAAsB;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+GAA+G,yDAAiB;AAChI;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iFAAiF;AACjF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA,+BAA+B,sDAAU;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0DAA0D,cAAc;AACxE;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA,IAAI;AACJ;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,2DAAY,CAAC,wEAAwB;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB,IAAI;AACJ;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA,kCAAkC,qDAAU;AAC5C;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;AChqCA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;AC7BA;AACA;AACA;AACA;AACwC;AACxC;AACA;AACA;AACO;AACP;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP,iEAAiE;AACjE;AACA;AACA;AACA;AACO;AACP;AACA,uCAAuC,YAAY;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,WAAW;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,wDAAuB;AACvC;AACA;AACA,wBAAwB,uDAAsB;AAC9C;AACA,oCAAoC,yDAAwB;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,uDAAsB;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,mBAAmB;AAC3C;AACA;AACA,yBAAyB,oBAAoB;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,QAAQ;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D;;;;;;;;;;;;;;;ACjQ7D;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uCAAuC,QAAQ;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,WAAW;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,YAAY;AACpC;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,sBAAsB,oBAAoB;AACtE;AACA;AACA,CAAC,4BAA4B;;;;;;;;;;;;;;;;;;;;ACnI7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACA;AACP;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACO;AACP,gBAAgB,mCAAmC;AACnD;AACA;AACA,gBAAgB,kCAAkC;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oFAAoF,sBAAsB;AAC1G;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8EAA8E,SAAS,mBAAmB,YAAY;AACtH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACM;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,oCAAoC;AAC9B;AACP;AACA;AACA;;;;;;;;;;;;;;;ACnXA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACpC2D;AAClB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACO;AACP;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA,wBAAwB,6BAA6B;AACrD;AACO;AACP;AACA;AACO;AACP,QAAQ,kDAAQ;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qDAAqD,kBAAkB;AACvE;AACO;AACP;AACA;AACA;AACA;AACA;AACA,oDAAoD,kBAAkB;AACtE;AACA;AACA;AACO;AACP;AACA,iBAAiB,wEAAwB;AACzC;AACA;AACA,SAAS;AACT,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,8BAA8B;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,8BAA8B;AAC5D;AACA,mBAAmB,qBAAqB;AACxC;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,eAAe;AACjD;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;ACtWA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;AC3HA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,qCAAqC;AACrC;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,qCAAqC;AACrC;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,qCAAqC;AACrC;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;AC7hBA;AACA;AACA;AACA;AACuE;AAChE;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2EAA2E,uDAAY;AACvF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA,QAAQ,4DAAiB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,mDAAQ;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP,SAAS,mDAAQ;AACjB;AACA;AACA,QAAQ,mDAAQ;AAChB;AACA;AACA;AACA,wBAAwB,mDAAQ,sBAAsB,mDAAQ;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,oBAAoB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;AClLA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACwC;AACxC,6BAA6B;AAC7B,6BAA6B;AAC7B,6BAA6B;AAC7B,8BAA8B;AAC9B,qBAAqB;AACrB,+BAA+B;AAC/B,gCAAgC;AAChC,uBAAuB;AACvB,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,KAAK,IAAI,MAAM,EAAE,YAAY,UAAU,SAAS;AAC1E,kCAAkC,cAAc;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,iDAAgB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,kBAAkB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+CAA+C,UAAU;AACzD;AACA;AACA;AACA;AACA;AACA,8BAA8B,UAAU,EAAE,6BAA6B;AACvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,sBAAsB,EAAE,qBAAqB;AACxD;AACA;AACA;AACA,wCAAwC,IAAI,EAAE,KAAK,OAAO,IAAI,EAAE,IAAI,EAAE,KAAK;AAC3E;AACO;AACP;AACA;AACA;AACA;AACA;AACA,8CAA8C,SAAS;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,4CAAW;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,4CAAW,KAAK,eAAe,MAAM,4CAAW;AACvE;AACA;AACA;AACA;AACA;AACA,8BAA8B,eAAe;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAAgD,UAAU,IAAI,oBAAoB;AAClF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,oBAAoB,IAAI,aAAa;AACvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,eAAe,IAAI,aAAa;AAC/C,eAAe,eAAe,EAAE,aAAa;AAC7C,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C,UAAU,IAAI,iBAAiB;AACzE;AACA;AACA;AACA,4CAA4C,UAAU,IAAI,oBAAoB;AAC9E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC,KAAK;AAC1C;AACA,+BAA+B,OAAO,IAAI,KAAK,OAAO,OAAO,EAAE,KAAK;AACpE,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,kBAAkB;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC,IAAI;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2CAA2C;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,yBAAyB;AACvD;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,YAAY;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yDAAyD;AACzD;AACA;AACA;AACA;AACA,iDAAiD;AACjD;AACA;AACA;AACA;AACA;AACA;AACA,yDAAyD;AACzD;AACA;AACA;AACA;AACA,yDAAyD;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAAgD,cAAc;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,IAAI,EAAE,6BAA6B;AACzD;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C,sBAAsB;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,aAAa;AAC1C;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,aAAa;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sCAAsC,YAAY;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,YAAY;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sCAAsC,YAAY;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,cAAc;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,4CAAW;AACnC;AACA;AACA;AACA;AACA,iBAAiB,4CAAW;AAC5B,CAAC;AACM;AACP;AACA;AACA;AACA;AACA,8CAA8C,8BAA8B;AAC5E;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,KAAK,GAAG,aAAa;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,aAAa;AACpC;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,KAAK;AACrC,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,wBAAwB,kBAAkB;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,IAAI;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,YAAY;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qDAAqD;AACrD;AACA;AACA;AACA;AACA,8CAA8C;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA,yDAAyD;AACzD;AACA;AACA;AACA;AACA,qDAAqD;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAAgD,cAAc;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,IAAI,EAAE,kCAAkC;AAC1D,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sCAAsC,QAAQ;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sCAAsC,QAAQ;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,QAAQ;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sCAAsC,QAAQ;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,YAAY;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACh3CP;AACA;AACA;AACA;AACA;AACoC;AAC7B;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,+DAA8B;AAC3D;AACA;AACA;AACA;AACA,IAAI,6CAAY,GAAG,+CAA+C,OAAO,IAAI;AAC7E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACP;AACA;AACA;AACA;AACA;AACO;AACA;AACP;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA,sDAAsD,SAAS;AAC/D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,sCAAsC,+BAA+B;AACrE;AACA;AACA;AACA,CAAC;AACM;AACP;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;ACjKP;AACA;AACA;AACA;AACuD;AACvD;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,iCAAiC;AAC1D,qBAAqB,6BAA6B;AAClD,oBAAoB,4BAA4B;AAChD,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA,yBAAyB,0BAA0B;AACnD,qBAAqB,sBAAsB;AAC3C,oBAAoB,qBAAqB;AACzC,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,OAAO,mDAAS,aAAa,qDAAW,wBAAwB;AACzF,qBAAqB,kBAAkB,gCAAgC;AACvE;AACA,oBAAoB,YAAY;AAChC,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA,qDAAqD;AACrD;AACO;AACP;AACA;AACA;AACA;AACO;;;;;;;;;;;;;;;ACzDP;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACvBA;AACA;AACA;AACA;AACA;AAC+C;AACd;AAC1B;AACP;AACA;AACA;AACA;AACA;AACA,wBAAwB,MAAM;AAC9B;AACA;AACA,8BAA8B,GAAG;AACjC;AACA,iCAAiC,EAAE;AACnC;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA,kCAAkC;AAClC,kCAAkC;AAClC,mCAAmC;AACnC;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACO;AACP,+BAA+B,EAAE;AACjC;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP,mCAAmC,EAAE;AACrC;AACO;AACP;AACA;AACO,yDAAyD;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACO;AACP,sCAAsC,SAAS;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP,wBAAwB,SAAS;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP,6BAA6B,QAAQ;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP,WAAW,gCAAgC;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACO;AACP,WAAW,gCAAgC;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACO;AACP;AACA;AACO;AACP;AACA;AACO;AACP;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA,gBAAgB,SAAS;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA,gBAAgB,SAAS;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACO;AACP;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACO,mDAAmD;AAC1D;AACA;AACA;AACO;AACP;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACA;AACP;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA,sBAAsB;AACtB;AACA;AACA,kBAAkB,uBAAuB,iBAAiB;AAC1D;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACA;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iDAAiD,0CAAI;AACrD;AACA;AACA,wBAAwB,qxmBAAqxmB;AAC7ymB,CAAC;AACD,gCAAgC,wDAAiB;AACjD;AACA;AACA,wBAAwB,gBAAgB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,mCAAmC,0CAAI;AAChC;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC/yBA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACO;AACP;AACA,6DAA6D,KAAK;AAClE;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACO;AACP;AACA,oBAAoB,SAAS;AAC7B;AACA;AACA;AACO;AACP;AACA;AACA,0EAA0E,WAAW;AACrF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;ACtHA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;ACrBA;AACA;AACA;AACA;AACmC;AACO;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA,yDAAyD,0BAA0B,cAAc,YAAY,SAAS,aAAa,UAAU,gBAAgB,aAAa,EAAE;AAC5K;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kEAAkE,YAAY;AAC9E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,2CAA2C;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,mDAAS;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,mDAAS;AACrB,+BAA+B,2CAAW;AAC1C;AACA;AACA,sBAAsB,2CAAW;AACjC;AACA,0BAA0B,eAAe;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,mDAAS;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,2BAA2B;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,mBAAmB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA,qBAAqB,cAAc,EAAE,SAAS;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,mDAAS;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,2CAA2C;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,+BAA+B,GAAG,eAAe,GAAG;AAC/E;AACA;AACA;AACA;AACA;AACA,0BAA0B,+BAA+B,GAAG,eAAe,GAAG;AAC9E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;AC1lBA;AACA;AACA;AACA;AAC8D;AACxB;AACO;AACK;AACX;AACE;AACzC;AACA;AACO;AACP,SAAS,+CAAK;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,4BAA4B,8CAAO;AACnC;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,2BAA2B,0EAA8B;AACzD;AACA,wEAAwE,0EAA8B;AACtG,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,qBAAqB;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,iCAAiC,qDAAU;AAClD;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,iEAAiE,WAAW;AAC5E;AACA;AACA;AACA;AACA;AACA;AACA,yDAAyD,WAAW;AACpE;AACA;AACA;AACA,wDAAwD,UAAU;AAClE;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,8DAAiB;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iDAAiD,2DAA0B;AAC3E;AACA;AACA;AACA,sCAAsC,2DAA0B;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yDAAyD,WAAW;AACpE;AACA;AACA;AACA;AACA;AACA;AACA,iDAAiD,WAAW;AAC5D;AACA;AACA;AACA,gDAAgD,UAAU;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC,8DAAiB;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,8DAAiB;AACzC,aAAa;AACb,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;;;;;;;;;;;;;;;;;ACxbA;AACA;AACA;AACA;AACuD;AACvD;AACA;AACA;AACO;AACP;AACA,6BAA6B,6DAAO;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,6DAAO;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;ACvDA;AACA;AACA;AACA;AACoE;AACrB;AACZ;AAC4F;AAC/H;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,uBAAuB;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,sEAAkB,oBAAoB,iBAAiB,yCAAyC,uBAAuB;AAC7I;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,qBAAqB,GAAG,4BAA4B;AACvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,4CAAK;AACxB;AACA;AACA,mBAAmB,4CAAK;AACxB;AACA;AACA;AACA,oDAAoD,0CAA0C;AAC9F;AACA;AACA;AACA;AACA;AACA,oDAAoD,0CAA0C;AAC9F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,wDAAW;AAC9B;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,0FAA8B;AAChE,kCAAkC;AAClC,yCAAyC,iFAAqB;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yCAAyC,8EAAkB;AAC3D;AACA;AACA;AACA,yCAAyC,8EAAkB;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,0FAA8B;AAChE,kCAAkC;AAClC,yCAAyC,iFAAqB;AAC9D;AACA;AACA;AACA;AACA;AACA,wCAAwC,8BAA8B;AACtE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;ACnSA;AACA;AACA;AACA;AACoE;AACpE;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,sEAAkB,mBAAmB,gBAAgB;AAC3E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,WAAW,IAAI,kBAAkB;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,sEAAkB,4BAA4B,gBAAgB;AACpF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,sEAAkB,4BAA4B,gBAAgB;AACpF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,uBAAuB;AACxD;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;AC9LA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;AC3IA;AACA;AACA;AACA;AACyC;AACzC;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,kDAAQ;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,kDAAQ;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;AC/YA;AACA;AACA;AACA;AACyC;AACN;AACnC;AACA;AACA;AACA;AACO,wBAAwB,4CAAK;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,kDAAQ;AAC3B;AACA;AACA;AACA;AACA;AACA,mBAAmB,kDAAQ;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wCAAwC,SAAS;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;AC7IA;AACA;AACA;AACA;AAC+D;AACxD,sCAAsC,wEAAmB;AAChE;AACA;AACA,qDAAqD,SAAS;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACO;;;;;;;;;;;;;;;;;;;;ACxBP;AACA;AACA;AACA;AAC4D;AACI;AACzD,gDAAgD,EAAE,IAAI;AAC7D;AACA;AACA;AACA;AACA;AACA,wDAAwD,IAAI,MAAM;AAClE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACA;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,kEAAU;AACrC;AACA;AACA;AACA;AACA,CAAC;AACM;AACP;AACA;AACA;AACA,iBAAiB,8DAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;AC3HA;AACA;AACA;AACA;AACuE;AACG;AACf;AACpD;AACP;AACA,yDAAyD,6DAAW,wBAAwB,6DAAW;AACvG;AACA;AACA,yDAAyD,6DAAW,wBAAwB,6DAAW;AACvG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA,QAAQ,uEAAe;AACvB;AACA,SAAS;AACT;AACA;AACA;AACA,oCAAoC,6DAAW,2CAA2C,6DAAW;AACrG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,gBAAgB,MAAM,eAAe;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA,kBAAkB,cAAc,MAAM,aAAa;AACnD;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA,sBAAsB,sEAAkB;AACxC;AACA;AACA,yCAAyC,eAAe;AACxD;AACA;AACA;AACA,gCAAgC;AAChC;AACA,sBAAsB;AACtB;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;ACrHA;AACA;AACA;AACA;AAC2D;AAC6B;AAClD;AACtC;AACA;AACA;AACA;AACO;AACP,4CAA4C,8DAAe;AAC3D;AACA,mBAAmB,kEAAmB;AACtC;AACA;AACA;AACA;AACA,+BAA+B,8CAAO;AACtC,+BAA+B,8CAAO;AACtC,4BAA4B,8CAAO;AACnC;AACA,yBAAyB,uBAAuB;AAChD,6BAA6B,uBAAuB;AACpD;AACA,2BAA2B,kEAAmB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,2DAAY,KAAK,6DAAW,iCAAiC,6DAAW;AACxG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,kEAAmB;AACtC;AACA;;;;;;;;;;;;;;;;;ACjGA;AACA;AACA;AACA;AAC2D;AAC6B;AACxF;AACA;AACA;AACO;AACP,kCAAkC,8DAAe;AACjD;AACA;AACA;AACA,mBAAmB,kEAAmB;AACtC;AACA,2BAA2B;AAC3B,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,kEAAmB;AAC1C;AACA,2CAA2C,QAAQ;AACnD;AACA;AACA,iCAAiC,iBAAiB;AAClD;AACA;AACA,6EAA6E;AAC7E,kFAAkF;AAClF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,2DAAY,KAAK,6DAAW,+BAA+B,6DAAW;AACtG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,kEAAmB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;AC9JA;AACA;AACA;AACA;AAC6D;AACP;AACkD;AACZ;AACpC;AACU;AACV;AACa;AACb;AACgB;AACjE;AACP,UAAU,yBAAyB;AACnC;AACA;AACA;AACA;AACA;AACA,IAAI,gEAAQ;AACZ;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,wDAAiB;AACvC;AACA;AACA,sBAAsB,wDAAiB;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,8DAAgB;AAC3C;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA,aAAa;AACb;AACA;AACA;AACA,oCAAoC,uDAAM;AAC1C;AACA,sDAAsD,gDAAgD;AACtG,2BAA2B,2BAA2B,GAAG,+BAA+B,GAAG,+BAA+B;AAC1H,2CAA2C,WAAW,yDAAS,YAAY;AAC3E;AACA;AACA;AACA,iBAAiB,iEAAS,kCAAkC,oEAAgB;AAC5E;AACA;AACA,sDAAsD,gDAAgD;AACtG,2BAA2B,2BAA2B,GAAG,+BAA+B,GAAG,+BAA+B;AAC1H,6CAA6C,yDAAS;AACtD;AACA,gDAAgD,OAAO;AACvD;AACA;AACA;AACA;AACA,4DAA4D,yDAAS;AACrE,4DAA4D,yDAAS;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,oEAAY,CAAC,iEAAS,kCAAkC,oEAAgB;AAClG,4BAA4B,4DAAY;AACxC,4BAA4B,4DAAY;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,8DAAgB;AAC3C;AACA;AACA;AACA;AACA,eAAe,iEAAS,kCAAkC,oEAAgB;AAC1E,kCAAkC,uEAAe;AACjD,oBAAoB,kBAAkB;AACtC;AACA;AACA,uCAAuC,8EAAkB;AACzD;AACA;AACA,sCAAsC,8EAAkB;AACxD;AACA;AACA,8BAA8B,0BAA0B;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC,yDAAS;AAC9C,qCAAqC,yDAAS;AAC9C;AACA;AACA,iCAAiC,6BAA6B;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC,yDAAS;AAC9C,qCAAqC,yDAAS;AAC9C;AACA;AACA,2BAA2B,8DAAgB,KAAK,yDAAS,0GAA0G,yDAAS;AAC5K;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sCAAsC,iFAAkB;AACxD,qDAAqD,8EAAsB,cAAc,6DAAW,oBAAoB,8EAAsB,cAAc,6DAAW;AACvK;AACA,qBAAqB,sEAAY;AACjC;AACA;AACA,iBAAiB,kDAAO;AACxB;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,wBAAwB,kBAAkB;AAC1C,iBAAiB,kDAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,iEAAS,kCAAkC,oEAAgB;AAC1E;AACA,oBAAoB,kBAAkB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,uEAAe;AACjD;AACA;AACA,mBAAmB,8DAAgB,KAAK,yDAAS,YAAY,yDAAS;AACtE,4CAA4C,8EAAkB;AAC9D;AACA;AACA,KAAK;AACL;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACrPA;AACA;AACA;AACA;AAC4E;AACK;AAC7B;AACI;AACZ;AAC+C;AACL;AACd;AACb;AACkK;AAC9J;AACa;AACP;AACpB;AAC1C;AACP;AACA,6CAA6C,+FAAyB;AACtE,yCAAyC,iFAAkB;AAC3D;AACA;AACA,yCAAyC,8DAAM;AAC/C,uBAAuB,6DAAS;AAChC;AACA;AACA,uBAAuB,6DAAS;AAChC,oBAAoB,uEAAwB,KAAK,yDAAS,mCAAmC,yDAAS;AACtG,wBAAwB,2DAAY,KAAK,iDAAK,+DAA+D,iDAAK;AAClH;AACA;AACA;AACA,6DAA6D,yEAAe,gBAAgB,qEAAW;AACvG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,2DAAY;AAC1C,8BAA8B,2DAAY;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,yBAAyB,yFAAqB;AAC9C,yBAAyB,4GAAwC;AACjE;AACA;AACA;AACA;AACA;AACA,4BAA4B,qBAAqB;AACjD;AACA;AACA;AACA;AACA,6FAA6F,sEAAY,KAAK,6DAAW,kCAAkC,6DAAW;AACtK;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,gEAAQ;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,gEAAQ;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,mBAAmB,6DAAS;AAC5B;AACA;AACA,sBAAsB,wEAAiB;AACvC;AACA,kFAAkF,sEAAY;AAC9F;AACA,uBAAuB,6DAAS;AAChC,SAAS;AACT;AACA;AACA;AACA,2BAA2B,+EAAsB;AACjD,2BAA2B,+EAAsB;AACjD;AACA;AACA;AACA;AACA,gBAAgB,yFAAqB;AACrC,gBAAgB,wGAAoC;AACpD,gBAAgB,sFAAkB;AAClC,gBAAgB,+GAA2C;AAC3D,4CAA4C,2DAAY;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA,oBAAoB,uEAAe;AACnC;AACA;AACA;AACA,yBAAyB,uEAAwB;AACjD;AACA,IAAI,gEAAQ;AACZ;AACA;AACA;AACA;AACA;AACA,eAAe,0EAAkB;AACjC;AACA;AACA;AACA,KAAK;AACL;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,yDAAS;AAC3C,kCAAkC,yDAAS;AAC3C,eAAe,uEAAwB;AACvC;;;;;;;;;;;;;;;;;;;;;;AC3NA;AACA;AACA;AACA;AACyE;AACjB;AACiB;AAClE;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,WAAW;AACvB;AACA;AACA;AACA,YAAY,gBAAgB;AAC5B;AACA,qBAAqB,kBAAkB,GAAG;AAC1C,oBAAoB,sBAAsB;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,0BAA0B;AAC9C;AACA;AACA;AACA;AACA;AACA,wBAAwB,aAAa;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAAgD,sEAAY,KAAK,6DAAW,uEAAuE,6DAAW;AAC9J;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,uBAAuB;AAC3C;AACA;AACA;AACA;AACA;AACA,wBAAwB,YAAY;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC,sEAAY,KAAK,6DAAW,uEAAuE,6DAAW;AAClJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,eAAe;AAC3B;AACA,YAAY,eAAe;AAC3B,YAAY,6CAA6C;AACzD,YAAY,oEAAoE;AAChF;AACA,YAAY,oEAAoE;AAChF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,0BAA0B;AAC9C;AACA;AACA;AACA,mCAAmC,6DAAW;AAC9C,mCAAmC,6DAAW;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC,qBAAqB;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4CAA4C,sEAAY;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,sEAAY;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC,6DAAW;AAC/C,oCAAoC,6DAAW;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,kBAAkB;AAC1C;AACA;AACA;AACA,2CAA2C,6DAAW;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,kBAAkB;AAC1C;AACA;AACA;AACA,2CAA2C,6DAAW;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,IAAI,4EAAoB;AACxB;AACA;AACA;AACA;AACA;AACA,6CAA6C,6DAAW;AACxD;AACA;AACA;AACA,6CAA6C,6DAAW;AACxD;AACA;AACA;AACA,+BAA+B,sEAAY,kDAAkD,oEAAU,iCAAiC,oEAAU;AAClJ;AACA;AACA,KAAK;AACL;AACA;;;;;;;;;;;;;;;AC/WA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;ACjCA;AACA;AACA;AACA;AACuH;AAC/D;AACN;AACN;AACP;AAC9B;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,6DAAW;AACvC;AACA;AACA;AACA;AACA,2CAA2C,iCAAiC;AAC5E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,iBAAiB;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,UAAU;AACpC;AACA;AACA,gCAAgC,6DAAW;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,uDAAQ;AAC/B;AACA,kBAAkB,iFAAqB;AACvC,mBAAmB,uDAAQ;AAC3B;AACA;AACA,eAAe,iDAAK;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,6DAAW;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,8EAAkB;AAC9C,0BAA0B,+EAAmB;AAC7C,mBAAmB,6DAAW;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,kDAAO;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;ACrLA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAAgD,sCAAsC;AACtF;AACA,4BAA4B,iBAAiB;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,eAAe;AACvC;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;AC5DA;AACA;AACA;AACA;AAC4D;AACT;AACwB;AAChB;AAClB;AACqC;AAC7B;AACjD;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC,yDAAS;AAC7C;AACA;AACA,oCAAoC,yDAAS;AAC7C;AACA;AACA;AACA;AACA,oCAAoC,yDAAS;AAC7C;AACA;AACA,oCAAoC,yDAAS;AAC7C;AACA,6BAA6B,sEAAwB,yGAAyG,0DAAY,KAAK,iDAAK,sGAAsG,iDAAK;AAC/R;AACA;AACA;AACA;AACA,iCAAiC,sEAAwB;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,gEAAQ;AAChB,mBAAmB,0EAAkB;AACrC;AACA;AACA;AACA,SAAS;AACT,mBAAmB,4DAAS;AAC5B;AACA;AACA;AACA,yBAAyB,8DAAO;AAChC;AACA;AACA;AACA;AACA;AACA;AACA,+CAA+C,YAAY;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iDAAiD,SAAS;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC,mBAAmB;AACxD;AACA;AACA;AACA,wCAAwC,iBAAiB;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iIAAiI,uBAAuB,GAAG,mBAAmB;AAC9K;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6CAA6C,SAAS;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4DAA4D,YAAY;AACxE;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gJAAgJ;AAChJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wDAAwD,YAAY;AACpE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D,SAAS;AACtE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,4EAA+B;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,2EAA8B;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;ACjdA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;AC1BA;AACA;AACA;AACA;AACuE;AAC2B;AAC3F;AACP,yBAAyB,gFAAuB;AAChD,0BAA0B,2GAAwB;AAClD;;;;;;;;;;;;;;;;;;ACTA;AACA;AACA;AACA;AACiD;AACjD;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA,uDAAuD,yDAAS,6DAA6D,yDAAS;AACtI;AACA;AACA;AACA;AACA;AACA;AACA,mDAAmD,yDAAS,wDAAwD,yDAAS;AAC7H;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,EAAE,yBAAyB,IAAI,0BAA0B;AAC1E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA,iBAAiB,EAAE,8BAA8B,IAAI,+BAA+B;AACpF;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACrEwD;AACT;AACP;AACqD;AACrD;AACjC;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA,kDAAkD,6DAAO;AACzD,oDAAoD,6DAAO;AAC3D,uDAAuD,6DAAO;AAC9D,iDAAiD,6DAAO;AACxD,oDAAoD,6DAAO;AAC3D,iDAAiD,6DAAO;AACxD,kDAAkD,6DAAO;AACzD,qDAAqD,6DAAO;AAC5D,kDAAkD,6DAAO;AACzD,oDAAoD,6DAAO;AAC3D,kDAAkD,6DAAO;AACzD,qDAAqD,6DAAO;AAC5D,iDAAiD,6DAAO;AACxD,kDAAkD,6DAAO;AACzD,iDAAiD,6DAAO;AACxD,qDAAqD,6DAAO;AAC5D,iDAAiD,6DAAO;AACxD,uDAAuD,6DAAO;AAC9D,oDAAoD,6DAAO;AAC3D,oDAAoD,6DAAO;AAC3D,iDAAiD,6DAAO;AACxD,kDAAkD,6DAAO;AACzD,iDAAiD,6DAAO;AACxD,sDAAsD,6DAAO;AAC7D,wDAAwD,6DAAO;AAC/D,mDAAmD,6DAAO;AAC1D,0DAA0D,6DAAO;AACjE,iDAAiD,6DAAO;AACxD,kDAAkD,6DAAO;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,6DAAO;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,kDAAkD;AACnD;AACA,WAAW,4DAA4D;AACvE;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,kEAAkE;AAC5D;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,iDAAK;AACpB;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA,CAAC,4DAA4D;AAC7D;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,sDAAsD;AACvD;AACA;AACA;AACO;AACP;AACA,WAAW,oDAAG;AACd,WAAW,iDAAK;AAChB,YAAY,iDAAK,yCAAyC,iDAAK;AAC/D;AACA;AACA;AACA;AACO;AACP,iCAAiC,iDAAQ;AACzC,mCAAmC,iDAAQ;AAC3C,gCAAgC,iDAAQ;AACxC,oCAAoC,iDAAQ;AAC5C,sCAAsC,iDAAQ;AAC9C,+BAA+B,iDAAQ;AACvC,sCAAsC,iDAAQ;AAC9C,iCAAiC,iDAAQ;AACzC,gCAAgC,iDAAQ;AACxC,+BAA+B,iDAAQ;AACvC,oCAAoC,iDAAQ;AAC5C,qCAAqC,iDAAQ;AAC7C,+BAA+B,iDAAQ;AACvC,iCAAiC,iDAAQ;AACzC,iCAAiC,iDAAQ;AACzC,oCAAoC,iDAAQ;AAC5C,gCAAgC,iDAAQ;AACxC,kCAAkC,iDAAQ;AAC1C,kCAAkC,iDAAQ;AAC1C,oCAAoC,iDAAQ;AAC5C,kCAAkC,iDAAQ;AAC1C,mCAAmC,iDAAQ;AAC3C,kCAAkC,iDAAQ;AAC1C,kCAAkC,iDAAQ;AAC1C,yCAAyC,iDAAQ;AACjD,oCAAoC,iDAAQ;AAC5C;AACA;AACA;AACA;AACO;AACP,WAAW,iDAAQ,sBAAsB,GAAG,EAAE,EAAE;AAChD;AACA;AACA;AACA;AACO;AACP;AACA;AACA,wCAAwC,6DAAO;AAC/C,0CAA0C,6DAAO;AACjD,6CAA6C,6DAAO;AACpD,2CAA2C,6DAAO;AAClD,yCAAyC,6DAAO;AAChD,0CAA0C,6DAAO;AACjD,4CAA4C,6DAAO;AACnD,yCAAyC,6DAAO;AAChD,+CAA+C,6DAAO;AACtD,wCAAwC,6DAAO;AAC/C,8CAA8C,6DAAO;AACrD,6CAA6C,6DAAO;AACpD,6CAA6C,6DAAO;AACpD,6CAA6C,6DAAO;AACpD,2CAA2C,6DAAO;AAClD,2CAA2C,6DAAO;AAClD,4CAA4C,6DAAO;AACnD,0CAA0C,6DAAO;AACjD,2CAA2C,6DAAO;AAClD,wCAAwC,6DAAO;AAC/C,yCAAyC,6DAAO;AAChD,+CAA+C,6DAAO;AACtD,2CAA2C,6DAAO;AAClD,0CAA0C,6DAAO;AACjD,6CAA6C,6DAAO;AACpD,kDAAkD,6DAAO;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,6DAAO;AAC1B;AACA;AACA;AACA;AACA,CAAC,kCAAkC;AACnC;AACO;AACP;AACO;AACP;AACA,kBAAkB,wBAAwB;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,uBAAuB;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,0BAA0B;AACpB;AACP;AACA;AACA;AACA,CAAC,sCAAsC;AACvC;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,iCAAiC,0EAAwB;;;;;;;;;;;;;;;;AC9WhE;AACA;AACA;AACA;AAC4D;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,wDAAK;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,wDAAK,KAAK,uDAAI;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4FAA4F,EAAE,oBAAoB,EAAE,oBAAoB,EAAE,oBAAoB,EAAE;AAChK;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2EAA2E,EAAE,qDAAqD,EAAE,qDAAqD,EAAE;AAC3L;AACA;AACA;AACA,2EAA2E,EAAE,qDAAqD,EAAE,qDAAqD,EAAE;AAC3L;AACA;AACA;AACA,4GAA4G,IAAI,UAAU,IAAI,iBAAiB,IAAI,UAAU,IAAI;AACjK;AACA;AACA;AACA,4GAA4G,IAAI,UAAU,IAAI,iBAAiB,IAAI,UAAU,IAAI;AACjK;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;ACtIA;AACA;AACA;AACA;AACqE;AACrE;AACA;AACA;AACA,2CAA2C,SAAS;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA,4CAA4C,SAAS;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4CAA4C,SAAS;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,6EAAmB;AAC7C;AACA;AACA,wBAAwB,yCAAyC;AACjE;AACA;AACA,+CAA+C;AAC/C,wBAAwB,uCAAuC;AAC/D;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC,KAAK;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,0DAA0D,gBAAgB;AAC1E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;AC7QA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B,uBAAuB;AACvB,mCAAmC;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAAgD,4BAA4B;AAC5E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;ACpFA;AACA;AACA;AACA;AACsD;AACtD;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA,CAAC,8CAA8C;AAC/C;AACA;AACA;AACO;AACP;AACA;AACA;AACA,CAAC,0CAA0C;AAC3C;AACA;AACA;AACO;AACP;AACA;AACA;AACA,CAAC,0CAA0C;AACpC;AACP;AACA;AACA;AACA;AACA;AACA,CAAC,0DAA0D;AACpD;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,+DAAM;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;;;;;;;;;;;;;;;;;;AC3IA;AACA;AACA;AACA;AAC6D;AACd;AACY;AACpD;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uCAAuC,uDAAQ;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,iBAAiB;AAC7C;AACA;AACA,mCAAmC,oEAAiB;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,mEAAU;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,wBAAwB;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;ACjHA;AACA;AACA;AACA;AAC6D;AACL;AACjD;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,8DAAQ;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,8DAAQ;AACxB,gBAAgB,8DAAQ;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,8DAAQ;AAC7B,gBAAgB,8DAAQ;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,8DAAQ;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,YAAY;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,kBAAkB;AACtB;AACA,KAAK,oCAAoC;AACzC;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,mEAAW;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yEAAyE,SAAS;AAClF;AACA;AACA;AACA,4BAA4B,WAAW;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;AC9NA;AACA;AACA;AACA;AAC2D;AACkB;AAC9B;AACN;AACW;AACpD;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,iEAAoB;AACxC;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,iDAAU,8BAA8B,yFAAuB;AAClF;AACA;AACO;AACP;AACA;AACA;AACA,+CAA+C,SAAS;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA,mBAAmB,gDAAS;AAC5B;AACA;AACA,6CAA6C,SAAS;AACtD;AACA;AACA,eAAe,gDAAS;AACxB;AACA;AACA;AACA;AACA;AACA,+CAA+C,aAAa;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,iDAAK;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+DAA+D,wEAAwE;AACvI;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8CAA8C,gDAAS,KAAK,iDAAK;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0DAA0D,iDAAK;AAC/D;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC,uDAAQ;AAC5C;AACA;AACA;AACA;AACA;AACA,+CAA+C,iDAAK;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D,uDAAQ;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,gBAAgB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uCAAuC,iDAAK;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gEAAgE,iDAAK;AACrE;AACA;AACA;AACA;AACA;AACA;AACA,iEAAiE,uDAAQ;AACzE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,gBAAgB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6CAA6C,iDAAK;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,qEAAwB;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;ACncA;AACA;AACA;AACA;AAC+E;AACvB;AACI;AACV;AACH;AACN;AACQ;AACT;AAC4B;AAC7D;AACP;AACA,eAAe,kEAAQ;AACvB;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA,iCAAiC,iFAAuB;AACxD,iBAAiB,0DAAO;AACxB,iBAAiB,mEAAuB;AACxC;AACA,kBAAkB,uDAAQ;AAC1B,eAAe,iDAAK;AACpB,mBAAmB,yDAAS;AAC5B,4BAA4B,8EAAkC;AAC9D,wBAAwB,0EAA8B;AACtD,mBAAmB,qEAAyB;AAC5C,aAAa,oDAAG;AAChB,eAAe,gDAAK;AACpB;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACvCA;AACA;AACA;AACA;AAC+D;AACb;AACH;AACN;AACwC;AACA;AACrB;AACyB;AAC5B;AACK;AACiB;AACZ;AACoB;AACM;AAC7F;AACA;AACA;AACA,0BAA0B,sEAAe;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,wBAAwB;AAChD;AACA,kDAAkD,uDAAQ;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,kEAAa,kBAAkB,8EAAyB;AACnF;AACA,uBAAuB,iDAAK;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA,sCAAsC;AACtC;AACA;AACA;AACA;AACA;AACA,0BAA0B,wDAAwD;AAClF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yCAAyC,kBAAkB;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+CAA+C,8DAA8D;AAC7G,6CAA6C,0DAA0D;AACvG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,uDAAQ;AACrB;AACA;AACA,cAAc,qBAAqB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iDAAiD,oDAAG;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA,eAAe,yFAA2B;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yDAAyD,4EAAkB,gBAAgB,4EAAkB;AAC7G;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,2BAA2B;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,iDAAK;AAC5B;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,gCAAgC,0BAA0B;AAC1D,gBAAgB,iDAAK,gDAAgD,iDAAK;AAC1E,0CAA0C,iDAAK,eAAe,iDAAK,4CAA4C,iDAAK;AACpH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,mBAAmB;AACtC;AACA;AACA;AACA,gBAAgB,iDAAK;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,aAAa;AAC3C;AACA;AACA;AACA,4BAA4B,qEAAU;AACtC,8CAA8C,iDAAK;AACnD;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,iCAAiC,sEAAsE;AACjI;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,wEAAY;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,0GAA4B;AAC3C;AACA;AACA,uBAAuB,gEAAS;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+CAA+C,4BAA4B;AAC3E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oDAAoD,8DAA8D;AAClH;AACA;AACA;AACA;AACA,uBAAuB,6FAAmB;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,2EAAiB;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC,2EAAiB;AACpD;AACA;AACA;AACA,oDAAoD,+BAA+B;AACnF;AACA;AACA;AACA;AACA,eAAe;AACf,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA,wBAAwB,sEAAmB;AAC3C;;;;;;;;;;;;;;;;;;;;AC1gBA;AACA;AACA;AACA;AACyC;AACc;AACI;AACE;AACc;AACpE;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,iDAAiD;AACnF;AACA,6BAA6B,+DAAQ;AACrC;AACA;AACA;AACA;AACA;AACA;AACA,uEAAuE,yBAAyB;AAChG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,oEAAuB;AACnD;AACA;AACA;AACA;AACA;AACA,4BAA4B,oEAAuB;AACnD;AACA;AACA;AACA;AACA,+BAA+B,kEAAa,iBAAiB,oEAAmB;AAChF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,mEAAW;AACvC;AACA;AACA;AACA;AACA;AACA;AACA,wCAAwC,iDAAK;AAC7C;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA,8CAA8C,wEAA2B,6BAA6B,wEAA2B;AACjI,yBAAyB;AACzB;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA,oBAAoB,2EAA8B,0DAA0D;AAC5G;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC,wEAA2B;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,wEAA2B;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC,iEAAoB;AACzD;AACA;AACA;AACA,qBAAqB,wEAA2B;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2DAA2D,wEAA2B;AACtF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACxLA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,oDAAoD;AAC9C;AACP;AACA;AACA;AACA,CAAC,sDAAsD;AAChD;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,oEAAoE;AAC9D;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,gDAAgD;AAC1C;AACP;AACA;AACA,CAAC,8CAA8C;AAC/C;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA,CAAC,sDAAsD;AACvD;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,0EAA0E;AAC3E;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,gDAAgD;AACjD;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,4CAA4C;AAC7C;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,sDAAsD;AACvD;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,4DAA4D;AACtD;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,oCAAoC;AACrC;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,kDAAkD;AACnD;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,8CAA8C;AAC/C;AACA;AACA;AACO;AACP;AACA;AACA;AACA,CAAC,0CAA0C;AAC3C;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,oCAAoC;AAC9B;AACP;AACA;AACA;AACA;AACA;AACA,CAAC,0DAA0D;AACpD;AACP;AACA;AACA;AACA,CAAC,sCAAsC;AACvC;AACA,WAAW,4DAA4D;AACvE;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,kEAAkE;AACnE;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C;AAC1C,2CAA2C;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C;AAC1C;AACA;AACA;AACA;AACA,0CAA0C;AAC1C;AACA;AACA;AACA;AACA,0CAA0C;AAC1C,4CAA4C;AAC5C;AACA;AACA;AACA,0CAA0C;AAC1C;AACA;AACA;AACA;AACA,0CAA0C;AAC1C,4CAA4C;AAC5C;AACA;AACA;AACA,0CAA0C;AAC1C;AACA;AACA;AACA;AACA,0CAA0C;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,0BAA0B;AACpB;AACP;AACA;AACA;AACA;AACA;AACA,CAAC,wCAAwC;AAClC;AACP;AACA;AACA;AACA,CAAC,8BAA8B;AAC/B;AACA;AACA;AACO;AACP;AACA;AACA;AACA,CAAC,0CAA0C;AAC3C;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,0CAA0C;AAC3C;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,0EAA0E;AAC3E;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA,CAAC,8CAA8C;AACxC;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,4CAA4C;AACtC;AACP;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,sDAAsD;AAChD;AACP;AACA;AACA;AACA;AACA,CAAC,sCAAsC;AAChC;AACP;AACA;AACA;AACA,CAAC,gCAAgC;AAC1B;AACP;AACA;AACA;AACA;AACA,CAAC,kDAAkD;AACnD;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,gDAAgD;AAC1C;AACP;AACA;AACA;AACA;AACA,CAAC,wCAAwC;AAClC;AACP;AACA;AACA;AACA;AACA,CAAC,4DAA4D;AAC7D;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,gCAAgC;AAC1B;AACP;AACA;AACA,CAAC,8BAA8B;AAC/B;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,sEAAsE;AACvE;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,sDAAsD;AACvD;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA,CAAC,wDAAwD;AACzD;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,wCAAwC;;;;;;;;;;;;;;;;;ACn6BzC;AACA;AACA;AACA;AACqD;AACqB;AACnE;AACP;AACA;AACA;AACA,gCAAgC,0DAAO;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,eAAe,uEAAY;AAC3B;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,uEAAY;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6CAA6C,iEAAU;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;ACxHA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC,OAAO;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,YAAY,IAAI,eAAe;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAAgD,QAAQ;AACxD,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sDAAsD,QAAQ;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iIAAiI;AACjI;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wEAAwE,SAAS;AACjF;AACA,SAAS;AACT;AACA;;;;;;;UCpMA;UACA;;UAEA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;;UAEA;UACA;;UAEA;UACA;UACA;;;;;WCtBA;WACA;WACA;WACA;WACA,yCAAyC,wCAAwC;WACjF;WACA;WACA;;;;;WCPA;;;;;WCAA;WACA;WACA;WACA,uDAAuD,iBAAiB;WACxE;WACA,gDAAgD,aAAa;WAC7D;;;;;;;;;;;;;;;;ACNA;AACA;AACA;AACA;AAC2E;AACE;AAC7E;AACO;AACP;AACA;AACA;AACA;AACA,6BAA6B,mFAAkB;AAC/C;AACA,KAAK,gBAAgB,sFAAkB;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA","sources":["webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/arrays.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/arraysFind.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/assert.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/cache.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/cancellation.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/codicons.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/color.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/diff/diff.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/diff/diffChange.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/errors.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/event.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/functional.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/hash.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/iterator.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/keyCodes.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/lazy.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/lifecycle.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/linkedList.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/map.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/objects.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/path.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/platform.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/process.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/stopwatch.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/strings.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/types.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/uint.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/uri.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/base/common/worker/simpleWorker.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/core/characterClassifier.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/core/lineRange.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/core/offsetRange.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/core/position.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/core/range.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/core/selection.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/core/wordCharacterClassifier.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/core/wordHelper.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/dynamicProgrammingDiffing.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/myersDiffAlgorithm.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/computeMovedLines.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/defaultLinesDiffComputer.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/heuristicSequenceOptimizations.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/lineSequence.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/linesSliceCharSequence.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/utils.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/diff/legacyLinesDiffComputer.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/diff/linesDiffComputer.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/diff/linesDiffComputers.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/diff/rangeMapping.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/languages.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/languages/defaultDocumentColorsComputer.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/languages/linkComputer.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/languages/supports/inplaceReplaceSupport.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/model.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/model/mirrorTextModel.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/model/prefixSumComputer.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/model/textModelSearch.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/services/editorBaseApi.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/services/editorSimpleWorker.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/services/unicodeTextModelHighlighter.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/standalone/standaloneEnums.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/common/tokenizationRegistry.js","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/nls.js","webpack://fausteditorweb/webpack/bootstrap","webpack://fausteditorweb/webpack/runtime/define property getters","webpack://fausteditorweb/webpack/runtime/hasOwnProperty shorthand","webpack://fausteditorweb/webpack/runtime/make namespace object","webpack://fausteditorweb/./node_modules/monaco-editor/esm/vs/editor/editor.worker.js"],"sourcesContent":["/**\n * Returns the last element of an array.\n * @param array The array.\n * @param n Which element from the end (default is zero).\n */\nexport function tail(array, n = 0) {\n return array[array.length - (1 + n)];\n}\nexport function tail2(arr) {\n if (arr.length === 0) {\n throw new Error('Invalid tail call');\n }\n return [arr.slice(0, arr.length - 1), arr[arr.length - 1]];\n}\nexport function equals(one, other, itemEquals = (a, b) => a === b) {\n if (one === other) {\n return true;\n }\n if (!one || !other) {\n return false;\n }\n if (one.length !== other.length) {\n return false;\n }\n for (let i = 0, len = one.length; i < len; i++) {\n if (!itemEquals(one[i], other[i])) {\n return false;\n }\n }\n return true;\n}\n/**\n * Remove the element at `index` by replacing it with the last element. This is faster than `splice`\n * but changes the order of the array\n */\nexport function removeFastWithoutKeepingOrder(array, index) {\n const last = array.length - 1;\n if (index < last) {\n array[index] = array[last];\n }\n array.pop();\n}\n/**\n * Performs a binary search algorithm over a sorted array.\n *\n * @param array The array being searched.\n * @param key The value we search for.\n * @param comparator A function that takes two array elements and returns zero\n * if they are equal, a negative number if the first element precedes the\n * second one in the sorting order, or a positive number if the second element\n * precedes the first one.\n * @return See {@link binarySearch2}\n */\nexport function binarySearch(array, key, comparator) {\n return binarySearch2(array.length, i => comparator(array[i], key));\n}\n/**\n * Performs a binary search algorithm over a sorted collection. Useful for cases\n * when we need to perform a binary search over something that isn't actually an\n * array, and converting data to an array would defeat the use of binary search\n * in the first place.\n *\n * @param length The collection length.\n * @param compareToKey A function that takes an index of an element in the\n * collection and returns zero if the value at this index is equal to the\n * search key, a negative number if the value precedes the search key in the\n * sorting order, or a positive number if the search key precedes the value.\n * @return A non-negative index of an element, if found. If not found, the\n * result is -(n+1) (or ~n, using bitwise notation), where n is the index\n * where the key should be inserted to maintain the sorting order.\n */\nexport function binarySearch2(length, compareToKey) {\n let low = 0, high = length - 1;\n while (low <= high) {\n const mid = ((low + high) / 2) | 0;\n const comp = compareToKey(mid);\n if (comp < 0) {\n low = mid + 1;\n }\n else if (comp > 0) {\n high = mid - 1;\n }\n else {\n return mid;\n }\n }\n return -(low + 1);\n}\nexport function quickSelect(nth, data, compare) {\n nth = nth | 0;\n if (nth >= data.length) {\n throw new TypeError('invalid index');\n }\n const pivotValue = data[Math.floor(data.length * Math.random())];\n const lower = [];\n const higher = [];\n const pivots = [];\n for (const value of data) {\n const val = compare(value, pivotValue);\n if (val < 0) {\n lower.push(value);\n }\n else if (val > 0) {\n higher.push(value);\n }\n else {\n pivots.push(value);\n }\n }\n if (nth < lower.length) {\n return quickSelect(nth, lower, compare);\n }\n else if (nth < lower.length + pivots.length) {\n return pivots[0];\n }\n else {\n return quickSelect(nth - (lower.length + pivots.length), higher, compare);\n }\n}\nexport function groupBy(data, compare) {\n const result = [];\n let currentGroup = undefined;\n for (const element of data.slice(0).sort(compare)) {\n if (!currentGroup || compare(currentGroup[0], element) !== 0) {\n currentGroup = [element];\n result.push(currentGroup);\n }\n else {\n currentGroup.push(element);\n }\n }\n return result;\n}\n/**\n * Splits the given items into a list of (non-empty) groups.\n * `shouldBeGrouped` is used to decide if two consecutive items should be in the same group.\n * The order of the items is preserved.\n */\nexport function* groupAdjacentBy(items, shouldBeGrouped) {\n let currentGroup;\n let last;\n for (const item of items) {\n if (last !== undefined && shouldBeGrouped(last, item)) {\n currentGroup.push(item);\n }\n else {\n if (currentGroup) {\n yield currentGroup;\n }\n currentGroup = [item];\n }\n last = item;\n }\n if (currentGroup) {\n yield currentGroup;\n }\n}\nexport function forEachAdjacent(arr, f) {\n for (let i = 0; i <= arr.length; i++) {\n f(i === 0 ? undefined : arr[i - 1], i === arr.length ? undefined : arr[i]);\n }\n}\nexport function forEachWithNeighbors(arr, f) {\n for (let i = 0; i < arr.length; i++) {\n f(i === 0 ? undefined : arr[i - 1], arr[i], i + 1 === arr.length ? undefined : arr[i + 1]);\n }\n}\n/**\n * @returns New array with all falsy values removed. The original array IS NOT modified.\n */\nexport function coalesce(array) {\n return array.filter(e => !!e);\n}\n/**\n * Remove all falsy values from `array`. The original array IS modified.\n */\nexport function coalesceInPlace(array) {\n let to = 0;\n for (let i = 0; i < array.length; i++) {\n if (!!array[i]) {\n array[to] = array[i];\n to += 1;\n }\n }\n array.length = to;\n}\n/**\n * @returns false if the provided object is an array and not empty.\n */\nexport function isFalsyOrEmpty(obj) {\n return !Array.isArray(obj) || obj.length === 0;\n}\nexport function isNonEmptyArray(obj) {\n return Array.isArray(obj) && obj.length > 0;\n}\n/**\n * Removes duplicates from the given array. The optional keyFn allows to specify\n * how elements are checked for equality by returning an alternate value for each.\n */\nexport function distinct(array, keyFn = value => value) {\n const seen = new Set();\n return array.filter(element => {\n const key = keyFn(element);\n if (seen.has(key)) {\n return false;\n }\n seen.add(key);\n return true;\n });\n}\nexport function firstOrDefault(array, notFoundValue) {\n return array.length > 0 ? array[0] : notFoundValue;\n}\nexport function range(arg, to) {\n let from = typeof to === 'number' ? arg : 0;\n if (typeof to === 'number') {\n from = arg;\n }\n else {\n from = 0;\n to = arg;\n }\n const result = [];\n if (from <= to) {\n for (let i = from; i < to; i++) {\n result.push(i);\n }\n }\n else {\n for (let i = from; i > to; i--) {\n result.push(i);\n }\n }\n return result;\n}\n/**\n * Insert `insertArr` inside `target` at `insertIndex`.\n * Please don't touch unless you understand https://jsperf.com/inserting-an-array-within-an-array\n */\nexport function arrayInsert(target, insertIndex, insertArr) {\n const before = target.slice(0, insertIndex);\n const after = target.slice(insertIndex);\n return before.concat(insertArr, after);\n}\n/**\n * Pushes an element to the start of the array, if found.\n */\nexport function pushToStart(arr, value) {\n const index = arr.indexOf(value);\n if (index > -1) {\n arr.splice(index, 1);\n arr.unshift(value);\n }\n}\n/**\n * Pushes an element to the end of the array, if found.\n */\nexport function pushToEnd(arr, value) {\n const index = arr.indexOf(value);\n if (index > -1) {\n arr.splice(index, 1);\n arr.push(value);\n }\n}\nexport function pushMany(arr, items) {\n for (const item of items) {\n arr.push(item);\n }\n}\nexport function asArray(x) {\n return Array.isArray(x) ? x : [x];\n}\n/**\n * Insert the new items in the array.\n * @param array The original array.\n * @param start The zero-based location in the array from which to start inserting elements.\n * @param newItems The items to be inserted\n */\nexport function insertInto(array, start, newItems) {\n const startIdx = getActualStartIndex(array, start);\n const originalLength = array.length;\n const newItemsLength = newItems.length;\n array.length = originalLength + newItemsLength;\n // Move the items after the start index, start from the end so that we don't overwrite any value.\n for (let i = originalLength - 1; i >= startIdx; i--) {\n array[i + newItemsLength] = array[i];\n }\n for (let i = 0; i < newItemsLength; i++) {\n array[i + startIdx] = newItems[i];\n }\n}\n/**\n * Removes elements from an array and inserts new elements in their place, returning the deleted elements. Alternative to the native Array.splice method, it\n * can only support limited number of items due to the maximum call stack size limit.\n * @param array The original array.\n * @param start The zero-based location in the array from which to start removing elements.\n * @param deleteCount The number of elements to remove.\n * @returns An array containing the elements that were deleted.\n */\nexport function splice(array, start, deleteCount, newItems) {\n const index = getActualStartIndex(array, start);\n let result = array.splice(index, deleteCount);\n if (result === undefined) {\n // see https://bugs.webkit.org/show_bug.cgi?id=261140\n result = [];\n }\n insertInto(array, index, newItems);\n return result;\n}\n/**\n * Determine the actual start index (same logic as the native splice() or slice())\n * If greater than the length of the array, start will be set to the length of the array. In this case, no element will be deleted but the method will behave as an adding function, adding as many element as item[n*] provided.\n * If negative, it will begin that many elements from the end of the array. (In this case, the origin -1, meaning -n is the index of the nth last element, and is therefore equivalent to the index of array.length - n.) If array.length + start is less than 0, it will begin from index 0.\n * @param array The target array.\n * @param start The operation index.\n */\nfunction getActualStartIndex(array, start) {\n return start < 0 ? Math.max(start + array.length, 0) : Math.min(start, array.length);\n}\nexport var CompareResult;\n(function (CompareResult) {\n function isLessThan(result) {\n return result < 0;\n }\n CompareResult.isLessThan = isLessThan;\n function isLessThanOrEqual(result) {\n return result <= 0;\n }\n CompareResult.isLessThanOrEqual = isLessThanOrEqual;\n function isGreaterThan(result) {\n return result > 0;\n }\n CompareResult.isGreaterThan = isGreaterThan;\n function isNeitherLessOrGreaterThan(result) {\n return result === 0;\n }\n CompareResult.isNeitherLessOrGreaterThan = isNeitherLessOrGreaterThan;\n CompareResult.greaterThan = 1;\n CompareResult.lessThan = -1;\n CompareResult.neitherLessOrGreaterThan = 0;\n})(CompareResult || (CompareResult = {}));\nexport function compareBy(selector, comparator) {\n return (a, b) => comparator(selector(a), selector(b));\n}\nexport function tieBreakComparators(...comparators) {\n return (item1, item2) => {\n for (const comparator of comparators) {\n const result = comparator(item1, item2);\n if (!CompareResult.isNeitherLessOrGreaterThan(result)) {\n return result;\n }\n }\n return CompareResult.neitherLessOrGreaterThan;\n };\n}\n/**\n * The natural order on numbers.\n*/\nexport const numberComparator = (a, b) => a - b;\nexport const booleanComparator = (a, b) => numberComparator(a ? 1 : 0, b ? 1 : 0);\nexport function reverseOrder(comparator) {\n return (a, b) => -comparator(a, b);\n}\nexport class ArrayQueue {\n /**\n * Constructs a queue that is backed by the given array. Runtime is O(1).\n */\n constructor(items) {\n this.items = items;\n this.firstIdx = 0;\n this.lastIdx = this.items.length - 1;\n }\n get length() {\n return this.lastIdx - this.firstIdx + 1;\n }\n /**\n * Consumes elements from the beginning of the queue as long as the predicate returns true.\n * If no elements were consumed, `null` is returned. Has a runtime of O(result.length).\n */\n takeWhile(predicate) {\n // P(k) := k <= this.lastIdx && predicate(this.items[k])\n // Find s := min { k | k >= this.firstIdx && !P(k) } and return this.data[this.firstIdx...s)\n let startIdx = this.firstIdx;\n while (startIdx < this.items.length && predicate(this.items[startIdx])) {\n startIdx++;\n }\n const result = startIdx === this.firstIdx ? null : this.items.slice(this.firstIdx, startIdx);\n this.firstIdx = startIdx;\n return result;\n }\n /**\n * Consumes elements from the end of the queue as long as the predicate returns true.\n * If no elements were consumed, `null` is returned.\n * The result has the same order as the underlying array!\n */\n takeFromEndWhile(predicate) {\n // P(k) := this.firstIdx >= k && predicate(this.items[k])\n // Find s := max { k | k <= this.lastIdx && !P(k) } and return this.data(s...this.lastIdx]\n let endIdx = this.lastIdx;\n while (endIdx >= 0 && predicate(this.items[endIdx])) {\n endIdx--;\n }\n const result = endIdx === this.lastIdx ? null : this.items.slice(endIdx + 1, this.lastIdx + 1);\n this.lastIdx = endIdx;\n return result;\n }\n peek() {\n if (this.length === 0) {\n return undefined;\n }\n return this.items[this.firstIdx];\n }\n dequeue() {\n const result = this.items[this.firstIdx];\n this.firstIdx++;\n return result;\n }\n takeCount(count) {\n const result = this.items.slice(this.firstIdx, this.firstIdx + count);\n this.firstIdx += count;\n return result;\n }\n}\n/**\n * This class is faster than an iterator and array for lazy computed data.\n*/\nexport class CallbackIterable {\n constructor(\n /**\n * Calls the callback for every item.\n * Stops when the callback returns false.\n */\n iterate) {\n this.iterate = iterate;\n }\n toArray() {\n const result = [];\n this.iterate(item => { result.push(item); return true; });\n return result;\n }\n filter(predicate) {\n return new CallbackIterable(cb => this.iterate(item => predicate(item) ? cb(item) : true));\n }\n map(mapFn) {\n return new CallbackIterable(cb => this.iterate(item => cb(mapFn(item))));\n }\n findLast(predicate) {\n let result;\n this.iterate(item => {\n if (predicate(item)) {\n result = item;\n }\n return true;\n });\n return result;\n }\n findLastMaxBy(comparator) {\n let result;\n let first = true;\n this.iterate(item => {\n if (first || CompareResult.isGreaterThan(comparator(item, result))) {\n first = false;\n result = item;\n }\n return true;\n });\n return result;\n }\n}\nCallbackIterable.empty = new CallbackIterable(_callback => { });\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nexport function findLast(array, predicate, fromIdx) {\n const idx = findLastIdx(array, predicate);\n if (idx === -1) {\n return undefined;\n }\n return array[idx];\n}\nexport function findLastIdx(array, predicate, fromIndex = array.length - 1) {\n for (let i = fromIndex; i >= 0; i--) {\n const element = array[i];\n if (predicate(element)) {\n return i;\n }\n }\n return -1;\n}\n/**\n * Finds the last item where predicate is true using binary search.\n * `predicate` must be monotonous, i.e. `arr.map(predicate)` must be like `[true, ..., true, false, ..., false]`!\n *\n * @returns `undefined` if no item matches, otherwise the last item that matches the predicate.\n */\nexport function findLastMonotonous(array, predicate) {\n const idx = findLastIdxMonotonous(array, predicate);\n return idx === -1 ? undefined : array[idx];\n}\n/**\n * Finds the last item where predicate is true using binary search.\n * `predicate` must be monotonous, i.e. `arr.map(predicate)` must be like `[true, ..., true, false, ..., false]`!\n *\n * @returns `startIdx - 1` if predicate is false for all items, otherwise the index of the last item that matches the predicate.\n */\nexport function findLastIdxMonotonous(array, predicate, startIdx = 0, endIdxEx = array.length) {\n let i = startIdx;\n let j = endIdxEx;\n while (i < j) {\n const k = Math.floor((i + j) / 2);\n if (predicate(array[k])) {\n i = k + 1;\n }\n else {\n j = k;\n }\n }\n return i - 1;\n}\n/**\n * Finds the first item where predicate is true using binary search.\n * `predicate` must be monotonous, i.e. `arr.map(predicate)` must be like `[false, ..., false, true, ..., true]`!\n *\n * @returns `undefined` if no item matches, otherwise the first item that matches the predicate.\n */\nexport function findFirstMonotonous(array, predicate) {\n const idx = findFirstIdxMonotonousOrArrLen(array, predicate);\n return idx === array.length ? undefined : array[idx];\n}\n/**\n * Finds the first item where predicate is true using binary search.\n * `predicate` must be monotonous, i.e. `arr.map(predicate)` must be like `[false, ..., false, true, ..., true]`!\n *\n * @returns `endIdxEx` if predicate is false for all items, otherwise the index of the first item that matches the predicate.\n */\nexport function findFirstIdxMonotonousOrArrLen(array, predicate, startIdx = 0, endIdxEx = array.length) {\n let i = startIdx;\n let j = endIdxEx;\n while (i < j) {\n const k = Math.floor((i + j) / 2);\n if (predicate(array[k])) {\n j = k;\n }\n else {\n i = k + 1;\n }\n }\n return i;\n}\n/**\n * Use this when\n * * You have a sorted array\n * * You query this array with a monotonous predicate to find the last item that has a certain property.\n * * You query this array multiple times with monotonous predicates that get weaker and weaker.\n */\nexport class MonotonousArray {\n constructor(_array) {\n this._array = _array;\n this._findLastMonotonousLastIdx = 0;\n }\n /**\n * The predicate must be monotonous, i.e. `arr.map(predicate)` must be like `[true, ..., true, false, ..., false]`!\n * For subsequent calls, current predicate must be weaker than (or equal to) the previous predicate, i.e. more entries must be `true`.\n */\n findLastMonotonous(predicate) {\n if (MonotonousArray.assertInvariants) {\n if (this._prevFindLastPredicate) {\n for (const item of this._array) {\n if (this._prevFindLastPredicate(item) && !predicate(item)) {\n throw new Error('MonotonousArray: current predicate must be weaker than (or equal to) the previous predicate.');\n }\n }\n }\n this._prevFindLastPredicate = predicate;\n }\n const idx = findLastIdxMonotonous(this._array, predicate, this._findLastMonotonousLastIdx);\n this._findLastMonotonousLastIdx = idx + 1;\n return idx === -1 ? undefined : this._array[idx];\n }\n}\nMonotonousArray.assertInvariants = false;\n/**\n * Returns the first item that is equal to or greater than every other item.\n*/\nexport function findFirstMaxBy(array, comparator) {\n if (array.length === 0) {\n return undefined;\n }\n let max = array[0];\n for (let i = 1; i < array.length; i++) {\n const item = array[i];\n if (comparator(item, max) > 0) {\n max = item;\n }\n }\n return max;\n}\n/**\n * Returns the last item that is equal to or greater than every other item.\n*/\nexport function findLastMaxBy(array, comparator) {\n if (array.length === 0) {\n return undefined;\n }\n let max = array[0];\n for (let i = 1; i < array.length; i++) {\n const item = array[i];\n if (comparator(item, max) >= 0) {\n max = item;\n }\n }\n return max;\n}\n/**\n * Returns the first item that is equal to or less than every other item.\n*/\nexport function findFirstMinBy(array, comparator) {\n return findFirstMaxBy(array, (a, b) => -comparator(a, b));\n}\nexport function findMaxIdxBy(array, comparator) {\n if (array.length === 0) {\n return -1;\n }\n let maxIdx = 0;\n for (let i = 1; i < array.length; i++) {\n const item = array[i];\n if (comparator(item, array[maxIdx]) > 0) {\n maxIdx = i;\n }\n }\n return maxIdx;\n}\n/**\n * Returns the first mapped value of the array which is not undefined.\n */\nexport function mapFindFirst(items, mapFn) {\n for (const value of items) {\n const mapped = mapFn(value);\n if (mapped !== undefined) {\n return mapped;\n }\n }\n return undefined;\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { BugIndicatingError, onUnexpectedError } from './errors.js';\n/**\n * Throws an error with the provided message if the provided value does not evaluate to a true Javascript value.\n *\n * @deprecated Use `assert(...)` instead.\n * This method is usually used like this:\n * ```ts\n * import * as assert from 'vs/base/common/assert';\n * assert.ok(...);\n * ```\n *\n * However, `assert` in that example is a user chosen name.\n * There is no tooling for generating such an import statement.\n * Thus, the `assert(...)` function should be used instead.\n */\nexport function ok(value, message) {\n if (!value) {\n throw new Error(message ? `Assertion failed (${message})` : 'Assertion Failed');\n }\n}\nexport function assertNever(value, message = 'Unreachable') {\n throw new Error(message);\n}\n/**\n * condition must be side-effect free!\n */\nexport function assertFn(condition) {\n if (!condition()) {\n // eslint-disable-next-line no-debugger\n debugger;\n // Reevaluate `condition` again to make debugging easier\n condition();\n onUnexpectedError(new BugIndicatingError('Assertion Failed'));\n }\n}\nexport function checkAdjacentItems(items, predicate) {\n let i = 0;\n while (i < items.length - 1) {\n const a = items[i];\n const b = items[i + 1];\n if (!predicate(a, b)) {\n return false;\n }\n i++;\n }\n return true;\n}\n","/**\n * Uses a LRU cache to make a given parametrized function cached.\n * Caches just the last value.\n * The key must be JSON serializable.\n*/\nexport class LRUCachedFunction {\n constructor(fn) {\n this.fn = fn;\n this.lastCache = undefined;\n this.lastArgKey = undefined;\n }\n get(arg) {\n const key = JSON.stringify(arg);\n if (this.lastArgKey !== key) {\n this.lastArgKey = key;\n this.lastCache = this.fn(arg);\n }\n return this.lastCache;\n }\n}\n/**\n * Uses an unbounded cache (referential equality) to memoize the results of the given function.\n*/\nexport class CachedFunction {\n get cachedValues() {\n return this._map;\n }\n constructor(fn) {\n this.fn = fn;\n this._map = new Map();\n }\n get(arg) {\n if (this._map.has(arg)) {\n return this._map.get(arg);\n }\n const value = this.fn(arg);\n this._map.set(arg, value);\n return value;\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { Emitter, Event } from './event.js';\nconst shortcutEvent = Object.freeze(function (callback, context) {\n const handle = setTimeout(callback.bind(context), 0);\n return { dispose() { clearTimeout(handle); } };\n});\nexport var CancellationToken;\n(function (CancellationToken) {\n function isCancellationToken(thing) {\n if (thing === CancellationToken.None || thing === CancellationToken.Cancelled) {\n return true;\n }\n if (thing instanceof MutableToken) {\n return true;\n }\n if (!thing || typeof thing !== 'object') {\n return false;\n }\n return typeof thing.isCancellationRequested === 'boolean'\n && typeof thing.onCancellationRequested === 'function';\n }\n CancellationToken.isCancellationToken = isCancellationToken;\n CancellationToken.None = Object.freeze({\n isCancellationRequested: false,\n onCancellationRequested: Event.None\n });\n CancellationToken.Cancelled = Object.freeze({\n isCancellationRequested: true,\n onCancellationRequested: shortcutEvent\n });\n})(CancellationToken || (CancellationToken = {}));\nclass MutableToken {\n constructor() {\n this._isCancelled = false;\n this._emitter = null;\n }\n cancel() {\n if (!this._isCancelled) {\n this._isCancelled = true;\n if (this._emitter) {\n this._emitter.fire(undefined);\n this.dispose();\n }\n }\n }\n get isCancellationRequested() {\n return this._isCancelled;\n }\n get onCancellationRequested() {\n if (this._isCancelled) {\n return shortcutEvent;\n }\n if (!this._emitter) {\n this._emitter = new Emitter();\n }\n return this._emitter.event;\n }\n dispose() {\n if (this._emitter) {\n this._emitter.dispose();\n this._emitter = null;\n }\n }\n}\nexport class CancellationTokenSource {\n constructor(parent) {\n this._token = undefined;\n this._parentListener = undefined;\n this._parentListener = parent && parent.onCancellationRequested(this.cancel, this);\n }\n get token() {\n if (!this._token) {\n // be lazy and create the token only when\n // actually needed\n this._token = new MutableToken();\n }\n return this._token;\n }\n cancel() {\n if (!this._token) {\n // save an object by returning the default\n // cancelled token when cancellation happens\n // before someone asks for the token\n this._token = CancellationToken.Cancelled;\n }\n else if (this._token instanceof MutableToken) {\n // actually cancel\n this._token.cancel();\n }\n }\n dispose(cancel = false) {\n var _a;\n if (cancel) {\n this.cancel();\n }\n (_a = this._parentListener) === null || _a === void 0 ? void 0 : _a.dispose();\n if (!this._token) {\n // ensure to initialize with an empty token if we had none\n this._token = CancellationToken.None;\n }\n else if (this._token instanceof MutableToken) {\n // actually dispose\n this._token.dispose();\n }\n }\n}\n","import { isString } from './types.js';\nconst _codiconFontCharacters = Object.create(null);\nfunction register(id, fontCharacter) {\n if (isString(fontCharacter)) {\n const val = _codiconFontCharacters[fontCharacter];\n if (val === undefined) {\n throw new Error(`${id} references an unknown codicon: ${fontCharacter}`);\n }\n fontCharacter = val;\n }\n _codiconFontCharacters[id] = fontCharacter;\n return { id };\n}\n/**\n * Only to be used by the iconRegistry.\n */\nexport function getCodiconFontCharacters() {\n return _codiconFontCharacters;\n}\n/**\n * The Codicon library is a set of default icons that are built-in in VS Code.\n *\n * In the product (outside of base) Codicons should only be used as defaults. In order to have all icons in VS Code\n * themeable, component should define new, UI component specific icons using `iconRegistry.registerIcon`.\n * In that call a Codicon can be named as default.\n */\nexport const Codicon = {\n // built-in icons, with image name\n add: register('add', 0xea60),\n plus: register('plus', 0xea60),\n gistNew: register('gist-new', 0xea60),\n repoCreate: register('repo-create', 0xea60),\n lightbulb: register('lightbulb', 0xea61),\n lightBulb: register('light-bulb', 0xea61),\n repo: register('repo', 0xea62),\n repoDelete: register('repo-delete', 0xea62),\n gistFork: register('gist-fork', 0xea63),\n repoForked: register('repo-forked', 0xea63),\n gitPullRequest: register('git-pull-request', 0xea64),\n gitPullRequestAbandoned: register('git-pull-request-abandoned', 0xea64),\n recordKeys: register('record-keys', 0xea65),\n keyboard: register('keyboard', 0xea65),\n tag: register('tag', 0xea66),\n tagAdd: register('tag-add', 0xea66),\n tagRemove: register('tag-remove', 0xea66),\n gitPullRequestLabel: register('git-pull-request-label', 0xea66),\n person: register('person', 0xea67),\n personFollow: register('person-follow', 0xea67),\n personOutline: register('person-outline', 0xea67),\n personFilled: register('person-filled', 0xea67),\n gitBranch: register('git-branch', 0xea68),\n gitBranchCreate: register('git-branch-create', 0xea68),\n gitBranchDelete: register('git-branch-delete', 0xea68),\n sourceControl: register('source-control', 0xea68),\n mirror: register('mirror', 0xea69),\n mirrorPublic: register('mirror-public', 0xea69),\n star: register('star', 0xea6a),\n starAdd: register('star-add', 0xea6a),\n starDelete: register('star-delete', 0xea6a),\n starEmpty: register('star-empty', 0xea6a),\n comment: register('comment', 0xea6b),\n commentAdd: register('comment-add', 0xea6b),\n alert: register('alert', 0xea6c),\n warning: register('warning', 0xea6c),\n search: register('search', 0xea6d),\n searchSave: register('search-save', 0xea6d),\n logOut: register('log-out', 0xea6e),\n signOut: register('sign-out', 0xea6e),\n logIn: register('log-in', 0xea6f),\n signIn: register('sign-in', 0xea6f),\n eye: register('eye', 0xea70),\n eyeUnwatch: register('eye-unwatch', 0xea70),\n eyeWatch: register('eye-watch', 0xea70),\n circleFilled: register('circle-filled', 0xea71),\n primitiveDot: register('primitive-dot', 0xea71),\n closeDirty: register('close-dirty', 0xea71),\n debugBreakpoint: register('debug-breakpoint', 0xea71),\n debugBreakpointDisabled: register('debug-breakpoint-disabled', 0xea71),\n debugHint: register('debug-hint', 0xea71),\n primitiveSquare: register('primitive-square', 0xea72),\n edit: register('edit', 0xea73),\n pencil: register('pencil', 0xea73),\n info: register('info', 0xea74),\n issueOpened: register('issue-opened', 0xea74),\n gistPrivate: register('gist-private', 0xea75),\n gitForkPrivate: register('git-fork-private', 0xea75),\n lock: register('lock', 0xea75),\n mirrorPrivate: register('mirror-private', 0xea75),\n close: register('close', 0xea76),\n removeClose: register('remove-close', 0xea76),\n x: register('x', 0xea76),\n repoSync: register('repo-sync', 0xea77),\n sync: register('sync', 0xea77),\n clone: register('clone', 0xea78),\n desktopDownload: register('desktop-download', 0xea78),\n beaker: register('beaker', 0xea79),\n microscope: register('microscope', 0xea79),\n vm: register('vm', 0xea7a),\n deviceDesktop: register('device-desktop', 0xea7a),\n file: register('file', 0xea7b),\n fileText: register('file-text', 0xea7b),\n more: register('more', 0xea7c),\n ellipsis: register('ellipsis', 0xea7c),\n kebabHorizontal: register('kebab-horizontal', 0xea7c),\n mailReply: register('mail-reply', 0xea7d),\n reply: register('reply', 0xea7d),\n organization: register('organization', 0xea7e),\n organizationFilled: register('organization-filled', 0xea7e),\n organizationOutline: register('organization-outline', 0xea7e),\n newFile: register('new-file', 0xea7f),\n fileAdd: register('file-add', 0xea7f),\n newFolder: register('new-folder', 0xea80),\n fileDirectoryCreate: register('file-directory-create', 0xea80),\n trash: register('trash', 0xea81),\n trashcan: register('trashcan', 0xea81),\n history: register('history', 0xea82),\n clock: register('clock', 0xea82),\n folder: register('folder', 0xea83),\n fileDirectory: register('file-directory', 0xea83),\n symbolFolder: register('symbol-folder', 0xea83),\n logoGithub: register('logo-github', 0xea84),\n markGithub: register('mark-github', 0xea84),\n github: register('github', 0xea84),\n terminal: register('terminal', 0xea85),\n console: register('console', 0xea85),\n repl: register('repl', 0xea85),\n zap: register('zap', 0xea86),\n symbolEvent: register('symbol-event', 0xea86),\n error: register('error', 0xea87),\n stop: register('stop', 0xea87),\n variable: register('variable', 0xea88),\n symbolVariable: register('symbol-variable', 0xea88),\n array: register('array', 0xea8a),\n symbolArray: register('symbol-array', 0xea8a),\n symbolModule: register('symbol-module', 0xea8b),\n symbolPackage: register('symbol-package', 0xea8b),\n symbolNamespace: register('symbol-namespace', 0xea8b),\n symbolObject: register('symbol-object', 0xea8b),\n symbolMethod: register('symbol-method', 0xea8c),\n symbolFunction: register('symbol-function', 0xea8c),\n symbolConstructor: register('symbol-constructor', 0xea8c),\n symbolBoolean: register('symbol-boolean', 0xea8f),\n symbolNull: register('symbol-null', 0xea8f),\n symbolNumeric: register('symbol-numeric', 0xea90),\n symbolNumber: register('symbol-number', 0xea90),\n symbolStructure: register('symbol-structure', 0xea91),\n symbolStruct: register('symbol-struct', 0xea91),\n symbolParameter: register('symbol-parameter', 0xea92),\n symbolTypeParameter: register('symbol-type-parameter', 0xea92),\n symbolKey: register('symbol-key', 0xea93),\n symbolText: register('symbol-text', 0xea93),\n symbolReference: register('symbol-reference', 0xea94),\n goToFile: register('go-to-file', 0xea94),\n symbolEnum: register('symbol-enum', 0xea95),\n symbolValue: register('symbol-value', 0xea95),\n symbolRuler: register('symbol-ruler', 0xea96),\n symbolUnit: register('symbol-unit', 0xea96),\n activateBreakpoints: register('activate-breakpoints', 0xea97),\n archive: register('archive', 0xea98),\n arrowBoth: register('arrow-both', 0xea99),\n arrowDown: register('arrow-down', 0xea9a),\n arrowLeft: register('arrow-left', 0xea9b),\n arrowRight: register('arrow-right', 0xea9c),\n arrowSmallDown: register('arrow-small-down', 0xea9d),\n arrowSmallLeft: register('arrow-small-left', 0xea9e),\n arrowSmallRight: register('arrow-small-right', 0xea9f),\n arrowSmallUp: register('arrow-small-up', 0xeaa0),\n arrowUp: register('arrow-up', 0xeaa1),\n bell: register('bell', 0xeaa2),\n bold: register('bold', 0xeaa3),\n book: register('book', 0xeaa4),\n bookmark: register('bookmark', 0xeaa5),\n debugBreakpointConditionalUnverified: register('debug-breakpoint-conditional-unverified', 0xeaa6),\n debugBreakpointConditional: register('debug-breakpoint-conditional', 0xeaa7),\n debugBreakpointConditionalDisabled: register('debug-breakpoint-conditional-disabled', 0xeaa7),\n debugBreakpointDataUnverified: register('debug-breakpoint-data-unverified', 0xeaa8),\n debugBreakpointData: register('debug-breakpoint-data', 0xeaa9),\n debugBreakpointDataDisabled: register('debug-breakpoint-data-disabled', 0xeaa9),\n debugBreakpointLogUnverified: register('debug-breakpoint-log-unverified', 0xeaaa),\n debugBreakpointLog: register('debug-breakpoint-log', 0xeaab),\n debugBreakpointLogDisabled: register('debug-breakpoint-log-disabled', 0xeaab),\n briefcase: register('briefcase', 0xeaac),\n broadcast: register('broadcast', 0xeaad),\n browser: register('browser', 0xeaae),\n bug: register('bug', 0xeaaf),\n calendar: register('calendar', 0xeab0),\n caseSensitive: register('case-sensitive', 0xeab1),\n check: register('check', 0xeab2),\n checklist: register('checklist', 0xeab3),\n chevronDown: register('chevron-down', 0xeab4),\n dropDownButton: register('drop-down-button', 0xeab4),\n chevronLeft: register('chevron-left', 0xeab5),\n chevronRight: register('chevron-right', 0xeab6),\n chevronUp: register('chevron-up', 0xeab7),\n chromeClose: register('chrome-close', 0xeab8),\n chromeMaximize: register('chrome-maximize', 0xeab9),\n chromeMinimize: register('chrome-minimize', 0xeaba),\n chromeRestore: register('chrome-restore', 0xeabb),\n circle: register('circle', 0xeabc),\n circleOutline: register('circle-outline', 0xeabc),\n debugBreakpointUnverified: register('debug-breakpoint-unverified', 0xeabc),\n circleSlash: register('circle-slash', 0xeabd),\n circuitBoard: register('circuit-board', 0xeabe),\n clearAll: register('clear-all', 0xeabf),\n clippy: register('clippy', 0xeac0),\n closeAll: register('close-all', 0xeac1),\n cloudDownload: register('cloud-download', 0xeac2),\n cloudUpload: register('cloud-upload', 0xeac3),\n code: register('code', 0xeac4),\n collapseAll: register('collapse-all', 0xeac5),\n colorMode: register('color-mode', 0xeac6),\n commentDiscussion: register('comment-discussion', 0xeac7),\n compareChanges: register('compare-changes', 0xeafd),\n creditCard: register('credit-card', 0xeac9),\n dash: register('dash', 0xeacc),\n dashboard: register('dashboard', 0xeacd),\n database: register('database', 0xeace),\n debugContinue: register('debug-continue', 0xeacf),\n debugDisconnect: register('debug-disconnect', 0xead0),\n debugPause: register('debug-pause', 0xead1),\n debugRestart: register('debug-restart', 0xead2),\n debugStart: register('debug-start', 0xead3),\n debugStepInto: register('debug-step-into', 0xead4),\n debugStepOut: register('debug-step-out', 0xead5),\n debugStepOver: register('debug-step-over', 0xead6),\n debugStop: register('debug-stop', 0xead7),\n debug: register('debug', 0xead8),\n deviceCameraVideo: register('device-camera-video', 0xead9),\n deviceCamera: register('device-camera', 0xeada),\n deviceMobile: register('device-mobile', 0xeadb),\n diffAdded: register('diff-added', 0xeadc),\n diffIgnored: register('diff-ignored', 0xeadd),\n diffModified: register('diff-modified', 0xeade),\n diffRemoved: register('diff-removed', 0xeadf),\n diffRenamed: register('diff-renamed', 0xeae0),\n diff: register('diff', 0xeae1),\n discard: register('discard', 0xeae2),\n editorLayout: register('editor-layout', 0xeae3),\n emptyWindow: register('empty-window', 0xeae4),\n exclude: register('exclude', 0xeae5),\n extensions: register('extensions', 0xeae6),\n eyeClosed: register('eye-closed', 0xeae7),\n fileBinary: register('file-binary', 0xeae8),\n fileCode: register('file-code', 0xeae9),\n fileMedia: register('file-media', 0xeaea),\n filePdf: register('file-pdf', 0xeaeb),\n fileSubmodule: register('file-submodule', 0xeaec),\n fileSymlinkDirectory: register('file-symlink-directory', 0xeaed),\n fileSymlinkFile: register('file-symlink-file', 0xeaee),\n fileZip: register('file-zip', 0xeaef),\n files: register('files', 0xeaf0),\n filter: register('filter', 0xeaf1),\n flame: register('flame', 0xeaf2),\n foldDown: register('fold-down', 0xeaf3),\n foldUp: register('fold-up', 0xeaf4),\n fold: register('fold', 0xeaf5),\n folderActive: register('folder-active', 0xeaf6),\n folderOpened: register('folder-opened', 0xeaf7),\n gear: register('gear', 0xeaf8),\n gift: register('gift', 0xeaf9),\n gistSecret: register('gist-secret', 0xeafa),\n gist: register('gist', 0xeafb),\n gitCommit: register('git-commit', 0xeafc),\n gitCompare: register('git-compare', 0xeafd),\n gitMerge: register('git-merge', 0xeafe),\n githubAction: register('github-action', 0xeaff),\n githubAlt: register('github-alt', 0xeb00),\n globe: register('globe', 0xeb01),\n grabber: register('grabber', 0xeb02),\n graph: register('graph', 0xeb03),\n gripper: register('gripper', 0xeb04),\n heart: register('heart', 0xeb05),\n home: register('home', 0xeb06),\n horizontalRule: register('horizontal-rule', 0xeb07),\n hubot: register('hubot', 0xeb08),\n inbox: register('inbox', 0xeb09),\n issueClosed: register('issue-closed', 0xeba4),\n issueReopened: register('issue-reopened', 0xeb0b),\n issues: register('issues', 0xeb0c),\n italic: register('italic', 0xeb0d),\n jersey: register('jersey', 0xeb0e),\n json: register('json', 0xeb0f),\n bracket: register('bracket', 0xeb0f),\n kebabVertical: register('kebab-vertical', 0xeb10),\n key: register('key', 0xeb11),\n law: register('law', 0xeb12),\n lightbulbAutofix: register('lightbulb-autofix', 0xeb13),\n linkExternal: register('link-external', 0xeb14),\n link: register('link', 0xeb15),\n listOrdered: register('list-ordered', 0xeb16),\n listUnordered: register('list-unordered', 0xeb17),\n liveShare: register('live-share', 0xeb18),\n loading: register('loading', 0xeb19),\n location: register('location', 0xeb1a),\n mailRead: register('mail-read', 0xeb1b),\n mail: register('mail', 0xeb1c),\n markdown: register('markdown', 0xeb1d),\n megaphone: register('megaphone', 0xeb1e),\n mention: register('mention', 0xeb1f),\n milestone: register('milestone', 0xeb20),\n gitPullRequestMilestone: register('git-pull-request-milestone', 0xeb20),\n mortarBoard: register('mortar-board', 0xeb21),\n move: register('move', 0xeb22),\n multipleWindows: register('multiple-windows', 0xeb23),\n mute: register('mute', 0xeb24),\n noNewline: register('no-newline', 0xeb25),\n note: register('note', 0xeb26),\n octoface: register('octoface', 0xeb27),\n openPreview: register('open-preview', 0xeb28),\n package: register('package', 0xeb29),\n paintcan: register('paintcan', 0xeb2a),\n pin: register('pin', 0xeb2b),\n play: register('play', 0xeb2c),\n run: register('run', 0xeb2c),\n plug: register('plug', 0xeb2d),\n preserveCase: register('preserve-case', 0xeb2e),\n preview: register('preview', 0xeb2f),\n project: register('project', 0xeb30),\n pulse: register('pulse', 0xeb31),\n question: register('question', 0xeb32),\n quote: register('quote', 0xeb33),\n radioTower: register('radio-tower', 0xeb34),\n reactions: register('reactions', 0xeb35),\n references: register('references', 0xeb36),\n refresh: register('refresh', 0xeb37),\n regex: register('regex', 0xeb38),\n remoteExplorer: register('remote-explorer', 0xeb39),\n remote: register('remote', 0xeb3a),\n remove: register('remove', 0xeb3b),\n replaceAll: register('replace-all', 0xeb3c),\n replace: register('replace', 0xeb3d),\n repoClone: register('repo-clone', 0xeb3e),\n repoForcePush: register('repo-force-push', 0xeb3f),\n repoPull: register('repo-pull', 0xeb40),\n repoPush: register('repo-push', 0xeb41),\n report: register('report', 0xeb42),\n requestChanges: register('request-changes', 0xeb43),\n rocket: register('rocket', 0xeb44),\n rootFolderOpened: register('root-folder-opened', 0xeb45),\n rootFolder: register('root-folder', 0xeb46),\n rss: register('rss', 0xeb47),\n ruby: register('ruby', 0xeb48),\n saveAll: register('save-all', 0xeb49),\n saveAs: register('save-as', 0xeb4a),\n save: register('save', 0xeb4b),\n screenFull: register('screen-full', 0xeb4c),\n screenNormal: register('screen-normal', 0xeb4d),\n searchStop: register('search-stop', 0xeb4e),\n server: register('server', 0xeb50),\n settingsGear: register('settings-gear', 0xeb51),\n settings: register('settings', 0xeb52),\n shield: register('shield', 0xeb53),\n smiley: register('smiley', 0xeb54),\n sortPrecedence: register('sort-precedence', 0xeb55),\n splitHorizontal: register('split-horizontal', 0xeb56),\n splitVertical: register('split-vertical', 0xeb57),\n squirrel: register('squirrel', 0xeb58),\n starFull: register('star-full', 0xeb59),\n starHalf: register('star-half', 0xeb5a),\n symbolClass: register('symbol-class', 0xeb5b),\n symbolColor: register('symbol-color', 0xeb5c),\n symbolCustomColor: register('symbol-customcolor', 0xeb5c),\n symbolConstant: register('symbol-constant', 0xeb5d),\n symbolEnumMember: register('symbol-enum-member', 0xeb5e),\n symbolField: register('symbol-field', 0xeb5f),\n symbolFile: register('symbol-file', 0xeb60),\n symbolInterface: register('symbol-interface', 0xeb61),\n symbolKeyword: register('symbol-keyword', 0xeb62),\n symbolMisc: register('symbol-misc', 0xeb63),\n symbolOperator: register('symbol-operator', 0xeb64),\n symbolProperty: register('symbol-property', 0xeb65),\n wrench: register('wrench', 0xeb65),\n wrenchSubaction: register('wrench-subaction', 0xeb65),\n symbolSnippet: register('symbol-snippet', 0xeb66),\n tasklist: register('tasklist', 0xeb67),\n telescope: register('telescope', 0xeb68),\n textSize: register('text-size', 0xeb69),\n threeBars: register('three-bars', 0xeb6a),\n thumbsdown: register('thumbsdown', 0xeb6b),\n thumbsup: register('thumbsup', 0xeb6c),\n tools: register('tools', 0xeb6d),\n triangleDown: register('triangle-down', 0xeb6e),\n triangleLeft: register('triangle-left', 0xeb6f),\n triangleRight: register('triangle-right', 0xeb70),\n triangleUp: register('triangle-up', 0xeb71),\n twitter: register('twitter', 0xeb72),\n unfold: register('unfold', 0xeb73),\n unlock: register('unlock', 0xeb74),\n unmute: register('unmute', 0xeb75),\n unverified: register('unverified', 0xeb76),\n verified: register('verified', 0xeb77),\n versions: register('versions', 0xeb78),\n vmActive: register('vm-active', 0xeb79),\n vmOutline: register('vm-outline', 0xeb7a),\n vmRunning: register('vm-running', 0xeb7b),\n watch: register('watch', 0xeb7c),\n whitespace: register('whitespace', 0xeb7d),\n wholeWord: register('whole-word', 0xeb7e),\n window: register('window', 0xeb7f),\n wordWrap: register('word-wrap', 0xeb80),\n zoomIn: register('zoom-in', 0xeb81),\n zoomOut: register('zoom-out', 0xeb82),\n listFilter: register('list-filter', 0xeb83),\n listFlat: register('list-flat', 0xeb84),\n listSelection: register('list-selection', 0xeb85),\n selection: register('selection', 0xeb85),\n listTree: register('list-tree', 0xeb86),\n debugBreakpointFunctionUnverified: register('debug-breakpoint-function-unverified', 0xeb87),\n debugBreakpointFunction: register('debug-breakpoint-function', 0xeb88),\n debugBreakpointFunctionDisabled: register('debug-breakpoint-function-disabled', 0xeb88),\n debugStackframeActive: register('debug-stackframe-active', 0xeb89),\n circleSmallFilled: register('circle-small-filled', 0xeb8a),\n debugStackframeDot: register('debug-stackframe-dot', 0xeb8a),\n debugStackframe: register('debug-stackframe', 0xeb8b),\n debugStackframeFocused: register('debug-stackframe-focused', 0xeb8b),\n debugBreakpointUnsupported: register('debug-breakpoint-unsupported', 0xeb8c),\n symbolString: register('symbol-string', 0xeb8d),\n debugReverseContinue: register('debug-reverse-continue', 0xeb8e),\n debugStepBack: register('debug-step-back', 0xeb8f),\n debugRestartFrame: register('debug-restart-frame', 0xeb90),\n callIncoming: register('call-incoming', 0xeb92),\n callOutgoing: register('call-outgoing', 0xeb93),\n menu: register('menu', 0xeb94),\n expandAll: register('expand-all', 0xeb95),\n feedback: register('feedback', 0xeb96),\n gitPullRequestReviewer: register('git-pull-request-reviewer', 0xeb96),\n groupByRefType: register('group-by-ref-type', 0xeb97),\n ungroupByRefType: register('ungroup-by-ref-type', 0xeb98),\n account: register('account', 0xeb99),\n gitPullRequestAssignee: register('git-pull-request-assignee', 0xeb99),\n bellDot: register('bell-dot', 0xeb9a),\n debugConsole: register('debug-console', 0xeb9b),\n library: register('library', 0xeb9c),\n output: register('output', 0xeb9d),\n runAll: register('run-all', 0xeb9e),\n syncIgnored: register('sync-ignored', 0xeb9f),\n pinned: register('pinned', 0xeba0),\n githubInverted: register('github-inverted', 0xeba1),\n debugAlt: register('debug-alt', 0xeb91),\n serverProcess: register('server-process', 0xeba2),\n serverEnvironment: register('server-environment', 0xeba3),\n pass: register('pass', 0xeba4),\n stopCircle: register('stop-circle', 0xeba5),\n playCircle: register('play-circle', 0xeba6),\n record: register('record', 0xeba7),\n debugAltSmall: register('debug-alt-small', 0xeba8),\n vmConnect: register('vm-connect', 0xeba9),\n cloud: register('cloud', 0xebaa),\n merge: register('merge', 0xebab),\n exportIcon: register('export', 0xebac),\n graphLeft: register('graph-left', 0xebad),\n magnet: register('magnet', 0xebae),\n notebook: register('notebook', 0xebaf),\n redo: register('redo', 0xebb0),\n checkAll: register('check-all', 0xebb1),\n pinnedDirty: register('pinned-dirty', 0xebb2),\n passFilled: register('pass-filled', 0xebb3),\n circleLargeFilled: register('circle-large-filled', 0xebb4),\n circleLarge: register('circle-large', 0xebb5),\n circleLargeOutline: register('circle-large-outline', 0xebb5),\n combine: register('combine', 0xebb6),\n gather: register('gather', 0xebb6),\n table: register('table', 0xebb7),\n variableGroup: register('variable-group', 0xebb8),\n typeHierarchy: register('type-hierarchy', 0xebb9),\n typeHierarchySub: register('type-hierarchy-sub', 0xebba),\n typeHierarchySuper: register('type-hierarchy-super', 0xebbb),\n gitPullRequestCreate: register('git-pull-request-create', 0xebbc),\n runAbove: register('run-above', 0xebbd),\n runBelow: register('run-below', 0xebbe),\n notebookTemplate: register('notebook-template', 0xebbf),\n debugRerun: register('debug-rerun', 0xebc0),\n workspaceTrusted: register('workspace-trusted', 0xebc1),\n workspaceUntrusted: register('workspace-untrusted', 0xebc2),\n workspaceUnspecified: register('workspace-unspecified', 0xebc3),\n terminalCmd: register('terminal-cmd', 0xebc4),\n terminalDebian: register('terminal-debian', 0xebc5),\n terminalLinux: register('terminal-linux', 0xebc6),\n terminalPowershell: register('terminal-powershell', 0xebc7),\n terminalTmux: register('terminal-tmux', 0xebc8),\n terminalUbuntu: register('terminal-ubuntu', 0xebc9),\n terminalBash: register('terminal-bash', 0xebca),\n arrowSwap: register('arrow-swap', 0xebcb),\n copy: register('copy', 0xebcc),\n personAdd: register('person-add', 0xebcd),\n filterFilled: register('filter-filled', 0xebce),\n wand: register('wand', 0xebcf),\n debugLineByLine: register('debug-line-by-line', 0xebd0),\n inspect: register('inspect', 0xebd1),\n layers: register('layers', 0xebd2),\n layersDot: register('layers-dot', 0xebd3),\n layersActive: register('layers-active', 0xebd4),\n compass: register('compass', 0xebd5),\n compassDot: register('compass-dot', 0xebd6),\n compassActive: register('compass-active', 0xebd7),\n azure: register('azure', 0xebd8),\n issueDraft: register('issue-draft', 0xebd9),\n gitPullRequestClosed: register('git-pull-request-closed', 0xebda),\n gitPullRequestDraft: register('git-pull-request-draft', 0xebdb),\n debugAll: register('debug-all', 0xebdc),\n debugCoverage: register('debug-coverage', 0xebdd),\n runErrors: register('run-errors', 0xebde),\n folderLibrary: register('folder-library', 0xebdf),\n debugContinueSmall: register('debug-continue-small', 0xebe0),\n beakerStop: register('beaker-stop', 0xebe1),\n graphLine: register('graph-line', 0xebe2),\n graphScatter: register('graph-scatter', 0xebe3),\n pieChart: register('pie-chart', 0xebe4),\n bracketDot: register('bracket-dot', 0xebe5),\n bracketError: register('bracket-error', 0xebe6),\n lockSmall: register('lock-small', 0xebe7),\n azureDevops: register('azure-devops', 0xebe8),\n verifiedFilled: register('verified-filled', 0xebe9),\n newLine: register('newline', 0xebea),\n layout: register('layout', 0xebeb),\n layoutActivitybarLeft: register('layout-activitybar-left', 0xebec),\n layoutActivitybarRight: register('layout-activitybar-right', 0xebed),\n layoutPanelLeft: register('layout-panel-left', 0xebee),\n layoutPanelCenter: register('layout-panel-center', 0xebef),\n layoutPanelJustify: register('layout-panel-justify', 0xebf0),\n layoutPanelRight: register('layout-panel-right', 0xebf1),\n layoutPanel: register('layout-panel', 0xebf2),\n layoutSidebarLeft: register('layout-sidebar-left', 0xebf3),\n layoutSidebarRight: register('layout-sidebar-right', 0xebf4),\n layoutStatusbar: register('layout-statusbar', 0xebf5),\n layoutMenubar: register('layout-menubar', 0xebf6),\n layoutCentered: register('layout-centered', 0xebf7),\n layoutSidebarRightOff: register('layout-sidebar-right-off', 0xec00),\n layoutPanelOff: register('layout-panel-off', 0xec01),\n layoutSidebarLeftOff: register('layout-sidebar-left-off', 0xec02),\n target: register('target', 0xebf8),\n indent: register('indent', 0xebf9),\n recordSmall: register('record-small', 0xebfa),\n errorSmall: register('error-small', 0xebfb),\n arrowCircleDown: register('arrow-circle-down', 0xebfc),\n arrowCircleLeft: register('arrow-circle-left', 0xebfd),\n arrowCircleRight: register('arrow-circle-right', 0xebfe),\n arrowCircleUp: register('arrow-circle-up', 0xebff),\n heartFilled: register('heart-filled', 0xec04),\n map: register('map', 0xec05),\n mapFilled: register('map-filled', 0xec06),\n circleSmall: register('circle-small', 0xec07),\n bellSlash: register('bell-slash', 0xec08),\n bellSlashDot: register('bell-slash-dot', 0xec09),\n commentUnresolved: register('comment-unresolved', 0xec0a),\n gitPullRequestGoToChanges: register('git-pull-request-go-to-changes', 0xec0b),\n gitPullRequestNewChanges: register('git-pull-request-new-changes', 0xec0c),\n searchFuzzy: register('search-fuzzy', 0xec0d),\n commentDraft: register('comment-draft', 0xec0e),\n send: register('send', 0xec0f),\n sparkle: register('sparkle', 0xec10),\n insert: register('insert', 0xec11),\n mic: register('mic', 0xec12),\n thumbsDownFilled: register('thumbsdown-filled', 0xec13),\n thumbsUpFilled: register('thumbsup-filled', 0xec14),\n coffee: register('coffee', 0xec15),\n snake: register('snake', 0xec16),\n game: register('game', 0xec17),\n vr: register('vr', 0xec18),\n chip: register('chip', 0xec19),\n piano: register('piano', 0xec1a),\n music: register('music', 0xec1b),\n micFilled: register('mic-filled', 0xec1c),\n gitFetch: register('git-fetch', 0xec1d),\n copilot: register('copilot', 0xec1e),\n lightbulbSparkle: register('lightbulb-sparkle', 0xec1f),\n lightbulbSparkleAutofix: register('lightbulb-sparkle-autofix', 0xec1f),\n robot: register('robot', 0xec20),\n sparkleFilled: register('sparkle-filled', 0xec21),\n diffSingle: register('diff-single', 0xec22),\n diffMultiple: register('diff-multiple', 0xec23),\n // derived icons, that could become separate icons\n dialogError: register('dialog-error', 'error'),\n dialogWarning: register('dialog-warning', 'warning'),\n dialogInfo: register('dialog-info', 'info'),\n dialogClose: register('dialog-close', 'close'),\n treeItemExpanded: register('tree-item-expanded', 'chevron-down'), // collapsed is done with rotation\n treeFilterOnTypeOn: register('tree-filter-on-type-on', 'list-filter'),\n treeFilterOnTypeOff: register('tree-filter-on-type-off', 'list-selection'),\n treeFilterClear: register('tree-filter-clear', 'close'),\n treeItemLoading: register('tree-item-loading', 'loading'),\n menuSelection: register('menu-selection', 'check'),\n menuSubmenu: register('menu-submenu', 'chevron-right'),\n menuBarMore: register('menubar-more', 'more'),\n scrollbarButtonLeft: register('scrollbar-button-left', 'triangle-left'),\n scrollbarButtonRight: register('scrollbar-button-right', 'triangle-right'),\n scrollbarButtonUp: register('scrollbar-button-up', 'triangle-up'),\n scrollbarButtonDown: register('scrollbar-button-down', 'triangle-down'),\n toolBarMore: register('toolbar-more', 'more'),\n quickInputBack: register('quick-input-back', 'arrow-left')\n};\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nfunction roundFloat(number, decimalPoints) {\n const decimal = Math.pow(10, decimalPoints);\n return Math.round(number * decimal) / decimal;\n}\nexport class RGBA {\n constructor(r, g, b, a = 1) {\n this._rgbaBrand = undefined;\n this.r = Math.min(255, Math.max(0, r)) | 0;\n this.g = Math.min(255, Math.max(0, g)) | 0;\n this.b = Math.min(255, Math.max(0, b)) | 0;\n this.a = roundFloat(Math.max(Math.min(1, a), 0), 3);\n }\n static equals(a, b) {\n return a.r === b.r && a.g === b.g && a.b === b.b && a.a === b.a;\n }\n}\nexport class HSLA {\n constructor(h, s, l, a) {\n this._hslaBrand = undefined;\n this.h = Math.max(Math.min(360, h), 0) | 0;\n this.s = roundFloat(Math.max(Math.min(1, s), 0), 3);\n this.l = roundFloat(Math.max(Math.min(1, l), 0), 3);\n this.a = roundFloat(Math.max(Math.min(1, a), 0), 3);\n }\n static equals(a, b) {\n return a.h === b.h && a.s === b.s && a.l === b.l && a.a === b.a;\n }\n /**\n * Converts an RGB color value to HSL. Conversion formula\n * adapted from http://en.wikipedia.org/wiki/HSL_color_space.\n * Assumes r, g, and b are contained in the set [0, 255] and\n * returns h in the set [0, 360], s, and l in the set [0, 1].\n */\n static fromRGBA(rgba) {\n const r = rgba.r / 255;\n const g = rgba.g / 255;\n const b = rgba.b / 255;\n const a = rgba.a;\n const max = Math.max(r, g, b);\n const min = Math.min(r, g, b);\n let h = 0;\n let s = 0;\n const l = (min + max) / 2;\n const chroma = max - min;\n if (chroma > 0) {\n s = Math.min((l <= 0.5 ? chroma / (2 * l) : chroma / (2 - (2 * l))), 1);\n switch (max) {\n case r:\n h = (g - b) / chroma + (g < b ? 6 : 0);\n break;\n case g:\n h = (b - r) / chroma + 2;\n break;\n case b:\n h = (r - g) / chroma + 4;\n break;\n }\n h *= 60;\n h = Math.round(h);\n }\n return new HSLA(h, s, l, a);\n }\n static _hue2rgb(p, q, t) {\n if (t < 0) {\n t += 1;\n }\n if (t > 1) {\n t -= 1;\n }\n if (t < 1 / 6) {\n return p + (q - p) * 6 * t;\n }\n if (t < 1 / 2) {\n return q;\n }\n if (t < 2 / 3) {\n return p + (q - p) * (2 / 3 - t) * 6;\n }\n return p;\n }\n /**\n * Converts an HSL color value to RGB. Conversion formula\n * adapted from http://en.wikipedia.org/wiki/HSL_color_space.\n * Assumes h in the set [0, 360] s, and l are contained in the set [0, 1] and\n * returns r, g, and b in the set [0, 255].\n */\n static toRGBA(hsla) {\n const h = hsla.h / 360;\n const { s, l, a } = hsla;\n let r, g, b;\n if (s === 0) {\n r = g = b = l; // achromatic\n }\n else {\n const q = l < 0.5 ? l * (1 + s) : l + s - l * s;\n const p = 2 * l - q;\n r = HSLA._hue2rgb(p, q, h + 1 / 3);\n g = HSLA._hue2rgb(p, q, h);\n b = HSLA._hue2rgb(p, q, h - 1 / 3);\n }\n return new RGBA(Math.round(r * 255), Math.round(g * 255), Math.round(b * 255), a);\n }\n}\nexport class HSVA {\n constructor(h, s, v, a) {\n this._hsvaBrand = undefined;\n this.h = Math.max(Math.min(360, h), 0) | 0;\n this.s = roundFloat(Math.max(Math.min(1, s), 0), 3);\n this.v = roundFloat(Math.max(Math.min(1, v), 0), 3);\n this.a = roundFloat(Math.max(Math.min(1, a), 0), 3);\n }\n static equals(a, b) {\n return a.h === b.h && a.s === b.s && a.v === b.v && a.a === b.a;\n }\n // from http://www.rapidtables.com/convert/color/rgb-to-hsv.htm\n static fromRGBA(rgba) {\n const r = rgba.r / 255;\n const g = rgba.g / 255;\n const b = rgba.b / 255;\n const cmax = Math.max(r, g, b);\n const cmin = Math.min(r, g, b);\n const delta = cmax - cmin;\n const s = cmax === 0 ? 0 : (delta / cmax);\n let m;\n if (delta === 0) {\n m = 0;\n }\n else if (cmax === r) {\n m = ((((g - b) / delta) % 6) + 6) % 6;\n }\n else if (cmax === g) {\n m = ((b - r) / delta) + 2;\n }\n else {\n m = ((r - g) / delta) + 4;\n }\n return new HSVA(Math.round(m * 60), s, cmax, rgba.a);\n }\n // from http://www.rapidtables.com/convert/color/hsv-to-rgb.htm\n static toRGBA(hsva) {\n const { h, s, v, a } = hsva;\n const c = v * s;\n const x = c * (1 - Math.abs((h / 60) % 2 - 1));\n const m = v - c;\n let [r, g, b] = [0, 0, 0];\n if (h < 60) {\n r = c;\n g = x;\n }\n else if (h < 120) {\n r = x;\n g = c;\n }\n else if (h < 180) {\n g = c;\n b = x;\n }\n else if (h < 240) {\n g = x;\n b = c;\n }\n else if (h < 300) {\n r = x;\n b = c;\n }\n else if (h <= 360) {\n r = c;\n b = x;\n }\n r = Math.round((r + m) * 255);\n g = Math.round((g + m) * 255);\n b = Math.round((b + m) * 255);\n return new RGBA(r, g, b, a);\n }\n}\nexport class Color {\n static fromHex(hex) {\n return Color.Format.CSS.parseHex(hex) || Color.red;\n }\n static equals(a, b) {\n if (!a && !b) {\n return true;\n }\n if (!a || !b) {\n return false;\n }\n return a.equals(b);\n }\n get hsla() {\n if (this._hsla) {\n return this._hsla;\n }\n else {\n return HSLA.fromRGBA(this.rgba);\n }\n }\n get hsva() {\n if (this._hsva) {\n return this._hsva;\n }\n return HSVA.fromRGBA(this.rgba);\n }\n constructor(arg) {\n if (!arg) {\n throw new Error('Color needs a value');\n }\n else if (arg instanceof RGBA) {\n this.rgba = arg;\n }\n else if (arg instanceof HSLA) {\n this._hsla = arg;\n this.rgba = HSLA.toRGBA(arg);\n }\n else if (arg instanceof HSVA) {\n this._hsva = arg;\n this.rgba = HSVA.toRGBA(arg);\n }\n else {\n throw new Error('Invalid color ctor argument');\n }\n }\n equals(other) {\n return !!other && RGBA.equals(this.rgba, other.rgba) && HSLA.equals(this.hsla, other.hsla) && HSVA.equals(this.hsva, other.hsva);\n }\n /**\n * http://www.w3.org/TR/WCAG20/#relativeluminancedef\n * Returns the number in the set [0, 1]. O => Darkest Black. 1 => Lightest white.\n */\n getRelativeLuminance() {\n const R = Color._relativeLuminanceForComponent(this.rgba.r);\n const G = Color._relativeLuminanceForComponent(this.rgba.g);\n const B = Color._relativeLuminanceForComponent(this.rgba.b);\n const luminance = 0.2126 * R + 0.7152 * G + 0.0722 * B;\n return roundFloat(luminance, 4);\n }\n static _relativeLuminanceForComponent(color) {\n const c = color / 255;\n return (c <= 0.03928) ? c / 12.92 : Math.pow(((c + 0.055) / 1.055), 2.4);\n }\n /**\n *\thttp://24ways.org/2010/calculating-color-contrast\n * Return 'true' if lighter color otherwise 'false'\n */\n isLighter() {\n const yiq = (this.rgba.r * 299 + this.rgba.g * 587 + this.rgba.b * 114) / 1000;\n return yiq >= 128;\n }\n isLighterThan(another) {\n const lum1 = this.getRelativeLuminance();\n const lum2 = another.getRelativeLuminance();\n return lum1 > lum2;\n }\n isDarkerThan(another) {\n const lum1 = this.getRelativeLuminance();\n const lum2 = another.getRelativeLuminance();\n return lum1 < lum2;\n }\n lighten(factor) {\n return new Color(new HSLA(this.hsla.h, this.hsla.s, this.hsla.l + this.hsla.l * factor, this.hsla.a));\n }\n darken(factor) {\n return new Color(new HSLA(this.hsla.h, this.hsla.s, this.hsla.l - this.hsla.l * factor, this.hsla.a));\n }\n transparent(factor) {\n const { r, g, b, a } = this.rgba;\n return new Color(new RGBA(r, g, b, a * factor));\n }\n isTransparent() {\n return this.rgba.a === 0;\n }\n isOpaque() {\n return this.rgba.a === 1;\n }\n opposite() {\n return new Color(new RGBA(255 - this.rgba.r, 255 - this.rgba.g, 255 - this.rgba.b, this.rgba.a));\n }\n makeOpaque(opaqueBackground) {\n if (this.isOpaque() || opaqueBackground.rgba.a !== 1) {\n // only allow to blend onto a non-opaque color onto a opaque color\n return this;\n }\n const { r, g, b, a } = this.rgba;\n // https://stackoverflow.com/questions/12228548/finding-equivalent-color-with-opacity\n return new Color(new RGBA(opaqueBackground.rgba.r - a * (opaqueBackground.rgba.r - r), opaqueBackground.rgba.g - a * (opaqueBackground.rgba.g - g), opaqueBackground.rgba.b - a * (opaqueBackground.rgba.b - b), 1));\n }\n toString() {\n if (!this._toString) {\n this._toString = Color.Format.CSS.format(this);\n }\n return this._toString;\n }\n static getLighterColor(of, relative, factor) {\n if (of.isLighterThan(relative)) {\n return of;\n }\n factor = factor ? factor : 0.5;\n const lum1 = of.getRelativeLuminance();\n const lum2 = relative.getRelativeLuminance();\n factor = factor * (lum2 - lum1) / lum2;\n return of.lighten(factor);\n }\n static getDarkerColor(of, relative, factor) {\n if (of.isDarkerThan(relative)) {\n return of;\n }\n factor = factor ? factor : 0.5;\n const lum1 = of.getRelativeLuminance();\n const lum2 = relative.getRelativeLuminance();\n factor = factor * (lum1 - lum2) / lum1;\n return of.darken(factor);\n }\n}\nColor.white = new Color(new RGBA(255, 255, 255, 1));\nColor.black = new Color(new RGBA(0, 0, 0, 1));\nColor.red = new Color(new RGBA(255, 0, 0, 1));\nColor.blue = new Color(new RGBA(0, 0, 255, 1));\nColor.green = new Color(new RGBA(0, 255, 0, 1));\nColor.cyan = new Color(new RGBA(0, 255, 255, 1));\nColor.lightgrey = new Color(new RGBA(211, 211, 211, 1));\nColor.transparent = new Color(new RGBA(0, 0, 0, 0));\n(function (Color) {\n let Format;\n (function (Format) {\n let CSS;\n (function (CSS) {\n function formatRGB(color) {\n if (color.rgba.a === 1) {\n return `rgb(${color.rgba.r}, ${color.rgba.g}, ${color.rgba.b})`;\n }\n return Color.Format.CSS.formatRGBA(color);\n }\n CSS.formatRGB = formatRGB;\n function formatRGBA(color) {\n return `rgba(${color.rgba.r}, ${color.rgba.g}, ${color.rgba.b}, ${+(color.rgba.a).toFixed(2)})`;\n }\n CSS.formatRGBA = formatRGBA;\n function formatHSL(color) {\n if (color.hsla.a === 1) {\n return `hsl(${color.hsla.h}, ${(color.hsla.s * 100).toFixed(2)}%, ${(color.hsla.l * 100).toFixed(2)}%)`;\n }\n return Color.Format.CSS.formatHSLA(color);\n }\n CSS.formatHSL = formatHSL;\n function formatHSLA(color) {\n return `hsla(${color.hsla.h}, ${(color.hsla.s * 100).toFixed(2)}%, ${(color.hsla.l * 100).toFixed(2)}%, ${color.hsla.a.toFixed(2)})`;\n }\n CSS.formatHSLA = formatHSLA;\n function _toTwoDigitHex(n) {\n const r = n.toString(16);\n return r.length !== 2 ? '0' + r : r;\n }\n /**\n * Formats the color as #RRGGBB\n */\n function formatHex(color) {\n return `#${_toTwoDigitHex(color.rgba.r)}${_toTwoDigitHex(color.rgba.g)}${_toTwoDigitHex(color.rgba.b)}`;\n }\n CSS.formatHex = formatHex;\n /**\n * Formats the color as #RRGGBBAA\n * If 'compact' is set, colors without transparancy will be printed as #RRGGBB\n */\n function formatHexA(color, compact = false) {\n if (compact && color.rgba.a === 1) {\n return Color.Format.CSS.formatHex(color);\n }\n return `#${_toTwoDigitHex(color.rgba.r)}${_toTwoDigitHex(color.rgba.g)}${_toTwoDigitHex(color.rgba.b)}${_toTwoDigitHex(Math.round(color.rgba.a * 255))}`;\n }\n CSS.formatHexA = formatHexA;\n /**\n * The default format will use HEX if opaque and RGBA otherwise.\n */\n function format(color) {\n if (color.isOpaque()) {\n return Color.Format.CSS.formatHex(color);\n }\n return Color.Format.CSS.formatRGBA(color);\n }\n CSS.format = format;\n /**\n * Converts an Hex color value to a Color.\n * returns r, g, and b are contained in the set [0, 255]\n * @param hex string (#RGB, #RGBA, #RRGGBB or #RRGGBBAA).\n */\n function parseHex(hex) {\n const length = hex.length;\n if (length === 0) {\n // Invalid color\n return null;\n }\n if (hex.charCodeAt(0) !== 35 /* CharCode.Hash */) {\n // Does not begin with a #\n return null;\n }\n if (length === 7) {\n // #RRGGBB format\n const r = 16 * _parseHexDigit(hex.charCodeAt(1)) + _parseHexDigit(hex.charCodeAt(2));\n const g = 16 * _parseHexDigit(hex.charCodeAt(3)) + _parseHexDigit(hex.charCodeAt(4));\n const b = 16 * _parseHexDigit(hex.charCodeAt(5)) + _parseHexDigit(hex.charCodeAt(6));\n return new Color(new RGBA(r, g, b, 1));\n }\n if (length === 9) {\n // #RRGGBBAA format\n const r = 16 * _parseHexDigit(hex.charCodeAt(1)) + _parseHexDigit(hex.charCodeAt(2));\n const g = 16 * _parseHexDigit(hex.charCodeAt(3)) + _parseHexDigit(hex.charCodeAt(4));\n const b = 16 * _parseHexDigit(hex.charCodeAt(5)) + _parseHexDigit(hex.charCodeAt(6));\n const a = 16 * _parseHexDigit(hex.charCodeAt(7)) + _parseHexDigit(hex.charCodeAt(8));\n return new Color(new RGBA(r, g, b, a / 255));\n }\n if (length === 4) {\n // #RGB format\n const r = _parseHexDigit(hex.charCodeAt(1));\n const g = _parseHexDigit(hex.charCodeAt(2));\n const b = _parseHexDigit(hex.charCodeAt(3));\n return new Color(new RGBA(16 * r + r, 16 * g + g, 16 * b + b));\n }\n if (length === 5) {\n // #RGBA format\n const r = _parseHexDigit(hex.charCodeAt(1));\n const g = _parseHexDigit(hex.charCodeAt(2));\n const b = _parseHexDigit(hex.charCodeAt(3));\n const a = _parseHexDigit(hex.charCodeAt(4));\n return new Color(new RGBA(16 * r + r, 16 * g + g, 16 * b + b, (16 * a + a) / 255));\n }\n // Invalid color\n return null;\n }\n CSS.parseHex = parseHex;\n function _parseHexDigit(charCode) {\n switch (charCode) {\n case 48 /* CharCode.Digit0 */: return 0;\n case 49 /* CharCode.Digit1 */: return 1;\n case 50 /* CharCode.Digit2 */: return 2;\n case 51 /* CharCode.Digit3 */: return 3;\n case 52 /* CharCode.Digit4 */: return 4;\n case 53 /* CharCode.Digit5 */: return 5;\n case 54 /* CharCode.Digit6 */: return 6;\n case 55 /* CharCode.Digit7 */: return 7;\n case 56 /* CharCode.Digit8 */: return 8;\n case 57 /* CharCode.Digit9 */: return 9;\n case 97 /* CharCode.a */: return 10;\n case 65 /* CharCode.A */: return 10;\n case 98 /* CharCode.b */: return 11;\n case 66 /* CharCode.B */: return 11;\n case 99 /* CharCode.c */: return 12;\n case 67 /* CharCode.C */: return 12;\n case 100 /* CharCode.d */: return 13;\n case 68 /* CharCode.D */: return 13;\n case 101 /* CharCode.e */: return 14;\n case 69 /* CharCode.E */: return 14;\n case 102 /* CharCode.f */: return 15;\n case 70 /* CharCode.F */: return 15;\n }\n return 0;\n }\n })(CSS = Format.CSS || (Format.CSS = {}));\n })(Format = Color.Format || (Color.Format = {}));\n})(Color || (Color = {}));\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { DiffChange } from './diffChange.js';\nimport { stringHash } from '../hash.js';\nexport class StringDiffSequence {\n constructor(source) {\n this.source = source;\n }\n getElements() {\n const source = this.source;\n const characters = new Int32Array(source.length);\n for (let i = 0, len = source.length; i < len; i++) {\n characters[i] = source.charCodeAt(i);\n }\n return characters;\n }\n}\nexport function stringDiff(original, modified, pretty) {\n return new LcsDiff(new StringDiffSequence(original), new StringDiffSequence(modified)).ComputeDiff(pretty).changes;\n}\n//\n// The code below has been ported from a C# implementation in VS\n//\nclass Debug {\n static Assert(condition, message) {\n if (!condition) {\n throw new Error(message);\n }\n }\n}\nclass MyArray {\n /**\n * Copies a range of elements from an Array starting at the specified source index and pastes\n * them to another Array starting at the specified destination index. The length and the indexes\n * are specified as 64-bit integers.\n * sourceArray:\n *\t\tThe Array that contains the data to copy.\n * sourceIndex:\n *\t\tA 64-bit integer that represents the index in the sourceArray at which copying begins.\n * destinationArray:\n *\t\tThe Array that receives the data.\n * destinationIndex:\n *\t\tA 64-bit integer that represents the index in the destinationArray at which storing begins.\n * length:\n *\t\tA 64-bit integer that represents the number of elements to copy.\n */\n static Copy(sourceArray, sourceIndex, destinationArray, destinationIndex, length) {\n for (let i = 0; i < length; i++) {\n destinationArray[destinationIndex + i] = sourceArray[sourceIndex + i];\n }\n }\n static Copy2(sourceArray, sourceIndex, destinationArray, destinationIndex, length) {\n for (let i = 0; i < length; i++) {\n destinationArray[destinationIndex + i] = sourceArray[sourceIndex + i];\n }\n }\n}\n/**\n * A utility class which helps to create the set of DiffChanges from\n * a difference operation. This class accepts original DiffElements and\n * modified DiffElements that are involved in a particular change. The\n * MarkNextChange() method can be called to mark the separation between\n * distinct changes. At the end, the Changes property can be called to retrieve\n * the constructed changes.\n */\nclass DiffChangeHelper {\n /**\n * Constructs a new DiffChangeHelper for the given DiffSequences.\n */\n constructor() {\n this.m_changes = [];\n this.m_originalStart = 1073741824 /* Constants.MAX_SAFE_SMALL_INTEGER */;\n this.m_modifiedStart = 1073741824 /* Constants.MAX_SAFE_SMALL_INTEGER */;\n this.m_originalCount = 0;\n this.m_modifiedCount = 0;\n }\n /**\n * Marks the beginning of the next change in the set of differences.\n */\n MarkNextChange() {\n // Only add to the list if there is something to add\n if (this.m_originalCount > 0 || this.m_modifiedCount > 0) {\n // Add the new change to our list\n this.m_changes.push(new DiffChange(this.m_originalStart, this.m_originalCount, this.m_modifiedStart, this.m_modifiedCount));\n }\n // Reset for the next change\n this.m_originalCount = 0;\n this.m_modifiedCount = 0;\n this.m_originalStart = 1073741824 /* Constants.MAX_SAFE_SMALL_INTEGER */;\n this.m_modifiedStart = 1073741824 /* Constants.MAX_SAFE_SMALL_INTEGER */;\n }\n /**\n * Adds the original element at the given position to the elements\n * affected by the current change. The modified index gives context\n * to the change position with respect to the original sequence.\n * @param originalIndex The index of the original element to add.\n * @param modifiedIndex The index of the modified element that provides corresponding position in the modified sequence.\n */\n AddOriginalElement(originalIndex, modifiedIndex) {\n // The 'true' start index is the smallest of the ones we've seen\n this.m_originalStart = Math.min(this.m_originalStart, originalIndex);\n this.m_modifiedStart = Math.min(this.m_modifiedStart, modifiedIndex);\n this.m_originalCount++;\n }\n /**\n * Adds the modified element at the given position to the elements\n * affected by the current change. The original index gives context\n * to the change position with respect to the modified sequence.\n * @param originalIndex The index of the original element that provides corresponding position in the original sequence.\n * @param modifiedIndex The index of the modified element to add.\n */\n AddModifiedElement(originalIndex, modifiedIndex) {\n // The 'true' start index is the smallest of the ones we've seen\n this.m_originalStart = Math.min(this.m_originalStart, originalIndex);\n this.m_modifiedStart = Math.min(this.m_modifiedStart, modifiedIndex);\n this.m_modifiedCount++;\n }\n /**\n * Retrieves all of the changes marked by the class.\n */\n getChanges() {\n if (this.m_originalCount > 0 || this.m_modifiedCount > 0) {\n // Finish up on whatever is left\n this.MarkNextChange();\n }\n return this.m_changes;\n }\n /**\n * Retrieves all of the changes marked by the class in the reverse order\n */\n getReverseChanges() {\n if (this.m_originalCount > 0 || this.m_modifiedCount > 0) {\n // Finish up on whatever is left\n this.MarkNextChange();\n }\n this.m_changes.reverse();\n return this.m_changes;\n }\n}\n/**\n * An implementation of the difference algorithm described in\n * \"An O(ND) Difference Algorithm and its variations\" by Eugene W. Myers\n */\nexport class LcsDiff {\n /**\n * Constructs the DiffFinder\n */\n constructor(originalSequence, modifiedSequence, continueProcessingPredicate = null) {\n this.ContinueProcessingPredicate = continueProcessingPredicate;\n this._originalSequence = originalSequence;\n this._modifiedSequence = modifiedSequence;\n const [originalStringElements, originalElementsOrHash, originalHasStrings] = LcsDiff._getElements(originalSequence);\n const [modifiedStringElements, modifiedElementsOrHash, modifiedHasStrings] = LcsDiff._getElements(modifiedSequence);\n this._hasStrings = (originalHasStrings && modifiedHasStrings);\n this._originalStringElements = originalStringElements;\n this._originalElementsOrHash = originalElementsOrHash;\n this._modifiedStringElements = modifiedStringElements;\n this._modifiedElementsOrHash = modifiedElementsOrHash;\n this.m_forwardHistory = [];\n this.m_reverseHistory = [];\n }\n static _isStringArray(arr) {\n return (arr.length > 0 && typeof arr[0] === 'string');\n }\n static _getElements(sequence) {\n const elements = sequence.getElements();\n if (LcsDiff._isStringArray(elements)) {\n const hashes = new Int32Array(elements.length);\n for (let i = 0, len = elements.length; i < len; i++) {\n hashes[i] = stringHash(elements[i], 0);\n }\n return [elements, hashes, true];\n }\n if (elements instanceof Int32Array) {\n return [[], elements, false];\n }\n return [[], new Int32Array(elements), false];\n }\n ElementsAreEqual(originalIndex, newIndex) {\n if (this._originalElementsOrHash[originalIndex] !== this._modifiedElementsOrHash[newIndex]) {\n return false;\n }\n return (this._hasStrings ? this._originalStringElements[originalIndex] === this._modifiedStringElements[newIndex] : true);\n }\n ElementsAreStrictEqual(originalIndex, newIndex) {\n if (!this.ElementsAreEqual(originalIndex, newIndex)) {\n return false;\n }\n const originalElement = LcsDiff._getStrictElement(this._originalSequence, originalIndex);\n const modifiedElement = LcsDiff._getStrictElement(this._modifiedSequence, newIndex);\n return (originalElement === modifiedElement);\n }\n static _getStrictElement(sequence, index) {\n if (typeof sequence.getStrictElement === 'function') {\n return sequence.getStrictElement(index);\n }\n return null;\n }\n OriginalElementsAreEqual(index1, index2) {\n if (this._originalElementsOrHash[index1] !== this._originalElementsOrHash[index2]) {\n return false;\n }\n return (this._hasStrings ? this._originalStringElements[index1] === this._originalStringElements[index2] : true);\n }\n ModifiedElementsAreEqual(index1, index2) {\n if (this._modifiedElementsOrHash[index1] !== this._modifiedElementsOrHash[index2]) {\n return false;\n }\n return (this._hasStrings ? this._modifiedStringElements[index1] === this._modifiedStringElements[index2] : true);\n }\n ComputeDiff(pretty) {\n return this._ComputeDiff(0, this._originalElementsOrHash.length - 1, 0, this._modifiedElementsOrHash.length - 1, pretty);\n }\n /**\n * Computes the differences between the original and modified input\n * sequences on the bounded range.\n * @returns An array of the differences between the two input sequences.\n */\n _ComputeDiff(originalStart, originalEnd, modifiedStart, modifiedEnd, pretty) {\n const quitEarlyArr = [false];\n let changes = this.ComputeDiffRecursive(originalStart, originalEnd, modifiedStart, modifiedEnd, quitEarlyArr);\n if (pretty) {\n // We have to clean up the computed diff to be more intuitive\n // but it turns out this cannot be done correctly until the entire set\n // of diffs have been computed\n changes = this.PrettifyChanges(changes);\n }\n return {\n quitEarly: quitEarlyArr[0],\n changes: changes\n };\n }\n /**\n * Private helper method which computes the differences on the bounded range\n * recursively.\n * @returns An array of the differences between the two input sequences.\n */\n ComputeDiffRecursive(originalStart, originalEnd, modifiedStart, modifiedEnd, quitEarlyArr) {\n quitEarlyArr[0] = false;\n // Find the start of the differences\n while (originalStart <= originalEnd && modifiedStart <= modifiedEnd && this.ElementsAreEqual(originalStart, modifiedStart)) {\n originalStart++;\n modifiedStart++;\n }\n // Find the end of the differences\n while (originalEnd >= originalStart && modifiedEnd >= modifiedStart && this.ElementsAreEqual(originalEnd, modifiedEnd)) {\n originalEnd--;\n modifiedEnd--;\n }\n // In the special case where we either have all insertions or all deletions or the sequences are identical\n if (originalStart > originalEnd || modifiedStart > modifiedEnd) {\n let changes;\n if (modifiedStart <= modifiedEnd) {\n Debug.Assert(originalStart === originalEnd + 1, 'originalStart should only be one more than originalEnd');\n // All insertions\n changes = [\n new DiffChange(originalStart, 0, modifiedStart, modifiedEnd - modifiedStart + 1)\n ];\n }\n else if (originalStart <= originalEnd) {\n Debug.Assert(modifiedStart === modifiedEnd + 1, 'modifiedStart should only be one more than modifiedEnd');\n // All deletions\n changes = [\n new DiffChange(originalStart, originalEnd - originalStart + 1, modifiedStart, 0)\n ];\n }\n else {\n Debug.Assert(originalStart === originalEnd + 1, 'originalStart should only be one more than originalEnd');\n Debug.Assert(modifiedStart === modifiedEnd + 1, 'modifiedStart should only be one more than modifiedEnd');\n // Identical sequences - No differences\n changes = [];\n }\n return changes;\n }\n // This problem can be solved using the Divide-And-Conquer technique.\n const midOriginalArr = [0];\n const midModifiedArr = [0];\n const result = this.ComputeRecursionPoint(originalStart, originalEnd, modifiedStart, modifiedEnd, midOriginalArr, midModifiedArr, quitEarlyArr);\n const midOriginal = midOriginalArr[0];\n const midModified = midModifiedArr[0];\n if (result !== null) {\n // Result is not-null when there was enough memory to compute the changes while\n // searching for the recursion point\n return result;\n }\n else if (!quitEarlyArr[0]) {\n // We can break the problem down recursively by finding the changes in the\n // First Half: (originalStart, modifiedStart) to (midOriginal, midModified)\n // Second Half: (midOriginal + 1, minModified + 1) to (originalEnd, modifiedEnd)\n // NOTE: ComputeDiff() is inclusive, therefore the second range starts on the next point\n const leftChanges = this.ComputeDiffRecursive(originalStart, midOriginal, modifiedStart, midModified, quitEarlyArr);\n let rightChanges = [];\n if (!quitEarlyArr[0]) {\n rightChanges = this.ComputeDiffRecursive(midOriginal + 1, originalEnd, midModified + 1, modifiedEnd, quitEarlyArr);\n }\n else {\n // We didn't have time to finish the first half, so we don't have time to compute this half.\n // Consider the entire rest of the sequence different.\n rightChanges = [\n new DiffChange(midOriginal + 1, originalEnd - (midOriginal + 1) + 1, midModified + 1, modifiedEnd - (midModified + 1) + 1)\n ];\n }\n return this.ConcatenateChanges(leftChanges, rightChanges);\n }\n // If we hit here, we quit early, and so can't return anything meaningful\n return [\n new DiffChange(originalStart, originalEnd - originalStart + 1, modifiedStart, modifiedEnd - modifiedStart + 1)\n ];\n }\n WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr) {\n let forwardChanges = null;\n let reverseChanges = null;\n // First, walk backward through the forward diagonals history\n let changeHelper = new DiffChangeHelper();\n let diagonalMin = diagonalForwardStart;\n let diagonalMax = diagonalForwardEnd;\n let diagonalRelative = (midOriginalArr[0] - midModifiedArr[0]) - diagonalForwardOffset;\n let lastOriginalIndex = -1073741824 /* Constants.MIN_SAFE_SMALL_INTEGER */;\n let historyIndex = this.m_forwardHistory.length - 1;\n do {\n // Get the diagonal index from the relative diagonal number\n const diagonal = diagonalRelative + diagonalForwardBase;\n // Figure out where we came from\n if (diagonal === diagonalMin || (diagonal < diagonalMax && forwardPoints[diagonal - 1] < forwardPoints[diagonal + 1])) {\n // Vertical line (the element is an insert)\n originalIndex = forwardPoints[diagonal + 1];\n modifiedIndex = originalIndex - diagonalRelative - diagonalForwardOffset;\n if (originalIndex < lastOriginalIndex) {\n changeHelper.MarkNextChange();\n }\n lastOriginalIndex = originalIndex;\n changeHelper.AddModifiedElement(originalIndex + 1, modifiedIndex);\n diagonalRelative = (diagonal + 1) - diagonalForwardBase; //Setup for the next iteration\n }\n else {\n // Horizontal line (the element is a deletion)\n originalIndex = forwardPoints[diagonal - 1] + 1;\n modifiedIndex = originalIndex - diagonalRelative - diagonalForwardOffset;\n if (originalIndex < lastOriginalIndex) {\n changeHelper.MarkNextChange();\n }\n lastOriginalIndex = originalIndex - 1;\n changeHelper.AddOriginalElement(originalIndex, modifiedIndex + 1);\n diagonalRelative = (diagonal - 1) - diagonalForwardBase; //Setup for the next iteration\n }\n if (historyIndex >= 0) {\n forwardPoints = this.m_forwardHistory[historyIndex];\n diagonalForwardBase = forwardPoints[0]; //We stored this in the first spot\n diagonalMin = 1;\n diagonalMax = forwardPoints.length - 1;\n }\n } while (--historyIndex >= -1);\n // Ironically, we get the forward changes as the reverse of the\n // order we added them since we technically added them backwards\n forwardChanges = changeHelper.getReverseChanges();\n if (quitEarlyArr[0]) {\n // TODO: Calculate a partial from the reverse diagonals.\n // For now, just assume everything after the midOriginal/midModified point is a diff\n let originalStartPoint = midOriginalArr[0] + 1;\n let modifiedStartPoint = midModifiedArr[0] + 1;\n if (forwardChanges !== null && forwardChanges.length > 0) {\n const lastForwardChange = forwardChanges[forwardChanges.length - 1];\n originalStartPoint = Math.max(originalStartPoint, lastForwardChange.getOriginalEnd());\n modifiedStartPoint = Math.max(modifiedStartPoint, lastForwardChange.getModifiedEnd());\n }\n reverseChanges = [\n new DiffChange(originalStartPoint, originalEnd - originalStartPoint + 1, modifiedStartPoint, modifiedEnd - modifiedStartPoint + 1)\n ];\n }\n else {\n // Now walk backward through the reverse diagonals history\n changeHelper = new DiffChangeHelper();\n diagonalMin = diagonalReverseStart;\n diagonalMax = diagonalReverseEnd;\n diagonalRelative = (midOriginalArr[0] - midModifiedArr[0]) - diagonalReverseOffset;\n lastOriginalIndex = 1073741824 /* Constants.MAX_SAFE_SMALL_INTEGER */;\n historyIndex = (deltaIsEven) ? this.m_reverseHistory.length - 1 : this.m_reverseHistory.length - 2;\n do {\n // Get the diagonal index from the relative diagonal number\n const diagonal = diagonalRelative + diagonalReverseBase;\n // Figure out where we came from\n if (diagonal === diagonalMin || (diagonal < diagonalMax && reversePoints[diagonal - 1] >= reversePoints[diagonal + 1])) {\n // Horizontal line (the element is a deletion))\n originalIndex = reversePoints[diagonal + 1] - 1;\n modifiedIndex = originalIndex - diagonalRelative - diagonalReverseOffset;\n if (originalIndex > lastOriginalIndex) {\n changeHelper.MarkNextChange();\n }\n lastOriginalIndex = originalIndex + 1;\n changeHelper.AddOriginalElement(originalIndex + 1, modifiedIndex + 1);\n diagonalRelative = (diagonal + 1) - diagonalReverseBase; //Setup for the next iteration\n }\n else {\n // Vertical line (the element is an insertion)\n originalIndex = reversePoints[diagonal - 1];\n modifiedIndex = originalIndex - diagonalRelative - diagonalReverseOffset;\n if (originalIndex > lastOriginalIndex) {\n changeHelper.MarkNextChange();\n }\n lastOriginalIndex = originalIndex;\n changeHelper.AddModifiedElement(originalIndex + 1, modifiedIndex + 1);\n diagonalRelative = (diagonal - 1) - diagonalReverseBase; //Setup for the next iteration\n }\n if (historyIndex >= 0) {\n reversePoints = this.m_reverseHistory[historyIndex];\n diagonalReverseBase = reversePoints[0]; //We stored this in the first spot\n diagonalMin = 1;\n diagonalMax = reversePoints.length - 1;\n }\n } while (--historyIndex >= -1);\n // There are cases where the reverse history will find diffs that\n // are correct, but not intuitive, so we need shift them.\n reverseChanges = changeHelper.getChanges();\n }\n return this.ConcatenateChanges(forwardChanges, reverseChanges);\n }\n /**\n * Given the range to compute the diff on, this method finds the point:\n * (midOriginal, midModified)\n * that exists in the middle of the LCS of the two sequences and\n * is the point at which the LCS problem may be broken down recursively.\n * This method will try to keep the LCS trace in memory. If the LCS recursion\n * point is calculated and the full trace is available in memory, then this method\n * will return the change list.\n * @param originalStart The start bound of the original sequence range\n * @param originalEnd The end bound of the original sequence range\n * @param modifiedStart The start bound of the modified sequence range\n * @param modifiedEnd The end bound of the modified sequence range\n * @param midOriginal The middle point of the original sequence range\n * @param midModified The middle point of the modified sequence range\n * @returns The diff changes, if available, otherwise null\n */\n ComputeRecursionPoint(originalStart, originalEnd, modifiedStart, modifiedEnd, midOriginalArr, midModifiedArr, quitEarlyArr) {\n let originalIndex = 0, modifiedIndex = 0;\n let diagonalForwardStart = 0, diagonalForwardEnd = 0;\n let diagonalReverseStart = 0, diagonalReverseEnd = 0;\n // To traverse the edit graph and produce the proper LCS, our actual\n // start position is just outside the given boundary\n originalStart--;\n modifiedStart--;\n // We set these up to make the compiler happy, but they will\n // be replaced before we return with the actual recursion point\n midOriginalArr[0] = 0;\n midModifiedArr[0] = 0;\n // Clear out the history\n this.m_forwardHistory = [];\n this.m_reverseHistory = [];\n // Each cell in the two arrays corresponds to a diagonal in the edit graph.\n // The integer value in the cell represents the originalIndex of the furthest\n // reaching point found so far that ends in that diagonal.\n // The modifiedIndex can be computed mathematically from the originalIndex and the diagonal number.\n const maxDifferences = (originalEnd - originalStart) + (modifiedEnd - modifiedStart);\n const numDiagonals = maxDifferences + 1;\n const forwardPoints = new Int32Array(numDiagonals);\n const reversePoints = new Int32Array(numDiagonals);\n // diagonalForwardBase: Index into forwardPoints of the diagonal which passes through (originalStart, modifiedStart)\n // diagonalReverseBase: Index into reversePoints of the diagonal which passes through (originalEnd, modifiedEnd)\n const diagonalForwardBase = (modifiedEnd - modifiedStart);\n const diagonalReverseBase = (originalEnd - originalStart);\n // diagonalForwardOffset: Geometric offset which allows modifiedIndex to be computed from originalIndex and the\n // diagonal number (relative to diagonalForwardBase)\n // diagonalReverseOffset: Geometric offset which allows modifiedIndex to be computed from originalIndex and the\n // diagonal number (relative to diagonalReverseBase)\n const diagonalForwardOffset = (originalStart - modifiedStart);\n const diagonalReverseOffset = (originalEnd - modifiedEnd);\n // delta: The difference between the end diagonal and the start diagonal. This is used to relate diagonal numbers\n // relative to the start diagonal with diagonal numbers relative to the end diagonal.\n // The Even/Oddn-ness of this delta is important for determining when we should check for overlap\n const delta = diagonalReverseBase - diagonalForwardBase;\n const deltaIsEven = (delta % 2 === 0);\n // Here we set up the start and end points as the furthest points found so far\n // in both the forward and reverse directions, respectively\n forwardPoints[diagonalForwardBase] = originalStart;\n reversePoints[diagonalReverseBase] = originalEnd;\n // Remember if we quit early, and thus need to do a best-effort result instead of a real result.\n quitEarlyArr[0] = false;\n // A couple of points:\n // --With this method, we iterate on the number of differences between the two sequences.\n // The more differences there actually are, the longer this will take.\n // --Also, as the number of differences increases, we have to search on diagonals further\n // away from the reference diagonal (which is diagonalForwardBase for forward, diagonalReverseBase for reverse).\n // --We extend on even diagonals (relative to the reference diagonal) only when numDifferences\n // is even and odd diagonals only when numDifferences is odd.\n for (let numDifferences = 1; numDifferences <= (maxDifferences / 2) + 1; numDifferences++) {\n let furthestOriginalIndex = 0;\n let furthestModifiedIndex = 0;\n // Run the algorithm in the forward direction\n diagonalForwardStart = this.ClipDiagonalBound(diagonalForwardBase - numDifferences, numDifferences, diagonalForwardBase, numDiagonals);\n diagonalForwardEnd = this.ClipDiagonalBound(diagonalForwardBase + numDifferences, numDifferences, diagonalForwardBase, numDiagonals);\n for (let diagonal = diagonalForwardStart; diagonal <= diagonalForwardEnd; diagonal += 2) {\n // STEP 1: We extend the furthest reaching point in the present diagonal\n // by looking at the diagonals above and below and picking the one whose point\n // is further away from the start point (originalStart, modifiedStart)\n if (diagonal === diagonalForwardStart || (diagonal < diagonalForwardEnd && forwardPoints[diagonal - 1] < forwardPoints[diagonal + 1])) {\n originalIndex = forwardPoints[diagonal + 1];\n }\n else {\n originalIndex = forwardPoints[diagonal - 1] + 1;\n }\n modifiedIndex = originalIndex - (diagonal - diagonalForwardBase) - diagonalForwardOffset;\n // Save the current originalIndex so we can test for false overlap in step 3\n const tempOriginalIndex = originalIndex;\n // STEP 2: We can continue to extend the furthest reaching point in the present diagonal\n // so long as the elements are equal.\n while (originalIndex < originalEnd && modifiedIndex < modifiedEnd && this.ElementsAreEqual(originalIndex + 1, modifiedIndex + 1)) {\n originalIndex++;\n modifiedIndex++;\n }\n forwardPoints[diagonal] = originalIndex;\n if (originalIndex + modifiedIndex > furthestOriginalIndex + furthestModifiedIndex) {\n furthestOriginalIndex = originalIndex;\n furthestModifiedIndex = modifiedIndex;\n }\n // STEP 3: If delta is odd (overlap first happens on forward when delta is odd)\n // and diagonal is in the range of reverse diagonals computed for numDifferences-1\n // (the previous iteration; we haven't computed reverse diagonals for numDifferences yet)\n // then check for overlap.\n if (!deltaIsEven && Math.abs(diagonal - diagonalReverseBase) <= (numDifferences - 1)) {\n if (originalIndex >= reversePoints[diagonal]) {\n midOriginalArr[0] = originalIndex;\n midModifiedArr[0] = modifiedIndex;\n if (tempOriginalIndex <= reversePoints[diagonal] && 1447 /* LocalConstants.MaxDifferencesHistory */ > 0 && numDifferences <= (1447 /* LocalConstants.MaxDifferencesHistory */ + 1)) {\n // BINGO! We overlapped, and we have the full trace in memory!\n return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr);\n }\n else {\n // Either false overlap, or we didn't have enough memory for the full trace\n // Just return the recursion point\n return null;\n }\n }\n }\n }\n // Check to see if we should be quitting early, before moving on to the next iteration.\n const matchLengthOfLongest = ((furthestOriginalIndex - originalStart) + (furthestModifiedIndex - modifiedStart) - numDifferences) / 2;\n if (this.ContinueProcessingPredicate !== null && !this.ContinueProcessingPredicate(furthestOriginalIndex, matchLengthOfLongest)) {\n // We can't finish, so skip ahead to generating a result from what we have.\n quitEarlyArr[0] = true;\n // Use the furthest distance we got in the forward direction.\n midOriginalArr[0] = furthestOriginalIndex;\n midModifiedArr[0] = furthestModifiedIndex;\n if (matchLengthOfLongest > 0 && 1447 /* LocalConstants.MaxDifferencesHistory */ > 0 && numDifferences <= (1447 /* LocalConstants.MaxDifferencesHistory */ + 1)) {\n // Enough of the history is in memory to walk it backwards\n return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr);\n }\n else {\n // We didn't actually remember enough of the history.\n //Since we are quitting the diff early, we need to shift back the originalStart and modified start\n //back into the boundary limits since we decremented their value above beyond the boundary limit.\n originalStart++;\n modifiedStart++;\n return [\n new DiffChange(originalStart, originalEnd - originalStart + 1, modifiedStart, modifiedEnd - modifiedStart + 1)\n ];\n }\n }\n // Run the algorithm in the reverse direction\n diagonalReverseStart = this.ClipDiagonalBound(diagonalReverseBase - numDifferences, numDifferences, diagonalReverseBase, numDiagonals);\n diagonalReverseEnd = this.ClipDiagonalBound(diagonalReverseBase + numDifferences, numDifferences, diagonalReverseBase, numDiagonals);\n for (let diagonal = diagonalReverseStart; diagonal <= diagonalReverseEnd; diagonal += 2) {\n // STEP 1: We extend the furthest reaching point in the present diagonal\n // by looking at the diagonals above and below and picking the one whose point\n // is further away from the start point (originalEnd, modifiedEnd)\n if (diagonal === diagonalReverseStart || (diagonal < diagonalReverseEnd && reversePoints[diagonal - 1] >= reversePoints[diagonal + 1])) {\n originalIndex = reversePoints[diagonal + 1] - 1;\n }\n else {\n originalIndex = reversePoints[diagonal - 1];\n }\n modifiedIndex = originalIndex - (diagonal - diagonalReverseBase) - diagonalReverseOffset;\n // Save the current originalIndex so we can test for false overlap\n const tempOriginalIndex = originalIndex;\n // STEP 2: We can continue to extend the furthest reaching point in the present diagonal\n // as long as the elements are equal.\n while (originalIndex > originalStart && modifiedIndex > modifiedStart && this.ElementsAreEqual(originalIndex, modifiedIndex)) {\n originalIndex--;\n modifiedIndex--;\n }\n reversePoints[diagonal] = originalIndex;\n // STEP 4: If delta is even (overlap first happens on reverse when delta is even)\n // and diagonal is in the range of forward diagonals computed for numDifferences\n // then check for overlap.\n if (deltaIsEven && Math.abs(diagonal - diagonalForwardBase) <= numDifferences) {\n if (originalIndex <= forwardPoints[diagonal]) {\n midOriginalArr[0] = originalIndex;\n midModifiedArr[0] = modifiedIndex;\n if (tempOriginalIndex >= forwardPoints[diagonal] && 1447 /* LocalConstants.MaxDifferencesHistory */ > 0 && numDifferences <= (1447 /* LocalConstants.MaxDifferencesHistory */ + 1)) {\n // BINGO! We overlapped, and we have the full trace in memory!\n return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr);\n }\n else {\n // Either false overlap, or we didn't have enough memory for the full trace\n // Just return the recursion point\n return null;\n }\n }\n }\n }\n // Save current vectors to history before the next iteration\n if (numDifferences <= 1447 /* LocalConstants.MaxDifferencesHistory */) {\n // We are allocating space for one extra int, which we fill with\n // the index of the diagonal base index\n let temp = new Int32Array(diagonalForwardEnd - diagonalForwardStart + 2);\n temp[0] = diagonalForwardBase - diagonalForwardStart + 1;\n MyArray.Copy2(forwardPoints, diagonalForwardStart, temp, 1, diagonalForwardEnd - diagonalForwardStart + 1);\n this.m_forwardHistory.push(temp);\n temp = new Int32Array(diagonalReverseEnd - diagonalReverseStart + 2);\n temp[0] = diagonalReverseBase - diagonalReverseStart + 1;\n MyArray.Copy2(reversePoints, diagonalReverseStart, temp, 1, diagonalReverseEnd - diagonalReverseStart + 1);\n this.m_reverseHistory.push(temp);\n }\n }\n // If we got here, then we have the full trace in history. We just have to convert it to a change list\n // NOTE: This part is a bit messy\n return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr);\n }\n /**\n * Shifts the given changes to provide a more intuitive diff.\n * While the first element in a diff matches the first element after the diff,\n * we shift the diff down.\n *\n * @param changes The list of changes to shift\n * @returns The shifted changes\n */\n PrettifyChanges(changes) {\n // Shift all the changes down first\n for (let i = 0; i < changes.length; i++) {\n const change = changes[i];\n const originalStop = (i < changes.length - 1) ? changes[i + 1].originalStart : this._originalElementsOrHash.length;\n const modifiedStop = (i < changes.length - 1) ? changes[i + 1].modifiedStart : this._modifiedElementsOrHash.length;\n const checkOriginal = change.originalLength > 0;\n const checkModified = change.modifiedLength > 0;\n while (change.originalStart + change.originalLength < originalStop\n && change.modifiedStart + change.modifiedLength < modifiedStop\n && (!checkOriginal || this.OriginalElementsAreEqual(change.originalStart, change.originalStart + change.originalLength))\n && (!checkModified || this.ModifiedElementsAreEqual(change.modifiedStart, change.modifiedStart + change.modifiedLength))) {\n const startStrictEqual = this.ElementsAreStrictEqual(change.originalStart, change.modifiedStart);\n const endStrictEqual = this.ElementsAreStrictEqual(change.originalStart + change.originalLength, change.modifiedStart + change.modifiedLength);\n if (endStrictEqual && !startStrictEqual) {\n // moving the change down would create an equal change, but the elements are not strict equal\n break;\n }\n change.originalStart++;\n change.modifiedStart++;\n }\n const mergedChangeArr = [null];\n if (i < changes.length - 1 && this.ChangesOverlap(changes[i], changes[i + 1], mergedChangeArr)) {\n changes[i] = mergedChangeArr[0];\n changes.splice(i + 1, 1);\n i--;\n continue;\n }\n }\n // Shift changes back up until we hit empty or whitespace-only lines\n for (let i = changes.length - 1; i >= 0; i--) {\n const change = changes[i];\n let originalStop = 0;\n let modifiedStop = 0;\n if (i > 0) {\n const prevChange = changes[i - 1];\n originalStop = prevChange.originalStart + prevChange.originalLength;\n modifiedStop = prevChange.modifiedStart + prevChange.modifiedLength;\n }\n const checkOriginal = change.originalLength > 0;\n const checkModified = change.modifiedLength > 0;\n let bestDelta = 0;\n let bestScore = this._boundaryScore(change.originalStart, change.originalLength, change.modifiedStart, change.modifiedLength);\n for (let delta = 1;; delta++) {\n const originalStart = change.originalStart - delta;\n const modifiedStart = change.modifiedStart - delta;\n if (originalStart < originalStop || modifiedStart < modifiedStop) {\n break;\n }\n if (checkOriginal && !this.OriginalElementsAreEqual(originalStart, originalStart + change.originalLength)) {\n break;\n }\n if (checkModified && !this.ModifiedElementsAreEqual(modifiedStart, modifiedStart + change.modifiedLength)) {\n break;\n }\n const touchingPreviousChange = (originalStart === originalStop && modifiedStart === modifiedStop);\n const score = ((touchingPreviousChange ? 5 : 0)\n + this._boundaryScore(originalStart, change.originalLength, modifiedStart, change.modifiedLength));\n if (score > bestScore) {\n bestScore = score;\n bestDelta = delta;\n }\n }\n change.originalStart -= bestDelta;\n change.modifiedStart -= bestDelta;\n const mergedChangeArr = [null];\n if (i > 0 && this.ChangesOverlap(changes[i - 1], changes[i], mergedChangeArr)) {\n changes[i - 1] = mergedChangeArr[0];\n changes.splice(i, 1);\n i++;\n continue;\n }\n }\n // There could be multiple longest common substrings.\n // Give preference to the ones containing longer lines\n if (this._hasStrings) {\n for (let i = 1, len = changes.length; i < len; i++) {\n const aChange = changes[i - 1];\n const bChange = changes[i];\n const matchedLength = bChange.originalStart - aChange.originalStart - aChange.originalLength;\n const aOriginalStart = aChange.originalStart;\n const bOriginalEnd = bChange.originalStart + bChange.originalLength;\n const abOriginalLength = bOriginalEnd - aOriginalStart;\n const aModifiedStart = aChange.modifiedStart;\n const bModifiedEnd = bChange.modifiedStart + bChange.modifiedLength;\n const abModifiedLength = bModifiedEnd - aModifiedStart;\n // Avoid wasting a lot of time with these searches\n if (matchedLength < 5 && abOriginalLength < 20 && abModifiedLength < 20) {\n const t = this._findBetterContiguousSequence(aOriginalStart, abOriginalLength, aModifiedStart, abModifiedLength, matchedLength);\n if (t) {\n const [originalMatchStart, modifiedMatchStart] = t;\n if (originalMatchStart !== aChange.originalStart + aChange.originalLength || modifiedMatchStart !== aChange.modifiedStart + aChange.modifiedLength) {\n // switch to another sequence that has a better score\n aChange.originalLength = originalMatchStart - aChange.originalStart;\n aChange.modifiedLength = modifiedMatchStart - aChange.modifiedStart;\n bChange.originalStart = originalMatchStart + matchedLength;\n bChange.modifiedStart = modifiedMatchStart + matchedLength;\n bChange.originalLength = bOriginalEnd - bChange.originalStart;\n bChange.modifiedLength = bModifiedEnd - bChange.modifiedStart;\n }\n }\n }\n }\n }\n return changes;\n }\n _findBetterContiguousSequence(originalStart, originalLength, modifiedStart, modifiedLength, desiredLength) {\n if (originalLength < desiredLength || modifiedLength < desiredLength) {\n return null;\n }\n const originalMax = originalStart + originalLength - desiredLength + 1;\n const modifiedMax = modifiedStart + modifiedLength - desiredLength + 1;\n let bestScore = 0;\n let bestOriginalStart = 0;\n let bestModifiedStart = 0;\n for (let i = originalStart; i < originalMax; i++) {\n for (let j = modifiedStart; j < modifiedMax; j++) {\n const score = this._contiguousSequenceScore(i, j, desiredLength);\n if (score > 0 && score > bestScore) {\n bestScore = score;\n bestOriginalStart = i;\n bestModifiedStart = j;\n }\n }\n }\n if (bestScore > 0) {\n return [bestOriginalStart, bestModifiedStart];\n }\n return null;\n }\n _contiguousSequenceScore(originalStart, modifiedStart, length) {\n let score = 0;\n for (let l = 0; l < length; l++) {\n if (!this.ElementsAreEqual(originalStart + l, modifiedStart + l)) {\n return 0;\n }\n score += this._originalStringElements[originalStart + l].length;\n }\n return score;\n }\n _OriginalIsBoundary(index) {\n if (index <= 0 || index >= this._originalElementsOrHash.length - 1) {\n return true;\n }\n return (this._hasStrings && /^\\s*$/.test(this._originalStringElements[index]));\n }\n _OriginalRegionIsBoundary(originalStart, originalLength) {\n if (this._OriginalIsBoundary(originalStart) || this._OriginalIsBoundary(originalStart - 1)) {\n return true;\n }\n if (originalLength > 0) {\n const originalEnd = originalStart + originalLength;\n if (this._OriginalIsBoundary(originalEnd - 1) || this._OriginalIsBoundary(originalEnd)) {\n return true;\n }\n }\n return false;\n }\n _ModifiedIsBoundary(index) {\n if (index <= 0 || index >= this._modifiedElementsOrHash.length - 1) {\n return true;\n }\n return (this._hasStrings && /^\\s*$/.test(this._modifiedStringElements[index]));\n }\n _ModifiedRegionIsBoundary(modifiedStart, modifiedLength) {\n if (this._ModifiedIsBoundary(modifiedStart) || this._ModifiedIsBoundary(modifiedStart - 1)) {\n return true;\n }\n if (modifiedLength > 0) {\n const modifiedEnd = modifiedStart + modifiedLength;\n if (this._ModifiedIsBoundary(modifiedEnd - 1) || this._ModifiedIsBoundary(modifiedEnd)) {\n return true;\n }\n }\n return false;\n }\n _boundaryScore(originalStart, originalLength, modifiedStart, modifiedLength) {\n const originalScore = (this._OriginalRegionIsBoundary(originalStart, originalLength) ? 1 : 0);\n const modifiedScore = (this._ModifiedRegionIsBoundary(modifiedStart, modifiedLength) ? 1 : 0);\n return (originalScore + modifiedScore);\n }\n /**\n * Concatenates the two input DiffChange lists and returns the resulting\n * list.\n * @param The left changes\n * @param The right changes\n * @returns The concatenated list\n */\n ConcatenateChanges(left, right) {\n const mergedChangeArr = [];\n if (left.length === 0 || right.length === 0) {\n return (right.length > 0) ? right : left;\n }\n else if (this.ChangesOverlap(left[left.length - 1], right[0], mergedChangeArr)) {\n // Since we break the problem down recursively, it is possible that we\n // might recurse in the middle of a change thereby splitting it into\n // two changes. Here in the combining stage, we detect and fuse those\n // changes back together\n const result = new Array(left.length + right.length - 1);\n MyArray.Copy(left, 0, result, 0, left.length - 1);\n result[left.length - 1] = mergedChangeArr[0];\n MyArray.Copy(right, 1, result, left.length, right.length - 1);\n return result;\n }\n else {\n const result = new Array(left.length + right.length);\n MyArray.Copy(left, 0, result, 0, left.length);\n MyArray.Copy(right, 0, result, left.length, right.length);\n return result;\n }\n }\n /**\n * Returns true if the two changes overlap and can be merged into a single\n * change\n * @param left The left change\n * @param right The right change\n * @param mergedChange The merged change if the two overlap, null otherwise\n * @returns True if the two changes overlap\n */\n ChangesOverlap(left, right, mergedChangeArr) {\n Debug.Assert(left.originalStart <= right.originalStart, 'Left change is not less than or equal to right change');\n Debug.Assert(left.modifiedStart <= right.modifiedStart, 'Left change is not less than or equal to right change');\n if (left.originalStart + left.originalLength >= right.originalStart || left.modifiedStart + left.modifiedLength >= right.modifiedStart) {\n const originalStart = left.originalStart;\n let originalLength = left.originalLength;\n const modifiedStart = left.modifiedStart;\n let modifiedLength = left.modifiedLength;\n if (left.originalStart + left.originalLength >= right.originalStart) {\n originalLength = right.originalStart + right.originalLength - left.originalStart;\n }\n if (left.modifiedStart + left.modifiedLength >= right.modifiedStart) {\n modifiedLength = right.modifiedStart + right.modifiedLength - left.modifiedStart;\n }\n mergedChangeArr[0] = new DiffChange(originalStart, originalLength, modifiedStart, modifiedLength);\n return true;\n }\n else {\n mergedChangeArr[0] = null;\n return false;\n }\n }\n /**\n * Helper method used to clip a diagonal index to the range of valid\n * diagonals. This also decides whether or not the diagonal index,\n * if it exceeds the boundary, should be clipped to the boundary or clipped\n * one inside the boundary depending on the Even/Odd status of the boundary\n * and numDifferences.\n * @param diagonal The index of the diagonal to clip.\n * @param numDifferences The current number of differences being iterated upon.\n * @param diagonalBaseIndex The base reference diagonal.\n * @param numDiagonals The total number of diagonals.\n * @returns The clipped diagonal index.\n */\n ClipDiagonalBound(diagonal, numDifferences, diagonalBaseIndex, numDiagonals) {\n if (diagonal >= 0 && diagonal < numDiagonals) {\n // Nothing to clip, its in range\n return diagonal;\n }\n // diagonalsBelow: The number of diagonals below the reference diagonal\n // diagonalsAbove: The number of diagonals above the reference diagonal\n const diagonalsBelow = diagonalBaseIndex;\n const diagonalsAbove = numDiagonals - diagonalBaseIndex - 1;\n const diffEven = (numDifferences % 2 === 0);\n if (diagonal < 0) {\n const lowerBoundEven = (diagonalsBelow % 2 === 0);\n return (diffEven === lowerBoundEven) ? 0 : 1;\n }\n else {\n const upperBoundEven = (diagonalsAbove % 2 === 0);\n return (diffEven === upperBoundEven) ? numDiagonals - 1 : numDiagonals - 2;\n }\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\n/**\n * Represents information about a specific difference between two sequences.\n */\nexport class DiffChange {\n /**\n * Constructs a new DiffChange with the given sequence information\n * and content.\n */\n constructor(originalStart, originalLength, modifiedStart, modifiedLength) {\n //Debug.Assert(originalLength > 0 || modifiedLength > 0, \"originalLength and modifiedLength cannot both be <= 0\");\n this.originalStart = originalStart;\n this.originalLength = originalLength;\n this.modifiedStart = modifiedStart;\n this.modifiedLength = modifiedLength;\n }\n /**\n * The end point (exclusive) of the change in the original sequence.\n */\n getOriginalEnd() {\n return this.originalStart + this.originalLength;\n }\n /**\n * The end point (exclusive) of the change in the modified sequence.\n */\n getModifiedEnd() {\n return this.modifiedStart + this.modifiedLength;\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\n// Avoid circular dependency on EventEmitter by implementing a subset of the interface.\nexport class ErrorHandler {\n constructor() {\n this.listeners = [];\n this.unexpectedErrorHandler = function (e) {\n setTimeout(() => {\n if (e.stack) {\n if (ErrorNoTelemetry.isErrorNoTelemetry(e)) {\n throw new ErrorNoTelemetry(e.message + '\\n\\n' + e.stack);\n }\n throw new Error(e.message + '\\n\\n' + e.stack);\n }\n throw e;\n }, 0);\n };\n }\n emit(e) {\n this.listeners.forEach((listener) => {\n listener(e);\n });\n }\n onUnexpectedError(e) {\n this.unexpectedErrorHandler(e);\n this.emit(e);\n }\n // For external errors, we don't want the listeners to be called\n onUnexpectedExternalError(e) {\n this.unexpectedErrorHandler(e);\n }\n}\nexport const errorHandler = new ErrorHandler();\nexport function onUnexpectedError(e) {\n // ignore errors from cancelled promises\n if (!isCancellationError(e)) {\n errorHandler.onUnexpectedError(e);\n }\n return undefined;\n}\nexport function onUnexpectedExternalError(e) {\n // ignore errors from cancelled promises\n if (!isCancellationError(e)) {\n errorHandler.onUnexpectedExternalError(e);\n }\n return undefined;\n}\nexport function transformErrorForSerialization(error) {\n if (error instanceof Error) {\n const { name, message } = error;\n const stack = error.stacktrace || error.stack;\n return {\n $isError: true,\n name,\n message,\n stack,\n noTelemetry: ErrorNoTelemetry.isErrorNoTelemetry(error)\n };\n }\n // return as is\n return error;\n}\nconst canceledName = 'Canceled';\n/**\n * Checks if the given error is a promise in canceled state\n */\nexport function isCancellationError(error) {\n if (error instanceof CancellationError) {\n return true;\n }\n return error instanceof Error && error.name === canceledName && error.message === canceledName;\n}\n// !!!IMPORTANT!!!\n// Do NOT change this class because it is also used as an API-type.\nexport class CancellationError extends Error {\n constructor() {\n super(canceledName);\n this.name = this.message;\n }\n}\n/**\n * @deprecated use {@link CancellationError `new CancellationError()`} instead\n */\nexport function canceled() {\n const error = new Error(canceledName);\n error.name = error.message;\n return error;\n}\nexport function illegalArgument(name) {\n if (name) {\n return new Error(`Illegal argument: ${name}`);\n }\n else {\n return new Error('Illegal argument');\n }\n}\nexport function illegalState(name) {\n if (name) {\n return new Error(`Illegal state: ${name}`);\n }\n else {\n return new Error('Illegal state');\n }\n}\nexport class NotSupportedError extends Error {\n constructor(message) {\n super('NotSupported');\n if (message) {\n this.message = message;\n }\n }\n}\n/**\n * Error that when thrown won't be logged in telemetry as an unhandled error.\n */\nexport class ErrorNoTelemetry extends Error {\n constructor(msg) {\n super(msg);\n this.name = 'CodeExpectedError';\n }\n static fromError(err) {\n if (err instanceof ErrorNoTelemetry) {\n return err;\n }\n const result = new ErrorNoTelemetry();\n result.message = err.message;\n result.stack = err.stack;\n return result;\n }\n static isErrorNoTelemetry(err) {\n return err.name === 'CodeExpectedError';\n }\n}\n/**\n * This error indicates a bug.\n * Do not throw this for invalid user input.\n * Only catch this error to recover gracefully from bugs.\n */\nexport class BugIndicatingError extends Error {\n constructor(message) {\n super(message || 'An unexpected bug occurred.');\n Object.setPrototypeOf(this, BugIndicatingError.prototype);\n // Because we know for sure only buggy code throws this,\n // we definitely want to break here and fix the bug.\n // eslint-disable-next-line no-debugger\n // debugger;\n }\n}\n","import { onUnexpectedError } from './errors.js';\nimport { createSingleCallFunction } from './functional.js';\nimport { combinedDisposable, Disposable, DisposableStore, toDisposable } from './lifecycle.js';\nimport { LinkedList } from './linkedList.js';\nimport { StopWatch } from './stopwatch.js';\n// -----------------------------------------------------------------------------------------------------------------------\n// Uncomment the next line to print warnings whenever an emitter with listeners is disposed. That is a sign of code smell.\n// -----------------------------------------------------------------------------------------------------------------------\nconst _enableDisposeWithListenerWarning = false;\n// _enableDisposeWithListenerWarning = Boolean(\"TRUE\"); // causes a linter warning so that it cannot be pushed\n// -----------------------------------------------------------------------------------------------------------------------\n// Uncomment the next line to print warnings whenever a snapshotted event is used repeatedly without cleanup.\n// See https://github.com/microsoft/vscode/issues/142851\n// -----------------------------------------------------------------------------------------------------------------------\nconst _enableSnapshotPotentialLeakWarning = false;\nexport var Event;\n(function (Event) {\n Event.None = () => Disposable.None;\n function _addLeakageTraceLogic(options) {\n if (_enableSnapshotPotentialLeakWarning) {\n const { onDidAddListener: origListenerDidAdd } = options;\n const stack = Stacktrace.create();\n let count = 0;\n options.onDidAddListener = () => {\n if (++count === 2) {\n console.warn('snapshotted emitter LIKELY used public and SHOULD HAVE BEEN created with DisposableStore. snapshotted here');\n stack.print();\n }\n origListenerDidAdd === null || origListenerDidAdd === void 0 ? void 0 : origListenerDidAdd();\n };\n }\n }\n /**\n * Given an event, returns another event which debounces calls and defers the listeners to a later task via a shared\n * `setTimeout`. The event is converted into a signal (`Event`) to avoid additional object creation as a\n * result of merging events and to try prevent race conditions that could arise when using related deferred and\n * non-deferred events.\n *\n * This is useful for deferring non-critical work (eg. general UI updates) to ensure it does not block critical work\n * (eg. latency of keypress to text rendered).\n *\n * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n * returned event causes this utility to leak a listener on the original event.\n *\n * @param event The event source for the new event.\n * @param disposable A disposable store to add the new EventEmitter to.\n */\n function defer(event, disposable) {\n return debounce(event, () => void 0, 0, undefined, true, undefined, disposable);\n }\n Event.defer = defer;\n /**\n * Given an event, returns another event which only fires once.\n *\n * @param event The event source for the new event.\n */\n function once(event) {\n return (listener, thisArgs = null, disposables) => {\n // we need this, in case the event fires during the listener call\n let didFire = false;\n let result = undefined;\n result = event(e => {\n if (didFire) {\n return;\n }\n else if (result) {\n result.dispose();\n }\n else {\n didFire = true;\n }\n return listener.call(thisArgs, e);\n }, null, disposables);\n if (didFire) {\n result.dispose();\n }\n return result;\n };\n }\n Event.once = once;\n /**\n * Maps an event of one type into an event of another type using a mapping function, similar to how\n * `Array.prototype.map` works.\n *\n * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n * returned event causes this utility to leak a listener on the original event.\n *\n * @param event The event source for the new event.\n * @param map The mapping function.\n * @param disposable A disposable store to add the new EventEmitter to.\n */\n function map(event, map, disposable) {\n return snapshot((listener, thisArgs = null, disposables) => event(i => listener.call(thisArgs, map(i)), null, disposables), disposable);\n }\n Event.map = map;\n /**\n * Wraps an event in another event that performs some function on the event object before firing.\n *\n * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n * returned event causes this utility to leak a listener on the original event.\n *\n * @param event The event source for the new event.\n * @param each The function to perform on the event object.\n * @param disposable A disposable store to add the new EventEmitter to.\n */\n function forEach(event, each, disposable) {\n return snapshot((listener, thisArgs = null, disposables) => event(i => { each(i); listener.call(thisArgs, i); }, null, disposables), disposable);\n }\n Event.forEach = forEach;\n function filter(event, filter, disposable) {\n return snapshot((listener, thisArgs = null, disposables) => event(e => filter(e) && listener.call(thisArgs, e), null, disposables), disposable);\n }\n Event.filter = filter;\n /**\n * Given an event, returns the same event but typed as `Event`.\n */\n function signal(event) {\n return event;\n }\n Event.signal = signal;\n function any(...events) {\n return (listener, thisArgs = null, disposables) => {\n const disposable = combinedDisposable(...events.map(event => event(e => listener.call(thisArgs, e))));\n return addAndReturnDisposable(disposable, disposables);\n };\n }\n Event.any = any;\n /**\n * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n * returned event causes this utility to leak a listener on the original event.\n */\n function reduce(event, merge, initial, disposable) {\n let output = initial;\n return map(event, e => {\n output = merge(output, e);\n return output;\n }, disposable);\n }\n Event.reduce = reduce;\n function snapshot(event, disposable) {\n let listener;\n const options = {\n onWillAddFirstListener() {\n listener = event(emitter.fire, emitter);\n },\n onDidRemoveLastListener() {\n listener === null || listener === void 0 ? void 0 : listener.dispose();\n }\n };\n if (!disposable) {\n _addLeakageTraceLogic(options);\n }\n const emitter = new Emitter(options);\n disposable === null || disposable === void 0 ? void 0 : disposable.add(emitter);\n return emitter.event;\n }\n /**\n * Adds the IDisposable to the store if it's set, and returns it. Useful to\n * Event function implementation.\n */\n function addAndReturnDisposable(d, store) {\n if (store instanceof Array) {\n store.push(d);\n }\n else if (store) {\n store.add(d);\n }\n return d;\n }\n function debounce(event, merge, delay = 100, leading = false, flushOnListenerRemove = false, leakWarningThreshold, disposable) {\n let subscription;\n let output = undefined;\n let handle = undefined;\n let numDebouncedCalls = 0;\n let doFire;\n const options = {\n leakWarningThreshold,\n onWillAddFirstListener() {\n subscription = event(cur => {\n numDebouncedCalls++;\n output = merge(output, cur);\n if (leading && !handle) {\n emitter.fire(output);\n output = undefined;\n }\n doFire = () => {\n const _output = output;\n output = undefined;\n handle = undefined;\n if (!leading || numDebouncedCalls > 1) {\n emitter.fire(_output);\n }\n numDebouncedCalls = 0;\n };\n if (typeof delay === 'number') {\n clearTimeout(handle);\n handle = setTimeout(doFire, delay);\n }\n else {\n if (handle === undefined) {\n handle = 0;\n queueMicrotask(doFire);\n }\n }\n });\n },\n onWillRemoveListener() {\n if (flushOnListenerRemove && numDebouncedCalls > 0) {\n doFire === null || doFire === void 0 ? void 0 : doFire();\n }\n },\n onDidRemoveLastListener() {\n doFire = undefined;\n subscription.dispose();\n }\n };\n if (!disposable) {\n _addLeakageTraceLogic(options);\n }\n const emitter = new Emitter(options);\n disposable === null || disposable === void 0 ? void 0 : disposable.add(emitter);\n return emitter.event;\n }\n Event.debounce = debounce;\n /**\n * Debounces an event, firing after some delay (default=0) with an array of all event original objects.\n *\n * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n * returned event causes this utility to leak a listener on the original event.\n */\n function accumulate(event, delay = 0, disposable) {\n return Event.debounce(event, (last, e) => {\n if (!last) {\n return [e];\n }\n last.push(e);\n return last;\n }, delay, undefined, true, undefined, disposable);\n }\n Event.accumulate = accumulate;\n /**\n * Filters an event such that some condition is _not_ met more than once in a row, effectively ensuring duplicate\n * event objects from different sources do not fire the same event object.\n *\n * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n * returned event causes this utility to leak a listener on the original event.\n *\n * @param event The event source for the new event.\n * @param equals The equality condition.\n * @param disposable A disposable store to add the new EventEmitter to.\n *\n * @example\n * ```\n * // Fire only one time when a single window is opened or focused\n * Event.latch(Event.any(onDidOpenWindow, onDidFocusWindow))\n * ```\n */\n function latch(event, equals = (a, b) => a === b, disposable) {\n let firstCall = true;\n let cache;\n return filter(event, value => {\n const shouldEmit = firstCall || !equals(value, cache);\n firstCall = false;\n cache = value;\n return shouldEmit;\n }, disposable);\n }\n Event.latch = latch;\n /**\n * Splits an event whose parameter is a union type into 2 separate events for each type in the union.\n *\n * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n * returned event causes this utility to leak a listener on the original event.\n *\n * @example\n * ```\n * const event = new EventEmitter().event;\n * const [numberEvent, undefinedEvent] = Event.split(event, isUndefined);\n * ```\n *\n * @param event The event source for the new event.\n * @param isT A function that determines what event is of the first type.\n * @param disposable A disposable store to add the new EventEmitter to.\n */\n function split(event, isT, disposable) {\n return [\n Event.filter(event, isT, disposable),\n Event.filter(event, e => !isT(e), disposable),\n ];\n }\n Event.split = split;\n /**\n * Buffers an event until it has a listener attached.\n *\n * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n * returned event causes this utility to leak a listener on the original event.\n *\n * @param event The event source for the new event.\n * @param flushAfterTimeout Determines whether to flush the buffer after a timeout immediately or after a\n * `setTimeout` when the first event listener is added.\n * @param _buffer Internal: A source event array used for tests.\n *\n * @example\n * ```\n * // Start accumulating events, when the first listener is attached, flush\n * // the event after a timeout such that multiple listeners attached before\n * // the timeout would receive the event\n * this.onInstallExtension = Event.buffer(service.onInstallExtension, true);\n * ```\n */\n function buffer(event, flushAfterTimeout = false, _buffer = [], disposable) {\n let buffer = _buffer.slice();\n let listener = event(e => {\n if (buffer) {\n buffer.push(e);\n }\n else {\n emitter.fire(e);\n }\n });\n if (disposable) {\n disposable.add(listener);\n }\n const flush = () => {\n buffer === null || buffer === void 0 ? void 0 : buffer.forEach(e => emitter.fire(e));\n buffer = null;\n };\n const emitter = new Emitter({\n onWillAddFirstListener() {\n if (!listener) {\n listener = event(e => emitter.fire(e));\n if (disposable) {\n disposable.add(listener);\n }\n }\n },\n onDidAddFirstListener() {\n if (buffer) {\n if (flushAfterTimeout) {\n setTimeout(flush);\n }\n else {\n flush();\n }\n }\n },\n onDidRemoveLastListener() {\n if (listener) {\n listener.dispose();\n }\n listener = null;\n }\n });\n if (disposable) {\n disposable.add(emitter);\n }\n return emitter.event;\n }\n Event.buffer = buffer;\n /**\n * Wraps the event in an {@link IChainableEvent}, allowing a more functional programming style.\n *\n * @example\n * ```\n * // Normal\n * const onEnterPressNormal = Event.filter(\n * Event.map(onKeyPress.event, e => new StandardKeyboardEvent(e)),\n * e.keyCode === KeyCode.Enter\n * ).event;\n *\n * // Using chain\n * const onEnterPressChain = Event.chain(onKeyPress.event, $ => $\n * .map(e => new StandardKeyboardEvent(e))\n * .filter(e => e.keyCode === KeyCode.Enter)\n * );\n * ```\n */\n function chain(event, sythensize) {\n const fn = (listener, thisArgs, disposables) => {\n const cs = sythensize(new ChainableSynthesis());\n return event(function (value) {\n const result = cs.evaluate(value);\n if (result !== HaltChainable) {\n listener.call(thisArgs, result);\n }\n }, undefined, disposables);\n };\n return fn;\n }\n Event.chain = chain;\n const HaltChainable = Symbol('HaltChainable');\n class ChainableSynthesis {\n constructor() {\n this.steps = [];\n }\n map(fn) {\n this.steps.push(fn);\n return this;\n }\n forEach(fn) {\n this.steps.push(v => {\n fn(v);\n return v;\n });\n return this;\n }\n filter(fn) {\n this.steps.push(v => fn(v) ? v : HaltChainable);\n return this;\n }\n reduce(merge, initial) {\n let last = initial;\n this.steps.push(v => {\n last = merge(last, v);\n return last;\n });\n return this;\n }\n latch(equals = (a, b) => a === b) {\n let firstCall = true;\n let cache;\n this.steps.push(value => {\n const shouldEmit = firstCall || !equals(value, cache);\n firstCall = false;\n cache = value;\n return shouldEmit ? value : HaltChainable;\n });\n return this;\n }\n evaluate(value) {\n for (const step of this.steps) {\n value = step(value);\n if (value === HaltChainable) {\n break;\n }\n }\n return value;\n }\n }\n /**\n * Creates an {@link Event} from a node event emitter.\n */\n function fromNodeEventEmitter(emitter, eventName, map = id => id) {\n const fn = (...args) => result.fire(map(...args));\n const onFirstListenerAdd = () => emitter.on(eventName, fn);\n const onLastListenerRemove = () => emitter.removeListener(eventName, fn);\n const result = new Emitter({ onWillAddFirstListener: onFirstListenerAdd, onDidRemoveLastListener: onLastListenerRemove });\n return result.event;\n }\n Event.fromNodeEventEmitter = fromNodeEventEmitter;\n /**\n * Creates an {@link Event} from a DOM event emitter.\n */\n function fromDOMEventEmitter(emitter, eventName, map = id => id) {\n const fn = (...args) => result.fire(map(...args));\n const onFirstListenerAdd = () => emitter.addEventListener(eventName, fn);\n const onLastListenerRemove = () => emitter.removeEventListener(eventName, fn);\n const result = new Emitter({ onWillAddFirstListener: onFirstListenerAdd, onDidRemoveLastListener: onLastListenerRemove });\n return result.event;\n }\n Event.fromDOMEventEmitter = fromDOMEventEmitter;\n /**\n * Creates a promise out of an event, using the {@link Event.once} helper.\n */\n function toPromise(event) {\n return new Promise(resolve => once(event)(resolve));\n }\n Event.toPromise = toPromise;\n /**\n * Creates an event out of a promise that fires once when the promise is\n * resolved with the result of the promise or `undefined`.\n */\n function fromPromise(promise) {\n const result = new Emitter();\n promise.then(res => {\n result.fire(res);\n }, () => {\n result.fire(undefined);\n }).finally(() => {\n result.dispose();\n });\n return result.event;\n }\n Event.fromPromise = fromPromise;\n function runAndSubscribe(event, handler, initial) {\n handler(initial);\n return event(e => handler(e));\n }\n Event.runAndSubscribe = runAndSubscribe;\n /**\n * Adds a listener to an event and calls the listener immediately with undefined as the event object. A new\n * {@link DisposableStore} is passed to the listener which is disposed when the returned disposable is disposed.\n */\n function runAndSubscribeWithStore(event, handler) {\n let store = null;\n function run(e) {\n store === null || store === void 0 ? void 0 : store.dispose();\n store = new DisposableStore();\n handler(e, store);\n }\n run(undefined);\n const disposable = event(e => run(e));\n return toDisposable(() => {\n disposable.dispose();\n store === null || store === void 0 ? void 0 : store.dispose();\n });\n }\n Event.runAndSubscribeWithStore = runAndSubscribeWithStore;\n class EmitterObserver {\n constructor(_observable, store) {\n this._observable = _observable;\n this._counter = 0;\n this._hasChanged = false;\n const options = {\n onWillAddFirstListener: () => {\n _observable.addObserver(this);\n },\n onDidRemoveLastListener: () => {\n _observable.removeObserver(this);\n }\n };\n if (!store) {\n _addLeakageTraceLogic(options);\n }\n this.emitter = new Emitter(options);\n if (store) {\n store.add(this.emitter);\n }\n }\n beginUpdate(_observable) {\n // assert(_observable === this.obs);\n this._counter++;\n }\n handlePossibleChange(_observable) {\n // assert(_observable === this.obs);\n }\n handleChange(_observable, _change) {\n // assert(_observable === this.obs);\n this._hasChanged = true;\n }\n endUpdate(_observable) {\n // assert(_observable === this.obs);\n this._counter--;\n if (this._counter === 0) {\n this._observable.reportChanges();\n if (this._hasChanged) {\n this._hasChanged = false;\n this.emitter.fire(this._observable.get());\n }\n }\n }\n }\n /**\n * Creates an event emitter that is fired when the observable changes.\n * Each listeners subscribes to the emitter.\n */\n function fromObservable(obs, store) {\n const observer = new EmitterObserver(obs, store);\n return observer.emitter.event;\n }\n Event.fromObservable = fromObservable;\n /**\n * Each listener is attached to the observable directly.\n */\n function fromObservableLight(observable) {\n return (listener, thisArgs, disposables) => {\n let count = 0;\n let didChange = false;\n const observer = {\n beginUpdate() {\n count++;\n },\n endUpdate() {\n count--;\n if (count === 0) {\n observable.reportChanges();\n if (didChange) {\n didChange = false;\n listener.call(thisArgs);\n }\n }\n },\n handlePossibleChange() {\n // noop\n },\n handleChange() {\n didChange = true;\n }\n };\n observable.addObserver(observer);\n observable.reportChanges();\n const disposable = {\n dispose() {\n observable.removeObserver(observer);\n }\n };\n if (disposables instanceof DisposableStore) {\n disposables.add(disposable);\n }\n else if (Array.isArray(disposables)) {\n disposables.push(disposable);\n }\n return disposable;\n };\n }\n Event.fromObservableLight = fromObservableLight;\n})(Event || (Event = {}));\nexport class EventProfiling {\n constructor(name) {\n this.listenerCount = 0;\n this.invocationCount = 0;\n this.elapsedOverall = 0;\n this.durations = [];\n this.name = `${name}_${EventProfiling._idPool++}`;\n EventProfiling.all.add(this);\n }\n start(listenerCount) {\n this._stopWatch = new StopWatch();\n this.listenerCount = listenerCount;\n }\n stop() {\n if (this._stopWatch) {\n const elapsed = this._stopWatch.elapsed();\n this.durations.push(elapsed);\n this.elapsedOverall += elapsed;\n this.invocationCount += 1;\n this._stopWatch = undefined;\n }\n }\n}\nEventProfiling.all = new Set();\nEventProfiling._idPool = 0;\nlet _globalLeakWarningThreshold = -1;\nclass LeakageMonitor {\n constructor(threshold, name = Math.random().toString(18).slice(2, 5)) {\n this.threshold = threshold;\n this.name = name;\n this._warnCountdown = 0;\n }\n dispose() {\n var _a;\n (_a = this._stacks) === null || _a === void 0 ? void 0 : _a.clear();\n }\n check(stack, listenerCount) {\n const threshold = this.threshold;\n if (threshold <= 0 || listenerCount < threshold) {\n return undefined;\n }\n if (!this._stacks) {\n this._stacks = new Map();\n }\n const count = (this._stacks.get(stack.value) || 0);\n this._stacks.set(stack.value, count + 1);\n this._warnCountdown -= 1;\n if (this._warnCountdown <= 0) {\n // only warn on first exceed and then every time the limit\n // is exceeded by 50% again\n this._warnCountdown = threshold * 0.5;\n // find most frequent listener and print warning\n let topStack;\n let topCount = 0;\n for (const [stack, count] of this._stacks) {\n if (!topStack || topCount < count) {\n topStack = stack;\n topCount = count;\n }\n }\n console.warn(`[${this.name}] potential listener LEAK detected, having ${listenerCount} listeners already. MOST frequent listener (${topCount}):`);\n console.warn(topStack);\n }\n return () => {\n const count = (this._stacks.get(stack.value) || 0);\n this._stacks.set(stack.value, count - 1);\n };\n }\n}\nclass Stacktrace {\n static create() {\n var _a;\n return new Stacktrace((_a = new Error().stack) !== null && _a !== void 0 ? _a : '');\n }\n constructor(value) {\n this.value = value;\n }\n print() {\n console.warn(this.value.split('\\n').slice(2).join('\\n'));\n }\n}\nclass UniqueContainer {\n constructor(value) {\n this.value = value;\n }\n}\nconst compactionThreshold = 2;\nconst forEachListener = (listeners, fn) => {\n if (listeners instanceof UniqueContainer) {\n fn(listeners);\n }\n else {\n for (let i = 0; i < listeners.length; i++) {\n const l = listeners[i];\n if (l) {\n fn(l);\n }\n }\n }\n};\n/**\n * The Emitter can be used to expose an Event to the public\n * to fire it from the insides.\n * Sample:\n class Document {\n\n private readonly _onDidChange = new Emitter<(value:string)=>any>();\n\n public onDidChange = this._onDidChange.event;\n\n // getter-style\n // get onDidChange(): Event<(value:string)=>any> {\n // \treturn this._onDidChange.event;\n // }\n\n private _doIt() {\n //...\n this._onDidChange.fire(value);\n }\n }\n */\nexport class Emitter {\n constructor(options) {\n var _a, _b, _c, _d, _e;\n this._size = 0;\n this._options = options;\n this._leakageMon = _globalLeakWarningThreshold > 0 || ((_a = this._options) === null || _a === void 0 ? void 0 : _a.leakWarningThreshold) ? new LeakageMonitor((_c = (_b = this._options) === null || _b === void 0 ? void 0 : _b.leakWarningThreshold) !== null && _c !== void 0 ? _c : _globalLeakWarningThreshold) : undefined;\n this._perfMon = ((_d = this._options) === null || _d === void 0 ? void 0 : _d._profName) ? new EventProfiling(this._options._profName) : undefined;\n this._deliveryQueue = (_e = this._options) === null || _e === void 0 ? void 0 : _e.deliveryQueue;\n }\n dispose() {\n var _a, _b, _c, _d;\n if (!this._disposed) {\n this._disposed = true;\n // It is bad to have listeners at the time of disposing an emitter, it is worst to have listeners keep the emitter\n // alive via the reference that's embedded in their disposables. Therefore we loop over all remaining listeners and\n // unset their subscriptions/disposables. Looping and blaming remaining listeners is done on next tick because the\n // the following programming pattern is very popular:\n //\n // const someModel = this._disposables.add(new ModelObject()); // (1) create and register model\n // this._disposables.add(someModel.onDidChange(() => { ... }); // (2) subscribe and register model-event listener\n // ...later...\n // this._disposables.dispose(); disposes (1) then (2): don't warn after (1) but after the \"overall dispose\" is done\n if (((_a = this._deliveryQueue) === null || _a === void 0 ? void 0 : _a.current) === this) {\n this._deliveryQueue.reset();\n }\n if (this._listeners) {\n if (_enableDisposeWithListenerWarning) {\n const listeners = this._listeners;\n queueMicrotask(() => {\n forEachListener(listeners, l => { var _a; return (_a = l.stack) === null || _a === void 0 ? void 0 : _a.print(); });\n });\n }\n this._listeners = undefined;\n this._size = 0;\n }\n (_c = (_b = this._options) === null || _b === void 0 ? void 0 : _b.onDidRemoveLastListener) === null || _c === void 0 ? void 0 : _c.call(_b);\n (_d = this._leakageMon) === null || _d === void 0 ? void 0 : _d.dispose();\n }\n }\n /**\n * For the public to allow to subscribe\n * to events from this Emitter\n */\n get event() {\n var _a;\n (_a = this._event) !== null && _a !== void 0 ? _a : (this._event = (callback, thisArgs, disposables) => {\n var _a, _b, _c, _d, _e;\n if (this._leakageMon && this._size > this._leakageMon.threshold * 3) {\n console.warn(`[${this._leakageMon.name}] REFUSES to accept new listeners because it exceeded its threshold by far`);\n return Disposable.None;\n }\n if (this._disposed) {\n // todo: should we warn if a listener is added to a disposed emitter? This happens often\n return Disposable.None;\n }\n if (thisArgs) {\n callback = callback.bind(thisArgs);\n }\n const contained = new UniqueContainer(callback);\n let removeMonitor;\n let stack;\n if (this._leakageMon && this._size >= Math.ceil(this._leakageMon.threshold * 0.2)) {\n // check and record this emitter for potential leakage\n contained.stack = Stacktrace.create();\n removeMonitor = this._leakageMon.check(contained.stack, this._size + 1);\n }\n if (_enableDisposeWithListenerWarning) {\n contained.stack = stack !== null && stack !== void 0 ? stack : Stacktrace.create();\n }\n if (!this._listeners) {\n (_b = (_a = this._options) === null || _a === void 0 ? void 0 : _a.onWillAddFirstListener) === null || _b === void 0 ? void 0 : _b.call(_a, this);\n this._listeners = contained;\n (_d = (_c = this._options) === null || _c === void 0 ? void 0 : _c.onDidAddFirstListener) === null || _d === void 0 ? void 0 : _d.call(_c, this);\n }\n else if (this._listeners instanceof UniqueContainer) {\n (_e = this._deliveryQueue) !== null && _e !== void 0 ? _e : (this._deliveryQueue = new EventDeliveryQueuePrivate());\n this._listeners = [this._listeners, contained];\n }\n else {\n this._listeners.push(contained);\n }\n this._size++;\n const result = toDisposable(() => { removeMonitor === null || removeMonitor === void 0 ? void 0 : removeMonitor(); this._removeListener(contained); });\n if (disposables instanceof DisposableStore) {\n disposables.add(result);\n }\n else if (Array.isArray(disposables)) {\n disposables.push(result);\n }\n return result;\n });\n return this._event;\n }\n _removeListener(listener) {\n var _a, _b, _c, _d;\n (_b = (_a = this._options) === null || _a === void 0 ? void 0 : _a.onWillRemoveListener) === null || _b === void 0 ? void 0 : _b.call(_a, this);\n if (!this._listeners) {\n return; // expected if a listener gets disposed\n }\n if (this._size === 1) {\n this._listeners = undefined;\n (_d = (_c = this._options) === null || _c === void 0 ? void 0 : _c.onDidRemoveLastListener) === null || _d === void 0 ? void 0 : _d.call(_c, this);\n this._size = 0;\n return;\n }\n // size > 1 which requires that listeners be a list:\n const listeners = this._listeners;\n const index = listeners.indexOf(listener);\n if (index === -1) {\n console.log('disposed?', this._disposed);\n console.log('size?', this._size);\n console.log('arr?', JSON.stringify(this._listeners));\n throw new Error('Attempted to dispose unknown listener');\n }\n this._size--;\n listeners[index] = undefined;\n const adjustDeliveryQueue = this._deliveryQueue.current === this;\n if (this._size * compactionThreshold <= listeners.length) {\n let n = 0;\n for (let i = 0; i < listeners.length; i++) {\n if (listeners[i]) {\n listeners[n++] = listeners[i];\n }\n else if (adjustDeliveryQueue) {\n this._deliveryQueue.end--;\n if (n < this._deliveryQueue.i) {\n this._deliveryQueue.i--;\n }\n }\n }\n listeners.length = n;\n }\n }\n _deliver(listener, value) {\n var _a;\n if (!listener) {\n return;\n }\n const errorHandler = ((_a = this._options) === null || _a === void 0 ? void 0 : _a.onListenerError) || onUnexpectedError;\n if (!errorHandler) {\n listener.value(value);\n return;\n }\n try {\n listener.value(value);\n }\n catch (e) {\n errorHandler(e);\n }\n }\n /** Delivers items in the queue. Assumes the queue is ready to go. */\n _deliverQueue(dq) {\n const listeners = dq.current._listeners;\n while (dq.i < dq.end) {\n // important: dq.i is incremented before calling deliver() because it might reenter deliverQueue()\n this._deliver(listeners[dq.i++], dq.value);\n }\n dq.reset();\n }\n /**\n * To be kept private to fire an event to\n * subscribers\n */\n fire(event) {\n var _a, _b, _c, _d;\n if ((_a = this._deliveryQueue) === null || _a === void 0 ? void 0 : _a.current) {\n this._deliverQueue(this._deliveryQueue);\n (_b = this._perfMon) === null || _b === void 0 ? void 0 : _b.stop(); // last fire() will have starting perfmon, stop it before starting the next dispatch\n }\n (_c = this._perfMon) === null || _c === void 0 ? void 0 : _c.start(this._size);\n if (!this._listeners) {\n // no-op\n }\n else if (this._listeners instanceof UniqueContainer) {\n this._deliver(this._listeners, event);\n }\n else {\n const dq = this._deliveryQueue;\n dq.enqueue(this, event, this._listeners.length);\n this._deliverQueue(dq);\n }\n (_d = this._perfMon) === null || _d === void 0 ? void 0 : _d.stop();\n }\n hasListeners() {\n return this._size > 0;\n }\n}\nexport const createEventDeliveryQueue = () => new EventDeliveryQueuePrivate();\nclass EventDeliveryQueuePrivate {\n constructor() {\n /**\n * Index in current's listener list.\n */\n this.i = -1;\n /**\n * The last index in the listener's list to deliver.\n */\n this.end = 0;\n }\n enqueue(emitter, value, end) {\n this.i = 0;\n this.end = end;\n this.current = emitter;\n this.value = value;\n }\n reset() {\n this.i = this.end; // force any current emission loop to stop, mainly for during dispose\n this.current = undefined;\n this.value = undefined;\n }\n}\nexport class PauseableEmitter extends Emitter {\n constructor(options) {\n super(options);\n this._isPaused = 0;\n this._eventQueue = new LinkedList();\n this._mergeFn = options === null || options === void 0 ? void 0 : options.merge;\n }\n pause() {\n this._isPaused++;\n }\n resume() {\n if (this._isPaused !== 0 && --this._isPaused === 0) {\n if (this._mergeFn) {\n // use the merge function to create a single composite\n // event. make a copy in case firing pauses this emitter\n if (this._eventQueue.size > 0) {\n const events = Array.from(this._eventQueue);\n this._eventQueue.clear();\n super.fire(this._mergeFn(events));\n }\n }\n else {\n // no merging, fire each event individually and test\n // that this emitter isn't paused halfway through\n while (!this._isPaused && this._eventQueue.size !== 0) {\n super.fire(this._eventQueue.shift());\n }\n }\n }\n }\n fire(event) {\n if (this._size) {\n if (this._isPaused !== 0) {\n this._eventQueue.push(event);\n }\n else {\n super.fire(event);\n }\n }\n }\n}\nexport class DebounceEmitter extends PauseableEmitter {\n constructor(options) {\n var _a;\n super(options);\n this._delay = (_a = options.delay) !== null && _a !== void 0 ? _a : 100;\n }\n fire(event) {\n if (!this._handle) {\n this.pause();\n this._handle = setTimeout(() => {\n this._handle = undefined;\n this.resume();\n }, this._delay);\n }\n super.fire(event);\n }\n}\n/**\n * An emitter which queue all events and then process them at the\n * end of the event loop.\n */\nexport class MicrotaskEmitter extends Emitter {\n constructor(options) {\n super(options);\n this._queuedEvents = [];\n this._mergeFn = options === null || options === void 0 ? void 0 : options.merge;\n }\n fire(event) {\n if (!this.hasListeners()) {\n return;\n }\n this._queuedEvents.push(event);\n if (this._queuedEvents.length === 1) {\n queueMicrotask(() => {\n if (this._mergeFn) {\n super.fire(this._mergeFn(this._queuedEvents));\n }\n else {\n this._queuedEvents.forEach(e => super.fire(e));\n }\n this._queuedEvents = [];\n });\n }\n }\n}\n/**\n * An event emitter that multiplexes many events into a single event.\n *\n * @example Listen to the `onData` event of all `Thing`s, dynamically adding and removing `Thing`s\n * to the multiplexer as needed.\n *\n * ```typescript\n * const anythingDataMultiplexer = new EventMultiplexer<{ data: string }>();\n *\n * const thingListeners = DisposableMap();\n *\n * thingService.onDidAddThing(thing => {\n * thingListeners.set(thing, anythingDataMultiplexer.add(thing.onData);\n * });\n * thingService.onDidRemoveThing(thing => {\n * thingListeners.deleteAndDispose(thing);\n * });\n *\n * anythingDataMultiplexer.event(e => {\n * console.log('Something fired data ' + e.data)\n * });\n * ```\n */\nexport class EventMultiplexer {\n constructor() {\n this.hasListeners = false;\n this.events = [];\n this.emitter = new Emitter({\n onWillAddFirstListener: () => this.onFirstListenerAdd(),\n onDidRemoveLastListener: () => this.onLastListenerRemove()\n });\n }\n get event() {\n return this.emitter.event;\n }\n add(event) {\n const e = { event: event, listener: null };\n this.events.push(e);\n if (this.hasListeners) {\n this.hook(e);\n }\n const dispose = () => {\n if (this.hasListeners) {\n this.unhook(e);\n }\n const idx = this.events.indexOf(e);\n this.events.splice(idx, 1);\n };\n return toDisposable(createSingleCallFunction(dispose));\n }\n onFirstListenerAdd() {\n this.hasListeners = true;\n this.events.forEach(e => this.hook(e));\n }\n onLastListenerRemove() {\n this.hasListeners = false;\n this.events.forEach(e => this.unhook(e));\n }\n hook(e) {\n e.listener = e.event(r => this.emitter.fire(r));\n }\n unhook(e) {\n if (e.listener) {\n e.listener.dispose();\n }\n e.listener = null;\n }\n dispose() {\n this.emitter.dispose();\n }\n}\n/**\n * The EventBufferer is useful in situations in which you want\n * to delay firing your events during some code.\n * You can wrap that code and be sure that the event will not\n * be fired during that wrap.\n *\n * ```\n * const emitter: Emitter;\n * const delayer = new EventDelayer();\n * const delayedEvent = delayer.wrapEvent(emitter.event);\n *\n * delayedEvent(console.log);\n *\n * delayer.bufferEvents(() => {\n * emitter.fire(); // event will not be fired yet\n * });\n *\n * // event will only be fired at this point\n * ```\n */\nexport class EventBufferer {\n constructor() {\n this.buffers = [];\n }\n wrapEvent(event) {\n return (listener, thisArgs, disposables) => {\n return event(i => {\n const buffer = this.buffers[this.buffers.length - 1];\n if (buffer) {\n buffer.push(() => listener.call(thisArgs, i));\n }\n else {\n listener.call(thisArgs, i);\n }\n }, undefined, disposables);\n };\n }\n bufferEvents(fn) {\n const buffer = [];\n this.buffers.push(buffer);\n const r = fn();\n this.buffers.pop();\n buffer.forEach(flush => flush());\n return r;\n }\n}\n/**\n * A Relay is an event forwarder which functions as a replugabble event pipe.\n * Once created, you can connect an input event to it and it will simply forward\n * events from that input event through its own `event` property. The `input`\n * can be changed at any point in time.\n */\nexport class Relay {\n constructor() {\n this.listening = false;\n this.inputEvent = Event.None;\n this.inputEventListener = Disposable.None;\n this.emitter = new Emitter({\n onDidAddFirstListener: () => {\n this.listening = true;\n this.inputEventListener = this.inputEvent(this.emitter.fire, this.emitter);\n },\n onDidRemoveLastListener: () => {\n this.listening = false;\n this.inputEventListener.dispose();\n }\n });\n this.event = this.emitter.event;\n }\n set input(event) {\n this.inputEvent = event;\n if (this.listening) {\n this.inputEventListener.dispose();\n this.inputEventListener = event(this.emitter.fire, this.emitter);\n }\n }\n dispose() {\n this.inputEventListener.dispose();\n this.emitter.dispose();\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\n/**\n * Given a function, returns a function that is only calling that function once.\n */\nexport function createSingleCallFunction(fn, fnDidRunCallback) {\n const _this = this;\n let didCall = false;\n let result;\n return function () {\n if (didCall) {\n return result;\n }\n didCall = true;\n if (fnDidRunCallback) {\n try {\n result = fn.apply(_this, arguments);\n }\n finally {\n fnDidRunCallback();\n }\n }\n else {\n result = fn.apply(_this, arguments);\n }\n return result;\n };\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport * as strings from './strings.js';\n/**\n * Return a hash value for an object.\n */\nexport function hash(obj) {\n return doHash(obj, 0);\n}\nexport function doHash(obj, hashVal) {\n switch (typeof obj) {\n case 'object':\n if (obj === null) {\n return numberHash(349, hashVal);\n }\n else if (Array.isArray(obj)) {\n return arrayHash(obj, hashVal);\n }\n return objectHash(obj, hashVal);\n case 'string':\n return stringHash(obj, hashVal);\n case 'boolean':\n return booleanHash(obj, hashVal);\n case 'number':\n return numberHash(obj, hashVal);\n case 'undefined':\n return numberHash(937, hashVal);\n default:\n return numberHash(617, hashVal);\n }\n}\nexport function numberHash(val, initialHashVal) {\n return (((initialHashVal << 5) - initialHashVal) + val) | 0; // hashVal * 31 + ch, keep as int32\n}\nfunction booleanHash(b, initialHashVal) {\n return numberHash(b ? 433 : 863, initialHashVal);\n}\nexport function stringHash(s, hashVal) {\n hashVal = numberHash(149417, hashVal);\n for (let i = 0, length = s.length; i < length; i++) {\n hashVal = numberHash(s.charCodeAt(i), hashVal);\n }\n return hashVal;\n}\nfunction arrayHash(arr, initialHashVal) {\n initialHashVal = numberHash(104579, initialHashVal);\n return arr.reduce((hashVal, item) => doHash(item, hashVal), initialHashVal);\n}\nfunction objectHash(obj, initialHashVal) {\n initialHashVal = numberHash(181387, initialHashVal);\n return Object.keys(obj).sort().reduce((hashVal, key) => {\n hashVal = stringHash(key, hashVal);\n return doHash(obj[key], hashVal);\n }, initialHashVal);\n}\nfunction leftRotate(value, bits, totalBits = 32) {\n // delta + bits = totalBits\n const delta = totalBits - bits;\n // All ones, expect `delta` zeros aligned to the right\n const mask = ~((1 << delta) - 1);\n // Join (value left-shifted `bits` bits) with (masked value right-shifted `delta` bits)\n return ((value << bits) | ((mask & value) >>> delta)) >>> 0;\n}\nfunction fill(dest, index = 0, count = dest.byteLength, value = 0) {\n for (let i = 0; i < count; i++) {\n dest[index + i] = value;\n }\n}\nfunction leftPad(value, length, char = '0') {\n while (value.length < length) {\n value = char + value;\n }\n return value;\n}\nexport function toHexString(bufferOrValue, bitsize = 32) {\n if (bufferOrValue instanceof ArrayBuffer) {\n return Array.from(new Uint8Array(bufferOrValue)).map(b => b.toString(16).padStart(2, '0')).join('');\n }\n return leftPad((bufferOrValue >>> 0).toString(16), bitsize / 4);\n}\n/**\n * A SHA1 implementation that works with strings and does not allocate.\n */\nexport class StringSHA1 {\n constructor() {\n this._h0 = 0x67452301;\n this._h1 = 0xEFCDAB89;\n this._h2 = 0x98BADCFE;\n this._h3 = 0x10325476;\n this._h4 = 0xC3D2E1F0;\n this._buff = new Uint8Array(64 /* SHA1Constant.BLOCK_SIZE */ + 3 /* to fit any utf-8 */);\n this._buffDV = new DataView(this._buff.buffer);\n this._buffLen = 0;\n this._totalLen = 0;\n this._leftoverHighSurrogate = 0;\n this._finished = false;\n }\n update(str) {\n const strLen = str.length;\n if (strLen === 0) {\n return;\n }\n const buff = this._buff;\n let buffLen = this._buffLen;\n let leftoverHighSurrogate = this._leftoverHighSurrogate;\n let charCode;\n let offset;\n if (leftoverHighSurrogate !== 0) {\n charCode = leftoverHighSurrogate;\n offset = -1;\n leftoverHighSurrogate = 0;\n }\n else {\n charCode = str.charCodeAt(0);\n offset = 0;\n }\n while (true) {\n let codePoint = charCode;\n if (strings.isHighSurrogate(charCode)) {\n if (offset + 1 < strLen) {\n const nextCharCode = str.charCodeAt(offset + 1);\n if (strings.isLowSurrogate(nextCharCode)) {\n offset++;\n codePoint = strings.computeCodePoint(charCode, nextCharCode);\n }\n else {\n // illegal => unicode replacement character\n codePoint = 65533 /* SHA1Constant.UNICODE_REPLACEMENT */;\n }\n }\n else {\n // last character is a surrogate pair\n leftoverHighSurrogate = charCode;\n break;\n }\n }\n else if (strings.isLowSurrogate(charCode)) {\n // illegal => unicode replacement character\n codePoint = 65533 /* SHA1Constant.UNICODE_REPLACEMENT */;\n }\n buffLen = this._push(buff, buffLen, codePoint);\n offset++;\n if (offset < strLen) {\n charCode = str.charCodeAt(offset);\n }\n else {\n break;\n }\n }\n this._buffLen = buffLen;\n this._leftoverHighSurrogate = leftoverHighSurrogate;\n }\n _push(buff, buffLen, codePoint) {\n if (codePoint < 0x0080) {\n buff[buffLen++] = codePoint;\n }\n else if (codePoint < 0x0800) {\n buff[buffLen++] = 0b11000000 | ((codePoint & 0b00000000000000000000011111000000) >>> 6);\n buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000000000111111) >>> 0);\n }\n else if (codePoint < 0x10000) {\n buff[buffLen++] = 0b11100000 | ((codePoint & 0b00000000000000001111000000000000) >>> 12);\n buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000111111000000) >>> 6);\n buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000000000111111) >>> 0);\n }\n else {\n buff[buffLen++] = 0b11110000 | ((codePoint & 0b00000000000111000000000000000000) >>> 18);\n buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000111111000000000000) >>> 12);\n buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000111111000000) >>> 6);\n buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000000000111111) >>> 0);\n }\n if (buffLen >= 64 /* SHA1Constant.BLOCK_SIZE */) {\n this._step();\n buffLen -= 64 /* SHA1Constant.BLOCK_SIZE */;\n this._totalLen += 64 /* SHA1Constant.BLOCK_SIZE */;\n // take last 3 in case of UTF8 overflow\n buff[0] = buff[64 /* SHA1Constant.BLOCK_SIZE */ + 0];\n buff[1] = buff[64 /* SHA1Constant.BLOCK_SIZE */ + 1];\n buff[2] = buff[64 /* SHA1Constant.BLOCK_SIZE */ + 2];\n }\n return buffLen;\n }\n digest() {\n if (!this._finished) {\n this._finished = true;\n if (this._leftoverHighSurrogate) {\n // illegal => unicode replacement character\n this._leftoverHighSurrogate = 0;\n this._buffLen = this._push(this._buff, this._buffLen, 65533 /* SHA1Constant.UNICODE_REPLACEMENT */);\n }\n this._totalLen += this._buffLen;\n this._wrapUp();\n }\n return toHexString(this._h0) + toHexString(this._h1) + toHexString(this._h2) + toHexString(this._h3) + toHexString(this._h4);\n }\n _wrapUp() {\n this._buff[this._buffLen++] = 0x80;\n fill(this._buff, this._buffLen);\n if (this._buffLen > 56) {\n this._step();\n fill(this._buff);\n }\n // this will fit because the mantissa can cover up to 52 bits\n const ml = 8 * this._totalLen;\n this._buffDV.setUint32(56, Math.floor(ml / 4294967296), false);\n this._buffDV.setUint32(60, ml % 4294967296, false);\n this._step();\n }\n _step() {\n const bigBlock32 = StringSHA1._bigBlock32;\n const data = this._buffDV;\n for (let j = 0; j < 64 /* 16*4 */; j += 4) {\n bigBlock32.setUint32(j, data.getUint32(j, false), false);\n }\n for (let j = 64; j < 320 /* 80*4 */; j += 4) {\n bigBlock32.setUint32(j, leftRotate((bigBlock32.getUint32(j - 12, false) ^ bigBlock32.getUint32(j - 32, false) ^ bigBlock32.getUint32(j - 56, false) ^ bigBlock32.getUint32(j - 64, false)), 1), false);\n }\n let a = this._h0;\n let b = this._h1;\n let c = this._h2;\n let d = this._h3;\n let e = this._h4;\n let f, k;\n let temp;\n for (let j = 0; j < 80; j++) {\n if (j < 20) {\n f = (b & c) | ((~b) & d);\n k = 0x5A827999;\n }\n else if (j < 40) {\n f = b ^ c ^ d;\n k = 0x6ED9EBA1;\n }\n else if (j < 60) {\n f = (b & c) | (b & d) | (c & d);\n k = 0x8F1BBCDC;\n }\n else {\n f = b ^ c ^ d;\n k = 0xCA62C1D6;\n }\n temp = (leftRotate(a, 5) + f + e + k + bigBlock32.getUint32(j * 4, false)) & 0xffffffff;\n e = d;\n d = c;\n c = leftRotate(b, 30);\n b = a;\n a = temp;\n }\n this._h0 = (this._h0 + a) & 0xffffffff;\n this._h1 = (this._h1 + b) & 0xffffffff;\n this._h2 = (this._h2 + c) & 0xffffffff;\n this._h3 = (this._h3 + d) & 0xffffffff;\n this._h4 = (this._h4 + e) & 0xffffffff;\n }\n}\nStringSHA1._bigBlock32 = new DataView(new ArrayBuffer(320)); // 80 * 4 = 320\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nexport var Iterable;\n(function (Iterable) {\n function is(thing) {\n return thing && typeof thing === 'object' && typeof thing[Symbol.iterator] === 'function';\n }\n Iterable.is = is;\n const _empty = Object.freeze([]);\n function empty() {\n return _empty;\n }\n Iterable.empty = empty;\n function* single(element) {\n yield element;\n }\n Iterable.single = single;\n function wrap(iterableOrElement) {\n if (is(iterableOrElement)) {\n return iterableOrElement;\n }\n else {\n return single(iterableOrElement);\n }\n }\n Iterable.wrap = wrap;\n function from(iterable) {\n return iterable || _empty;\n }\n Iterable.from = from;\n function* reverse(array) {\n for (let i = array.length - 1; i >= 0; i--) {\n yield array[i];\n }\n }\n Iterable.reverse = reverse;\n function isEmpty(iterable) {\n return !iterable || iterable[Symbol.iterator]().next().done === true;\n }\n Iterable.isEmpty = isEmpty;\n function first(iterable) {\n return iterable[Symbol.iterator]().next().value;\n }\n Iterable.first = first;\n function some(iterable, predicate) {\n for (const element of iterable) {\n if (predicate(element)) {\n return true;\n }\n }\n return false;\n }\n Iterable.some = some;\n function find(iterable, predicate) {\n for (const element of iterable) {\n if (predicate(element)) {\n return element;\n }\n }\n return undefined;\n }\n Iterable.find = find;\n function* filter(iterable, predicate) {\n for (const element of iterable) {\n if (predicate(element)) {\n yield element;\n }\n }\n }\n Iterable.filter = filter;\n function* map(iterable, fn) {\n let index = 0;\n for (const element of iterable) {\n yield fn(element, index++);\n }\n }\n Iterable.map = map;\n function* concat(...iterables) {\n for (const iterable of iterables) {\n yield* iterable;\n }\n }\n Iterable.concat = concat;\n function reduce(iterable, reducer, initialValue) {\n let value = initialValue;\n for (const element of iterable) {\n value = reducer(value, element);\n }\n return value;\n }\n Iterable.reduce = reduce;\n /**\n * Returns an iterable slice of the array, with the same semantics as `array.slice()`.\n */\n function* slice(arr, from, to = arr.length) {\n if (from < 0) {\n from += arr.length;\n }\n if (to < 0) {\n to += arr.length;\n }\n else if (to > arr.length) {\n to = arr.length;\n }\n for (; from < to; from++) {\n yield arr[from];\n }\n }\n Iterable.slice = slice;\n /**\n * Consumes `atMost` elements from iterable and returns the consumed elements,\n * and an iterable for the rest of the elements.\n */\n function consume(iterable, atMost = Number.POSITIVE_INFINITY) {\n const consumed = [];\n if (atMost === 0) {\n return [consumed, iterable];\n }\n const iterator = iterable[Symbol.iterator]();\n for (let i = 0; i < atMost; i++) {\n const next = iterator.next();\n if (next.done) {\n return [consumed, Iterable.empty()];\n }\n consumed.push(next.value);\n }\n return [consumed, { [Symbol.iterator]() { return iterator; } }];\n }\n Iterable.consume = consume;\n})(Iterable || (Iterable = {}));\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nclass KeyCodeStrMap {\n constructor() {\n this._keyCodeToStr = [];\n this._strToKeyCode = Object.create(null);\n }\n define(keyCode, str) {\n this._keyCodeToStr[keyCode] = str;\n this._strToKeyCode[str.toLowerCase()] = keyCode;\n }\n keyCodeToStr(keyCode) {\n return this._keyCodeToStr[keyCode];\n }\n strToKeyCode(str) {\n return this._strToKeyCode[str.toLowerCase()] || 0 /* KeyCode.Unknown */;\n }\n}\nconst uiMap = new KeyCodeStrMap();\nconst userSettingsUSMap = new KeyCodeStrMap();\nconst userSettingsGeneralMap = new KeyCodeStrMap();\nexport const EVENT_KEY_CODE_MAP = new Array(230);\nexport const NATIVE_WINDOWS_KEY_CODE_TO_KEY_CODE = {};\nconst scanCodeIntToStr = [];\nconst scanCodeStrToInt = Object.create(null);\nconst scanCodeLowerCaseStrToInt = Object.create(null);\n/**\n * -1 if a ScanCode => KeyCode mapping depends on kb layout.\n */\nexport const IMMUTABLE_CODE_TO_KEY_CODE = [];\n/**\n * -1 if a KeyCode => ScanCode mapping depends on kb layout.\n */\nexport const IMMUTABLE_KEY_CODE_TO_CODE = [];\nfor (let i = 0; i <= 193 /* ScanCode.MAX_VALUE */; i++) {\n IMMUTABLE_CODE_TO_KEY_CODE[i] = -1 /* KeyCode.DependsOnKbLayout */;\n}\nfor (let i = 0; i <= 132 /* KeyCode.MAX_VALUE */; i++) {\n IMMUTABLE_KEY_CODE_TO_CODE[i] = -1 /* ScanCode.DependsOnKbLayout */;\n}\n(function () {\n // See https://msdn.microsoft.com/en-us/library/windows/desktop/dd375731(v=vs.85).aspx\n // See https://github.com/microsoft/node-native-keymap/blob/88c0b0e5/deps/chromium/keyboard_codes_win.h\n const empty = '';\n const mappings = [\n // immutable, scanCode, scanCodeStr, keyCode, keyCodeStr, eventKeyCode, vkey, usUserSettingsLabel, generalUserSettingsLabel\n [1, 0 /* ScanCode.None */, 'None', 0 /* KeyCode.Unknown */, 'unknown', 0, 'VK_UNKNOWN', empty, empty],\n [1, 1 /* ScanCode.Hyper */, 'Hyper', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 2 /* ScanCode.Super */, 'Super', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 3 /* ScanCode.Fn */, 'Fn', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 4 /* ScanCode.FnLock */, 'FnLock', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 5 /* ScanCode.Suspend */, 'Suspend', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 6 /* ScanCode.Resume */, 'Resume', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 7 /* ScanCode.Turbo */, 'Turbo', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 8 /* ScanCode.Sleep */, 'Sleep', 0 /* KeyCode.Unknown */, empty, 0, 'VK_SLEEP', empty, empty],\n [1, 9 /* ScanCode.WakeUp */, 'WakeUp', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [0, 10 /* ScanCode.KeyA */, 'KeyA', 31 /* KeyCode.KeyA */, 'A', 65, 'VK_A', empty, empty],\n [0, 11 /* ScanCode.KeyB */, 'KeyB', 32 /* KeyCode.KeyB */, 'B', 66, 'VK_B', empty, empty],\n [0, 12 /* ScanCode.KeyC */, 'KeyC', 33 /* KeyCode.KeyC */, 'C', 67, 'VK_C', empty, empty],\n [0, 13 /* ScanCode.KeyD */, 'KeyD', 34 /* KeyCode.KeyD */, 'D', 68, 'VK_D', empty, empty],\n [0, 14 /* ScanCode.KeyE */, 'KeyE', 35 /* KeyCode.KeyE */, 'E', 69, 'VK_E', empty, empty],\n [0, 15 /* ScanCode.KeyF */, 'KeyF', 36 /* KeyCode.KeyF */, 'F', 70, 'VK_F', empty, empty],\n [0, 16 /* ScanCode.KeyG */, 'KeyG', 37 /* KeyCode.KeyG */, 'G', 71, 'VK_G', empty, empty],\n [0, 17 /* ScanCode.KeyH */, 'KeyH', 38 /* KeyCode.KeyH */, 'H', 72, 'VK_H', empty, empty],\n [0, 18 /* ScanCode.KeyI */, 'KeyI', 39 /* KeyCode.KeyI */, 'I', 73, 'VK_I', empty, empty],\n [0, 19 /* ScanCode.KeyJ */, 'KeyJ', 40 /* KeyCode.KeyJ */, 'J', 74, 'VK_J', empty, empty],\n [0, 20 /* ScanCode.KeyK */, 'KeyK', 41 /* KeyCode.KeyK */, 'K', 75, 'VK_K', empty, empty],\n [0, 21 /* ScanCode.KeyL */, 'KeyL', 42 /* KeyCode.KeyL */, 'L', 76, 'VK_L', empty, empty],\n [0, 22 /* ScanCode.KeyM */, 'KeyM', 43 /* KeyCode.KeyM */, 'M', 77, 'VK_M', empty, empty],\n [0, 23 /* ScanCode.KeyN */, 'KeyN', 44 /* KeyCode.KeyN */, 'N', 78, 'VK_N', empty, empty],\n [0, 24 /* ScanCode.KeyO */, 'KeyO', 45 /* KeyCode.KeyO */, 'O', 79, 'VK_O', empty, empty],\n [0, 25 /* ScanCode.KeyP */, 'KeyP', 46 /* KeyCode.KeyP */, 'P', 80, 'VK_P', empty, empty],\n [0, 26 /* ScanCode.KeyQ */, 'KeyQ', 47 /* KeyCode.KeyQ */, 'Q', 81, 'VK_Q', empty, empty],\n [0, 27 /* ScanCode.KeyR */, 'KeyR', 48 /* KeyCode.KeyR */, 'R', 82, 'VK_R', empty, empty],\n [0, 28 /* ScanCode.KeyS */, 'KeyS', 49 /* KeyCode.KeyS */, 'S', 83, 'VK_S', empty, empty],\n [0, 29 /* ScanCode.KeyT */, 'KeyT', 50 /* KeyCode.KeyT */, 'T', 84, 'VK_T', empty, empty],\n [0, 30 /* ScanCode.KeyU */, 'KeyU', 51 /* KeyCode.KeyU */, 'U', 85, 'VK_U', empty, empty],\n [0, 31 /* ScanCode.KeyV */, 'KeyV', 52 /* KeyCode.KeyV */, 'V', 86, 'VK_V', empty, empty],\n [0, 32 /* ScanCode.KeyW */, 'KeyW', 53 /* KeyCode.KeyW */, 'W', 87, 'VK_W', empty, empty],\n [0, 33 /* ScanCode.KeyX */, 'KeyX', 54 /* KeyCode.KeyX */, 'X', 88, 'VK_X', empty, empty],\n [0, 34 /* ScanCode.KeyY */, 'KeyY', 55 /* KeyCode.KeyY */, 'Y', 89, 'VK_Y', empty, empty],\n [0, 35 /* ScanCode.KeyZ */, 'KeyZ', 56 /* KeyCode.KeyZ */, 'Z', 90, 'VK_Z', empty, empty],\n [0, 36 /* ScanCode.Digit1 */, 'Digit1', 22 /* KeyCode.Digit1 */, '1', 49, 'VK_1', empty, empty],\n [0, 37 /* ScanCode.Digit2 */, 'Digit2', 23 /* KeyCode.Digit2 */, '2', 50, 'VK_2', empty, empty],\n [0, 38 /* ScanCode.Digit3 */, 'Digit3', 24 /* KeyCode.Digit3 */, '3', 51, 'VK_3', empty, empty],\n [0, 39 /* ScanCode.Digit4 */, 'Digit4', 25 /* KeyCode.Digit4 */, '4', 52, 'VK_4', empty, empty],\n [0, 40 /* ScanCode.Digit5 */, 'Digit5', 26 /* KeyCode.Digit5 */, '5', 53, 'VK_5', empty, empty],\n [0, 41 /* ScanCode.Digit6 */, 'Digit6', 27 /* KeyCode.Digit6 */, '6', 54, 'VK_6', empty, empty],\n [0, 42 /* ScanCode.Digit7 */, 'Digit7', 28 /* KeyCode.Digit7 */, '7', 55, 'VK_7', empty, empty],\n [0, 43 /* ScanCode.Digit8 */, 'Digit8', 29 /* KeyCode.Digit8 */, '8', 56, 'VK_8', empty, empty],\n [0, 44 /* ScanCode.Digit9 */, 'Digit9', 30 /* KeyCode.Digit9 */, '9', 57, 'VK_9', empty, empty],\n [0, 45 /* ScanCode.Digit0 */, 'Digit0', 21 /* KeyCode.Digit0 */, '0', 48, 'VK_0', empty, empty],\n [1, 46 /* ScanCode.Enter */, 'Enter', 3 /* KeyCode.Enter */, 'Enter', 13, 'VK_RETURN', empty, empty],\n [1, 47 /* ScanCode.Escape */, 'Escape', 9 /* KeyCode.Escape */, 'Escape', 27, 'VK_ESCAPE', empty, empty],\n [1, 48 /* ScanCode.Backspace */, 'Backspace', 1 /* KeyCode.Backspace */, 'Backspace', 8, 'VK_BACK', empty, empty],\n [1, 49 /* ScanCode.Tab */, 'Tab', 2 /* KeyCode.Tab */, 'Tab', 9, 'VK_TAB', empty, empty],\n [1, 50 /* ScanCode.Space */, 'Space', 10 /* KeyCode.Space */, 'Space', 32, 'VK_SPACE', empty, empty],\n [0, 51 /* ScanCode.Minus */, 'Minus', 88 /* KeyCode.Minus */, '-', 189, 'VK_OEM_MINUS', '-', 'OEM_MINUS'],\n [0, 52 /* ScanCode.Equal */, 'Equal', 86 /* KeyCode.Equal */, '=', 187, 'VK_OEM_PLUS', '=', 'OEM_PLUS'],\n [0, 53 /* ScanCode.BracketLeft */, 'BracketLeft', 92 /* KeyCode.BracketLeft */, '[', 219, 'VK_OEM_4', '[', 'OEM_4'],\n [0, 54 /* ScanCode.BracketRight */, 'BracketRight', 94 /* KeyCode.BracketRight */, ']', 221, 'VK_OEM_6', ']', 'OEM_6'],\n [0, 55 /* ScanCode.Backslash */, 'Backslash', 93 /* KeyCode.Backslash */, '\\\\', 220, 'VK_OEM_5', '\\\\', 'OEM_5'],\n [0, 56 /* ScanCode.IntlHash */, 'IntlHash', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty], // has been dropped from the w3c spec\n [0, 57 /* ScanCode.Semicolon */, 'Semicolon', 85 /* KeyCode.Semicolon */, ';', 186, 'VK_OEM_1', ';', 'OEM_1'],\n [0, 58 /* ScanCode.Quote */, 'Quote', 95 /* KeyCode.Quote */, '\\'', 222, 'VK_OEM_7', '\\'', 'OEM_7'],\n [0, 59 /* ScanCode.Backquote */, 'Backquote', 91 /* KeyCode.Backquote */, '`', 192, 'VK_OEM_3', '`', 'OEM_3'],\n [0, 60 /* ScanCode.Comma */, 'Comma', 87 /* KeyCode.Comma */, ',', 188, 'VK_OEM_COMMA', ',', 'OEM_COMMA'],\n [0, 61 /* ScanCode.Period */, 'Period', 89 /* KeyCode.Period */, '.', 190, 'VK_OEM_PERIOD', '.', 'OEM_PERIOD'],\n [0, 62 /* ScanCode.Slash */, 'Slash', 90 /* KeyCode.Slash */, '/', 191, 'VK_OEM_2', '/', 'OEM_2'],\n [1, 63 /* ScanCode.CapsLock */, 'CapsLock', 8 /* KeyCode.CapsLock */, 'CapsLock', 20, 'VK_CAPITAL', empty, empty],\n [1, 64 /* ScanCode.F1 */, 'F1', 59 /* KeyCode.F1 */, 'F1', 112, 'VK_F1', empty, empty],\n [1, 65 /* ScanCode.F2 */, 'F2', 60 /* KeyCode.F2 */, 'F2', 113, 'VK_F2', empty, empty],\n [1, 66 /* ScanCode.F3 */, 'F3', 61 /* KeyCode.F3 */, 'F3', 114, 'VK_F3', empty, empty],\n [1, 67 /* ScanCode.F4 */, 'F4', 62 /* KeyCode.F4 */, 'F4', 115, 'VK_F4', empty, empty],\n [1, 68 /* ScanCode.F5 */, 'F5', 63 /* KeyCode.F5 */, 'F5', 116, 'VK_F5', empty, empty],\n [1, 69 /* ScanCode.F6 */, 'F6', 64 /* KeyCode.F6 */, 'F6', 117, 'VK_F6', empty, empty],\n [1, 70 /* ScanCode.F7 */, 'F7', 65 /* KeyCode.F7 */, 'F7', 118, 'VK_F7', empty, empty],\n [1, 71 /* ScanCode.F8 */, 'F8', 66 /* KeyCode.F8 */, 'F8', 119, 'VK_F8', empty, empty],\n [1, 72 /* ScanCode.F9 */, 'F9', 67 /* KeyCode.F9 */, 'F9', 120, 'VK_F9', empty, empty],\n [1, 73 /* ScanCode.F10 */, 'F10', 68 /* KeyCode.F10 */, 'F10', 121, 'VK_F10', empty, empty],\n [1, 74 /* ScanCode.F11 */, 'F11', 69 /* KeyCode.F11 */, 'F11', 122, 'VK_F11', empty, empty],\n [1, 75 /* ScanCode.F12 */, 'F12', 70 /* KeyCode.F12 */, 'F12', 123, 'VK_F12', empty, empty],\n [1, 76 /* ScanCode.PrintScreen */, 'PrintScreen', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 77 /* ScanCode.ScrollLock */, 'ScrollLock', 84 /* KeyCode.ScrollLock */, 'ScrollLock', 145, 'VK_SCROLL', empty, empty],\n [1, 78 /* ScanCode.Pause */, 'Pause', 7 /* KeyCode.PauseBreak */, 'PauseBreak', 19, 'VK_PAUSE', empty, empty],\n [1, 79 /* ScanCode.Insert */, 'Insert', 19 /* KeyCode.Insert */, 'Insert', 45, 'VK_INSERT', empty, empty],\n [1, 80 /* ScanCode.Home */, 'Home', 14 /* KeyCode.Home */, 'Home', 36, 'VK_HOME', empty, empty],\n [1, 81 /* ScanCode.PageUp */, 'PageUp', 11 /* KeyCode.PageUp */, 'PageUp', 33, 'VK_PRIOR', empty, empty],\n [1, 82 /* ScanCode.Delete */, 'Delete', 20 /* KeyCode.Delete */, 'Delete', 46, 'VK_DELETE', empty, empty],\n [1, 83 /* ScanCode.End */, 'End', 13 /* KeyCode.End */, 'End', 35, 'VK_END', empty, empty],\n [1, 84 /* ScanCode.PageDown */, 'PageDown', 12 /* KeyCode.PageDown */, 'PageDown', 34, 'VK_NEXT', empty, empty],\n [1, 85 /* ScanCode.ArrowRight */, 'ArrowRight', 17 /* KeyCode.RightArrow */, 'RightArrow', 39, 'VK_RIGHT', 'Right', empty],\n [1, 86 /* ScanCode.ArrowLeft */, 'ArrowLeft', 15 /* KeyCode.LeftArrow */, 'LeftArrow', 37, 'VK_LEFT', 'Left', empty],\n [1, 87 /* ScanCode.ArrowDown */, 'ArrowDown', 18 /* KeyCode.DownArrow */, 'DownArrow', 40, 'VK_DOWN', 'Down', empty],\n [1, 88 /* ScanCode.ArrowUp */, 'ArrowUp', 16 /* KeyCode.UpArrow */, 'UpArrow', 38, 'VK_UP', 'Up', empty],\n [1, 89 /* ScanCode.NumLock */, 'NumLock', 83 /* KeyCode.NumLock */, 'NumLock', 144, 'VK_NUMLOCK', empty, empty],\n [1, 90 /* ScanCode.NumpadDivide */, 'NumpadDivide', 113 /* KeyCode.NumpadDivide */, 'NumPad_Divide', 111, 'VK_DIVIDE', empty, empty],\n [1, 91 /* ScanCode.NumpadMultiply */, 'NumpadMultiply', 108 /* KeyCode.NumpadMultiply */, 'NumPad_Multiply', 106, 'VK_MULTIPLY', empty, empty],\n [1, 92 /* ScanCode.NumpadSubtract */, 'NumpadSubtract', 111 /* KeyCode.NumpadSubtract */, 'NumPad_Subtract', 109, 'VK_SUBTRACT', empty, empty],\n [1, 93 /* ScanCode.NumpadAdd */, 'NumpadAdd', 109 /* KeyCode.NumpadAdd */, 'NumPad_Add', 107, 'VK_ADD', empty, empty],\n [1, 94 /* ScanCode.NumpadEnter */, 'NumpadEnter', 3 /* KeyCode.Enter */, empty, 0, empty, empty, empty],\n [1, 95 /* ScanCode.Numpad1 */, 'Numpad1', 99 /* KeyCode.Numpad1 */, 'NumPad1', 97, 'VK_NUMPAD1', empty, empty],\n [1, 96 /* ScanCode.Numpad2 */, 'Numpad2', 100 /* KeyCode.Numpad2 */, 'NumPad2', 98, 'VK_NUMPAD2', empty, empty],\n [1, 97 /* ScanCode.Numpad3 */, 'Numpad3', 101 /* KeyCode.Numpad3 */, 'NumPad3', 99, 'VK_NUMPAD3', empty, empty],\n [1, 98 /* ScanCode.Numpad4 */, 'Numpad4', 102 /* KeyCode.Numpad4 */, 'NumPad4', 100, 'VK_NUMPAD4', empty, empty],\n [1, 99 /* ScanCode.Numpad5 */, 'Numpad5', 103 /* KeyCode.Numpad5 */, 'NumPad5', 101, 'VK_NUMPAD5', empty, empty],\n [1, 100 /* ScanCode.Numpad6 */, 'Numpad6', 104 /* KeyCode.Numpad6 */, 'NumPad6', 102, 'VK_NUMPAD6', empty, empty],\n [1, 101 /* ScanCode.Numpad7 */, 'Numpad7', 105 /* KeyCode.Numpad7 */, 'NumPad7', 103, 'VK_NUMPAD7', empty, empty],\n [1, 102 /* ScanCode.Numpad8 */, 'Numpad8', 106 /* KeyCode.Numpad8 */, 'NumPad8', 104, 'VK_NUMPAD8', empty, empty],\n [1, 103 /* ScanCode.Numpad9 */, 'Numpad9', 107 /* KeyCode.Numpad9 */, 'NumPad9', 105, 'VK_NUMPAD9', empty, empty],\n [1, 104 /* ScanCode.Numpad0 */, 'Numpad0', 98 /* KeyCode.Numpad0 */, 'NumPad0', 96, 'VK_NUMPAD0', empty, empty],\n [1, 105 /* ScanCode.NumpadDecimal */, 'NumpadDecimal', 112 /* KeyCode.NumpadDecimal */, 'NumPad_Decimal', 110, 'VK_DECIMAL', empty, empty],\n [0, 106 /* ScanCode.IntlBackslash */, 'IntlBackslash', 97 /* KeyCode.IntlBackslash */, 'OEM_102', 226, 'VK_OEM_102', empty, empty],\n [1, 107 /* ScanCode.ContextMenu */, 'ContextMenu', 58 /* KeyCode.ContextMenu */, 'ContextMenu', 93, empty, empty, empty],\n [1, 108 /* ScanCode.Power */, 'Power', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 109 /* ScanCode.NumpadEqual */, 'NumpadEqual', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 110 /* ScanCode.F13 */, 'F13', 71 /* KeyCode.F13 */, 'F13', 124, 'VK_F13', empty, empty],\n [1, 111 /* ScanCode.F14 */, 'F14', 72 /* KeyCode.F14 */, 'F14', 125, 'VK_F14', empty, empty],\n [1, 112 /* ScanCode.F15 */, 'F15', 73 /* KeyCode.F15 */, 'F15', 126, 'VK_F15', empty, empty],\n [1, 113 /* ScanCode.F16 */, 'F16', 74 /* KeyCode.F16 */, 'F16', 127, 'VK_F16', empty, empty],\n [1, 114 /* ScanCode.F17 */, 'F17', 75 /* KeyCode.F17 */, 'F17', 128, 'VK_F17', empty, empty],\n [1, 115 /* ScanCode.F18 */, 'F18', 76 /* KeyCode.F18 */, 'F18', 129, 'VK_F18', empty, empty],\n [1, 116 /* ScanCode.F19 */, 'F19', 77 /* KeyCode.F19 */, 'F19', 130, 'VK_F19', empty, empty],\n [1, 117 /* ScanCode.F20 */, 'F20', 78 /* KeyCode.F20 */, 'F20', 131, 'VK_F20', empty, empty],\n [1, 118 /* ScanCode.F21 */, 'F21', 79 /* KeyCode.F21 */, 'F21', 132, 'VK_F21', empty, empty],\n [1, 119 /* ScanCode.F22 */, 'F22', 80 /* KeyCode.F22 */, 'F22', 133, 'VK_F22', empty, empty],\n [1, 120 /* ScanCode.F23 */, 'F23', 81 /* KeyCode.F23 */, 'F23', 134, 'VK_F23', empty, empty],\n [1, 121 /* ScanCode.F24 */, 'F24', 82 /* KeyCode.F24 */, 'F24', 135, 'VK_F24', empty, empty],\n [1, 122 /* ScanCode.Open */, 'Open', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 123 /* ScanCode.Help */, 'Help', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 124 /* ScanCode.Select */, 'Select', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 125 /* ScanCode.Again */, 'Again', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 126 /* ScanCode.Undo */, 'Undo', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 127 /* ScanCode.Cut */, 'Cut', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 128 /* ScanCode.Copy */, 'Copy', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 129 /* ScanCode.Paste */, 'Paste', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 130 /* ScanCode.Find */, 'Find', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 131 /* ScanCode.AudioVolumeMute */, 'AudioVolumeMute', 117 /* KeyCode.AudioVolumeMute */, 'AudioVolumeMute', 173, 'VK_VOLUME_MUTE', empty, empty],\n [1, 132 /* ScanCode.AudioVolumeUp */, 'AudioVolumeUp', 118 /* KeyCode.AudioVolumeUp */, 'AudioVolumeUp', 175, 'VK_VOLUME_UP', empty, empty],\n [1, 133 /* ScanCode.AudioVolumeDown */, 'AudioVolumeDown', 119 /* KeyCode.AudioVolumeDown */, 'AudioVolumeDown', 174, 'VK_VOLUME_DOWN', empty, empty],\n [1, 134 /* ScanCode.NumpadComma */, 'NumpadComma', 110 /* KeyCode.NUMPAD_SEPARATOR */, 'NumPad_Separator', 108, 'VK_SEPARATOR', empty, empty],\n [0, 135 /* ScanCode.IntlRo */, 'IntlRo', 115 /* KeyCode.ABNT_C1 */, 'ABNT_C1', 193, 'VK_ABNT_C1', empty, empty],\n [1, 136 /* ScanCode.KanaMode */, 'KanaMode', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [0, 137 /* ScanCode.IntlYen */, 'IntlYen', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 138 /* ScanCode.Convert */, 'Convert', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 139 /* ScanCode.NonConvert */, 'NonConvert', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 140 /* ScanCode.Lang1 */, 'Lang1', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 141 /* ScanCode.Lang2 */, 'Lang2', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 142 /* ScanCode.Lang3 */, 'Lang3', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 143 /* ScanCode.Lang4 */, 'Lang4', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 144 /* ScanCode.Lang5 */, 'Lang5', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 145 /* ScanCode.Abort */, 'Abort', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 146 /* ScanCode.Props */, 'Props', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 147 /* ScanCode.NumpadParenLeft */, 'NumpadParenLeft', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 148 /* ScanCode.NumpadParenRight */, 'NumpadParenRight', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 149 /* ScanCode.NumpadBackspace */, 'NumpadBackspace', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 150 /* ScanCode.NumpadMemoryStore */, 'NumpadMemoryStore', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 151 /* ScanCode.NumpadMemoryRecall */, 'NumpadMemoryRecall', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 152 /* ScanCode.NumpadMemoryClear */, 'NumpadMemoryClear', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 153 /* ScanCode.NumpadMemoryAdd */, 'NumpadMemoryAdd', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 154 /* ScanCode.NumpadMemorySubtract */, 'NumpadMemorySubtract', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 155 /* ScanCode.NumpadClear */, 'NumpadClear', 131 /* KeyCode.Clear */, 'Clear', 12, 'VK_CLEAR', empty, empty],\n [1, 156 /* ScanCode.NumpadClearEntry */, 'NumpadClearEntry', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 0 /* ScanCode.None */, empty, 5 /* KeyCode.Ctrl */, 'Ctrl', 17, 'VK_CONTROL', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 4 /* KeyCode.Shift */, 'Shift', 16, 'VK_SHIFT', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 6 /* KeyCode.Alt */, 'Alt', 18, 'VK_MENU', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 57 /* KeyCode.Meta */, 'Meta', 91, 'VK_COMMAND', empty, empty],\n [1, 157 /* ScanCode.ControlLeft */, 'ControlLeft', 5 /* KeyCode.Ctrl */, empty, 0, 'VK_LCONTROL', empty, empty],\n [1, 158 /* ScanCode.ShiftLeft */, 'ShiftLeft', 4 /* KeyCode.Shift */, empty, 0, 'VK_LSHIFT', empty, empty],\n [1, 159 /* ScanCode.AltLeft */, 'AltLeft', 6 /* KeyCode.Alt */, empty, 0, 'VK_LMENU', empty, empty],\n [1, 160 /* ScanCode.MetaLeft */, 'MetaLeft', 57 /* KeyCode.Meta */, empty, 0, 'VK_LWIN', empty, empty],\n [1, 161 /* ScanCode.ControlRight */, 'ControlRight', 5 /* KeyCode.Ctrl */, empty, 0, 'VK_RCONTROL', empty, empty],\n [1, 162 /* ScanCode.ShiftRight */, 'ShiftRight', 4 /* KeyCode.Shift */, empty, 0, 'VK_RSHIFT', empty, empty],\n [1, 163 /* ScanCode.AltRight */, 'AltRight', 6 /* KeyCode.Alt */, empty, 0, 'VK_RMENU', empty, empty],\n [1, 164 /* ScanCode.MetaRight */, 'MetaRight', 57 /* KeyCode.Meta */, empty, 0, 'VK_RWIN', empty, empty],\n [1, 165 /* ScanCode.BrightnessUp */, 'BrightnessUp', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 166 /* ScanCode.BrightnessDown */, 'BrightnessDown', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 167 /* ScanCode.MediaPlay */, 'MediaPlay', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 168 /* ScanCode.MediaRecord */, 'MediaRecord', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 169 /* ScanCode.MediaFastForward */, 'MediaFastForward', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 170 /* ScanCode.MediaRewind */, 'MediaRewind', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 171 /* ScanCode.MediaTrackNext */, 'MediaTrackNext', 124 /* KeyCode.MediaTrackNext */, 'MediaTrackNext', 176, 'VK_MEDIA_NEXT_TRACK', empty, empty],\n [1, 172 /* ScanCode.MediaTrackPrevious */, 'MediaTrackPrevious', 125 /* KeyCode.MediaTrackPrevious */, 'MediaTrackPrevious', 177, 'VK_MEDIA_PREV_TRACK', empty, empty],\n [1, 173 /* ScanCode.MediaStop */, 'MediaStop', 126 /* KeyCode.MediaStop */, 'MediaStop', 178, 'VK_MEDIA_STOP', empty, empty],\n [1, 174 /* ScanCode.Eject */, 'Eject', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 175 /* ScanCode.MediaPlayPause */, 'MediaPlayPause', 127 /* KeyCode.MediaPlayPause */, 'MediaPlayPause', 179, 'VK_MEDIA_PLAY_PAUSE', empty, empty],\n [1, 176 /* ScanCode.MediaSelect */, 'MediaSelect', 128 /* KeyCode.LaunchMediaPlayer */, 'LaunchMediaPlayer', 181, 'VK_MEDIA_LAUNCH_MEDIA_SELECT', empty, empty],\n [1, 177 /* ScanCode.LaunchMail */, 'LaunchMail', 129 /* KeyCode.LaunchMail */, 'LaunchMail', 180, 'VK_MEDIA_LAUNCH_MAIL', empty, empty],\n [1, 178 /* ScanCode.LaunchApp2 */, 'LaunchApp2', 130 /* KeyCode.LaunchApp2 */, 'LaunchApp2', 183, 'VK_MEDIA_LAUNCH_APP2', empty, empty],\n [1, 179 /* ScanCode.LaunchApp1 */, 'LaunchApp1', 0 /* KeyCode.Unknown */, empty, 0, 'VK_MEDIA_LAUNCH_APP1', empty, empty],\n [1, 180 /* ScanCode.SelectTask */, 'SelectTask', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 181 /* ScanCode.LaunchScreenSaver */, 'LaunchScreenSaver', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 182 /* ScanCode.BrowserSearch */, 'BrowserSearch', 120 /* KeyCode.BrowserSearch */, 'BrowserSearch', 170, 'VK_BROWSER_SEARCH', empty, empty],\n [1, 183 /* ScanCode.BrowserHome */, 'BrowserHome', 121 /* KeyCode.BrowserHome */, 'BrowserHome', 172, 'VK_BROWSER_HOME', empty, empty],\n [1, 184 /* ScanCode.BrowserBack */, 'BrowserBack', 122 /* KeyCode.BrowserBack */, 'BrowserBack', 166, 'VK_BROWSER_BACK', empty, empty],\n [1, 185 /* ScanCode.BrowserForward */, 'BrowserForward', 123 /* KeyCode.BrowserForward */, 'BrowserForward', 167, 'VK_BROWSER_FORWARD', empty, empty],\n [1, 186 /* ScanCode.BrowserStop */, 'BrowserStop', 0 /* KeyCode.Unknown */, empty, 0, 'VK_BROWSER_STOP', empty, empty],\n [1, 187 /* ScanCode.BrowserRefresh */, 'BrowserRefresh', 0 /* KeyCode.Unknown */, empty, 0, 'VK_BROWSER_REFRESH', empty, empty],\n [1, 188 /* ScanCode.BrowserFavorites */, 'BrowserFavorites', 0 /* KeyCode.Unknown */, empty, 0, 'VK_BROWSER_FAVORITES', empty, empty],\n [1, 189 /* ScanCode.ZoomToggle */, 'ZoomToggle', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 190 /* ScanCode.MailReply */, 'MailReply', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 191 /* ScanCode.MailForward */, 'MailForward', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n [1, 192 /* ScanCode.MailSend */, 'MailSend', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n // See https://lists.w3.org/Archives/Public/www-dom/2010JulSep/att-0182/keyCode-spec.html\n // If an Input Method Editor is processing key input and the event is keydown, return 229.\n [1, 0 /* ScanCode.None */, empty, 114 /* KeyCode.KEY_IN_COMPOSITION */, 'KeyInComposition', 229, empty, empty, empty],\n [1, 0 /* ScanCode.None */, empty, 116 /* KeyCode.ABNT_C2 */, 'ABNT_C2', 194, 'VK_ABNT_C2', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 96 /* KeyCode.OEM_8 */, 'OEM_8', 223, 'VK_OEM_8', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_KANA', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_HANGUL', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_JUNJA', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_FINAL', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_HANJA', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_KANJI', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_CONVERT', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_NONCONVERT', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_ACCEPT', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_MODECHANGE', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_SELECT', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_PRINT', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_EXECUTE', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_SNAPSHOT', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_HELP', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_APPS', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_PROCESSKEY', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_PACKET', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_DBE_SBCSCHAR', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_DBE_DBCSCHAR', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_ATTN', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_CRSEL', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_EXSEL', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_EREOF', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_PLAY', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_ZOOM', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_NONAME', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_PA1', empty, empty],\n [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_OEM_CLEAR', empty, empty],\n ];\n const seenKeyCode = [];\n const seenScanCode = [];\n for (const mapping of mappings) {\n const [immutable, scanCode, scanCodeStr, keyCode, keyCodeStr, eventKeyCode, vkey, usUserSettingsLabel, generalUserSettingsLabel] = mapping;\n if (!seenScanCode[scanCode]) {\n seenScanCode[scanCode] = true;\n scanCodeIntToStr[scanCode] = scanCodeStr;\n scanCodeStrToInt[scanCodeStr] = scanCode;\n scanCodeLowerCaseStrToInt[scanCodeStr.toLowerCase()] = scanCode;\n if (immutable) {\n IMMUTABLE_CODE_TO_KEY_CODE[scanCode] = keyCode;\n if ((keyCode !== 0 /* KeyCode.Unknown */)\n && (keyCode !== 3 /* KeyCode.Enter */)\n && (keyCode !== 5 /* KeyCode.Ctrl */)\n && (keyCode !== 4 /* KeyCode.Shift */)\n && (keyCode !== 6 /* KeyCode.Alt */)\n && (keyCode !== 57 /* KeyCode.Meta */)) {\n IMMUTABLE_KEY_CODE_TO_CODE[keyCode] = scanCode;\n }\n }\n }\n if (!seenKeyCode[keyCode]) {\n seenKeyCode[keyCode] = true;\n if (!keyCodeStr) {\n throw new Error(`String representation missing for key code ${keyCode} around scan code ${scanCodeStr}`);\n }\n uiMap.define(keyCode, keyCodeStr);\n userSettingsUSMap.define(keyCode, usUserSettingsLabel || keyCodeStr);\n userSettingsGeneralMap.define(keyCode, generalUserSettingsLabel || usUserSettingsLabel || keyCodeStr);\n }\n if (eventKeyCode) {\n EVENT_KEY_CODE_MAP[eventKeyCode] = keyCode;\n }\n if (vkey) {\n NATIVE_WINDOWS_KEY_CODE_TO_KEY_CODE[vkey] = keyCode;\n }\n }\n // Manually added due to the exclusion above (due to duplication with NumpadEnter)\n IMMUTABLE_KEY_CODE_TO_CODE[3 /* KeyCode.Enter */] = 46 /* ScanCode.Enter */;\n})();\nexport var KeyCodeUtils;\n(function (KeyCodeUtils) {\n function toString(keyCode) {\n return uiMap.keyCodeToStr(keyCode);\n }\n KeyCodeUtils.toString = toString;\n function fromString(key) {\n return uiMap.strToKeyCode(key);\n }\n KeyCodeUtils.fromString = fromString;\n function toUserSettingsUS(keyCode) {\n return userSettingsUSMap.keyCodeToStr(keyCode);\n }\n KeyCodeUtils.toUserSettingsUS = toUserSettingsUS;\n function toUserSettingsGeneral(keyCode) {\n return userSettingsGeneralMap.keyCodeToStr(keyCode);\n }\n KeyCodeUtils.toUserSettingsGeneral = toUserSettingsGeneral;\n function fromUserSettings(key) {\n return userSettingsUSMap.strToKeyCode(key) || userSettingsGeneralMap.strToKeyCode(key);\n }\n KeyCodeUtils.fromUserSettings = fromUserSettings;\n function toElectronAccelerator(keyCode) {\n if (keyCode >= 98 /* KeyCode.Numpad0 */ && keyCode <= 113 /* KeyCode.NumpadDivide */) {\n // [Electron Accelerators] Electron is able to parse numpad keys, but unfortunately it\n // renders them just as regular keys in menus. For example, num0 is rendered as \"0\",\n // numdiv is rendered as \"/\", numsub is rendered as \"-\".\n //\n // This can lead to incredible confusion, as it makes numpad based keybindings indistinguishable\n // from keybindings based on regular keys.\n //\n // We therefore need to fall back to custom rendering for numpad keys.\n return null;\n }\n switch (keyCode) {\n case 16 /* KeyCode.UpArrow */:\n return 'Up';\n case 18 /* KeyCode.DownArrow */:\n return 'Down';\n case 15 /* KeyCode.LeftArrow */:\n return 'Left';\n case 17 /* KeyCode.RightArrow */:\n return 'Right';\n }\n return uiMap.keyCodeToStr(keyCode);\n }\n KeyCodeUtils.toElectronAccelerator = toElectronAccelerator;\n})(KeyCodeUtils || (KeyCodeUtils = {}));\nexport function KeyChord(firstPart, secondPart) {\n const chordPart = ((secondPart & 0x0000FFFF) << 16) >>> 0;\n return (firstPart | chordPart) >>> 0;\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nexport class Lazy {\n constructor(executor) {\n this.executor = executor;\n this._didRun = false;\n }\n /**\n * Get the wrapped value.\n *\n * This will force evaluation of the lazy value if it has not been resolved yet. Lazy values are only\n * resolved once. `getValue` will re-throw exceptions that are hit while resolving the value\n */\n get value() {\n if (!this._didRun) {\n try {\n this._value = this.executor();\n }\n catch (err) {\n this._error = err;\n }\n finally {\n this._didRun = true;\n }\n }\n if (this._error) {\n throw this._error;\n }\n return this._value;\n }\n /**\n * Get the wrapped value without forcing evaluation.\n */\n get rawValue() { return this._value; }\n}\n","import { createSingleCallFunction } from './functional.js';\nimport { Iterable } from './iterator.js';\n// #region Disposable Tracking\n/**\n * Enables logging of potentially leaked disposables.\n *\n * A disposable is considered leaked if it is not disposed or not registered as the child of\n * another disposable. This tracking is very simple an only works for classes that either\n * extend Disposable or use a DisposableStore. This means there are a lot of false positives.\n */\nconst TRACK_DISPOSABLES = false;\nlet disposableTracker = null;\nexport function setDisposableTracker(tracker) {\n disposableTracker = tracker;\n}\nif (TRACK_DISPOSABLES) {\n const __is_disposable_tracked__ = '__is_disposable_tracked__';\n setDisposableTracker(new class {\n trackDisposable(x) {\n const stack = new Error('Potentially leaked disposable').stack;\n setTimeout(() => {\n if (!x[__is_disposable_tracked__]) {\n console.log(stack);\n }\n }, 3000);\n }\n setParent(child, parent) {\n if (child && child !== Disposable.None) {\n try {\n child[__is_disposable_tracked__] = true;\n }\n catch (_a) {\n // noop\n }\n }\n }\n markAsDisposed(disposable) {\n if (disposable && disposable !== Disposable.None) {\n try {\n disposable[__is_disposable_tracked__] = true;\n }\n catch (_a) {\n // noop\n }\n }\n }\n markAsSingleton(disposable) { }\n });\n}\nexport function trackDisposable(x) {\n disposableTracker === null || disposableTracker === void 0 ? void 0 : disposableTracker.trackDisposable(x);\n return x;\n}\nexport function markAsDisposed(disposable) {\n disposableTracker === null || disposableTracker === void 0 ? void 0 : disposableTracker.markAsDisposed(disposable);\n}\nfunction setParentOfDisposable(child, parent) {\n disposableTracker === null || disposableTracker === void 0 ? void 0 : disposableTracker.setParent(child, parent);\n}\nfunction setParentOfDisposables(children, parent) {\n if (!disposableTracker) {\n return;\n }\n for (const child of children) {\n disposableTracker.setParent(child, parent);\n }\n}\n/**\n * Indicates that the given object is a singleton which does not need to be disposed.\n*/\nexport function markAsSingleton(singleton) {\n disposableTracker === null || disposableTracker === void 0 ? void 0 : disposableTracker.markAsSingleton(singleton);\n return singleton;\n}\n/**\n * Check if `thing` is {@link IDisposable disposable}.\n */\nexport function isDisposable(thing) {\n return typeof thing.dispose === 'function' && thing.dispose.length === 0;\n}\nexport function dispose(arg) {\n if (Iterable.is(arg)) {\n const errors = [];\n for (const d of arg) {\n if (d) {\n try {\n d.dispose();\n }\n catch (e) {\n errors.push(e);\n }\n }\n }\n if (errors.length === 1) {\n throw errors[0];\n }\n else if (errors.length > 1) {\n throw new AggregateError(errors, 'Encountered errors while disposing of store');\n }\n return Array.isArray(arg) ? [] : arg;\n }\n else if (arg) {\n arg.dispose();\n return arg;\n }\n}\n/**\n * Combine multiple disposable values into a single {@link IDisposable}.\n */\nexport function combinedDisposable(...disposables) {\n const parent = toDisposable(() => dispose(disposables));\n setParentOfDisposables(disposables, parent);\n return parent;\n}\n/**\n * Turn a function that implements dispose into an {@link IDisposable}.\n *\n * @param fn Clean up function, guaranteed to be called only **once**.\n */\nexport function toDisposable(fn) {\n const self = trackDisposable({\n dispose: createSingleCallFunction(() => {\n markAsDisposed(self);\n fn();\n })\n });\n return self;\n}\n/**\n * Manages a collection of disposable values.\n *\n * This is the preferred way to manage multiple disposables. A `DisposableStore` is safer to work with than an\n * `IDisposable[]` as it considers edge cases, such as registering the same value multiple times or adding an item to a\n * store that has already been disposed of.\n */\nexport class DisposableStore {\n constructor() {\n this._toDispose = new Set();\n this._isDisposed = false;\n trackDisposable(this);\n }\n /**\n * Dispose of all registered disposables and mark this object as disposed.\n *\n * Any future disposables added to this object will be disposed of on `add`.\n */\n dispose() {\n if (this._isDisposed) {\n return;\n }\n markAsDisposed(this);\n this._isDisposed = true;\n this.clear();\n }\n /**\n * @return `true` if this object has been disposed of.\n */\n get isDisposed() {\n return this._isDisposed;\n }\n /**\n * Dispose of all registered disposables but do not mark this object as disposed.\n */\n clear() {\n if (this._toDispose.size === 0) {\n return;\n }\n try {\n dispose(this._toDispose);\n }\n finally {\n this._toDispose.clear();\n }\n }\n /**\n * Add a new {@link IDisposable disposable} to the collection.\n */\n add(o) {\n if (!o) {\n return o;\n }\n if (o === this) {\n throw new Error('Cannot register a disposable on itself!');\n }\n setParentOfDisposable(o, this);\n if (this._isDisposed) {\n if (!DisposableStore.DISABLE_DISPOSED_WARNING) {\n 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);\n }\n }\n else {\n this._toDispose.add(o);\n }\n return o;\n }\n /**\n * Deletes the value from the store, but does not dispose it.\n */\n deleteAndLeak(o) {\n if (!o) {\n return;\n }\n if (this._toDispose.has(o)) {\n this._toDispose.delete(o);\n setParentOfDisposable(o, null);\n }\n }\n}\nDisposableStore.DISABLE_DISPOSED_WARNING = false;\n/**\n * Abstract base class for a {@link IDisposable disposable} object.\n *\n * Subclasses can {@linkcode _register} disposables that will be automatically cleaned up when this object is disposed of.\n */\nexport class Disposable {\n constructor() {\n this._store = new DisposableStore();\n trackDisposable(this);\n setParentOfDisposable(this._store, this);\n }\n dispose() {\n markAsDisposed(this);\n this._store.dispose();\n }\n /**\n * Adds `o` to the collection of disposables managed by this object.\n */\n _register(o) {\n if (o === this) {\n throw new Error('Cannot register a disposable on itself!');\n }\n return this._store.add(o);\n }\n}\n/**\n * A disposable that does nothing when it is disposed of.\n *\n * TODO: This should not be a static property.\n */\nDisposable.None = Object.freeze({ dispose() { } });\n/**\n * Manages the lifecycle of a disposable value that may be changed.\n *\n * This ensures that when the disposable value is changed, the previously held disposable is disposed of. You can\n * also register a `MutableDisposable` on a `Disposable` to ensure it is automatically cleaned up.\n */\nexport class MutableDisposable {\n constructor() {\n this._isDisposed = false;\n trackDisposable(this);\n }\n get value() {\n return this._isDisposed ? undefined : this._value;\n }\n set value(value) {\n var _a;\n if (this._isDisposed || value === this._value) {\n return;\n }\n (_a = this._value) === null || _a === void 0 ? void 0 : _a.dispose();\n if (value) {\n setParentOfDisposable(value, this);\n }\n this._value = value;\n }\n /**\n * Resets the stored value and disposed of the previously stored value.\n */\n clear() {\n this.value = undefined;\n }\n dispose() {\n var _a;\n this._isDisposed = true;\n markAsDisposed(this);\n (_a = this._value) === null || _a === void 0 ? void 0 : _a.dispose();\n this._value = undefined;\n }\n}\nexport class RefCountedDisposable {\n constructor(_disposable) {\n this._disposable = _disposable;\n this._counter = 1;\n }\n acquire() {\n this._counter++;\n return this;\n }\n release() {\n if (--this._counter === 0) {\n this._disposable.dispose();\n }\n return this;\n }\n}\nexport class ImmortalReference {\n constructor(object) {\n this.object = object;\n }\n dispose() { }\n}\n/**\n * A map the manages the lifecycle of the values that it stores.\n */\nexport class DisposableMap {\n constructor() {\n this._store = new Map();\n this._isDisposed = false;\n trackDisposable(this);\n }\n /**\n * Disposes of all stored values and mark this object as disposed.\n *\n * Trying to use this object after it has been disposed of is an error.\n */\n dispose() {\n markAsDisposed(this);\n this._isDisposed = true;\n this.clearAndDisposeAll();\n }\n /**\n * Disposes of all stored values and clear the map, but DO NOT mark this object as disposed.\n */\n clearAndDisposeAll() {\n if (!this._store.size) {\n return;\n }\n try {\n dispose(this._store.values());\n }\n finally {\n this._store.clear();\n }\n }\n get(key) {\n return this._store.get(key);\n }\n set(key, value, skipDisposeOnOverwrite = false) {\n var _a;\n if (this._isDisposed) {\n console.warn(new Error('Trying to add a disposable to a DisposableMap that has already been disposed of. The added object will be leaked!').stack);\n }\n if (!skipDisposeOnOverwrite) {\n (_a = this._store.get(key)) === null || _a === void 0 ? void 0 : _a.dispose();\n }\n this._store.set(key, value);\n }\n /**\n * Delete the value stored for `key` from this map and also dispose of it.\n */\n deleteAndDispose(key) {\n var _a;\n (_a = this._store.get(key)) === null || _a === void 0 ? void 0 : _a.dispose();\n this._store.delete(key);\n }\n [Symbol.iterator]() {\n return this._store[Symbol.iterator]();\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nclass Node {\n constructor(element) {\n this.element = element;\n this.next = Node.Undefined;\n this.prev = Node.Undefined;\n }\n}\nNode.Undefined = new Node(undefined);\nexport class LinkedList {\n constructor() {\n this._first = Node.Undefined;\n this._last = Node.Undefined;\n this._size = 0;\n }\n get size() {\n return this._size;\n }\n isEmpty() {\n return this._first === Node.Undefined;\n }\n clear() {\n let node = this._first;\n while (node !== Node.Undefined) {\n const next = node.next;\n node.prev = Node.Undefined;\n node.next = Node.Undefined;\n node = next;\n }\n this._first = Node.Undefined;\n this._last = Node.Undefined;\n this._size = 0;\n }\n unshift(element) {\n return this._insert(element, false);\n }\n push(element) {\n return this._insert(element, true);\n }\n _insert(element, atTheEnd) {\n const newNode = new Node(element);\n if (this._first === Node.Undefined) {\n this._first = newNode;\n this._last = newNode;\n }\n else if (atTheEnd) {\n // push\n const oldLast = this._last;\n this._last = newNode;\n newNode.prev = oldLast;\n oldLast.next = newNode;\n }\n else {\n // unshift\n const oldFirst = this._first;\n this._first = newNode;\n newNode.next = oldFirst;\n oldFirst.prev = newNode;\n }\n this._size += 1;\n let didRemove = false;\n return () => {\n if (!didRemove) {\n didRemove = true;\n this._remove(newNode);\n }\n };\n }\n shift() {\n if (this._first === Node.Undefined) {\n return undefined;\n }\n else {\n const res = this._first.element;\n this._remove(this._first);\n return res;\n }\n }\n pop() {\n if (this._last === Node.Undefined) {\n return undefined;\n }\n else {\n const res = this._last.element;\n this._remove(this._last);\n return res;\n }\n }\n _remove(node) {\n if (node.prev !== Node.Undefined && node.next !== Node.Undefined) {\n // middle\n const anchor = node.prev;\n anchor.next = node.next;\n node.next.prev = anchor;\n }\n else if (node.prev === Node.Undefined && node.next === Node.Undefined) {\n // only node\n this._first = Node.Undefined;\n this._last = Node.Undefined;\n }\n else if (node.next === Node.Undefined) {\n // last\n this._last = this._last.prev;\n this._last.next = Node.Undefined;\n }\n else if (node.prev === Node.Undefined) {\n // first\n this._first = this._first.next;\n this._first.prev = Node.Undefined;\n }\n // done\n this._size -= 1;\n }\n *[Symbol.iterator]() {\n let node = this._first;\n while (node !== Node.Undefined) {\n yield node.element;\n node = node.next;\n }\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nvar _a, _b;\nclass ResourceMapEntry {\n constructor(uri, value) {\n this.uri = uri;\n this.value = value;\n }\n}\nfunction isEntries(arg) {\n return Array.isArray(arg);\n}\nexport class ResourceMap {\n constructor(arg, toKey) {\n this[_a] = 'ResourceMap';\n if (arg instanceof ResourceMap) {\n this.map = new Map(arg.map);\n this.toKey = toKey !== null && toKey !== void 0 ? toKey : ResourceMap.defaultToKey;\n }\n else if (isEntries(arg)) {\n this.map = new Map();\n this.toKey = toKey !== null && toKey !== void 0 ? toKey : ResourceMap.defaultToKey;\n for (const [resource, value] of arg) {\n this.set(resource, value);\n }\n }\n else {\n this.map = new Map();\n this.toKey = arg !== null && arg !== void 0 ? arg : ResourceMap.defaultToKey;\n }\n }\n set(resource, value) {\n this.map.set(this.toKey(resource), new ResourceMapEntry(resource, value));\n return this;\n }\n get(resource) {\n var _c;\n return (_c = this.map.get(this.toKey(resource))) === null || _c === void 0 ? void 0 : _c.value;\n }\n has(resource) {\n return this.map.has(this.toKey(resource));\n }\n get size() {\n return this.map.size;\n }\n clear() {\n this.map.clear();\n }\n delete(resource) {\n return this.map.delete(this.toKey(resource));\n }\n forEach(clb, thisArg) {\n if (typeof thisArg !== 'undefined') {\n clb = clb.bind(thisArg);\n }\n for (const [_, entry] of this.map) {\n clb(entry.value, entry.uri, this);\n }\n }\n *values() {\n for (const entry of this.map.values()) {\n yield entry.value;\n }\n }\n *keys() {\n for (const entry of this.map.values()) {\n yield entry.uri;\n }\n }\n *entries() {\n for (const entry of this.map.values()) {\n yield [entry.uri, entry.value];\n }\n }\n *[(_a = Symbol.toStringTag, Symbol.iterator)]() {\n for (const [, entry] of this.map) {\n yield [entry.uri, entry.value];\n }\n }\n}\nResourceMap.defaultToKey = (resource) => resource.toString();\nexport class LinkedMap {\n constructor() {\n this[_b] = 'LinkedMap';\n this._map = new Map();\n this._head = undefined;\n this._tail = undefined;\n this._size = 0;\n this._state = 0;\n }\n clear() {\n this._map.clear();\n this._head = undefined;\n this._tail = undefined;\n this._size = 0;\n this._state++;\n }\n isEmpty() {\n return !this._head && !this._tail;\n }\n get size() {\n return this._size;\n }\n get first() {\n var _c;\n return (_c = this._head) === null || _c === void 0 ? void 0 : _c.value;\n }\n get last() {\n var _c;\n return (_c = this._tail) === null || _c === void 0 ? void 0 : _c.value;\n }\n has(key) {\n return this._map.has(key);\n }\n get(key, touch = 0 /* Touch.None */) {\n const item = this._map.get(key);\n if (!item) {\n return undefined;\n }\n if (touch !== 0 /* Touch.None */) {\n this.touch(item, touch);\n }\n return item.value;\n }\n set(key, value, touch = 0 /* Touch.None */) {\n let item = this._map.get(key);\n if (item) {\n item.value = value;\n if (touch !== 0 /* Touch.None */) {\n this.touch(item, touch);\n }\n }\n else {\n item = { key, value, next: undefined, previous: undefined };\n switch (touch) {\n case 0 /* Touch.None */:\n this.addItemLast(item);\n break;\n case 1 /* Touch.AsOld */:\n this.addItemFirst(item);\n break;\n case 2 /* Touch.AsNew */:\n this.addItemLast(item);\n break;\n default:\n this.addItemLast(item);\n break;\n }\n this._map.set(key, item);\n this._size++;\n }\n return this;\n }\n delete(key) {\n return !!this.remove(key);\n }\n remove(key) {\n const item = this._map.get(key);\n if (!item) {\n return undefined;\n }\n this._map.delete(key);\n this.removeItem(item);\n this._size--;\n return item.value;\n }\n shift() {\n if (!this._head && !this._tail) {\n return undefined;\n }\n if (!this._head || !this._tail) {\n throw new Error('Invalid list');\n }\n const item = this._head;\n this._map.delete(item.key);\n this.removeItem(item);\n this._size--;\n return item.value;\n }\n forEach(callbackfn, thisArg) {\n const state = this._state;\n let current = this._head;\n while (current) {\n if (thisArg) {\n callbackfn.bind(thisArg)(current.value, current.key, this);\n }\n else {\n callbackfn(current.value, current.key, this);\n }\n if (this._state !== state) {\n throw new Error(`LinkedMap got modified during iteration.`);\n }\n current = current.next;\n }\n }\n keys() {\n const map = this;\n const state = this._state;\n let current = this._head;\n const iterator = {\n [Symbol.iterator]() {\n return iterator;\n },\n next() {\n if (map._state !== state) {\n throw new Error(`LinkedMap got modified during iteration.`);\n }\n if (current) {\n const result = { value: current.key, done: false };\n current = current.next;\n return result;\n }\n else {\n return { value: undefined, done: true };\n }\n }\n };\n return iterator;\n }\n values() {\n const map = this;\n const state = this._state;\n let current = this._head;\n const iterator = {\n [Symbol.iterator]() {\n return iterator;\n },\n next() {\n if (map._state !== state) {\n throw new Error(`LinkedMap got modified during iteration.`);\n }\n if (current) {\n const result = { value: current.value, done: false };\n current = current.next;\n return result;\n }\n else {\n return { value: undefined, done: true };\n }\n }\n };\n return iterator;\n }\n entries() {\n const map = this;\n const state = this._state;\n let current = this._head;\n const iterator = {\n [Symbol.iterator]() {\n return iterator;\n },\n next() {\n if (map._state !== state) {\n throw new Error(`LinkedMap got modified during iteration.`);\n }\n if (current) {\n const result = { value: [current.key, current.value], done: false };\n current = current.next;\n return result;\n }\n else {\n return { value: undefined, done: true };\n }\n }\n };\n return iterator;\n }\n [(_b = Symbol.toStringTag, Symbol.iterator)]() {\n return this.entries();\n }\n trimOld(newSize) {\n if (newSize >= this.size) {\n return;\n }\n if (newSize === 0) {\n this.clear();\n return;\n }\n let current = this._head;\n let currentSize = this.size;\n while (current && currentSize > newSize) {\n this._map.delete(current.key);\n current = current.next;\n currentSize--;\n }\n this._head = current;\n this._size = currentSize;\n if (current) {\n current.previous = undefined;\n }\n this._state++;\n }\n addItemFirst(item) {\n // First time Insert\n if (!this._head && !this._tail) {\n this._tail = item;\n }\n else if (!this._head) {\n throw new Error('Invalid list');\n }\n else {\n item.next = this._head;\n this._head.previous = item;\n }\n this._head = item;\n this._state++;\n }\n addItemLast(item) {\n // First time Insert\n if (!this._head && !this._tail) {\n this._head = item;\n }\n else if (!this._tail) {\n throw new Error('Invalid list');\n }\n else {\n item.previous = this._tail;\n this._tail.next = item;\n }\n this._tail = item;\n this._state++;\n }\n removeItem(item) {\n if (item === this._head && item === this._tail) {\n this._head = undefined;\n this._tail = undefined;\n }\n else if (item === this._head) {\n // This can only happen if size === 1 which is handled\n // by the case above.\n if (!item.next) {\n throw new Error('Invalid list');\n }\n item.next.previous = undefined;\n this._head = item.next;\n }\n else if (item === this._tail) {\n // This can only happen if size === 1 which is handled\n // by the case above.\n if (!item.previous) {\n throw new Error('Invalid list');\n }\n item.previous.next = undefined;\n this._tail = item.previous;\n }\n else {\n const next = item.next;\n const previous = item.previous;\n if (!next || !previous) {\n throw new Error('Invalid list');\n }\n next.previous = previous;\n previous.next = next;\n }\n item.next = undefined;\n item.previous = undefined;\n this._state++;\n }\n touch(item, touch) {\n if (!this._head || !this._tail) {\n throw new Error('Invalid list');\n }\n if ((touch !== 1 /* Touch.AsOld */ && touch !== 2 /* Touch.AsNew */)) {\n return;\n }\n if (touch === 1 /* Touch.AsOld */) {\n if (item === this._head) {\n return;\n }\n const next = item.next;\n const previous = item.previous;\n // Unlink the item\n if (item === this._tail) {\n // previous must be defined since item was not head but is tail\n // So there are more than on item in the map\n previous.next = undefined;\n this._tail = previous;\n }\n else {\n // Both next and previous are not undefined since item was neither head nor tail.\n next.previous = previous;\n previous.next = next;\n }\n // Insert the node at head\n item.previous = undefined;\n item.next = this._head;\n this._head.previous = item;\n this._head = item;\n this._state++;\n }\n else if (touch === 2 /* Touch.AsNew */) {\n if (item === this._tail) {\n return;\n }\n const next = item.next;\n const previous = item.previous;\n // Unlink the item.\n if (item === this._head) {\n // next must be defined since item was not tail but is head\n // So there are more than on item in the map\n next.previous = undefined;\n this._head = next;\n }\n else {\n // Both next and previous are not undefined since item was neither head nor tail.\n next.previous = previous;\n previous.next = next;\n }\n item.next = undefined;\n item.previous = this._tail;\n this._tail.next = item;\n this._tail = item;\n this._state++;\n }\n }\n toJSON() {\n const data = [];\n this.forEach((value, key) => {\n data.push([key, value]);\n });\n return data;\n }\n fromJSON(data) {\n this.clear();\n for (const [key, value] of data) {\n this.set(key, value);\n }\n }\n}\nexport class LRUCache extends LinkedMap {\n constructor(limit, ratio = 1) {\n super();\n this._limit = limit;\n this._ratio = Math.min(Math.max(0, ratio), 1);\n }\n get limit() {\n return this._limit;\n }\n set limit(limit) {\n this._limit = limit;\n this.checkTrim();\n }\n get(key, touch = 2 /* Touch.AsNew */) {\n return super.get(key, touch);\n }\n peek(key) {\n return super.get(key, 0 /* Touch.None */);\n }\n set(key, value) {\n super.set(key, value, 2 /* Touch.AsNew */);\n this.checkTrim();\n return this;\n }\n checkTrim() {\n if (this.size > this._limit) {\n this.trimOld(Math.round(this._limit * this._ratio));\n }\n }\n}\n/**\n * A map that allows access both by keys and values.\n * **NOTE**: values need to be unique.\n */\nexport class BidirectionalMap {\n constructor(entries) {\n this._m1 = new Map();\n this._m2 = new Map();\n if (entries) {\n for (const [key, value] of entries) {\n this.set(key, value);\n }\n }\n }\n clear() {\n this._m1.clear();\n this._m2.clear();\n }\n set(key, value) {\n this._m1.set(key, value);\n this._m2.set(value, key);\n }\n get(key) {\n return this._m1.get(key);\n }\n getKey(value) {\n return this._m2.get(value);\n }\n delete(key) {\n const value = this._m1.get(key);\n if (value === undefined) {\n return false;\n }\n this._m1.delete(key);\n this._m2.delete(value);\n return true;\n }\n keys() {\n return this._m1.keys();\n }\n values() {\n return this._m1.values();\n }\n}\nexport class SetMap {\n constructor() {\n this.map = new Map();\n }\n add(key, value) {\n let values = this.map.get(key);\n if (!values) {\n values = new Set();\n this.map.set(key, values);\n }\n values.add(value);\n }\n delete(key, value) {\n const values = this.map.get(key);\n if (!values) {\n return;\n }\n values.delete(value);\n if (values.size === 0) {\n this.map.delete(key);\n }\n }\n forEach(key, fn) {\n const values = this.map.get(key);\n if (!values) {\n return;\n }\n values.forEach(fn);\n }\n get(key) {\n const values = this.map.get(key);\n if (!values) {\n return new Set();\n }\n return values;\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { isTypedArray, isObject, isUndefinedOrNull } from './types.js';\nexport function deepClone(obj) {\n if (!obj || typeof obj !== 'object') {\n return obj;\n }\n if (obj instanceof RegExp) {\n return obj;\n }\n const result = Array.isArray(obj) ? [] : {};\n Object.entries(obj).forEach(([key, value]) => {\n result[key] = value && typeof value === 'object' ? deepClone(value) : value;\n });\n return result;\n}\nexport function deepFreeze(obj) {\n if (!obj || typeof obj !== 'object') {\n return obj;\n }\n const stack = [obj];\n while (stack.length > 0) {\n const obj = stack.shift();\n Object.freeze(obj);\n for (const key in obj) {\n if (_hasOwnProperty.call(obj, key)) {\n const prop = obj[key];\n if (typeof prop === 'object' && !Object.isFrozen(prop) && !isTypedArray(prop)) {\n stack.push(prop);\n }\n }\n }\n }\n return obj;\n}\nconst _hasOwnProperty = Object.prototype.hasOwnProperty;\nexport function cloneAndChange(obj, changer) {\n return _cloneAndChange(obj, changer, new Set());\n}\nfunction _cloneAndChange(obj, changer, seen) {\n if (isUndefinedOrNull(obj)) {\n return obj;\n }\n const changed = changer(obj);\n if (typeof changed !== 'undefined') {\n return changed;\n }\n if (Array.isArray(obj)) {\n const r1 = [];\n for (const e of obj) {\n r1.push(_cloneAndChange(e, changer, seen));\n }\n return r1;\n }\n if (isObject(obj)) {\n if (seen.has(obj)) {\n throw new Error('Cannot clone recursive data-structure');\n }\n seen.add(obj);\n const r2 = {};\n for (const i2 in obj) {\n if (_hasOwnProperty.call(obj, i2)) {\n r2[i2] = _cloneAndChange(obj[i2], changer, seen);\n }\n }\n seen.delete(obj);\n return r2;\n }\n return obj;\n}\n/**\n * Copies all properties of source into destination. The optional parameter \"overwrite\" allows to control\n * if existing properties on the destination should be overwritten or not. Defaults to true (overwrite).\n */\nexport function mixin(destination, source, overwrite = true) {\n if (!isObject(destination)) {\n return source;\n }\n if (isObject(source)) {\n Object.keys(source).forEach(key => {\n if (key in destination) {\n if (overwrite) {\n if (isObject(destination[key]) && isObject(source[key])) {\n mixin(destination[key], source[key], overwrite);\n }\n else {\n destination[key] = source[key];\n }\n }\n }\n else {\n destination[key] = source[key];\n }\n });\n }\n return destination;\n}\nexport function equals(one, other) {\n if (one === other) {\n return true;\n }\n if (one === null || one === undefined || other === null || other === undefined) {\n return false;\n }\n if (typeof one !== typeof other) {\n return false;\n }\n if (typeof one !== 'object') {\n return false;\n }\n if ((Array.isArray(one)) !== (Array.isArray(other))) {\n return false;\n }\n let i;\n let key;\n if (Array.isArray(one)) {\n if (one.length !== other.length) {\n return false;\n }\n for (i = 0; i < one.length; i++) {\n if (!equals(one[i], other[i])) {\n return false;\n }\n }\n }\n else {\n const oneKeys = [];\n for (key in one) {\n oneKeys.push(key);\n }\n oneKeys.sort();\n const otherKeys = [];\n for (key in other) {\n otherKeys.push(key);\n }\n otherKeys.sort();\n if (!equals(oneKeys, otherKeys)) {\n return false;\n }\n for (i = 0; i < oneKeys.length; i++) {\n if (!equals(one[oneKeys[i]], other[oneKeys[i]])) {\n return false;\n }\n }\n }\n return true;\n}\nexport function getAllPropertyNames(obj) {\n let res = [];\n while (Object.prototype !== obj) {\n res = res.concat(Object.getOwnPropertyNames(obj));\n obj = Object.getPrototypeOf(obj);\n }\n return res;\n}\nexport function getAllMethodNames(obj) {\n const methods = [];\n for (const prop of getAllPropertyNames(obj)) {\n if (typeof obj[prop] === 'function') {\n methods.push(prop);\n }\n }\n return methods;\n}\nexport function createProxyObject(methodNames, invoke) {\n const createProxyMethod = (method) => {\n return function () {\n const args = Array.prototype.slice.call(arguments, 0);\n return invoke(method, args);\n };\n };\n const result = {};\n for (const methodName of methodNames) {\n result[methodName] = createProxyMethod(methodName);\n }\n return result;\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\n// NOTE: VSCode's copy of nodejs path library to be usable in common (non-node) namespace\n// Copied from: https://github.com/nodejs/node/blob/v16.14.2/lib/path.js\n/**\n * Copyright Joyent, Inc. and other Node contributors.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and/or sell copies of the Software, and to permit\n * persons to whom the Software is furnished to do so, subject to the\n * following conditions:\n *\n * The above copyright notice and this permission notice shall be included\n * in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n * NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n * USE OR OTHER DEALINGS IN THE SOFTWARE.\n */\nimport * as process from './process.js';\nconst CHAR_UPPERCASE_A = 65; /* A */\nconst CHAR_LOWERCASE_A = 97; /* a */\nconst CHAR_UPPERCASE_Z = 90; /* Z */\nconst CHAR_LOWERCASE_Z = 122; /* z */\nconst CHAR_DOT = 46; /* . */\nconst CHAR_FORWARD_SLASH = 47; /* / */\nconst CHAR_BACKWARD_SLASH = 92; /* \\ */\nconst CHAR_COLON = 58; /* : */\nconst CHAR_QUESTION_MARK = 63; /* ? */\nclass ErrorInvalidArgType extends Error {\n constructor(name, expected, actual) {\n // determiner: 'must be' or 'must not be'\n let determiner;\n if (typeof expected === 'string' && expected.indexOf('not ') === 0) {\n determiner = 'must not be';\n expected = expected.replace(/^not /, '');\n }\n else {\n determiner = 'must be';\n }\n const type = name.indexOf('.') !== -1 ? 'property' : 'argument';\n let msg = `The \"${name}\" ${type} ${determiner} of type ${expected}`;\n msg += `. Received type ${typeof actual}`;\n super(msg);\n this.code = 'ERR_INVALID_ARG_TYPE';\n }\n}\nfunction validateObject(pathObject, name) {\n if (pathObject === null || typeof pathObject !== 'object') {\n throw new ErrorInvalidArgType(name, 'Object', pathObject);\n }\n}\nfunction validateString(value, name) {\n if (typeof value !== 'string') {\n throw new ErrorInvalidArgType(name, 'string', value);\n }\n}\nconst platformIsWin32 = (process.platform === 'win32');\nfunction isPathSeparator(code) {\n return code === CHAR_FORWARD_SLASH || code === CHAR_BACKWARD_SLASH;\n}\nfunction isPosixPathSeparator(code) {\n return code === CHAR_FORWARD_SLASH;\n}\nfunction isWindowsDeviceRoot(code) {\n return (code >= CHAR_UPPERCASE_A && code <= CHAR_UPPERCASE_Z) ||\n (code >= CHAR_LOWERCASE_A && code <= CHAR_LOWERCASE_Z);\n}\n// Resolves . and .. elements in a path with directory names\nfunction normalizeString(path, allowAboveRoot, separator, isPathSeparator) {\n let res = '';\n let lastSegmentLength = 0;\n let lastSlash = -1;\n let dots = 0;\n let code = 0;\n for (let i = 0; i <= path.length; ++i) {\n if (i < path.length) {\n code = path.charCodeAt(i);\n }\n else if (isPathSeparator(code)) {\n break;\n }\n else {\n code = CHAR_FORWARD_SLASH;\n }\n if (isPathSeparator(code)) {\n if (lastSlash === i - 1 || dots === 1) {\n // NOOP\n }\n else if (dots === 2) {\n if (res.length < 2 || lastSegmentLength !== 2 ||\n res.charCodeAt(res.length - 1) !== CHAR_DOT ||\n res.charCodeAt(res.length - 2) !== CHAR_DOT) {\n if (res.length > 2) {\n const lastSlashIndex = res.lastIndexOf(separator);\n if (lastSlashIndex === -1) {\n res = '';\n lastSegmentLength = 0;\n }\n else {\n res = res.slice(0, lastSlashIndex);\n lastSegmentLength = res.length - 1 - res.lastIndexOf(separator);\n }\n lastSlash = i;\n dots = 0;\n continue;\n }\n else if (res.length !== 0) {\n res = '';\n lastSegmentLength = 0;\n lastSlash = i;\n dots = 0;\n continue;\n }\n }\n if (allowAboveRoot) {\n res += res.length > 0 ? `${separator}..` : '..';\n lastSegmentLength = 2;\n }\n }\n else {\n if (res.length > 0) {\n res += `${separator}${path.slice(lastSlash + 1, i)}`;\n }\n else {\n res = path.slice(lastSlash + 1, i);\n }\n lastSegmentLength = i - lastSlash - 1;\n }\n lastSlash = i;\n dots = 0;\n }\n else if (code === CHAR_DOT && dots !== -1) {\n ++dots;\n }\n else {\n dots = -1;\n }\n }\n return res;\n}\nfunction _format(sep, pathObject) {\n validateObject(pathObject, 'pathObject');\n const dir = pathObject.dir || pathObject.root;\n const base = pathObject.base ||\n `${pathObject.name || ''}${pathObject.ext || ''}`;\n if (!dir) {\n return base;\n }\n return dir === pathObject.root ? `${dir}${base}` : `${dir}${sep}${base}`;\n}\nexport const win32 = {\n // path.resolve([from ...], to)\n resolve(...pathSegments) {\n let resolvedDevice = '';\n let resolvedTail = '';\n let resolvedAbsolute = false;\n for (let i = pathSegments.length - 1; i >= -1; i--) {\n let path;\n if (i >= 0) {\n path = pathSegments[i];\n validateString(path, 'path');\n // Skip empty entries\n if (path.length === 0) {\n continue;\n }\n }\n else if (resolvedDevice.length === 0) {\n path = process.cwd();\n }\n else {\n // Windows has the concept of drive-specific current working\n // directories. If we've resolved a drive letter but not yet an\n // absolute path, get cwd for that drive, or the process cwd if\n // the drive cwd is not available. We're sure the device is not\n // a UNC path at this points, because UNC paths are always absolute.\n path = process.env[`=${resolvedDevice}`] || process.cwd();\n // Verify that a cwd was found and that it actually points\n // to our drive. If not, default to the drive's root.\n if (path === undefined ||\n (path.slice(0, 2).toLowerCase() !== resolvedDevice.toLowerCase() &&\n path.charCodeAt(2) === CHAR_BACKWARD_SLASH)) {\n path = `${resolvedDevice}\\\\`;\n }\n }\n const len = path.length;\n let rootEnd = 0;\n let device = '';\n let isAbsolute = false;\n const code = path.charCodeAt(0);\n // Try to match a root\n if (len === 1) {\n if (isPathSeparator(code)) {\n // `path` contains just a path separator\n rootEnd = 1;\n isAbsolute = true;\n }\n }\n else if (isPathSeparator(code)) {\n // Possible UNC root\n // If we started with a separator, we know we at least have an\n // absolute path of some kind (UNC or otherwise)\n isAbsolute = true;\n if (isPathSeparator(path.charCodeAt(1))) {\n // Matched double path separator at beginning\n let j = 2;\n let last = j;\n // Match 1 or more non-path separators\n while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n j++;\n }\n if (j < len && j !== last) {\n const firstPart = path.slice(last, j);\n // Matched!\n last = j;\n // Match 1 or more path separators\n while (j < len && isPathSeparator(path.charCodeAt(j))) {\n j++;\n }\n if (j < len && j !== last) {\n // Matched!\n last = j;\n // Match 1 or more non-path separators\n while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n j++;\n }\n if (j === len || j !== last) {\n // We matched a UNC root\n device = `\\\\\\\\${firstPart}\\\\${path.slice(last, j)}`;\n rootEnd = j;\n }\n }\n }\n }\n else {\n rootEnd = 1;\n }\n }\n else if (isWindowsDeviceRoot(code) &&\n path.charCodeAt(1) === CHAR_COLON) {\n // Possible device root\n device = path.slice(0, 2);\n rootEnd = 2;\n if (len > 2 && isPathSeparator(path.charCodeAt(2))) {\n // Treat separator following drive name as an absolute path\n // indicator\n isAbsolute = true;\n rootEnd = 3;\n }\n }\n if (device.length > 0) {\n if (resolvedDevice.length > 0) {\n if (device.toLowerCase() !== resolvedDevice.toLowerCase()) {\n // This path points to another device so it is not applicable\n continue;\n }\n }\n else {\n resolvedDevice = device;\n }\n }\n if (resolvedAbsolute) {\n if (resolvedDevice.length > 0) {\n break;\n }\n }\n else {\n resolvedTail = `${path.slice(rootEnd)}\\\\${resolvedTail}`;\n resolvedAbsolute = isAbsolute;\n if (isAbsolute && resolvedDevice.length > 0) {\n break;\n }\n }\n }\n // At this point the path should be resolved to a full absolute path,\n // but handle relative paths to be safe (might happen when process.cwd()\n // fails)\n // Normalize the tail path\n resolvedTail = normalizeString(resolvedTail, !resolvedAbsolute, '\\\\', isPathSeparator);\n return resolvedAbsolute ?\n `${resolvedDevice}\\\\${resolvedTail}` :\n `${resolvedDevice}${resolvedTail}` || '.';\n },\n normalize(path) {\n validateString(path, 'path');\n const len = path.length;\n if (len === 0) {\n return '.';\n }\n let rootEnd = 0;\n let device;\n let isAbsolute = false;\n const code = path.charCodeAt(0);\n // Try to match a root\n if (len === 1) {\n // `path` contains just a single char, exit early to avoid\n // unnecessary work\n return isPosixPathSeparator(code) ? '\\\\' : path;\n }\n if (isPathSeparator(code)) {\n // Possible UNC root\n // If we started with a separator, we know we at least have an absolute\n // path of some kind (UNC or otherwise)\n isAbsolute = true;\n if (isPathSeparator(path.charCodeAt(1))) {\n // Matched double path separator at beginning\n let j = 2;\n let last = j;\n // Match 1 or more non-path separators\n while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n j++;\n }\n if (j < len && j !== last) {\n const firstPart = path.slice(last, j);\n // Matched!\n last = j;\n // Match 1 or more path separators\n while (j < len && isPathSeparator(path.charCodeAt(j))) {\n j++;\n }\n if (j < len && j !== last) {\n // Matched!\n last = j;\n // Match 1 or more non-path separators\n while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n j++;\n }\n if (j === len) {\n // We matched a UNC root only\n // Return the normalized version of the UNC root since there\n // is nothing left to process\n return `\\\\\\\\${firstPart}\\\\${path.slice(last)}\\\\`;\n }\n if (j !== last) {\n // We matched a UNC root with leftovers\n device = `\\\\\\\\${firstPart}\\\\${path.slice(last, j)}`;\n rootEnd = j;\n }\n }\n }\n }\n else {\n rootEnd = 1;\n }\n }\n else if (isWindowsDeviceRoot(code) && path.charCodeAt(1) === CHAR_COLON) {\n // Possible device root\n device = path.slice(0, 2);\n rootEnd = 2;\n if (len > 2 && isPathSeparator(path.charCodeAt(2))) {\n // Treat separator following drive name as an absolute path\n // indicator\n isAbsolute = true;\n rootEnd = 3;\n }\n }\n let tail = rootEnd < len ?\n normalizeString(path.slice(rootEnd), !isAbsolute, '\\\\', isPathSeparator) :\n '';\n if (tail.length === 0 && !isAbsolute) {\n tail = '.';\n }\n if (tail.length > 0 && isPathSeparator(path.charCodeAt(len - 1))) {\n tail += '\\\\';\n }\n if (device === undefined) {\n return isAbsolute ? `\\\\${tail}` : tail;\n }\n return isAbsolute ? `${device}\\\\${tail}` : `${device}${tail}`;\n },\n isAbsolute(path) {\n validateString(path, 'path');\n const len = path.length;\n if (len === 0) {\n return false;\n }\n const code = path.charCodeAt(0);\n return isPathSeparator(code) ||\n // Possible device root\n (len > 2 &&\n isWindowsDeviceRoot(code) &&\n path.charCodeAt(1) === CHAR_COLON &&\n isPathSeparator(path.charCodeAt(2)));\n },\n join(...paths) {\n if (paths.length === 0) {\n return '.';\n }\n let joined;\n let firstPart;\n for (let i = 0; i < paths.length; ++i) {\n const arg = paths[i];\n validateString(arg, 'path');\n if (arg.length > 0) {\n if (joined === undefined) {\n joined = firstPart = arg;\n }\n else {\n joined += `\\\\${arg}`;\n }\n }\n }\n if (joined === undefined) {\n return '.';\n }\n // Make sure that the joined path doesn't start with two slashes, because\n // normalize() will mistake it for a UNC path then.\n //\n // This step is skipped when it is very clear that the user actually\n // intended to point at a UNC path. This is assumed when the first\n // non-empty string arguments starts with exactly two slashes followed by\n // at least one more non-slash character.\n //\n // Note that for normalize() to treat a path as a UNC path it needs to\n // have at least 2 components, so we don't filter for that here.\n // This means that the user can use join to construct UNC paths from\n // a server name and a share name; for example:\n // path.join('//server', 'share') -> '\\\\\\\\server\\\\share\\\\')\n let needsReplace = true;\n let slashCount = 0;\n if (typeof firstPart === 'string' && isPathSeparator(firstPart.charCodeAt(0))) {\n ++slashCount;\n const firstLen = firstPart.length;\n if (firstLen > 1 && isPathSeparator(firstPart.charCodeAt(1))) {\n ++slashCount;\n if (firstLen > 2) {\n if (isPathSeparator(firstPart.charCodeAt(2))) {\n ++slashCount;\n }\n else {\n // We matched a UNC path in the first part\n needsReplace = false;\n }\n }\n }\n }\n if (needsReplace) {\n // Find any more consecutive slashes we need to replace\n while (slashCount < joined.length &&\n isPathSeparator(joined.charCodeAt(slashCount))) {\n slashCount++;\n }\n // Replace the slashes if needed\n if (slashCount >= 2) {\n joined = `\\\\${joined.slice(slashCount)}`;\n }\n }\n return win32.normalize(joined);\n },\n // It will solve the relative path from `from` to `to`, for instance:\n // from = 'C:\\\\orandea\\\\test\\\\aaa'\n // to = 'C:\\\\orandea\\\\impl\\\\bbb'\n // The output of the function should be: '..\\\\..\\\\impl\\\\bbb'\n relative(from, to) {\n validateString(from, 'from');\n validateString(to, 'to');\n if (from === to) {\n return '';\n }\n const fromOrig = win32.resolve(from);\n const toOrig = win32.resolve(to);\n if (fromOrig === toOrig) {\n return '';\n }\n from = fromOrig.toLowerCase();\n to = toOrig.toLowerCase();\n if (from === to) {\n return '';\n }\n // Trim any leading backslashes\n let fromStart = 0;\n while (fromStart < from.length &&\n from.charCodeAt(fromStart) === CHAR_BACKWARD_SLASH) {\n fromStart++;\n }\n // Trim trailing backslashes (applicable to UNC paths only)\n let fromEnd = from.length;\n while (fromEnd - 1 > fromStart &&\n from.charCodeAt(fromEnd - 1) === CHAR_BACKWARD_SLASH) {\n fromEnd--;\n }\n const fromLen = fromEnd - fromStart;\n // Trim any leading backslashes\n let toStart = 0;\n while (toStart < to.length &&\n to.charCodeAt(toStart) === CHAR_BACKWARD_SLASH) {\n toStart++;\n }\n // Trim trailing backslashes (applicable to UNC paths only)\n let toEnd = to.length;\n while (toEnd - 1 > toStart &&\n to.charCodeAt(toEnd - 1) === CHAR_BACKWARD_SLASH) {\n toEnd--;\n }\n const toLen = toEnd - toStart;\n // Compare paths to find the longest common path from root\n const length = fromLen < toLen ? fromLen : toLen;\n let lastCommonSep = -1;\n let i = 0;\n for (; i < length; i++) {\n const fromCode = from.charCodeAt(fromStart + i);\n if (fromCode !== to.charCodeAt(toStart + i)) {\n break;\n }\n else if (fromCode === CHAR_BACKWARD_SLASH) {\n lastCommonSep = i;\n }\n }\n // We found a mismatch before the first common path separator was seen, so\n // return the original `to`.\n if (i !== length) {\n if (lastCommonSep === -1) {\n return toOrig;\n }\n }\n else {\n if (toLen > length) {\n if (to.charCodeAt(toStart + i) === CHAR_BACKWARD_SLASH) {\n // We get here if `from` is the exact base path for `to`.\n // For example: from='C:\\\\foo\\\\bar'; to='C:\\\\foo\\\\bar\\\\baz'\n return toOrig.slice(toStart + i + 1);\n }\n if (i === 2) {\n // We get here if `from` is the device root.\n // For example: from='C:\\\\'; to='C:\\\\foo'\n return toOrig.slice(toStart + i);\n }\n }\n if (fromLen > length) {\n if (from.charCodeAt(fromStart + i) === CHAR_BACKWARD_SLASH) {\n // We get here if `to` is the exact base path for `from`.\n // For example: from='C:\\\\foo\\\\bar'; to='C:\\\\foo'\n lastCommonSep = i;\n }\n else if (i === 2) {\n // We get here if `to` is the device root.\n // For example: from='C:\\\\foo\\\\bar'; to='C:\\\\'\n lastCommonSep = 3;\n }\n }\n if (lastCommonSep === -1) {\n lastCommonSep = 0;\n }\n }\n let out = '';\n // Generate the relative path based on the path difference between `to` and\n // `from`\n for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n if (i === fromEnd || from.charCodeAt(i) === CHAR_BACKWARD_SLASH) {\n out += out.length === 0 ? '..' : '\\\\..';\n }\n }\n toStart += lastCommonSep;\n // Lastly, append the rest of the destination (`to`) path that comes after\n // the common path parts\n if (out.length > 0) {\n return `${out}${toOrig.slice(toStart, toEnd)}`;\n }\n if (toOrig.charCodeAt(toStart) === CHAR_BACKWARD_SLASH) {\n ++toStart;\n }\n return toOrig.slice(toStart, toEnd);\n },\n toNamespacedPath(path) {\n // Note: this will *probably* throw somewhere.\n if (typeof path !== 'string' || path.length === 0) {\n return path;\n }\n const resolvedPath = win32.resolve(path);\n if (resolvedPath.length <= 2) {\n return path;\n }\n if (resolvedPath.charCodeAt(0) === CHAR_BACKWARD_SLASH) {\n // Possible UNC root\n if (resolvedPath.charCodeAt(1) === CHAR_BACKWARD_SLASH) {\n const code = resolvedPath.charCodeAt(2);\n if (code !== CHAR_QUESTION_MARK && code !== CHAR_DOT) {\n // Matched non-long UNC root, convert the path to a long UNC path\n return `\\\\\\\\?\\\\UNC\\\\${resolvedPath.slice(2)}`;\n }\n }\n }\n else if (isWindowsDeviceRoot(resolvedPath.charCodeAt(0)) &&\n resolvedPath.charCodeAt(1) === CHAR_COLON &&\n resolvedPath.charCodeAt(2) === CHAR_BACKWARD_SLASH) {\n // Matched device root, convert the path to a long UNC path\n return `\\\\\\\\?\\\\${resolvedPath}`;\n }\n return path;\n },\n dirname(path) {\n validateString(path, 'path');\n const len = path.length;\n if (len === 0) {\n return '.';\n }\n let rootEnd = -1;\n let offset = 0;\n const code = path.charCodeAt(0);\n if (len === 1) {\n // `path` contains just a path separator, exit early to avoid\n // unnecessary work or a dot.\n return isPathSeparator(code) ? path : '.';\n }\n // Try to match a root\n if (isPathSeparator(code)) {\n // Possible UNC root\n rootEnd = offset = 1;\n if (isPathSeparator(path.charCodeAt(1))) {\n // Matched double path separator at beginning\n let j = 2;\n let last = j;\n // Match 1 or more non-path separators\n while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n j++;\n }\n if (j < len && j !== last) {\n // Matched!\n last = j;\n // Match 1 or more path separators\n while (j < len && isPathSeparator(path.charCodeAt(j))) {\n j++;\n }\n if (j < len && j !== last) {\n // Matched!\n last = j;\n // Match 1 or more non-path separators\n while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n j++;\n }\n if (j === len) {\n // We matched a UNC root only\n return path;\n }\n if (j !== last) {\n // We matched a UNC root with leftovers\n // Offset by 1 to include the separator after the UNC root to\n // treat it as a \"normal root\" on top of a (UNC) root\n rootEnd = offset = j + 1;\n }\n }\n }\n }\n // Possible device root\n }\n else if (isWindowsDeviceRoot(code) && path.charCodeAt(1) === CHAR_COLON) {\n rootEnd = len > 2 && isPathSeparator(path.charCodeAt(2)) ? 3 : 2;\n offset = rootEnd;\n }\n let end = -1;\n let matchedSlash = true;\n for (let i = len - 1; i >= offset; --i) {\n if (isPathSeparator(path.charCodeAt(i))) {\n if (!matchedSlash) {\n end = i;\n break;\n }\n }\n else {\n // We saw the first non-path separator\n matchedSlash = false;\n }\n }\n if (end === -1) {\n if (rootEnd === -1) {\n return '.';\n }\n end = rootEnd;\n }\n return path.slice(0, end);\n },\n basename(path, ext) {\n if (ext !== undefined) {\n validateString(ext, 'ext');\n }\n validateString(path, 'path');\n let start = 0;\n let end = -1;\n let matchedSlash = true;\n let i;\n // Check for a drive letter prefix so as not to mistake the following\n // path separator as an extra separator at the end of the path that can be\n // disregarded\n if (path.length >= 2 &&\n isWindowsDeviceRoot(path.charCodeAt(0)) &&\n path.charCodeAt(1) === CHAR_COLON) {\n start = 2;\n }\n if (ext !== undefined && ext.length > 0 && ext.length <= path.length) {\n if (ext === path) {\n return '';\n }\n let extIdx = ext.length - 1;\n let firstNonSlashEnd = -1;\n for (i = path.length - 1; i >= start; --i) {\n const code = path.charCodeAt(i);\n if (isPathSeparator(code)) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n }\n else {\n if (firstNonSlashEnd === -1) {\n // We saw the first non-path separator, remember this index in case\n // we need it if the extension ends up not matching\n matchedSlash = false;\n firstNonSlashEnd = i + 1;\n }\n if (extIdx >= 0) {\n // Try to match the explicit extension\n if (code === ext.charCodeAt(extIdx)) {\n if (--extIdx === -1) {\n // We matched the extension, so mark this as the end of our path\n // component\n end = i;\n }\n }\n else {\n // Extension does not match, so our result is the entire path\n // component\n extIdx = -1;\n end = firstNonSlashEnd;\n }\n }\n }\n }\n if (start === end) {\n end = firstNonSlashEnd;\n }\n else if (end === -1) {\n end = path.length;\n }\n return path.slice(start, end);\n }\n for (i = path.length - 1; i >= start; --i) {\n if (isPathSeparator(path.charCodeAt(i))) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n }\n else if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // path component\n matchedSlash = false;\n end = i + 1;\n }\n }\n if (end === -1) {\n return '';\n }\n return path.slice(start, end);\n },\n extname(path) {\n validateString(path, 'path');\n let start = 0;\n let startDot = -1;\n let startPart = 0;\n let end = -1;\n let matchedSlash = true;\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n let preDotState = 0;\n // Check for a drive letter prefix so as not to mistake the following\n // path separator as an extra separator at the end of the path that can be\n // disregarded\n if (path.length >= 2 &&\n path.charCodeAt(1) === CHAR_COLON &&\n isWindowsDeviceRoot(path.charCodeAt(0))) {\n start = startPart = 2;\n }\n for (let i = path.length - 1; i >= start; --i) {\n const code = path.charCodeAt(i);\n if (isPathSeparator(code)) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === CHAR_DOT) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1) {\n startDot = i;\n }\n else if (preDotState !== 1) {\n preDotState = 1;\n }\n }\n else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n if (startDot === -1 ||\n end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n (preDotState === 1 &&\n startDot === end - 1 &&\n startDot === startPart + 1)) {\n return '';\n }\n return path.slice(startDot, end);\n },\n format: _format.bind(null, '\\\\'),\n parse(path) {\n validateString(path, 'path');\n const ret = { root: '', dir: '', base: '', ext: '', name: '' };\n if (path.length === 0) {\n return ret;\n }\n const len = path.length;\n let rootEnd = 0;\n let code = path.charCodeAt(0);\n if (len === 1) {\n if (isPathSeparator(code)) {\n // `path` contains just a path separator, exit early to avoid\n // unnecessary work\n ret.root = ret.dir = path;\n return ret;\n }\n ret.base = ret.name = path;\n return ret;\n }\n // Try to match a root\n if (isPathSeparator(code)) {\n // Possible UNC root\n rootEnd = 1;\n if (isPathSeparator(path.charCodeAt(1))) {\n // Matched double path separator at beginning\n let j = 2;\n let last = j;\n // Match 1 or more non-path separators\n while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n j++;\n }\n if (j < len && j !== last) {\n // Matched!\n last = j;\n // Match 1 or more path separators\n while (j < len && isPathSeparator(path.charCodeAt(j))) {\n j++;\n }\n if (j < len && j !== last) {\n // Matched!\n last = j;\n // Match 1 or more non-path separators\n while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n j++;\n }\n if (j === len) {\n // We matched a UNC root only\n rootEnd = j;\n }\n else if (j !== last) {\n // We matched a UNC root with leftovers\n rootEnd = j + 1;\n }\n }\n }\n }\n }\n else if (isWindowsDeviceRoot(code) && path.charCodeAt(1) === CHAR_COLON) {\n // Possible device root\n if (len <= 2) {\n // `path` contains just a drive root, exit early to avoid\n // unnecessary work\n ret.root = ret.dir = path;\n return ret;\n }\n rootEnd = 2;\n if (isPathSeparator(path.charCodeAt(2))) {\n if (len === 3) {\n // `path` contains just a drive root, exit early to avoid\n // unnecessary work\n ret.root = ret.dir = path;\n return ret;\n }\n rootEnd = 3;\n }\n }\n if (rootEnd > 0) {\n ret.root = path.slice(0, rootEnd);\n }\n let startDot = -1;\n let startPart = rootEnd;\n let end = -1;\n let matchedSlash = true;\n let i = path.length - 1;\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n let preDotState = 0;\n // Get non-dir info\n for (; i >= rootEnd; --i) {\n code = path.charCodeAt(i);\n if (isPathSeparator(code)) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === CHAR_DOT) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1) {\n startDot = i;\n }\n else if (preDotState !== 1) {\n preDotState = 1;\n }\n }\n else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n if (end !== -1) {\n if (startDot === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n (preDotState === 1 &&\n startDot === end - 1 &&\n startDot === startPart + 1)) {\n ret.base = ret.name = path.slice(startPart, end);\n }\n else {\n ret.name = path.slice(startPart, startDot);\n ret.base = path.slice(startPart, end);\n ret.ext = path.slice(startDot, end);\n }\n }\n // If the directory is the root, use the entire root as the `dir` including\n // the trailing slash if any (`C:\\abc` -> `C:\\`). Otherwise, strip out the\n // trailing slash (`C:\\abc\\def` -> `C:\\abc`).\n if (startPart > 0 && startPart !== rootEnd) {\n ret.dir = path.slice(0, startPart - 1);\n }\n else {\n ret.dir = ret.root;\n }\n return ret;\n },\n sep: '\\\\',\n delimiter: ';',\n win32: null,\n posix: null\n};\nconst posixCwd = (() => {\n if (platformIsWin32) {\n // Converts Windows' backslash path separators to POSIX forward slashes\n // and truncates any drive indicator\n const regexp = /\\\\/g;\n return () => {\n const cwd = process.cwd().replace(regexp, '/');\n return cwd.slice(cwd.indexOf('/'));\n };\n }\n // We're already on POSIX, no need for any transformations\n return () => process.cwd();\n})();\nexport const posix = {\n // path.resolve([from ...], to)\n resolve(...pathSegments) {\n let resolvedPath = '';\n let resolvedAbsolute = false;\n for (let i = pathSegments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n const path = i >= 0 ? pathSegments[i] : posixCwd();\n validateString(path, 'path');\n // Skip empty entries\n if (path.length === 0) {\n continue;\n }\n resolvedPath = `${path}/${resolvedPath}`;\n resolvedAbsolute = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\n }\n // At this point the path should be resolved to a full absolute path, but\n // handle relative paths to be safe (might happen when process.cwd() fails)\n // Normalize the path\n resolvedPath = normalizeString(resolvedPath, !resolvedAbsolute, '/', isPosixPathSeparator);\n if (resolvedAbsolute) {\n return `/${resolvedPath}`;\n }\n return resolvedPath.length > 0 ? resolvedPath : '.';\n },\n normalize(path) {\n validateString(path, 'path');\n if (path.length === 0) {\n return '.';\n }\n const isAbsolute = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\n const trailingSeparator = path.charCodeAt(path.length - 1) === CHAR_FORWARD_SLASH;\n // Normalize the path\n path = normalizeString(path, !isAbsolute, '/', isPosixPathSeparator);\n if (path.length === 0) {\n if (isAbsolute) {\n return '/';\n }\n return trailingSeparator ? './' : '.';\n }\n if (trailingSeparator) {\n path += '/';\n }\n return isAbsolute ? `/${path}` : path;\n },\n isAbsolute(path) {\n validateString(path, 'path');\n return path.length > 0 && path.charCodeAt(0) === CHAR_FORWARD_SLASH;\n },\n join(...paths) {\n if (paths.length === 0) {\n return '.';\n }\n let joined;\n for (let i = 0; i < paths.length; ++i) {\n const arg = paths[i];\n validateString(arg, 'path');\n if (arg.length > 0) {\n if (joined === undefined) {\n joined = arg;\n }\n else {\n joined += `/${arg}`;\n }\n }\n }\n if (joined === undefined) {\n return '.';\n }\n return posix.normalize(joined);\n },\n relative(from, to) {\n validateString(from, 'from');\n validateString(to, 'to');\n if (from === to) {\n return '';\n }\n // Trim leading forward slashes.\n from = posix.resolve(from);\n to = posix.resolve(to);\n if (from === to) {\n return '';\n }\n const fromStart = 1;\n const fromEnd = from.length;\n const fromLen = fromEnd - fromStart;\n const toStart = 1;\n const toLen = to.length - toStart;\n // Compare paths to find the longest common path from root\n const length = (fromLen < toLen ? fromLen : toLen);\n let lastCommonSep = -1;\n let i = 0;\n for (; i < length; i++) {\n const fromCode = from.charCodeAt(fromStart + i);\n if (fromCode !== to.charCodeAt(toStart + i)) {\n break;\n }\n else if (fromCode === CHAR_FORWARD_SLASH) {\n lastCommonSep = i;\n }\n }\n if (i === length) {\n if (toLen > length) {\n if (to.charCodeAt(toStart + i) === CHAR_FORWARD_SLASH) {\n // We get here if `from` is the exact base path for `to`.\n // For example: from='/foo/bar'; to='/foo/bar/baz'\n return to.slice(toStart + i + 1);\n }\n if (i === 0) {\n // We get here if `from` is the root\n // For example: from='/'; to='/foo'\n return to.slice(toStart + i);\n }\n }\n else if (fromLen > length) {\n if (from.charCodeAt(fromStart + i) === CHAR_FORWARD_SLASH) {\n // We get here if `to` is the exact base path for `from`.\n // For example: from='/foo/bar/baz'; to='/foo/bar'\n lastCommonSep = i;\n }\n else if (i === 0) {\n // We get here if `to` is the root.\n // For example: from='/foo/bar'; to='/'\n lastCommonSep = 0;\n }\n }\n }\n let out = '';\n // Generate the relative path based on the path difference between `to`\n // and `from`.\n for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n if (i === fromEnd || from.charCodeAt(i) === CHAR_FORWARD_SLASH) {\n out += out.length === 0 ? '..' : '/..';\n }\n }\n // Lastly, append the rest of the destination (`to`) path that comes after\n // the common path parts.\n return `${out}${to.slice(toStart + lastCommonSep)}`;\n },\n toNamespacedPath(path) {\n // Non-op on posix systems\n return path;\n },\n dirname(path) {\n validateString(path, 'path');\n if (path.length === 0) {\n return '.';\n }\n const hasRoot = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\n let end = -1;\n let matchedSlash = true;\n for (let i = path.length - 1; i >= 1; --i) {\n if (path.charCodeAt(i) === CHAR_FORWARD_SLASH) {\n if (!matchedSlash) {\n end = i;\n break;\n }\n }\n else {\n // We saw the first non-path separator\n matchedSlash = false;\n }\n }\n if (end === -1) {\n return hasRoot ? '/' : '.';\n }\n if (hasRoot && end === 1) {\n return '//';\n }\n return path.slice(0, end);\n },\n basename(path, ext) {\n if (ext !== undefined) {\n validateString(ext, 'ext');\n }\n validateString(path, 'path');\n let start = 0;\n let end = -1;\n let matchedSlash = true;\n let i;\n if (ext !== undefined && ext.length > 0 && ext.length <= path.length) {\n if (ext === path) {\n return '';\n }\n let extIdx = ext.length - 1;\n let firstNonSlashEnd = -1;\n for (i = path.length - 1; i >= 0; --i) {\n const code = path.charCodeAt(i);\n if (code === CHAR_FORWARD_SLASH) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n }\n else {\n if (firstNonSlashEnd === -1) {\n // We saw the first non-path separator, remember this index in case\n // we need it if the extension ends up not matching\n matchedSlash = false;\n firstNonSlashEnd = i + 1;\n }\n if (extIdx >= 0) {\n // Try to match the explicit extension\n if (code === ext.charCodeAt(extIdx)) {\n if (--extIdx === -1) {\n // We matched the extension, so mark this as the end of our path\n // component\n end = i;\n }\n }\n else {\n // Extension does not match, so our result is the entire path\n // component\n extIdx = -1;\n end = firstNonSlashEnd;\n }\n }\n }\n }\n if (start === end) {\n end = firstNonSlashEnd;\n }\n else if (end === -1) {\n end = path.length;\n }\n return path.slice(start, end);\n }\n for (i = path.length - 1; i >= 0; --i) {\n if (path.charCodeAt(i) === CHAR_FORWARD_SLASH) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n }\n else if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // path component\n matchedSlash = false;\n end = i + 1;\n }\n }\n if (end === -1) {\n return '';\n }\n return path.slice(start, end);\n },\n extname(path) {\n validateString(path, 'path');\n let startDot = -1;\n let startPart = 0;\n let end = -1;\n let matchedSlash = true;\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n let preDotState = 0;\n for (let i = path.length - 1; i >= 0; --i) {\n const code = path.charCodeAt(i);\n if (code === CHAR_FORWARD_SLASH) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === CHAR_DOT) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1) {\n startDot = i;\n }\n else if (preDotState !== 1) {\n preDotState = 1;\n }\n }\n else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n if (startDot === -1 ||\n end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n (preDotState === 1 &&\n startDot === end - 1 &&\n startDot === startPart + 1)) {\n return '';\n }\n return path.slice(startDot, end);\n },\n format: _format.bind(null, '/'),\n parse(path) {\n validateString(path, 'path');\n const ret = { root: '', dir: '', base: '', ext: '', name: '' };\n if (path.length === 0) {\n return ret;\n }\n const isAbsolute = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\n let start;\n if (isAbsolute) {\n ret.root = '/';\n start = 1;\n }\n else {\n start = 0;\n }\n let startDot = -1;\n let startPart = 0;\n let end = -1;\n let matchedSlash = true;\n let i = path.length - 1;\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n let preDotState = 0;\n // Get non-dir info\n for (; i >= start; --i) {\n const code = path.charCodeAt(i);\n if (code === CHAR_FORWARD_SLASH) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === CHAR_DOT) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1) {\n startDot = i;\n }\n else if (preDotState !== 1) {\n preDotState = 1;\n }\n }\n else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n if (end !== -1) {\n const start = startPart === 0 && isAbsolute ? 1 : startPart;\n if (startDot === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n (preDotState === 1 &&\n startDot === end - 1 &&\n startDot === startPart + 1)) {\n ret.base = ret.name = path.slice(start, end);\n }\n else {\n ret.name = path.slice(start, startDot);\n ret.base = path.slice(start, end);\n ret.ext = path.slice(startDot, end);\n }\n }\n if (startPart > 0) {\n ret.dir = path.slice(0, startPart - 1);\n }\n else if (isAbsolute) {\n ret.dir = '/';\n }\n return ret;\n },\n sep: '/',\n delimiter: ':',\n win32: null,\n posix: null\n};\nposix.win32 = win32.win32 = win32;\nposix.posix = win32.posix = posix;\nexport const normalize = (platformIsWin32 ? win32.normalize : posix.normalize);\nexport const resolve = (platformIsWin32 ? win32.resolve : posix.resolve);\nexport const relative = (platformIsWin32 ? win32.relative : posix.relative);\nexport const dirname = (platformIsWin32 ? win32.dirname : posix.dirname);\nexport const basename = (platformIsWin32 ? win32.basename : posix.basename);\nexport const extname = (platformIsWin32 ? win32.extname : posix.extname);\nexport const sep = (platformIsWin32 ? win32.sep : posix.sep);\n","var _a;\n/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport * as nls from '../../nls.js';\nexport const LANGUAGE_DEFAULT = 'en';\nlet _isWindows = false;\nlet _isMacintosh = false;\nlet _isLinux = false;\nlet _isLinuxSnap = false;\nlet _isNative = false;\nlet _isWeb = false;\nlet _isElectron = false;\nlet _isIOS = false;\nlet _isCI = false;\nlet _isMobile = false;\nlet _locale = undefined;\nlet _language = LANGUAGE_DEFAULT;\nlet _platformLocale = LANGUAGE_DEFAULT;\nlet _translationsConfigFile = undefined;\nlet _userAgent = undefined;\nconst $globalThis = globalThis;\nlet nodeProcess = undefined;\nif (typeof $globalThis.vscode !== 'undefined' && typeof $globalThis.vscode.process !== 'undefined') {\n // Native environment (sandboxed)\n nodeProcess = $globalThis.vscode.process;\n}\nelse if (typeof process !== 'undefined') {\n // Native environment (non-sandboxed)\n nodeProcess = process;\n}\nconst isElectronProcess = typeof ((_a = nodeProcess === null || nodeProcess === void 0 ? void 0 : nodeProcess.versions) === null || _a === void 0 ? void 0 : _a.electron) === 'string';\nconst isElectronRenderer = isElectronProcess && (nodeProcess === null || nodeProcess === void 0 ? void 0 : nodeProcess.type) === 'renderer';\n// Web environment\nif (typeof navigator === 'object' && !isElectronRenderer) {\n _userAgent = navigator.userAgent;\n _isWindows = _userAgent.indexOf('Windows') >= 0;\n _isMacintosh = _userAgent.indexOf('Macintosh') >= 0;\n _isIOS = (_userAgent.indexOf('Macintosh') >= 0 || _userAgent.indexOf('iPad') >= 0 || _userAgent.indexOf('iPhone') >= 0) && !!navigator.maxTouchPoints && navigator.maxTouchPoints > 0;\n _isLinux = _userAgent.indexOf('Linux') >= 0;\n _isMobile = (_userAgent === null || _userAgent === void 0 ? void 0 : _userAgent.indexOf('Mobi')) >= 0;\n _isWeb = true;\n const configuredLocale = nls.getConfiguredDefaultLocale(\n // This call _must_ be done in the file that calls `nls.getConfiguredDefaultLocale`\n // to ensure that the NLS AMD Loader plugin has been loaded and configured.\n // This is because the loader plugin decides what the default locale is based on\n // how it's able to resolve the strings.\n nls.localize({ key: 'ensureLoaderPluginIsLoaded', comment: ['{Locked}'] }, '_'));\n _locale = configuredLocale || LANGUAGE_DEFAULT;\n _language = _locale;\n _platformLocale = navigator.language;\n}\n// Native environment\nelse if (typeof nodeProcess === 'object') {\n _isWindows = (nodeProcess.platform === 'win32');\n _isMacintosh = (nodeProcess.platform === 'darwin');\n _isLinux = (nodeProcess.platform === 'linux');\n _isLinuxSnap = _isLinux && !!nodeProcess.env['SNAP'] && !!nodeProcess.env['SNAP_REVISION'];\n _isElectron = isElectronProcess;\n _isCI = !!nodeProcess.env['CI'] || !!nodeProcess.env['BUILD_ARTIFACTSTAGINGDIRECTORY'];\n _locale = LANGUAGE_DEFAULT;\n _language = LANGUAGE_DEFAULT;\n const rawNlsConfig = nodeProcess.env['VSCODE_NLS_CONFIG'];\n if (rawNlsConfig) {\n try {\n const nlsConfig = JSON.parse(rawNlsConfig);\n const resolved = nlsConfig.availableLanguages['*'];\n _locale = nlsConfig.locale;\n _platformLocale = nlsConfig.osLocale;\n // VSCode's default language is 'en'\n _language = resolved ? resolved : LANGUAGE_DEFAULT;\n _translationsConfigFile = nlsConfig._translationsConfigFile;\n }\n catch (e) {\n }\n }\n _isNative = true;\n}\n// Unknown environment\nelse {\n console.error('Unable to resolve platform.');\n}\nlet _platform = 0 /* Platform.Web */;\nif (_isMacintosh) {\n _platform = 1 /* Platform.Mac */;\n}\nelse if (_isWindows) {\n _platform = 3 /* Platform.Windows */;\n}\nelse if (_isLinux) {\n _platform = 2 /* Platform.Linux */;\n}\nexport const isWindows = _isWindows;\nexport const isMacintosh = _isMacintosh;\nexport const isLinux = _isLinux;\nexport const isNative = _isNative;\nexport const isWeb = _isWeb;\nexport const isWebWorker = (_isWeb && typeof $globalThis.importScripts === 'function');\nexport const webWorkerOrigin = isWebWorker ? $globalThis.origin : undefined;\nexport const isIOS = _isIOS;\nexport const isMobile = _isMobile;\nexport const userAgent = _userAgent;\n/**\n * The language used for the user interface. The format of\n * the string is all lower case (e.g. zh-tw for Traditional\n * Chinese)\n */\nexport const language = _language;\nexport const setTimeout0IsFaster = (typeof $globalThis.postMessage === 'function' && !$globalThis.importScripts);\n/**\n * See https://html.spec.whatwg.org/multipage/timers-and-user-prompts.html#:~:text=than%204%2C%20then-,set%20timeout%20to%204,-.\n *\n * Works similarly to `setTimeout(0)` but doesn't suffer from the 4ms artificial delay\n * that browsers set when the nesting level is > 5.\n */\nexport const setTimeout0 = (() => {\n if (setTimeout0IsFaster) {\n const pending = [];\n $globalThis.addEventListener('message', (e) => {\n if (e.data && e.data.vscodeScheduleAsyncWork) {\n for (let i = 0, len = pending.length; i < len; i++) {\n const candidate = pending[i];\n if (candidate.id === e.data.vscodeScheduleAsyncWork) {\n pending.splice(i, 1);\n candidate.callback();\n return;\n }\n }\n }\n });\n let lastId = 0;\n return (callback) => {\n const myId = ++lastId;\n pending.push({\n id: myId,\n callback: callback\n });\n $globalThis.postMessage({ vscodeScheduleAsyncWork: myId }, '*');\n };\n }\n return (callback) => setTimeout(callback);\n})();\nexport const OS = (_isMacintosh || _isIOS ? 2 /* OperatingSystem.Macintosh */ : (_isWindows ? 1 /* OperatingSystem.Windows */ : 3 /* OperatingSystem.Linux */));\nlet _isLittleEndian = true;\nlet _isLittleEndianComputed = false;\nexport function isLittleEndian() {\n if (!_isLittleEndianComputed) {\n _isLittleEndianComputed = true;\n const test = new Uint8Array(2);\n test[0] = 1;\n test[1] = 2;\n const view = new Uint16Array(test.buffer);\n _isLittleEndian = (view[0] === (2 << 8) + 1);\n }\n return _isLittleEndian;\n}\nexport const isChrome = !!(userAgent && userAgent.indexOf('Chrome') >= 0);\nexport const isFirefox = !!(userAgent && userAgent.indexOf('Firefox') >= 0);\nexport const isSafari = !!(!isChrome && (userAgent && userAgent.indexOf('Safari') >= 0));\nexport const isEdge = !!(userAgent && userAgent.indexOf('Edg/') >= 0);\nexport const isAndroid = !!(userAgent && userAgent.indexOf('Android') >= 0);\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { isMacintosh, isWindows } from './platform.js';\nlet safeProcess;\n// Native sandbox environment\nconst vscodeGlobal = globalThis.vscode;\nif (typeof vscodeGlobal !== 'undefined' && typeof vscodeGlobal.process !== 'undefined') {\n const sandboxProcess = vscodeGlobal.process;\n safeProcess = {\n get platform() { return sandboxProcess.platform; },\n get arch() { return sandboxProcess.arch; },\n get env() { return sandboxProcess.env; },\n cwd() { return sandboxProcess.cwd(); }\n };\n}\n// Native node.js environment\nelse if (typeof process !== 'undefined') {\n safeProcess = {\n get platform() { return process.platform; },\n get arch() { return process.arch; },\n get env() { return process.env; },\n cwd() { return process.env['VSCODE_CWD'] || process.cwd(); }\n };\n}\n// Web environment\nelse {\n safeProcess = {\n // Supported\n get platform() { return isWindows ? 'win32' : isMacintosh ? 'darwin' : 'linux'; },\n get arch() { return undefined; /* arch is undefined in web */ },\n // Unsupported\n get env() { return {}; },\n cwd() { return '/'; }\n };\n}\n/**\n * Provides safe access to the `cwd` property in node.js, sandboxed or web\n * environments.\n *\n * Note: in web, this property is hardcoded to be `/`.\n *\n * @skipMangle\n */\nexport const cwd = safeProcess.cwd;\n/**\n * Provides safe access to the `env` property in node.js, sandboxed or web\n * environments.\n *\n * Note: in web, this property is hardcoded to be `{}`.\n */\nexport const env = safeProcess.env;\n/**\n * Provides safe access to the `platform` property in node.js, sandboxed or web\n * environments.\n */\nexport const platform = safeProcess.platform;\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nconst hasPerformanceNow = (globalThis.performance && typeof globalThis.performance.now === 'function');\nexport class StopWatch {\n static create(highResolution) {\n return new StopWatch(highResolution);\n }\n constructor(highResolution) {\n this._now = hasPerformanceNow && highResolution === false ? Date.now : globalThis.performance.now.bind(globalThis.performance);\n this._startTime = this._now();\n this._stopTime = -1;\n }\n stop() {\n this._stopTime = this._now();\n }\n elapsed() {\n if (this._stopTime !== -1) {\n return this._stopTime - this._startTime;\n }\n return this._now() - this._startTime;\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nvar _a;\nimport { LRUCachedFunction } from './cache.js';\nimport { Lazy } from './lazy.js';\nexport function isFalsyOrWhitespace(str) {\n if (!str || typeof str !== 'string') {\n return true;\n }\n return str.trim().length === 0;\n}\nconst _formatRegexp = /{(\\d+)}/g;\n/**\n * Helper to produce a string with a variable number of arguments. Insert variable segments\n * into the string using the {n} notation where N is the index of the argument following the string.\n * @param value string to which formatting is applied\n * @param args replacements for {n}-entries\n */\nexport function format(value, ...args) {\n if (args.length === 0) {\n return value;\n }\n return value.replace(_formatRegexp, function (match, group) {\n const idx = parseInt(group, 10);\n return isNaN(idx) || idx < 0 || idx >= args.length ?\n match :\n args[idx];\n });\n}\n/**\n * Converts HTML characters inside the string to use entities instead. Makes the string safe from\n * being used e.g. in HTMLElement.innerHTML.\n */\nexport function escape(html) {\n return html.replace(/[<>&]/g, function (match) {\n switch (match) {\n case '<': return '<';\n case '>': return '>';\n case '&': return '&';\n default: return match;\n }\n });\n}\n/**\n * Escapes regular expression characters in a given string\n */\nexport function escapeRegExpCharacters(value) {\n return value.replace(/[\\\\\\{\\}\\*\\+\\?\\|\\^\\$\\.\\[\\]\\(\\)]/g, '\\\\$&');\n}\n/**\n * Removes all occurrences of needle from the beginning and end of haystack.\n * @param haystack string to trim\n * @param needle the thing to trim (default is a blank)\n */\nexport function trim(haystack, needle = ' ') {\n const trimmed = ltrim(haystack, needle);\n return rtrim(trimmed, needle);\n}\n/**\n * Removes all occurrences of needle from the beginning of haystack.\n * @param haystack string to trim\n * @param needle the thing to trim\n */\nexport function ltrim(haystack, needle) {\n if (!haystack || !needle) {\n return haystack;\n }\n const needleLen = needle.length;\n if (needleLen === 0 || haystack.length === 0) {\n return haystack;\n }\n let offset = 0;\n while (haystack.indexOf(needle, offset) === offset) {\n offset = offset + needleLen;\n }\n return haystack.substring(offset);\n}\n/**\n * Removes all occurrences of needle from the end of haystack.\n * @param haystack string to trim\n * @param needle the thing to trim\n */\nexport function rtrim(haystack, needle) {\n if (!haystack || !needle) {\n return haystack;\n }\n const needleLen = needle.length, haystackLen = haystack.length;\n if (needleLen === 0 || haystackLen === 0) {\n return haystack;\n }\n let offset = haystackLen, idx = -1;\n while (true) {\n idx = haystack.lastIndexOf(needle, offset - 1);\n if (idx === -1 || idx + needleLen !== offset) {\n break;\n }\n if (idx === 0) {\n return '';\n }\n offset = idx;\n }\n return haystack.substring(0, offset);\n}\nexport function convertSimple2RegExpPattern(pattern) {\n return pattern.replace(/[\\-\\\\\\{\\}\\+\\?\\|\\^\\$\\.\\,\\[\\]\\(\\)\\#\\s]/g, '\\\\$&').replace(/[\\*]/g, '.*');\n}\nexport function stripWildcards(pattern) {\n return pattern.replace(/\\*/g, '');\n}\nexport function createRegExp(searchString, isRegex, options = {}) {\n if (!searchString) {\n throw new Error('Cannot create regex from empty string');\n }\n if (!isRegex) {\n searchString = escapeRegExpCharacters(searchString);\n }\n if (options.wholeWord) {\n if (!/\\B/.test(searchString.charAt(0))) {\n searchString = '\\\\b' + searchString;\n }\n if (!/\\B/.test(searchString.charAt(searchString.length - 1))) {\n searchString = searchString + '\\\\b';\n }\n }\n let modifiers = '';\n if (options.global) {\n modifiers += 'g';\n }\n if (!options.matchCase) {\n modifiers += 'i';\n }\n if (options.multiline) {\n modifiers += 'm';\n }\n if (options.unicode) {\n modifiers += 'u';\n }\n return new RegExp(searchString, modifiers);\n}\nexport function regExpLeadsToEndlessLoop(regexp) {\n // Exit early if it's one of these special cases which are meant to match\n // against an empty string\n if (regexp.source === '^' || regexp.source === '^$' || regexp.source === '$' || regexp.source === '^\\\\s*$') {\n return false;\n }\n // We check against an empty string. If the regular expression doesn't advance\n // (e.g. ends in an endless loop) it will match an empty string.\n const match = regexp.exec('');\n return !!(match && regexp.lastIndex === 0);\n}\nexport function splitLines(str) {\n return str.split(/\\r\\n|\\r|\\n/);\n}\n/**\n * Returns first index of the string that is not whitespace.\n * If string is empty or contains only whitespaces, returns -1\n */\nexport function firstNonWhitespaceIndex(str) {\n for (let i = 0, len = str.length; i < len; i++) {\n const chCode = str.charCodeAt(i);\n if (chCode !== 32 /* CharCode.Space */ && chCode !== 9 /* CharCode.Tab */) {\n return i;\n }\n }\n return -1;\n}\n/**\n * Returns the leading whitespace of the string.\n * If the string contains only whitespaces, returns entire string\n */\nexport function getLeadingWhitespace(str, start = 0, end = str.length) {\n for (let i = start; i < end; i++) {\n const chCode = str.charCodeAt(i);\n if (chCode !== 32 /* CharCode.Space */ && chCode !== 9 /* CharCode.Tab */) {\n return str.substring(start, i);\n }\n }\n return str.substring(start, end);\n}\n/**\n * Returns last index of the string that is not whitespace.\n * If string is empty or contains only whitespaces, returns -1\n */\nexport function lastNonWhitespaceIndex(str, startIndex = str.length - 1) {\n for (let i = startIndex; i >= 0; i--) {\n const chCode = str.charCodeAt(i);\n if (chCode !== 32 /* CharCode.Space */ && chCode !== 9 /* CharCode.Tab */) {\n return i;\n }\n }\n return -1;\n}\nexport function compare(a, b) {\n if (a < b) {\n return -1;\n }\n else if (a > b) {\n return 1;\n }\n else {\n return 0;\n }\n}\nexport function compareSubstring(a, b, aStart = 0, aEnd = a.length, bStart = 0, bEnd = b.length) {\n for (; aStart < aEnd && bStart < bEnd; aStart++, bStart++) {\n const codeA = a.charCodeAt(aStart);\n const codeB = b.charCodeAt(bStart);\n if (codeA < codeB) {\n return -1;\n }\n else if (codeA > codeB) {\n return 1;\n }\n }\n const aLen = aEnd - aStart;\n const bLen = bEnd - bStart;\n if (aLen < bLen) {\n return -1;\n }\n else if (aLen > bLen) {\n return 1;\n }\n return 0;\n}\nexport function compareIgnoreCase(a, b) {\n return compareSubstringIgnoreCase(a, b, 0, a.length, 0, b.length);\n}\nexport function compareSubstringIgnoreCase(a, b, aStart = 0, aEnd = a.length, bStart = 0, bEnd = b.length) {\n for (; aStart < aEnd && bStart < bEnd; aStart++, bStart++) {\n let codeA = a.charCodeAt(aStart);\n let codeB = b.charCodeAt(bStart);\n if (codeA === codeB) {\n // equal\n continue;\n }\n if (codeA >= 128 || codeB >= 128) {\n // not ASCII letters -> fallback to lower-casing strings\n return compareSubstring(a.toLowerCase(), b.toLowerCase(), aStart, aEnd, bStart, bEnd);\n }\n // mapper lower-case ascii letter onto upper-case varinats\n // [97-122] (lower ascii) --> [65-90] (upper ascii)\n if (isLowerAsciiLetter(codeA)) {\n codeA -= 32;\n }\n if (isLowerAsciiLetter(codeB)) {\n codeB -= 32;\n }\n // compare both code points\n const diff = codeA - codeB;\n if (diff === 0) {\n continue;\n }\n return diff;\n }\n const aLen = aEnd - aStart;\n const bLen = bEnd - bStart;\n if (aLen < bLen) {\n return -1;\n }\n else if (aLen > bLen) {\n return 1;\n }\n return 0;\n}\nexport function isAsciiDigit(code) {\n return code >= 48 /* CharCode.Digit0 */ && code <= 57 /* CharCode.Digit9 */;\n}\nexport function isLowerAsciiLetter(code) {\n return code >= 97 /* CharCode.a */ && code <= 122 /* CharCode.z */;\n}\nexport function isUpperAsciiLetter(code) {\n return code >= 65 /* CharCode.A */ && code <= 90 /* CharCode.Z */;\n}\nexport function equalsIgnoreCase(a, b) {\n return a.length === b.length && compareSubstringIgnoreCase(a, b) === 0;\n}\nexport function startsWithIgnoreCase(str, candidate) {\n const candidateLength = candidate.length;\n if (candidate.length > str.length) {\n return false;\n }\n return compareSubstringIgnoreCase(str, candidate, 0, candidateLength) === 0;\n}\n/**\n * @returns the length of the common prefix of the two strings.\n */\nexport function commonPrefixLength(a, b) {\n const len = Math.min(a.length, b.length);\n let i;\n for (i = 0; i < len; i++) {\n if (a.charCodeAt(i) !== b.charCodeAt(i)) {\n return i;\n }\n }\n return len;\n}\n/**\n * @returns the length of the common suffix of the two strings.\n */\nexport function commonSuffixLength(a, b) {\n const len = Math.min(a.length, b.length);\n let i;\n const aLastIndex = a.length - 1;\n const bLastIndex = b.length - 1;\n for (i = 0; i < len; i++) {\n if (a.charCodeAt(aLastIndex - i) !== b.charCodeAt(bLastIndex - i)) {\n return i;\n }\n }\n return len;\n}\n/**\n * See http://en.wikipedia.org/wiki/Surrogate_pair\n */\nexport function isHighSurrogate(charCode) {\n return (0xD800 <= charCode && charCode <= 0xDBFF);\n}\n/**\n * See http://en.wikipedia.org/wiki/Surrogate_pair\n */\nexport function isLowSurrogate(charCode) {\n return (0xDC00 <= charCode && charCode <= 0xDFFF);\n}\n/**\n * See http://en.wikipedia.org/wiki/Surrogate_pair\n */\nexport function computeCodePoint(highSurrogate, lowSurrogate) {\n return ((highSurrogate - 0xD800) << 10) + (lowSurrogate - 0xDC00) + 0x10000;\n}\n/**\n * get the code point that begins at offset `offset`\n */\nexport function getNextCodePoint(str, len, offset) {\n const charCode = str.charCodeAt(offset);\n if (isHighSurrogate(charCode) && offset + 1 < len) {\n const nextCharCode = str.charCodeAt(offset + 1);\n if (isLowSurrogate(nextCharCode)) {\n return computeCodePoint(charCode, nextCharCode);\n }\n }\n return charCode;\n}\n/**\n * get the code point that ends right before offset `offset`\n */\nfunction getPrevCodePoint(str, offset) {\n const charCode = str.charCodeAt(offset - 1);\n if (isLowSurrogate(charCode) && offset > 1) {\n const prevCharCode = str.charCodeAt(offset - 2);\n if (isHighSurrogate(prevCharCode)) {\n return computeCodePoint(prevCharCode, charCode);\n }\n }\n return charCode;\n}\nexport class CodePointIterator {\n get offset() {\n return this._offset;\n }\n constructor(str, offset = 0) {\n this._str = str;\n this._len = str.length;\n this._offset = offset;\n }\n setOffset(offset) {\n this._offset = offset;\n }\n prevCodePoint() {\n const codePoint = getPrevCodePoint(this._str, this._offset);\n this._offset -= (codePoint >= 65536 /* Constants.UNICODE_SUPPLEMENTARY_PLANE_BEGIN */ ? 2 : 1);\n return codePoint;\n }\n nextCodePoint() {\n const codePoint = getNextCodePoint(this._str, this._len, this._offset);\n this._offset += (codePoint >= 65536 /* Constants.UNICODE_SUPPLEMENTARY_PLANE_BEGIN */ ? 2 : 1);\n return codePoint;\n }\n eol() {\n return (this._offset >= this._len);\n }\n}\nexport class GraphemeIterator {\n get offset() {\n return this._iterator.offset;\n }\n constructor(str, offset = 0) {\n this._iterator = new CodePointIterator(str, offset);\n }\n nextGraphemeLength() {\n const graphemeBreakTree = GraphemeBreakTree.getInstance();\n const iterator = this._iterator;\n const initialOffset = iterator.offset;\n let graphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.nextCodePoint());\n while (!iterator.eol()) {\n const offset = iterator.offset;\n const nextGraphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.nextCodePoint());\n if (breakBetweenGraphemeBreakType(graphemeBreakType, nextGraphemeBreakType)) {\n // move iterator back\n iterator.setOffset(offset);\n break;\n }\n graphemeBreakType = nextGraphemeBreakType;\n }\n return (iterator.offset - initialOffset);\n }\n prevGraphemeLength() {\n const graphemeBreakTree = GraphemeBreakTree.getInstance();\n const iterator = this._iterator;\n const initialOffset = iterator.offset;\n let graphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.prevCodePoint());\n while (iterator.offset > 0) {\n const offset = iterator.offset;\n const prevGraphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.prevCodePoint());\n if (breakBetweenGraphemeBreakType(prevGraphemeBreakType, graphemeBreakType)) {\n // move iterator back\n iterator.setOffset(offset);\n break;\n }\n graphemeBreakType = prevGraphemeBreakType;\n }\n return (initialOffset - iterator.offset);\n }\n eol() {\n return this._iterator.eol();\n }\n}\nexport function nextCharLength(str, initialOffset) {\n const iterator = new GraphemeIterator(str, initialOffset);\n return iterator.nextGraphemeLength();\n}\nexport function prevCharLength(str, initialOffset) {\n const iterator = new GraphemeIterator(str, initialOffset);\n return iterator.prevGraphemeLength();\n}\nexport function getCharContainingOffset(str, offset) {\n if (offset > 0 && isLowSurrogate(str.charCodeAt(offset))) {\n offset--;\n }\n const endOffset = offset + nextCharLength(str, offset);\n const startOffset = endOffset - prevCharLength(str, endOffset);\n return [startOffset, endOffset];\n}\nlet CONTAINS_RTL = undefined;\nfunction makeContainsRtl() {\n // Generated using https://github.com/alexdima/unicode-utils/blob/main/rtl-test.js\n return /(?:[\\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\\u07FE-\\u0815\\u081A\\u0824\\u0828\\u0830-\\u0858\\u085E-\\u088E\\u08A0-\\u08C9\\u200F\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFD3D\\uFD50-\\uFDC7\\uFDF0-\\uFDFC\\uFE70-\\uFEFC]|\\uD802[\\uDC00-\\uDD1B\\uDD20-\\uDE00\\uDE10-\\uDE35\\uDE40-\\uDEE4\\uDEEB-\\uDF35\\uDF40-\\uDFFF]|\\uD803[\\uDC00-\\uDD23\\uDE80-\\uDEA9\\uDEAD-\\uDF45\\uDF51-\\uDF81\\uDF86-\\uDFF6]|\\uD83A[\\uDC00-\\uDCCF\\uDD00-\\uDD43\\uDD4B-\\uDFFF]|\\uD83B[\\uDC00-\\uDEBB])/;\n}\n/**\n * Returns true if `str` contains any Unicode character that is classified as \"R\" or \"AL\".\n */\nexport function containsRTL(str) {\n if (!CONTAINS_RTL) {\n CONTAINS_RTL = makeContainsRtl();\n }\n return CONTAINS_RTL.test(str);\n}\nconst IS_BASIC_ASCII = /^[\\t\\n\\r\\x20-\\x7E]*$/;\n/**\n * Returns true if `str` contains only basic ASCII characters in the range 32 - 126 (including 32 and 126) or \\n, \\r, \\t\n */\nexport function isBasicASCII(str) {\n return IS_BASIC_ASCII.test(str);\n}\nexport const UNUSUAL_LINE_TERMINATORS = /[\\u2028\\u2029]/; // LINE SEPARATOR (LS) or PARAGRAPH SEPARATOR (PS)\n/**\n * Returns true if `str` contains unusual line terminators, like LS or PS\n */\nexport function containsUnusualLineTerminators(str) {\n return UNUSUAL_LINE_TERMINATORS.test(str);\n}\nexport function isFullWidthCharacter(charCode) {\n // Do a cheap trick to better support wrapping of wide characters, treat them as 2 columns\n // http://jrgraphix.net/research/unicode_blocks.php\n // 2E80 - 2EFF CJK Radicals Supplement\n // 2F00 - 2FDF Kangxi Radicals\n // 2FF0 - 2FFF Ideographic Description Characters\n // 3000 - 303F CJK Symbols and Punctuation\n // 3040 - 309F Hiragana\n // 30A0 - 30FF Katakana\n // 3100 - 312F Bopomofo\n // 3130 - 318F Hangul Compatibility Jamo\n // 3190 - 319F Kanbun\n // 31A0 - 31BF Bopomofo Extended\n // 31F0 - 31FF Katakana Phonetic Extensions\n // 3200 - 32FF Enclosed CJK Letters and Months\n // 3300 - 33FF CJK Compatibility\n // 3400 - 4DBF CJK Unified Ideographs Extension A\n // 4DC0 - 4DFF Yijing Hexagram Symbols\n // 4E00 - 9FFF CJK Unified Ideographs\n // A000 - A48F Yi Syllables\n // A490 - A4CF Yi Radicals\n // AC00 - D7AF Hangul Syllables\n // [IGNORE] D800 - DB7F High Surrogates\n // [IGNORE] DB80 - DBFF High Private Use Surrogates\n // [IGNORE] DC00 - DFFF Low Surrogates\n // [IGNORE] E000 - F8FF Private Use Area\n // F900 - FAFF CJK Compatibility Ideographs\n // [IGNORE] FB00 - FB4F Alphabetic Presentation Forms\n // [IGNORE] FB50 - FDFF Arabic Presentation Forms-A\n // [IGNORE] FE00 - FE0F Variation Selectors\n // [IGNORE] FE20 - FE2F Combining Half Marks\n // [IGNORE] FE30 - FE4F CJK Compatibility Forms\n // [IGNORE] FE50 - FE6F Small Form Variants\n // [IGNORE] FE70 - FEFF Arabic Presentation Forms-B\n // FF00 - FFEF Halfwidth and Fullwidth Forms\n // [https://en.wikipedia.org/wiki/Halfwidth_and_fullwidth_forms]\n // of which FF01 - FF5E fullwidth ASCII of 21 to 7E\n // [IGNORE] and FF65 - FFDC halfwidth of Katakana and Hangul\n // [IGNORE] FFF0 - FFFF Specials\n return ((charCode >= 0x2E80 && charCode <= 0xD7AF)\n || (charCode >= 0xF900 && charCode <= 0xFAFF)\n || (charCode >= 0xFF01 && charCode <= 0xFF5E));\n}\n/**\n * A fast function (therefore imprecise) to check if code points are emojis.\n * Generated using https://github.com/alexdima/unicode-utils/blob/main/emoji-test.js\n */\nexport function isEmojiImprecise(x) {\n return ((x >= 0x1F1E6 && x <= 0x1F1FF) || (x === 8986) || (x === 8987) || (x === 9200)\n || (x === 9203) || (x >= 9728 && x <= 10175) || (x === 11088) || (x === 11093)\n || (x >= 127744 && x <= 128591) || (x >= 128640 && x <= 128764)\n || (x >= 128992 && x <= 129008) || (x >= 129280 && x <= 129535)\n || (x >= 129648 && x <= 129782));\n}\n// -- UTF-8 BOM\nexport const UTF8_BOM_CHARACTER = String.fromCharCode(65279 /* CharCode.UTF8_BOM */);\nexport function startsWithUTF8BOM(str) {\n return !!(str && str.length > 0 && str.charCodeAt(0) === 65279 /* CharCode.UTF8_BOM */);\n}\nexport function containsUppercaseCharacter(target, ignoreEscapedChars = false) {\n if (!target) {\n return false;\n }\n if (ignoreEscapedChars) {\n target = target.replace(/\\\\./g, '');\n }\n return target.toLowerCase() !== target;\n}\n/**\n * Produces 'a'-'z', followed by 'A'-'Z'... followed by 'a'-'z', etc.\n */\nexport function singleLetterHash(n) {\n const LETTERS_CNT = (90 /* CharCode.Z */ - 65 /* CharCode.A */ + 1);\n n = n % (2 * LETTERS_CNT);\n if (n < LETTERS_CNT) {\n return String.fromCharCode(97 /* CharCode.a */ + n);\n }\n return String.fromCharCode(65 /* CharCode.A */ + n - LETTERS_CNT);\n}\nfunction breakBetweenGraphemeBreakType(breakTypeA, breakTypeB) {\n // http://www.unicode.org/reports/tr29/#Grapheme_Cluster_Boundary_Rules\n // !!! Let's make the common case a bit faster\n if (breakTypeA === 0 /* GraphemeBreakType.Other */) {\n // see https://www.unicode.org/Public/13.0.0/ucd/auxiliary/GraphemeBreakTest-13.0.0d10.html#table\n return (breakTypeB !== 5 /* GraphemeBreakType.Extend */ && breakTypeB !== 7 /* GraphemeBreakType.SpacingMark */);\n }\n // Do not break between a CR and LF. Otherwise, break before and after controls.\n // GB3 CR × LF\n // GB4 (Control | CR | LF) ÷\n // GB5 ÷ (Control | CR | LF)\n if (breakTypeA === 2 /* GraphemeBreakType.CR */) {\n if (breakTypeB === 3 /* GraphemeBreakType.LF */) {\n return false; // GB3\n }\n }\n if (breakTypeA === 4 /* GraphemeBreakType.Control */ || breakTypeA === 2 /* GraphemeBreakType.CR */ || breakTypeA === 3 /* GraphemeBreakType.LF */) {\n return true; // GB4\n }\n if (breakTypeB === 4 /* GraphemeBreakType.Control */ || breakTypeB === 2 /* GraphemeBreakType.CR */ || breakTypeB === 3 /* GraphemeBreakType.LF */) {\n return true; // GB5\n }\n // Do not break Hangul syllable sequences.\n // GB6 L × (L | V | LV | LVT)\n // GB7 (LV | V) × (V | T)\n // GB8 (LVT | T) × T\n if (breakTypeA === 8 /* GraphemeBreakType.L */) {\n if (breakTypeB === 8 /* GraphemeBreakType.L */ || breakTypeB === 9 /* GraphemeBreakType.V */ || breakTypeB === 11 /* GraphemeBreakType.LV */ || breakTypeB === 12 /* GraphemeBreakType.LVT */) {\n return false; // GB6\n }\n }\n if (breakTypeA === 11 /* GraphemeBreakType.LV */ || breakTypeA === 9 /* GraphemeBreakType.V */) {\n if (breakTypeB === 9 /* GraphemeBreakType.V */ || breakTypeB === 10 /* GraphemeBreakType.T */) {\n return false; // GB7\n }\n }\n if (breakTypeA === 12 /* GraphemeBreakType.LVT */ || breakTypeA === 10 /* GraphemeBreakType.T */) {\n if (breakTypeB === 10 /* GraphemeBreakType.T */) {\n return false; // GB8\n }\n }\n // Do not break before extending characters or ZWJ.\n // GB9 × (Extend | ZWJ)\n if (breakTypeB === 5 /* GraphemeBreakType.Extend */ || breakTypeB === 13 /* GraphemeBreakType.ZWJ */) {\n return false; // GB9\n }\n // The GB9a and GB9b rules only apply to extended grapheme clusters:\n // Do not break before SpacingMarks, or after Prepend characters.\n // GB9a × SpacingMark\n // GB9b Prepend ×\n if (breakTypeB === 7 /* GraphemeBreakType.SpacingMark */) {\n return false; // GB9a\n }\n if (breakTypeA === 1 /* GraphemeBreakType.Prepend */) {\n return false; // GB9b\n }\n // Do not break within emoji modifier sequences or emoji zwj sequences.\n // GB11 \\p{Extended_Pictographic} Extend* ZWJ × \\p{Extended_Pictographic}\n if (breakTypeA === 13 /* GraphemeBreakType.ZWJ */ && breakTypeB === 14 /* GraphemeBreakType.Extended_Pictographic */) {\n // Note: we are not implementing the rule entirely here to avoid introducing states\n return false; // GB11\n }\n // GB12 sot (RI RI)* RI × RI\n // GB13 [^RI] (RI RI)* RI × RI\n if (breakTypeA === 6 /* GraphemeBreakType.Regional_Indicator */ && breakTypeB === 6 /* GraphemeBreakType.Regional_Indicator */) {\n // Note: we are not implementing the rule entirely here to avoid introducing states\n return false; // GB12 & GB13\n }\n // GB999 Any ÷ Any\n return true;\n}\nclass GraphemeBreakTree {\n static getInstance() {\n if (!GraphemeBreakTree._INSTANCE) {\n GraphemeBreakTree._INSTANCE = new GraphemeBreakTree();\n }\n return GraphemeBreakTree._INSTANCE;\n }\n constructor() {\n this._data = getGraphemeBreakRawData();\n }\n getGraphemeBreakType(codePoint) {\n // !!! Let's make 7bit ASCII a bit faster: 0..31\n if (codePoint < 32) {\n if (codePoint === 10 /* CharCode.LineFeed */) {\n return 3 /* GraphemeBreakType.LF */;\n }\n if (codePoint === 13 /* CharCode.CarriageReturn */) {\n return 2 /* GraphemeBreakType.CR */;\n }\n return 4 /* GraphemeBreakType.Control */;\n }\n // !!! Let's make 7bit ASCII a bit faster: 32..126\n if (codePoint < 127) {\n return 0 /* GraphemeBreakType.Other */;\n }\n const data = this._data;\n const nodeCount = data.length / 3;\n let nodeIndex = 1;\n while (nodeIndex <= nodeCount) {\n if (codePoint < data[3 * nodeIndex]) {\n // go left\n nodeIndex = 2 * nodeIndex;\n }\n else if (codePoint > data[3 * nodeIndex + 1]) {\n // go right\n nodeIndex = 2 * nodeIndex + 1;\n }\n else {\n // hit\n return data[3 * nodeIndex + 2];\n }\n }\n return 0 /* GraphemeBreakType.Other */;\n }\n}\nGraphemeBreakTree._INSTANCE = null;\nfunction getGraphemeBreakRawData() {\n // generated using https://github.com/alexdima/unicode-utils/blob/main/grapheme-break.js\n return JSON.parse('[0,0,0,51229,51255,12,44061,44087,12,127462,127487,6,7083,7085,5,47645,47671,12,54813,54839,12,128678,128678,14,3270,3270,5,9919,9923,14,45853,45879,12,49437,49463,12,53021,53047,12,71216,71218,7,128398,128399,14,129360,129374,14,2519,2519,5,4448,4519,9,9742,9742,14,12336,12336,14,44957,44983,12,46749,46775,12,48541,48567,12,50333,50359,12,52125,52151,12,53917,53943,12,69888,69890,5,73018,73018,5,127990,127990,14,128558,128559,14,128759,128760,14,129653,129655,14,2027,2035,5,2891,2892,7,3761,3761,5,6683,6683,5,8293,8293,4,9825,9826,14,9999,9999,14,43452,43453,5,44509,44535,12,45405,45431,12,46301,46327,12,47197,47223,12,48093,48119,12,48989,49015,12,49885,49911,12,50781,50807,12,51677,51703,12,52573,52599,12,53469,53495,12,54365,54391,12,65279,65279,4,70471,70472,7,72145,72147,7,119173,119179,5,127799,127818,14,128240,128244,14,128512,128512,14,128652,128652,14,128721,128722,14,129292,129292,14,129445,129450,14,129734,129743,14,1476,1477,5,2366,2368,7,2750,2752,7,3076,3076,5,3415,3415,5,4141,4144,5,6109,6109,5,6964,6964,5,7394,7400,5,9197,9198,14,9770,9770,14,9877,9877,14,9968,9969,14,10084,10084,14,43052,43052,5,43713,43713,5,44285,44311,12,44733,44759,12,45181,45207,12,45629,45655,12,46077,46103,12,46525,46551,12,46973,46999,12,47421,47447,12,47869,47895,12,48317,48343,12,48765,48791,12,49213,49239,12,49661,49687,12,50109,50135,12,50557,50583,12,51005,51031,12,51453,51479,12,51901,51927,12,52349,52375,12,52797,52823,12,53245,53271,12,53693,53719,12,54141,54167,12,54589,54615,12,55037,55063,12,69506,69509,5,70191,70193,5,70841,70841,7,71463,71467,5,72330,72342,5,94031,94031,5,123628,123631,5,127763,127765,14,127941,127941,14,128043,128062,14,128302,128317,14,128465,128467,14,128539,128539,14,128640,128640,14,128662,128662,14,128703,128703,14,128745,128745,14,129004,129007,14,129329,129330,14,129402,129402,14,129483,129483,14,129686,129704,14,130048,131069,14,173,173,4,1757,1757,1,2200,2207,5,2434,2435,7,2631,2632,5,2817,2817,5,3008,3008,5,3201,3201,5,3387,3388,5,3542,3542,5,3902,3903,7,4190,4192,5,6002,6003,5,6439,6440,5,6765,6770,7,7019,7027,5,7154,7155,7,8205,8205,13,8505,8505,14,9654,9654,14,9757,9757,14,9792,9792,14,9852,9853,14,9890,9894,14,9937,9937,14,9981,9981,14,10035,10036,14,11035,11036,14,42654,42655,5,43346,43347,7,43587,43587,5,44006,44007,7,44173,44199,12,44397,44423,12,44621,44647,12,44845,44871,12,45069,45095,12,45293,45319,12,45517,45543,12,45741,45767,12,45965,45991,12,46189,46215,12,46413,46439,12,46637,46663,12,46861,46887,12,47085,47111,12,47309,47335,12,47533,47559,12,47757,47783,12,47981,48007,12,48205,48231,12,48429,48455,12,48653,48679,12,48877,48903,12,49101,49127,12,49325,49351,12,49549,49575,12,49773,49799,12,49997,50023,12,50221,50247,12,50445,50471,12,50669,50695,12,50893,50919,12,51117,51143,12,51341,51367,12,51565,51591,12,51789,51815,12,52013,52039,12,52237,52263,12,52461,52487,12,52685,52711,12,52909,52935,12,53133,53159,12,53357,53383,12,53581,53607,12,53805,53831,12,54029,54055,12,54253,54279,12,54477,54503,12,54701,54727,12,54925,54951,12,55149,55175,12,68101,68102,5,69762,69762,7,70067,70069,7,70371,70378,5,70720,70721,7,71087,71087,5,71341,71341,5,71995,71996,5,72249,72249,7,72850,72871,5,73109,73109,5,118576,118598,5,121505,121519,5,127245,127247,14,127568,127569,14,127777,127777,14,127872,127891,14,127956,127967,14,128015,128016,14,128110,128172,14,128259,128259,14,128367,128368,14,128424,128424,14,128488,128488,14,128530,128532,14,128550,128551,14,128566,128566,14,128647,128647,14,128656,128656,14,128667,128673,14,128691,128693,14,128715,128715,14,128728,128732,14,128752,128752,14,128765,128767,14,129096,129103,14,129311,129311,14,129344,129349,14,129394,129394,14,129413,129425,14,129466,129471,14,129511,129535,14,129664,129666,14,129719,129722,14,129760,129767,14,917536,917631,5,13,13,2,1160,1161,5,1564,1564,4,1807,1807,1,2085,2087,5,2307,2307,7,2382,2383,7,2497,2500,5,2563,2563,7,2677,2677,5,2763,2764,7,2879,2879,5,2914,2915,5,3021,3021,5,3142,3144,5,3263,3263,5,3285,3286,5,3398,3400,7,3530,3530,5,3633,3633,5,3864,3865,5,3974,3975,5,4155,4156,7,4229,4230,5,5909,5909,7,6078,6085,7,6277,6278,5,6451,6456,7,6744,6750,5,6846,6846,5,6972,6972,5,7074,7077,5,7146,7148,7,7222,7223,5,7416,7417,5,8234,8238,4,8417,8417,5,9000,9000,14,9203,9203,14,9730,9731,14,9748,9749,14,9762,9763,14,9776,9783,14,9800,9811,14,9831,9831,14,9872,9873,14,9882,9882,14,9900,9903,14,9929,9933,14,9941,9960,14,9974,9974,14,9989,9989,14,10006,10006,14,10062,10062,14,10160,10160,14,11647,11647,5,12953,12953,14,43019,43019,5,43232,43249,5,43443,43443,5,43567,43568,7,43696,43696,5,43765,43765,7,44013,44013,5,44117,44143,12,44229,44255,12,44341,44367,12,44453,44479,12,44565,44591,12,44677,44703,12,44789,44815,12,44901,44927,12,45013,45039,12,45125,45151,12,45237,45263,12,45349,45375,12,45461,45487,12,45573,45599,12,45685,45711,12,45797,45823,12,45909,45935,12,46021,46047,12,46133,46159,12,46245,46271,12,46357,46383,12,46469,46495,12,46581,46607,12,46693,46719,12,46805,46831,12,46917,46943,12,47029,47055,12,47141,47167,12,47253,47279,12,47365,47391,12,47477,47503,12,47589,47615,12,47701,47727,12,47813,47839,12,47925,47951,12,48037,48063,12,48149,48175,12,48261,48287,12,48373,48399,12,48485,48511,12,48597,48623,12,48709,48735,12,48821,48847,12,48933,48959,12,49045,49071,12,49157,49183,12,49269,49295,12,49381,49407,12,49493,49519,12,49605,49631,12,49717,49743,12,49829,49855,12,49941,49967,12,50053,50079,12,50165,50191,12,50277,50303,12,50389,50415,12,50501,50527,12,50613,50639,12,50725,50751,12,50837,50863,12,50949,50975,12,51061,51087,12,51173,51199,12,51285,51311,12,51397,51423,12,51509,51535,12,51621,51647,12,51733,51759,12,51845,51871,12,51957,51983,12,52069,52095,12,52181,52207,12,52293,52319,12,52405,52431,12,52517,52543,12,52629,52655,12,52741,52767,12,52853,52879,12,52965,52991,12,53077,53103,12,53189,53215,12,53301,53327,12,53413,53439,12,53525,53551,12,53637,53663,12,53749,53775,12,53861,53887,12,53973,53999,12,54085,54111,12,54197,54223,12,54309,54335,12,54421,54447,12,54533,54559,12,54645,54671,12,54757,54783,12,54869,54895,12,54981,55007,12,55093,55119,12,55243,55291,10,66045,66045,5,68325,68326,5,69688,69702,5,69817,69818,5,69957,69958,7,70089,70092,5,70198,70199,5,70462,70462,5,70502,70508,5,70750,70750,5,70846,70846,7,71100,71101,5,71230,71230,7,71351,71351,5,71737,71738,5,72000,72000,7,72160,72160,5,72273,72278,5,72752,72758,5,72882,72883,5,73031,73031,5,73461,73462,7,94192,94193,7,119149,119149,7,121403,121452,5,122915,122916,5,126980,126980,14,127358,127359,14,127535,127535,14,127759,127759,14,127771,127771,14,127792,127793,14,127825,127867,14,127897,127899,14,127945,127945,14,127985,127986,14,128000,128007,14,128021,128021,14,128066,128100,14,128184,128235,14,128249,128252,14,128266,128276,14,128335,128335,14,128379,128390,14,128407,128419,14,128444,128444,14,128481,128481,14,128499,128499,14,128526,128526,14,128536,128536,14,128543,128543,14,128556,128556,14,128564,128564,14,128577,128580,14,128643,128645,14,128649,128649,14,128654,128654,14,128660,128660,14,128664,128664,14,128675,128675,14,128686,128689,14,128695,128696,14,128705,128709,14,128717,128719,14,128725,128725,14,128736,128741,14,128747,128748,14,128755,128755,14,128762,128762,14,128981,128991,14,129009,129023,14,129160,129167,14,129296,129304,14,129320,129327,14,129340,129342,14,129356,129356,14,129388,129392,14,129399,129400,14,129404,129407,14,129432,129442,14,129454,129455,14,129473,129474,14,129485,129487,14,129648,129651,14,129659,129660,14,129671,129679,14,129709,129711,14,129728,129730,14,129751,129753,14,129776,129782,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,2274,2274,1,2363,2363,7,2377,2380,7,2402,2403,5,2494,2494,5,2507,2508,7,2558,2558,5,2622,2624,7,2641,2641,5,2691,2691,7,2759,2760,5,2786,2787,5,2876,2876,5,2881,2884,5,2901,2902,5,3006,3006,5,3014,3016,7,3072,3072,5,3134,3136,5,3157,3158,5,3260,3260,5,3266,3266,5,3274,3275,7,3328,3329,5,3391,3392,7,3405,3405,5,3457,3457,5,3536,3537,7,3551,3551,5,3636,3642,5,3764,3772,5,3895,3895,5,3967,3967,7,3993,4028,5,4146,4151,5,4182,4183,7,4226,4226,5,4253,4253,5,4957,4959,5,5940,5940,7,6070,6070,7,6087,6088,7,6158,6158,4,6432,6434,5,6448,6449,7,6679,6680,5,6742,6742,5,6754,6754,5,6783,6783,5,6912,6915,5,6966,6970,5,6978,6978,5,7042,7042,7,7080,7081,5,7143,7143,7,7150,7150,7,7212,7219,5,7380,7392,5,7412,7412,5,8203,8203,4,8232,8232,4,8265,8265,14,8400,8412,5,8421,8432,5,8617,8618,14,9167,9167,14,9200,9200,14,9410,9410,14,9723,9726,14,9733,9733,14,9745,9745,14,9752,9752,14,9760,9760,14,9766,9766,14,9774,9774,14,9786,9786,14,9794,9794,14,9823,9823,14,9828,9828,14,9833,9850,14,9855,9855,14,9875,9875,14,9880,9880,14,9885,9887,14,9896,9897,14,9906,9916,14,9926,9927,14,9935,9935,14,9939,9939,14,9962,9962,14,9972,9972,14,9978,9978,14,9986,9986,14,9997,9997,14,10002,10002,14,10017,10017,14,10055,10055,14,10071,10071,14,10133,10135,14,10548,10549,14,11093,11093,14,12330,12333,5,12441,12442,5,42608,42610,5,43010,43010,5,43045,43046,5,43188,43203,7,43302,43309,5,43392,43394,5,43446,43449,5,43493,43493,5,43571,43572,7,43597,43597,7,43703,43704,5,43756,43757,5,44003,44004,7,44009,44010,7,44033,44059,12,44089,44115,12,44145,44171,12,44201,44227,12,44257,44283,12,44313,44339,12,44369,44395,12,44425,44451,12,44481,44507,12,44537,44563,12,44593,44619,12,44649,44675,12,44705,44731,12,44761,44787,12,44817,44843,12,44873,44899,12,44929,44955,12,44985,45011,12,45041,45067,12,45097,45123,12,45153,45179,12,45209,45235,12,45265,45291,12,45321,45347,12,45377,45403,12,45433,45459,12,45489,45515,12,45545,45571,12,45601,45627,12,45657,45683,12,45713,45739,12,45769,45795,12,45825,45851,12,45881,45907,12,45937,45963,12,45993,46019,12,46049,46075,12,46105,46131,12,46161,46187,12,46217,46243,12,46273,46299,12,46329,46355,12,46385,46411,12,46441,46467,12,46497,46523,12,46553,46579,12,46609,46635,12,46665,46691,12,46721,46747,12,46777,46803,12,46833,46859,12,46889,46915,12,46945,46971,12,47001,47027,12,47057,47083,12,47113,47139,12,47169,47195,12,47225,47251,12,47281,47307,12,47337,47363,12,47393,47419,12,47449,47475,12,47505,47531,12,47561,47587,12,47617,47643,12,47673,47699,12,47729,47755,12,47785,47811,12,47841,47867,12,47897,47923,12,47953,47979,12,48009,48035,12,48065,48091,12,48121,48147,12,48177,48203,12,48233,48259,12,48289,48315,12,48345,48371,12,48401,48427,12,48457,48483,12,48513,48539,12,48569,48595,12,48625,48651,12,48681,48707,12,48737,48763,12,48793,48819,12,48849,48875,12,48905,48931,12,48961,48987,12,49017,49043,12,49073,49099,12,49129,49155,12,49185,49211,12,49241,49267,12,49297,49323,12,49353,49379,12,49409,49435,12,49465,49491,12,49521,49547,12,49577,49603,12,49633,49659,12,49689,49715,12,49745,49771,12,49801,49827,12,49857,49883,12,49913,49939,12,49969,49995,12,50025,50051,12,50081,50107,12,50137,50163,12,50193,50219,12,50249,50275,12,50305,50331,12,50361,50387,12,50417,50443,12,50473,50499,12,50529,50555,12,50585,50611,12,50641,50667,12,50697,50723,12,50753,50779,12,50809,50835,12,50865,50891,12,50921,50947,12,50977,51003,12,51033,51059,12,51089,51115,12,51145,51171,12,51201,51227,12,51257,51283,12,51313,51339,12,51369,51395,12,51425,51451,12,51481,51507,12,51537,51563,12,51593,51619,12,51649,51675,12,51705,51731,12,51761,51787,12,51817,51843,12,51873,51899,12,51929,51955,12,51985,52011,12,52041,52067,12,52097,52123,12,52153,52179,12,52209,52235,12,52265,52291,12,52321,52347,12,52377,52403,12,52433,52459,12,52489,52515,12,52545,52571,12,52601,52627,12,52657,52683,12,52713,52739,12,52769,52795,12,52825,52851,12,52881,52907,12,52937,52963,12,52993,53019,12,53049,53075,12,53105,53131,12,53161,53187,12,53217,53243,12,53273,53299,12,53329,53355,12,53385,53411,12,53441,53467,12,53497,53523,12,53553,53579,12,53609,53635,12,53665,53691,12,53721,53747,12,53777,53803,12,53833,53859,12,53889,53915,12,53945,53971,12,54001,54027,12,54057,54083,12,54113,54139,12,54169,54195,12,54225,54251,12,54281,54307,12,54337,54363,12,54393,54419,12,54449,54475,12,54505,54531,12,54561,54587,12,54617,54643,12,54673,54699,12,54729,54755,12,54785,54811,12,54841,54867,12,54897,54923,12,54953,54979,12,55009,55035,12,55065,55091,12,55121,55147,12,55177,55203,12,65024,65039,5,65520,65528,4,66422,66426,5,68152,68154,5,69291,69292,5,69633,69633,5,69747,69748,5,69811,69814,5,69826,69826,5,69932,69932,7,70016,70017,5,70079,70080,7,70095,70095,5,70196,70196,5,70367,70367,5,70402,70403,7,70464,70464,5,70487,70487,5,70709,70711,7,70725,70725,7,70833,70834,7,70843,70844,7,70849,70849,7,71090,71093,5,71103,71104,5,71227,71228,7,71339,71339,5,71344,71349,5,71458,71461,5,71727,71735,5,71985,71989,7,71998,71998,5,72002,72002,7,72154,72155,5,72193,72202,5,72251,72254,5,72281,72283,5,72344,72345,5,72766,72766,7,72874,72880,5,72885,72886,5,73023,73029,5,73104,73105,5,73111,73111,5,92912,92916,5,94095,94098,5,113824,113827,4,119142,119142,7,119155,119162,4,119362,119364,5,121476,121476,5,122888,122904,5,123184,123190,5,125252,125258,5,127183,127183,14,127340,127343,14,127377,127386,14,127491,127503,14,127548,127551,14,127744,127756,14,127761,127761,14,127769,127769,14,127773,127774,14,127780,127788,14,127796,127797,14,127820,127823,14,127869,127869,14,127894,127895,14,127902,127903,14,127943,127943,14,127947,127950,14,127972,127972,14,127988,127988,14,127992,127994,14,128009,128011,14,128019,128019,14,128023,128041,14,128064,128064,14,128102,128107,14,128174,128181,14,128238,128238,14,128246,128247,14,128254,128254,14,128264,128264,14,128278,128299,14,128329,128330,14,128348,128359,14,128371,128377,14,128392,128393,14,128401,128404,14,128421,128421,14,128433,128434,14,128450,128452,14,128476,128478,14,128483,128483,14,128495,128495,14,128506,128506,14,128519,128520,14,128528,128528,14,128534,128534,14,128538,128538,14,128540,128542,14,128544,128549,14,128552,128555,14,128557,128557,14,128560,128563,14,128565,128565,14,128567,128576,14,128581,128591,14,128641,128642,14,128646,128646,14,128648,128648,14,128650,128651,14,128653,128653,14,128655,128655,14,128657,128659,14,128661,128661,14,128663,128663,14,128665,128666,14,128674,128674,14,128676,128677,14,128679,128685,14,128690,128690,14,128694,128694,14,128697,128702,14,128704,128704,14,128710,128714,14,128716,128716,14,128720,128720,14,128723,128724,14,128726,128727,14,128733,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,129008,129008,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,129661,129663,14,129667,129670,14,129680,129685,14,129705,129708,14,129712,129718,14,129723,129727,14,129731,129733,14,129744,129750,14,129754,129759,14,129768,129775,14,129783,129791,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,2192,2193,1,2250,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,3132,3132,5,3137,3140,7,3146,3149,5,3170,3171,5,3202,3203,7,3262,3262,7,3264,3265,7,3267,3268,7,3271,3272,7,3276,3277,5,3298,3299,5,3330,3331,7,3390,3390,5,3393,3396,5,3402,3404,7,3406,3406,1,3426,3427,5,3458,3459,7,3535,3535,5,3538,3540,5,3544,3550,7,3570,3571,7,3635,3635,7,3655,3662,5,3763,3763,7,3784,3789,5,3893,3893,5,3897,3897,5,3953,3966,5,3968,3972,5,3981,3991,5,4038,4038,5,4145,4145,7,4153,4154,5,4157,4158,5,4184,4185,5,4209,4212,5,4228,4228,7,4237,4237,5,4352,4447,8,4520,4607,10,5906,5908,5,5938,5939,5,5970,5971,5,6068,6069,5,6071,6077,5,6086,6086,5,6089,6099,5,6155,6157,5,6159,6159,5,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,6862,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,7679,5,8204,8204,5,8206,8207,4,8233,8233,4,8252,8252,14,8288,8292,4,8294,8303,4,8413,8416,5,8418,8420,5,8482,8482,14,8596,8601,14,8986,8987,14,9096,9096,14,9193,9196,14,9199,9199,14,9201,9202,14,9208,9210,14,9642,9643,14,9664,9664,14,9728,9729,14,9732,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,9775,9775,14,9784,9785,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,9874,14,9876,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,9934,14,9936,9936,14,9938,9938,14,9940,9940,14,9961,9961,14,9963,9967,14,9970,9971,14,9973,9973,14,9975,9977,14,9979,9980,14,9982,9985,14,9987,9988,14,9992,9996,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,10083,14,10085,10087,14,10145,10145,14,10175,10175,14,11013,11015,14,11088,11088,14,11503,11505,5,11744,11775,5,12334,12335,5,12349,12349,14,12951,12951,14,42607,42607,5,42612,42621,5,42736,42737,5,43014,43014,5,43043,43044,7,43047,43047,7,43136,43137,7,43204,43205,5,43263,43263,5,43335,43345,5,43360,43388,8,43395,43395,7,43444,43445,7,43450,43451,7,43454,43456,7,43561,43566,5,43569,43570,5,43573,43574,5,43596,43596,5,43644,43644,5,43698,43700,5,43710,43711,5,43755,43755,7,43758,43759,7,43766,43766,5,44005,44005,5,44008,44008,5,44012,44012,7,44032,44032,11,44060,44060,11,44088,44088,11,44116,44116,11,44144,44144,11,44172,44172,11,44200,44200,11,44228,44228,11,44256,44256,11,44284,44284,11,44312,44312,11,44340,44340,11,44368,44368,11,44396,44396,11,44424,44424,11,44452,44452,11,44480,44480,11,44508,44508,11,44536,44536,11,44564,44564,11,44592,44592,11,44620,44620,11,44648,44648,11,44676,44676,11,44704,44704,11,44732,44732,11,44760,44760,11,44788,44788,11,44816,44816,11,44844,44844,11,44872,44872,11,44900,44900,11,44928,44928,11,44956,44956,11,44984,44984,11,45012,45012,11,45040,45040,11,45068,45068,11,45096,45096,11,45124,45124,11,45152,45152,11,45180,45180,11,45208,45208,11,45236,45236,11,45264,45264,11,45292,45292,11,45320,45320,11,45348,45348,11,45376,45376,11,45404,45404,11,45432,45432,11,45460,45460,11,45488,45488,11,45516,45516,11,45544,45544,11,45572,45572,11,45600,45600,11,45628,45628,11,45656,45656,11,45684,45684,11,45712,45712,11,45740,45740,11,45768,45768,11,45796,45796,11,45824,45824,11,45852,45852,11,45880,45880,11,45908,45908,11,45936,45936,11,45964,45964,11,45992,45992,11,46020,46020,11,46048,46048,11,46076,46076,11,46104,46104,11,46132,46132,11,46160,46160,11,46188,46188,11,46216,46216,11,46244,46244,11,46272,46272,11,46300,46300,11,46328,46328,11,46356,46356,11,46384,46384,11,46412,46412,11,46440,46440,11,46468,46468,11,46496,46496,11,46524,46524,11,46552,46552,11,46580,46580,11,46608,46608,11,46636,46636,11,46664,46664,11,46692,46692,11,46720,46720,11,46748,46748,11,46776,46776,11,46804,46804,11,46832,46832,11,46860,46860,11,46888,46888,11,46916,46916,11,46944,46944,11,46972,46972,11,47000,47000,11,47028,47028,11,47056,47056,11,47084,47084,11,47112,47112,11,47140,47140,11,47168,47168,11,47196,47196,11,47224,47224,11,47252,47252,11,47280,47280,11,47308,47308,11,47336,47336,11,47364,47364,11,47392,47392,11,47420,47420,11,47448,47448,11,47476,47476,11,47504,47504,11,47532,47532,11,47560,47560,11,47588,47588,11,47616,47616,11,47644,47644,11,47672,47672,11,47700,47700,11,47728,47728,11,47756,47756,11,47784,47784,11,47812,47812,11,47840,47840,11,47868,47868,11,47896,47896,11,47924,47924,11,47952,47952,11,47980,47980,11,48008,48008,11,48036,48036,11,48064,48064,11,48092,48092,11,48120,48120,11,48148,48148,11,48176,48176,11,48204,48204,11,48232,48232,11,48260,48260,11,48288,48288,11,48316,48316,11,48344,48344,11,48372,48372,11,48400,48400,11,48428,48428,11,48456,48456,11,48484,48484,11,48512,48512,11,48540,48540,11,48568,48568,11,48596,48596,11,48624,48624,11,48652,48652,11,48680,48680,11,48708,48708,11,48736,48736,11,48764,48764,11,48792,48792,11,48820,48820,11,48848,48848,11,48876,48876,11,48904,48904,11,48932,48932,11,48960,48960,11,48988,48988,11,49016,49016,11,49044,49044,11,49072,49072,11,49100,49100,11,49128,49128,11,49156,49156,11,49184,49184,11,49212,49212,11,49240,49240,11,49268,49268,11,49296,49296,11,49324,49324,11,49352,49352,11,49380,49380,11,49408,49408,11,49436,49436,11,49464,49464,11,49492,49492,11,49520,49520,11,49548,49548,11,49576,49576,11,49604,49604,11,49632,49632,11,49660,49660,11,49688,49688,11,49716,49716,11,49744,49744,11,49772,49772,11,49800,49800,11,49828,49828,11,49856,49856,11,49884,49884,11,49912,49912,11,49940,49940,11,49968,49968,11,49996,49996,11,50024,50024,11,50052,50052,11,50080,50080,11,50108,50108,11,50136,50136,11,50164,50164,11,50192,50192,11,50220,50220,11,50248,50248,11,50276,50276,11,50304,50304,11,50332,50332,11,50360,50360,11,50388,50388,11,50416,50416,11,50444,50444,11,50472,50472,11,50500,50500,11,50528,50528,11,50556,50556,11,50584,50584,11,50612,50612,11,50640,50640,11,50668,50668,11,50696,50696,11,50724,50724,11,50752,50752,11,50780,50780,11,50808,50808,11,50836,50836,11,50864,50864,11,50892,50892,11,50920,50920,11,50948,50948,11,50976,50976,11,51004,51004,11,51032,51032,11,51060,51060,11,51088,51088,11,51116,51116,11,51144,51144,11,51172,51172,11,51200,51200,11,51228,51228,11,51256,51256,11,51284,51284,11,51312,51312,11,51340,51340,11,51368,51368,11,51396,51396,11,51424,51424,11,51452,51452,11,51480,51480,11,51508,51508,11,51536,51536,11,51564,51564,11,51592,51592,11,51620,51620,11,51648,51648,11,51676,51676,11,51704,51704,11,51732,51732,11,51760,51760,11,51788,51788,11,51816,51816,11,51844,51844,11,51872,51872,11,51900,51900,11,51928,51928,11,51956,51956,11,51984,51984,11,52012,52012,11,52040,52040,11,52068,52068,11,52096,52096,11,52124,52124,11,52152,52152,11,52180,52180,11,52208,52208,11,52236,52236,11,52264,52264,11,52292,52292,11,52320,52320,11,52348,52348,11,52376,52376,11,52404,52404,11,52432,52432,11,52460,52460,11,52488,52488,11,52516,52516,11,52544,52544,11,52572,52572,11,52600,52600,11,52628,52628,11,52656,52656,11,52684,52684,11,52712,52712,11,52740,52740,11,52768,52768,11,52796,52796,11,52824,52824,11,52852,52852,11,52880,52880,11,52908,52908,11,52936,52936,11,52964,52964,11,52992,52992,11,53020,53020,11,53048,53048,11,53076,53076,11,53104,53104,11,53132,53132,11,53160,53160,11,53188,53188,11,53216,53216,11,53244,53244,11,53272,53272,11,53300,53300,11,53328,53328,11,53356,53356,11,53384,53384,11,53412,53412,11,53440,53440,11,53468,53468,11,53496,53496,11,53524,53524,11,53552,53552,11,53580,53580,11,53608,53608,11,53636,53636,11,53664,53664,11,53692,53692,11,53720,53720,11,53748,53748,11,53776,53776,11,53804,53804,11,53832,53832,11,53860,53860,11,53888,53888,11,53916,53916,11,53944,53944,11,53972,53972,11,54000,54000,11,54028,54028,11,54056,54056,11,54084,54084,11,54112,54112,11,54140,54140,11,54168,54168,11,54196,54196,11,54224,54224,11,54252,54252,11,54280,54280,11,54308,54308,11,54336,54336,11,54364,54364,11,54392,54392,11,54420,54420,11,54448,54448,11,54476,54476,11,54504,54504,11,54532,54532,11,54560,54560,11,54588,54588,11,54616,54616,11,54644,54644,11,54672,54672,11,54700,54700,11,54728,54728,11,54756,54756,11,54784,54784,11,54812,54812,11,54840,54840,11,54868,54868,11,54896,54896,11,54924,54924,11,54952,54952,11,54980,54980,11,55008,55008,11,55036,55036,11,55064,55064,11,55092,55092,11,55120,55120,11,55148,55148,11,55176,55176,11,55216,55238,9,64286,64286,5,65056,65071,5,65438,65439,5,65529,65531,4,66272,66272,5,68097,68099,5,68108,68111,5,68159,68159,5,68900,68903,5,69446,69456,5,69632,69632,7,69634,69634,7,69744,69744,5,69759,69761,5,69808,69810,7,69815,69816,7,69821,69821,1,69837,69837,1,69927,69931,5,69933,69940,5,70003,70003,5,70018,70018,7,70070,70078,5,70082,70083,1,70094,70094,7,70188,70190,7,70194,70195,7,70197,70197,7,70206,70206,5,70368,70370,7,70400,70401,5,70459,70460,5,70463,70463,7,70465,70468,7,70475,70477,7,70498,70499,7,70512,70516,5,70712,70719,5,70722,70724,5,70726,70726,5,70832,70832,5,70835,70840,5,70842,70842,5,70845,70845,5,70847,70848,5,70850,70851,5,71088,71089,7,71096,71099,7,71102,71102,7,71132,71133,5,71219,71226,5,71229,71229,5,71231,71232,5,71340,71340,7,71342,71343,7,71350,71350,7,71453,71455,5,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,118528,118573,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,123566,123566,5,125136,125142,5,126976,126979,14,126981,127182,14,127184,127231,14,127279,127279,14,127344,127345,14,127374,127374,14,127405,127461,14,127489,127490,14,127514,127514,14,127538,127546,14,127561,127567,14,127570,127743,14,127757,127758,14,127760,127760,14,127762,127762,14,127766,127768,14,127770,127770,14,127772,127772,14,127775,127776,14,127778,127779,14,127789,127791,14,127794,127795,14,127798,127798,14,127819,127819,14,127824,127824,14,127868,127868,14,127870,127871,14,127892,127893,14,127896,127896,14,127900,127901,14,127904,127940,14,127942,127942,14,127944,127944,14,127946,127946,14,127951,127955,14,127968,127971,14,127973,127984,14,127987,127987,14,127989,127989,14,127991,127991,14,127995,127999,5,128008,128008,14,128012,128014,14,128017,128018,14,128020,128020,14,128022,128022,14,128042,128042,14,128063,128063,14,128065,128065,14,128101,128101,14,128108,128109,14,128173,128173,14,128182,128183,14,128236,128237,14,128239,128239,14,128245,128245,14,128248,128248,14,128253,128253,14,128255,128258,14,128260,128263,14,128265,128265,14,128277,128277,14,128300,128301,14,128326,128328,14,128331,128334,14,128336,128347,14,128360,128366,14,128369,128370,14,128378,128378,14,128391,128391,14,128394,128397,14,128400,128400,14,128405,128406,14,128420,128420,14,128422,128423,14,128425,128432,14,128435,128443,14,128445,128449,14,128453,128464,14,128468,128475,14,128479,128480,14,128482,128482,14,128484,128487,14,128489,128494,14,128496,128498,14,128500,128505,14,128507,128511,14,128513,128518,14,128521,128525,14,128527,128527,14,128529,128529,14,128533,128533,14,128535,128535,14,128537,128537,14]');\n}\n//#endregion\n/**\n * Computes the offset after performing a left delete on the given string,\n * while considering unicode grapheme/emoji rules.\n*/\nexport function getLeftDeleteOffset(offset, str) {\n if (offset === 0) {\n return 0;\n }\n // Try to delete emoji part.\n const emojiOffset = getOffsetBeforeLastEmojiComponent(offset, str);\n if (emojiOffset !== undefined) {\n return emojiOffset;\n }\n // Otherwise, just skip a single code point.\n const iterator = new CodePointIterator(str, offset);\n iterator.prevCodePoint();\n return iterator.offset;\n}\nfunction getOffsetBeforeLastEmojiComponent(initialOffset, str) {\n // See https://www.unicode.org/reports/tr51/tr51-14.html#EBNF_and_Regex for the\n // structure of emojis.\n const iterator = new CodePointIterator(str, initialOffset);\n let codePoint = iterator.prevCodePoint();\n // Skip modifiers\n while ((isEmojiModifier(codePoint) || codePoint === 65039 /* CodePoint.emojiVariantSelector */ || codePoint === 8419 /* CodePoint.enclosingKeyCap */)) {\n if (iterator.offset === 0) {\n // Cannot skip modifier, no preceding emoji base.\n return undefined;\n }\n codePoint = iterator.prevCodePoint();\n }\n // Expect base emoji\n if (!isEmojiImprecise(codePoint)) {\n // Unexpected code point, not a valid emoji.\n return undefined;\n }\n let resultOffset = iterator.offset;\n if (resultOffset > 0) {\n // Skip optional ZWJ code points that combine multiple emojis.\n // In theory, we should check if that ZWJ actually combines multiple emojis\n // to prevent deleting ZWJs in situations we didn't account for.\n const optionalZwjCodePoint = iterator.prevCodePoint();\n if (optionalZwjCodePoint === 8205 /* CodePoint.zwj */) {\n resultOffset = iterator.offset;\n }\n }\n return resultOffset;\n}\nfunction isEmojiModifier(codePoint) {\n return 0x1F3FB <= codePoint && codePoint <= 0x1F3FF;\n}\nexport const noBreakWhitespace = '\\xa0';\nexport class AmbiguousCharacters {\n static getInstance(locales) {\n return _a.cache.get(Array.from(locales));\n }\n static getLocales() {\n return _a._locales.value;\n }\n constructor(confusableDictionary) {\n this.confusableDictionary = confusableDictionary;\n }\n isAmbiguous(codePoint) {\n return this.confusableDictionary.has(codePoint);\n }\n /**\n * Returns the non basic ASCII code point that the given code point can be confused,\n * or undefined if such code point does note exist.\n */\n getPrimaryConfusable(codePoint) {\n return this.confusableDictionary.get(codePoint);\n }\n getConfusableCodePoints() {\n return new Set(this.confusableDictionary.keys());\n }\n}\n_a = AmbiguousCharacters;\nAmbiguousCharacters.ambiguousCharacterData = new Lazy(() => {\n // Generated using https://github.com/hediet/vscode-unicode-data\n // Stored as key1, value1, key2, value2, ...\n return JSON.parse('{\\\"_common\\\":[8232,32,8233,32,5760,32,8192,32,8193,32,8194,32,8195,32,8196,32,8197,32,8198,32,8200,32,8201,32,8202,32,8287,32,8199,32,8239,32,2042,95,65101,95,65102,95,65103,95,8208,45,8209,45,8210,45,65112,45,1748,45,8259,45,727,45,8722,45,10134,45,11450,45,1549,44,1643,44,8218,44,184,44,42233,44,894,59,2307,58,2691,58,1417,58,1795,58,1796,58,5868,58,65072,58,6147,58,6153,58,8282,58,1475,58,760,58,42889,58,8758,58,720,58,42237,58,451,33,11601,33,660,63,577,63,2429,63,5038,63,42731,63,119149,46,8228,46,1793,46,1794,46,42510,46,68176,46,1632,46,1776,46,42232,46,1373,96,65287,96,8219,96,8242,96,1370,96,1523,96,8175,96,65344,96,900,96,8189,96,8125,96,8127,96,8190,96,697,96,884,96,712,96,714,96,715,96,756,96,699,96,701,96,700,96,702,96,42892,96,1497,96,2036,96,2037,96,5194,96,5836,96,94033,96,94034,96,65339,91,10088,40,10098,40,12308,40,64830,40,65341,93,10089,41,10099,41,12309,41,64831,41,10100,123,119060,123,10101,125,65342,94,8270,42,1645,42,8727,42,66335,42,5941,47,8257,47,8725,47,8260,47,9585,47,10187,47,10744,47,119354,47,12755,47,12339,47,11462,47,20031,47,12035,47,65340,92,65128,92,8726,92,10189,92,10741,92,10745,92,119311,92,119355,92,12756,92,20022,92,12034,92,42872,38,708,94,710,94,5869,43,10133,43,66203,43,8249,60,10094,60,706,60,119350,60,5176,60,5810,60,5120,61,11840,61,12448,61,42239,61,8250,62,10095,62,707,62,119351,62,5171,62,94015,62,8275,126,732,126,8128,126,8764,126,65372,124,65293,45,120784,50,120794,50,120804,50,120814,50,120824,50,130034,50,42842,50,423,50,1000,50,42564,50,5311,50,42735,50,119302,51,120785,51,120795,51,120805,51,120815,51,120825,51,130035,51,42923,51,540,51,439,51,42858,51,11468,51,1248,51,94011,51,71882,51,120786,52,120796,52,120806,52,120816,52,120826,52,130036,52,5070,52,71855,52,120787,53,120797,53,120807,53,120817,53,120827,53,130037,53,444,53,71867,53,120788,54,120798,54,120808,54,120818,54,120828,54,130038,54,11474,54,5102,54,71893,54,119314,55,120789,55,120799,55,120809,55,120819,55,120829,55,130039,55,66770,55,71878,55,2819,56,2538,56,2666,56,125131,56,120790,56,120800,56,120810,56,120820,56,120830,56,130040,56,547,56,546,56,66330,56,2663,57,2920,57,2541,57,3437,57,120791,57,120801,57,120811,57,120821,57,120831,57,130041,57,42862,57,11466,57,71884,57,71852,57,71894,57,9082,97,65345,97,119834,97,119886,97,119938,97,119990,97,120042,97,120094,97,120146,97,120198,97,120250,97,120302,97,120354,97,120406,97,120458,97,593,97,945,97,120514,97,120572,97,120630,97,120688,97,120746,97,65313,65,119808,65,119860,65,119912,65,119964,65,120016,65,120068,65,120120,65,120172,65,120224,65,120276,65,120328,65,120380,65,120432,65,913,65,120488,65,120546,65,120604,65,120662,65,120720,65,5034,65,5573,65,42222,65,94016,65,66208,65,119835,98,119887,98,119939,98,119991,98,120043,98,120095,98,120147,98,120199,98,120251,98,120303,98,120355,98,120407,98,120459,98,388,98,5071,98,5234,98,5551,98,65314,66,8492,66,119809,66,119861,66,119913,66,120017,66,120069,66,120121,66,120173,66,120225,66,120277,66,120329,66,120381,66,120433,66,42932,66,914,66,120489,66,120547,66,120605,66,120663,66,120721,66,5108,66,5623,66,42192,66,66178,66,66209,66,66305,66,65347,99,8573,99,119836,99,119888,99,119940,99,119992,99,120044,99,120096,99,120148,99,120200,99,120252,99,120304,99,120356,99,120408,99,120460,99,7428,99,1010,99,11429,99,43951,99,66621,99,128844,67,71922,67,71913,67,65315,67,8557,67,8450,67,8493,67,119810,67,119862,67,119914,67,119966,67,120018,67,120174,67,120226,67,120278,67,120330,67,120382,67,120434,67,1017,67,11428,67,5087,67,42202,67,66210,67,66306,67,66581,67,66844,67,8574,100,8518,100,119837,100,119889,100,119941,100,119993,100,120045,100,120097,100,120149,100,120201,100,120253,100,120305,100,120357,100,120409,100,120461,100,1281,100,5095,100,5231,100,42194,100,8558,68,8517,68,119811,68,119863,68,119915,68,119967,68,120019,68,120071,68,120123,68,120175,68,120227,68,120279,68,120331,68,120383,68,120435,68,5024,68,5598,68,5610,68,42195,68,8494,101,65349,101,8495,101,8519,101,119838,101,119890,101,119942,101,120046,101,120098,101,120150,101,120202,101,120254,101,120306,101,120358,101,120410,101,120462,101,43826,101,1213,101,8959,69,65317,69,8496,69,119812,69,119864,69,119916,69,120020,69,120072,69,120124,69,120176,69,120228,69,120280,69,120332,69,120384,69,120436,69,917,69,120492,69,120550,69,120608,69,120666,69,120724,69,11577,69,5036,69,42224,69,71846,69,71854,69,66182,69,119839,102,119891,102,119943,102,119995,102,120047,102,120099,102,120151,102,120203,102,120255,102,120307,102,120359,102,120411,102,120463,102,43829,102,42905,102,383,102,7837,102,1412,102,119315,70,8497,70,119813,70,119865,70,119917,70,120021,70,120073,70,120125,70,120177,70,120229,70,120281,70,120333,70,120385,70,120437,70,42904,70,988,70,120778,70,5556,70,42205,70,71874,70,71842,70,66183,70,66213,70,66853,70,65351,103,8458,103,119840,103,119892,103,119944,103,120048,103,120100,103,120152,103,120204,103,120256,103,120308,103,120360,103,120412,103,120464,103,609,103,7555,103,397,103,1409,103,119814,71,119866,71,119918,71,119970,71,120022,71,120074,71,120126,71,120178,71,120230,71,120282,71,120334,71,120386,71,120438,71,1292,71,5056,71,5107,71,42198,71,65352,104,8462,104,119841,104,119945,104,119997,104,120049,104,120101,104,120153,104,120205,104,120257,104,120309,104,120361,104,120413,104,120465,104,1211,104,1392,104,5058,104,65320,72,8459,72,8460,72,8461,72,119815,72,119867,72,119919,72,120023,72,120179,72,120231,72,120283,72,120335,72,120387,72,120439,72,919,72,120494,72,120552,72,120610,72,120668,72,120726,72,11406,72,5051,72,5500,72,42215,72,66255,72,731,105,9075,105,65353,105,8560,105,8505,105,8520,105,119842,105,119894,105,119946,105,119998,105,120050,105,120102,105,120154,105,120206,105,120258,105,120310,105,120362,105,120414,105,120466,105,120484,105,618,105,617,105,953,105,8126,105,890,105,120522,105,120580,105,120638,105,120696,105,120754,105,1110,105,42567,105,1231,105,43893,105,5029,105,71875,105,65354,106,8521,106,119843,106,119895,106,119947,106,119999,106,120051,106,120103,106,120155,106,120207,106,120259,106,120311,106,120363,106,120415,106,120467,106,1011,106,1112,106,65322,74,119817,74,119869,74,119921,74,119973,74,120025,74,120077,74,120129,74,120181,74,120233,74,120285,74,120337,74,120389,74,120441,74,42930,74,895,74,1032,74,5035,74,5261,74,42201,74,119844,107,119896,107,119948,107,120000,107,120052,107,120104,107,120156,107,120208,107,120260,107,120312,107,120364,107,120416,107,120468,107,8490,75,65323,75,119818,75,119870,75,119922,75,119974,75,120026,75,120078,75,120130,75,120182,75,120234,75,120286,75,120338,75,120390,75,120442,75,922,75,120497,75,120555,75,120613,75,120671,75,120729,75,11412,75,5094,75,5845,75,42199,75,66840,75,1472,108,8739,73,9213,73,65512,73,1633,108,1777,73,66336,108,125127,108,120783,73,120793,73,120803,73,120813,73,120823,73,130033,73,65321,73,8544,73,8464,73,8465,73,119816,73,119868,73,119920,73,120024,73,120128,73,120180,73,120232,73,120284,73,120336,73,120388,73,120440,73,65356,108,8572,73,8467,108,119845,108,119897,108,119949,108,120001,108,120053,108,120105,73,120157,73,120209,73,120261,73,120313,73,120365,73,120417,73,120469,73,448,73,120496,73,120554,73,120612,73,120670,73,120728,73,11410,73,1030,73,1216,73,1493,108,1503,108,1575,108,126464,108,126592,108,65166,108,65165,108,1994,108,11599,73,5825,73,42226,73,93992,73,66186,124,66313,124,119338,76,8556,76,8466,76,119819,76,119871,76,119923,76,120027,76,120079,76,120131,76,120183,76,120235,76,120287,76,120339,76,120391,76,120443,76,11472,76,5086,76,5290,76,42209,76,93974,76,71843,76,71858,76,66587,76,66854,76,65325,77,8559,77,8499,77,119820,77,119872,77,119924,77,120028,77,120080,77,120132,77,120184,77,120236,77,120288,77,120340,77,120392,77,120444,77,924,77,120499,77,120557,77,120615,77,120673,77,120731,77,1018,77,11416,77,5047,77,5616,77,5846,77,42207,77,66224,77,66321,77,119847,110,119899,110,119951,110,120003,110,120055,110,120107,110,120159,110,120211,110,120263,110,120315,110,120367,110,120419,110,120471,110,1400,110,1404,110,65326,78,8469,78,119821,78,119873,78,119925,78,119977,78,120029,78,120081,78,120185,78,120237,78,120289,78,120341,78,120393,78,120445,78,925,78,120500,78,120558,78,120616,78,120674,78,120732,78,11418,78,42208,78,66835,78,3074,111,3202,111,3330,111,3458,111,2406,111,2662,111,2790,111,3046,111,3174,111,3302,111,3430,111,3664,111,3792,111,4160,111,1637,111,1781,111,65359,111,8500,111,119848,111,119900,111,119952,111,120056,111,120108,111,120160,111,120212,111,120264,111,120316,111,120368,111,120420,111,120472,111,7439,111,7441,111,43837,111,959,111,120528,111,120586,111,120644,111,120702,111,120760,111,963,111,120532,111,120590,111,120648,111,120706,111,120764,111,11423,111,4351,111,1413,111,1505,111,1607,111,126500,111,126564,111,126596,111,65259,111,65260,111,65258,111,65257,111,1726,111,64428,111,64429,111,64427,111,64426,111,1729,111,64424,111,64425,111,64423,111,64422,111,1749,111,3360,111,4125,111,66794,111,71880,111,71895,111,66604,111,1984,79,2534,79,2918,79,12295,79,70864,79,71904,79,120782,79,120792,79,120802,79,120812,79,120822,79,130032,79,65327,79,119822,79,119874,79,119926,79,119978,79,120030,79,120082,79,120134,79,120186,79,120238,79,120290,79,120342,79,120394,79,120446,79,927,79,120502,79,120560,79,120618,79,120676,79,120734,79,11422,79,1365,79,11604,79,4816,79,2848,79,66754,79,42227,79,71861,79,66194,79,66219,79,66564,79,66838,79,9076,112,65360,112,119849,112,119901,112,119953,112,120005,112,120057,112,120109,112,120161,112,120213,112,120265,112,120317,112,120369,112,120421,112,120473,112,961,112,120530,112,120544,112,120588,112,120602,112,120646,112,120660,112,120704,112,120718,112,120762,112,120776,112,11427,112,65328,80,8473,80,119823,80,119875,80,119927,80,119979,80,120031,80,120083,80,120187,80,120239,80,120291,80,120343,80,120395,80,120447,80,929,80,120504,80,120562,80,120620,80,120678,80,120736,80,11426,80,5090,80,5229,80,42193,80,66197,80,119850,113,119902,113,119954,113,120006,113,120058,113,120110,113,120162,113,120214,113,120266,113,120318,113,120370,113,120422,113,120474,113,1307,113,1379,113,1382,113,8474,81,119824,81,119876,81,119928,81,119980,81,120032,81,120084,81,120188,81,120240,81,120292,81,120344,81,120396,81,120448,81,11605,81,119851,114,119903,114,119955,114,120007,114,120059,114,120111,114,120163,114,120215,114,120267,114,120319,114,120371,114,120423,114,120475,114,43847,114,43848,114,7462,114,11397,114,43905,114,119318,82,8475,82,8476,82,8477,82,119825,82,119877,82,119929,82,120033,82,120189,82,120241,82,120293,82,120345,82,120397,82,120449,82,422,82,5025,82,5074,82,66740,82,5511,82,42211,82,94005,82,65363,115,119852,115,119904,115,119956,115,120008,115,120060,115,120112,115,120164,115,120216,115,120268,115,120320,115,120372,115,120424,115,120476,115,42801,115,445,115,1109,115,43946,115,71873,115,66632,115,65331,83,119826,83,119878,83,119930,83,119982,83,120034,83,120086,83,120138,83,120190,83,120242,83,120294,83,120346,83,120398,83,120450,83,1029,83,1359,83,5077,83,5082,83,42210,83,94010,83,66198,83,66592,83,119853,116,119905,116,119957,116,120009,116,120061,116,120113,116,120165,116,120217,116,120269,116,120321,116,120373,116,120425,116,120477,116,8868,84,10201,84,128872,84,65332,84,119827,84,119879,84,119931,84,119983,84,120035,84,120087,84,120139,84,120191,84,120243,84,120295,84,120347,84,120399,84,120451,84,932,84,120507,84,120565,84,120623,84,120681,84,120739,84,11430,84,5026,84,42196,84,93962,84,71868,84,66199,84,66225,84,66325,84,119854,117,119906,117,119958,117,120010,117,120062,117,120114,117,120166,117,120218,117,120270,117,120322,117,120374,117,120426,117,120478,117,42911,117,7452,117,43854,117,43858,117,651,117,965,117,120534,117,120592,117,120650,117,120708,117,120766,117,1405,117,66806,117,71896,117,8746,85,8899,85,119828,85,119880,85,119932,85,119984,85,120036,85,120088,85,120140,85,120192,85,120244,85,120296,85,120348,85,120400,85,120452,85,1357,85,4608,85,66766,85,5196,85,42228,85,94018,85,71864,85,8744,118,8897,118,65366,118,8564,118,119855,118,119907,118,119959,118,120011,118,120063,118,120115,118,120167,118,120219,118,120271,118,120323,118,120375,118,120427,118,120479,118,7456,118,957,118,120526,118,120584,118,120642,118,120700,118,120758,118,1141,118,1496,118,71430,118,43945,118,71872,118,119309,86,1639,86,1783,86,8548,86,119829,86,119881,86,119933,86,119985,86,120037,86,120089,86,120141,86,120193,86,120245,86,120297,86,120349,86,120401,86,120453,86,1140,86,11576,86,5081,86,5167,86,42719,86,42214,86,93960,86,71840,86,66845,86,623,119,119856,119,119908,119,119960,119,120012,119,120064,119,120116,119,120168,119,120220,119,120272,119,120324,119,120376,119,120428,119,120480,119,7457,119,1121,119,1309,119,1377,119,71434,119,71438,119,71439,119,43907,119,71919,87,71910,87,119830,87,119882,87,119934,87,119986,87,120038,87,120090,87,120142,87,120194,87,120246,87,120298,87,120350,87,120402,87,120454,87,1308,87,5043,87,5076,87,42218,87,5742,120,10539,120,10540,120,10799,120,65368,120,8569,120,119857,120,119909,120,119961,120,120013,120,120065,120,120117,120,120169,120,120221,120,120273,120,120325,120,120377,120,120429,120,120481,120,5441,120,5501,120,5741,88,9587,88,66338,88,71916,88,65336,88,8553,88,119831,88,119883,88,119935,88,119987,88,120039,88,120091,88,120143,88,120195,88,120247,88,120299,88,120351,88,120403,88,120455,88,42931,88,935,88,120510,88,120568,88,120626,88,120684,88,120742,88,11436,88,11613,88,5815,88,42219,88,66192,88,66228,88,66327,88,66855,88,611,121,7564,121,65369,121,119858,121,119910,121,119962,121,120014,121,120066,121,120118,121,120170,121,120222,121,120274,121,120326,121,120378,121,120430,121,120482,121,655,121,7935,121,43866,121,947,121,8509,121,120516,121,120574,121,120632,121,120690,121,120748,121,1199,121,4327,121,71900,121,65337,89,119832,89,119884,89,119936,89,119988,89,120040,89,120092,89,120144,89,120196,89,120248,89,120300,89,120352,89,120404,89,120456,89,933,89,978,89,120508,89,120566,89,120624,89,120682,89,120740,89,11432,89,1198,89,5033,89,5053,89,42220,89,94019,89,71844,89,66226,89,119859,122,119911,122,119963,122,120015,122,120067,122,120119,122,120171,122,120223,122,120275,122,120327,122,120379,122,120431,122,120483,122,7458,122,43923,122,71876,122,66293,90,71909,90,65338,90,8484,90,8488,90,119833,90,119885,90,119937,90,119989,90,120041,90,120197,90,120249,90,120301,90,120353,90,120405,90,120457,90,918,90,120493,90,120551,90,120609,90,120667,90,120725,90,5059,90,42204,90,71849,90,65282,34,65284,36,65285,37,65286,38,65290,42,65291,43,65294,46,65295,47,65296,48,65297,49,65298,50,65299,51,65300,52,65301,53,65302,54,65303,55,65304,56,65305,57,65308,60,65309,61,65310,62,65312,64,65316,68,65318,70,65319,71,65324,76,65329,81,65330,82,65333,85,65334,86,65335,87,65343,95,65346,98,65348,100,65350,102,65355,107,65357,109,65358,110,65361,113,65362,114,65364,116,65365,117,65367,119,65370,122,65371,123,65373,125,119846,109],\\\"_default\\\":[160,32,8211,45,65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"cs\\\":[65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"de\\\":[65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"es\\\":[8211,45,65374,126,65306,58,65281,33,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"fr\\\":[65374,126,65306,58,65281,33,8216,96,8245,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"it\\\":[160,32,8211,45,65374,126,65306,58,65281,33,8216,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"ja\\\":[8211,45,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65292,44,65307,59],\\\"ko\\\":[8211,45,65374,126,65306,58,65281,33,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"pl\\\":[65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"pt-BR\\\":[65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"qps-ploc\\\":[160,32,8211,45,65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"ru\\\":[65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,305,105,921,73,1009,112,215,120,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"tr\\\":[160,32,8211,45,65374,126,65306,58,65281,33,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"zh-hans\\\":[65374,126,65306,58,65281,33,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65288,40,65289,41],\\\"zh-hant\\\":[8211,45,65374,126,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65307,59]}');\n});\nAmbiguousCharacters.cache = new LRUCachedFunction((locales) => {\n function arrayToMap(arr) {\n const result = new Map();\n for (let i = 0; i < arr.length; i += 2) {\n result.set(arr[i], arr[i + 1]);\n }\n return result;\n }\n function mergeMaps(map1, map2) {\n const result = new Map(map1);\n for (const [key, value] of map2) {\n result.set(key, value);\n }\n return result;\n }\n function intersectMaps(map1, map2) {\n if (!map1) {\n return map2;\n }\n const result = new Map();\n for (const [key, value] of map1) {\n if (map2.has(key)) {\n result.set(key, value);\n }\n }\n return result;\n }\n const data = _a.ambiguousCharacterData.value;\n let filteredLocales = locales.filter((l) => !l.startsWith('_') && l in data);\n if (filteredLocales.length === 0) {\n filteredLocales = ['_default'];\n }\n let languageSpecificMap = undefined;\n for (const locale of filteredLocales) {\n const map = arrayToMap(data[locale]);\n languageSpecificMap = intersectMaps(languageSpecificMap, map);\n }\n const commonMap = arrayToMap(data['_common']);\n const map = mergeMaps(commonMap, languageSpecificMap);\n return new _a(map);\n});\nAmbiguousCharacters._locales = new Lazy(() => Object.keys(_a.ambiguousCharacterData.value).filter((k) => !k.startsWith('_')));\nexport class InvisibleCharacters {\n static getRawData() {\n // Generated using https://github.com/hediet/vscode-unicode-data\n return JSON.parse('[9,10,11,12,13,32,127,160,173,847,1564,4447,4448,6068,6069,6155,6156,6157,6158,7355,7356,8192,8193,8194,8195,8196,8197,8198,8199,8200,8201,8202,8203,8204,8205,8206,8207,8234,8235,8236,8237,8238,8239,8287,8288,8289,8290,8291,8292,8293,8294,8295,8296,8297,8298,8299,8300,8301,8302,8303,10240,12288,12644,65024,65025,65026,65027,65028,65029,65030,65031,65032,65033,65034,65035,65036,65037,65038,65039,65279,65440,65520,65521,65522,65523,65524,65525,65526,65527,65528,65532,78844,119155,119156,119157,119158,119159,119160,119161,119162,917504,917505,917506,917507,917508,917509,917510,917511,917512,917513,917514,917515,917516,917517,917518,917519,917520,917521,917522,917523,917524,917525,917526,917527,917528,917529,917530,917531,917532,917533,917534,917535,917536,917537,917538,917539,917540,917541,917542,917543,917544,917545,917546,917547,917548,917549,917550,917551,917552,917553,917554,917555,917556,917557,917558,917559,917560,917561,917562,917563,917564,917565,917566,917567,917568,917569,917570,917571,917572,917573,917574,917575,917576,917577,917578,917579,917580,917581,917582,917583,917584,917585,917586,917587,917588,917589,917590,917591,917592,917593,917594,917595,917596,917597,917598,917599,917600,917601,917602,917603,917604,917605,917606,917607,917608,917609,917610,917611,917612,917613,917614,917615,917616,917617,917618,917619,917620,917621,917622,917623,917624,917625,917626,917627,917628,917629,917630,917631,917760,917761,917762,917763,917764,917765,917766,917767,917768,917769,917770,917771,917772,917773,917774,917775,917776,917777,917778,917779,917780,917781,917782,917783,917784,917785,917786,917787,917788,917789,917790,917791,917792,917793,917794,917795,917796,917797,917798,917799,917800,917801,917802,917803,917804,917805,917806,917807,917808,917809,917810,917811,917812,917813,917814,917815,917816,917817,917818,917819,917820,917821,917822,917823,917824,917825,917826,917827,917828,917829,917830,917831,917832,917833,917834,917835,917836,917837,917838,917839,917840,917841,917842,917843,917844,917845,917846,917847,917848,917849,917850,917851,917852,917853,917854,917855,917856,917857,917858,917859,917860,917861,917862,917863,917864,917865,917866,917867,917868,917869,917870,917871,917872,917873,917874,917875,917876,917877,917878,917879,917880,917881,917882,917883,917884,917885,917886,917887,917888,917889,917890,917891,917892,917893,917894,917895,917896,917897,917898,917899,917900,917901,917902,917903,917904,917905,917906,917907,917908,917909,917910,917911,917912,917913,917914,917915,917916,917917,917918,917919,917920,917921,917922,917923,917924,917925,917926,917927,917928,917929,917930,917931,917932,917933,917934,917935,917936,917937,917938,917939,917940,917941,917942,917943,917944,917945,917946,917947,917948,917949,917950,917951,917952,917953,917954,917955,917956,917957,917958,917959,917960,917961,917962,917963,917964,917965,917966,917967,917968,917969,917970,917971,917972,917973,917974,917975,917976,917977,917978,917979,917980,917981,917982,917983,917984,917985,917986,917987,917988,917989,917990,917991,917992,917993,917994,917995,917996,917997,917998,917999]');\n }\n static getData() {\n if (!this._data) {\n this._data = new Set(InvisibleCharacters.getRawData());\n }\n return this._data;\n }\n static isInvisibleCharacter(codePoint) {\n return InvisibleCharacters.getData().has(codePoint);\n }\n static get codePoints() {\n return InvisibleCharacters.getData();\n }\n}\nInvisibleCharacters._data = undefined;\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\n/**\n * @returns whether the provided parameter is a JavaScript String or not.\n */\nexport function isString(str) {\n return (typeof str === 'string');\n}\n/**\n * @returns whether the provided parameter is of type `object` but **not**\n *\t`null`, an `array`, a `regexp`, nor a `date`.\n */\nexport function isObject(obj) {\n // The method can't do a type cast since there are type (like strings) which\n // are subclasses of any put not positvely matched by the function. Hence type\n // narrowing results in wrong results.\n return typeof obj === 'object'\n && obj !== null\n && !Array.isArray(obj)\n && !(obj instanceof RegExp)\n && !(obj instanceof Date);\n}\n/**\n * @returns whether the provided parameter is of type `Buffer` or Uint8Array dervived type\n */\nexport function isTypedArray(obj) {\n const TypedArray = Object.getPrototypeOf(Uint8Array);\n return typeof obj === 'object'\n && obj instanceof TypedArray;\n}\n/**\n * In **contrast** to just checking `typeof` this will return `false` for `NaN`.\n * @returns whether the provided parameter is a JavaScript Number or not.\n */\nexport function isNumber(obj) {\n return (typeof obj === 'number' && !isNaN(obj));\n}\n/**\n * @returns whether the provided parameter is an Iterable, casting to the given generic\n */\nexport function isIterable(obj) {\n return !!obj && typeof obj[Symbol.iterator] === 'function';\n}\n/**\n * @returns whether the provided parameter is a JavaScript Boolean or not.\n */\nexport function isBoolean(obj) {\n return (obj === true || obj === false);\n}\n/**\n * @returns whether the provided parameter is undefined.\n */\nexport function isUndefined(obj) {\n return (typeof obj === 'undefined');\n}\n/**\n * @returns whether the provided parameter is defined.\n */\nexport function isDefined(arg) {\n return !isUndefinedOrNull(arg);\n}\n/**\n * @returns whether the provided parameter is undefined or null.\n */\nexport function isUndefinedOrNull(obj) {\n return (isUndefined(obj) || obj === null);\n}\nexport function assertType(condition, type) {\n if (!condition) {\n throw new Error(type ? `Unexpected type, expected '${type}'` : 'Unexpected type');\n }\n}\n/**\n * Asserts that the argument passed in is neither undefined nor null.\n */\nexport function assertIsDefined(arg) {\n if (isUndefinedOrNull(arg)) {\n throw new Error('Assertion Failed: argument is undefined or null');\n }\n return arg;\n}\n/**\n * @returns whether the provided parameter is a JavaScript Function or not.\n */\nexport function isFunction(obj) {\n return (typeof obj === 'function');\n}\nexport function validateConstraints(args, constraints) {\n const len = Math.min(args.length, constraints.length);\n for (let i = 0; i < len; i++) {\n validateConstraint(args[i], constraints[i]);\n }\n}\nexport function validateConstraint(arg, constraint) {\n if (isString(constraint)) {\n if (typeof arg !== constraint) {\n throw new Error(`argument does not match constraint: typeof ${constraint}`);\n }\n }\n else if (isFunction(constraint)) {\n try {\n if (arg instanceof constraint) {\n return;\n }\n }\n catch (_a) {\n // ignore\n }\n if (!isUndefinedOrNull(arg) && arg.constructor === constraint) {\n return;\n }\n if (constraint.length === 1 && constraint.call(undefined, arg) === true) {\n return;\n }\n throw new Error(`argument does not match one of these constraints: arg instanceof constraint, arg.constructor === constraint, nor constraint(arg) === true`);\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nexport function toUint8(v) {\n if (v < 0) {\n return 0;\n }\n if (v > 255 /* Constants.MAX_UINT_8 */) {\n return 255 /* Constants.MAX_UINT_8 */;\n }\n return v | 0;\n}\nexport function toUint32(v) {\n if (v < 0) {\n return 0;\n }\n if (v > 4294967295 /* Constants.MAX_UINT_32 */) {\n return 4294967295 /* Constants.MAX_UINT_32 */;\n }\n return v | 0;\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport * as paths from './path.js';\nimport { isWindows } from './platform.js';\nconst _schemePattern = /^\\w[\\w\\d+.-]*$/;\nconst _singleSlashStart = /^\\//;\nconst _doubleSlashStart = /^\\/\\//;\nfunction _validateUri(ret, _strict) {\n // scheme, must be set\n if (!ret.scheme && _strict) {\n throw new Error(`[UriError]: Scheme is missing: {scheme: \"\", authority: \"${ret.authority}\", path: \"${ret.path}\", query: \"${ret.query}\", fragment: \"${ret.fragment}\"}`);\n }\n // scheme, https://tools.ietf.org/html/rfc3986#section-3.1\n // ALPHA *( ALPHA / DIGIT / \"+\" / \"-\" / \".\" )\n if (ret.scheme && !_schemePattern.test(ret.scheme)) {\n throw new Error('[UriError]: Scheme contains illegal characters.');\n }\n // path, http://tools.ietf.org/html/rfc3986#section-3.3\n // If a URI contains an authority component, then the path component\n // must either be empty or begin with a slash (\"/\") character. If a URI\n // does not contain an authority component, then the path cannot begin\n // with two slash characters (\"//\").\n if (ret.path) {\n if (ret.authority) {\n if (!_singleSlashStart.test(ret.path)) {\n 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');\n }\n }\n else {\n if (_doubleSlashStart.test(ret.path)) {\n throw new Error('[UriError]: If a URI does not contain an authority component, then the path cannot begin with two slash characters (\"//\")');\n }\n }\n }\n}\n// for a while we allowed uris *without* schemes and this is the migration\n// for them, e.g. an uri without scheme and without strict-mode warns and falls\n// back to the file-scheme. that should cause the least carnage and still be a\n// clear warning\nfunction _schemeFix(scheme, _strict) {\n if (!scheme && !_strict) {\n return 'file';\n }\n return scheme;\n}\n// implements a bit of https://tools.ietf.org/html/rfc3986#section-5\nfunction _referenceResolution(scheme, path) {\n // the slash-character is our 'default base' as we don't\n // support constructing URIs relative to other URIs. This\n // also means that we alter and potentially break paths.\n // see https://tools.ietf.org/html/rfc3986#section-5.1.4\n switch (scheme) {\n case 'https':\n case 'http':\n case 'file':\n if (!path) {\n path = _slash;\n }\n else if (path[0] !== _slash) {\n path = _slash + path;\n }\n break;\n }\n return path;\n}\nconst _empty = '';\nconst _slash = '/';\nconst _regexp = /^(([^:/?#]+?):)?(\\/\\/([^/?#]*))?([^?#]*)(\\?([^#]*))?(#(.*))?/;\n/**\n * Uniform Resource Identifier (URI) http://tools.ietf.org/html/rfc3986.\n * This class is a simple parser which creates the basic component parts\n * (http://tools.ietf.org/html/rfc3986#section-3) with minimal validation\n * and encoding.\n *\n * ```txt\n * foo://example.com:8042/over/there?name=ferret#nose\n * \\_/ \\______________/\\_________/ \\_________/ \\__/\n * | | | | |\n * scheme authority path query fragment\n * | _____________________|__\n * / \\ / \\\n * urn:example:animal:ferret:nose\n * ```\n */\nexport class URI {\n static isUri(thing) {\n if (thing instanceof URI) {\n return true;\n }\n if (!thing) {\n return false;\n }\n return typeof thing.authority === 'string'\n && typeof thing.fragment === 'string'\n && typeof thing.path === 'string'\n && typeof thing.query === 'string'\n && typeof thing.scheme === 'string'\n && typeof thing.fsPath === 'string'\n && typeof thing.with === 'function'\n && typeof thing.toString === 'function';\n }\n /**\n * @internal\n */\n constructor(schemeOrData, authority, path, query, fragment, _strict = false) {\n if (typeof schemeOrData === 'object') {\n this.scheme = schemeOrData.scheme || _empty;\n this.authority = schemeOrData.authority || _empty;\n this.path = schemeOrData.path || _empty;\n this.query = schemeOrData.query || _empty;\n this.fragment = schemeOrData.fragment || _empty;\n // no validation because it's this URI\n // that creates uri components.\n // _validateUri(this);\n }\n else {\n this.scheme = _schemeFix(schemeOrData, _strict);\n this.authority = authority || _empty;\n this.path = _referenceResolution(this.scheme, path || _empty);\n this.query = query || _empty;\n this.fragment = fragment || _empty;\n _validateUri(this, _strict);\n }\n }\n // ---- filesystem path -----------------------\n /**\n * Returns a string representing the corresponding file system path of this URI.\n * Will handle UNC paths, normalizes windows drive letters to lower-case, and uses the\n * platform specific path separator.\n *\n * * Will *not* validate the path for invalid characters and semantics.\n * * Will *not* look at the scheme of this URI.\n * * The result shall *not* be used for display purposes but for accessing a file on disk.\n *\n *\n * The *difference* to `URI#path` is the use of the platform specific separator and the handling\n * of UNC paths. See the below sample of a file-uri with an authority (UNC path).\n *\n * ```ts\n const u = URI.parse('file://server/c$/folder/file.txt')\n u.authority === 'server'\n u.path === '/shares/c$/file.txt'\n u.fsPath === '\\\\server\\c$\\folder\\file.txt'\n ```\n *\n * Using `URI#path` to read a file (using fs-apis) would not be enough because parts of the path,\n * namely the server name, would be missing. Therefore `URI#fsPath` exists - it's sugar to ease working\n * with URIs that represent files on disk (`file` scheme).\n */\n get fsPath() {\n // if (this.scheme !== 'file') {\n // \tconsole.warn(`[UriError] calling fsPath with scheme ${this.scheme}`);\n // }\n return uriToFsPath(this, false);\n }\n // ---- modify to new -------------------------\n with(change) {\n if (!change) {\n return this;\n }\n let { scheme, authority, path, query, fragment } = change;\n if (scheme === undefined) {\n scheme = this.scheme;\n }\n else if (scheme === null) {\n scheme = _empty;\n }\n if (authority === undefined) {\n authority = this.authority;\n }\n else if (authority === null) {\n authority = _empty;\n }\n if (path === undefined) {\n path = this.path;\n }\n else if (path === null) {\n path = _empty;\n }\n if (query === undefined) {\n query = this.query;\n }\n else if (query === null) {\n query = _empty;\n }\n if (fragment === undefined) {\n fragment = this.fragment;\n }\n else if (fragment === null) {\n fragment = _empty;\n }\n if (scheme === this.scheme\n && authority === this.authority\n && path === this.path\n && query === this.query\n && fragment === this.fragment) {\n return this;\n }\n return new Uri(scheme, authority, path, query, fragment);\n }\n // ---- parse & validate ------------------------\n /**\n * Creates a new URI from a string, e.g. `http://www.example.com/some/path`,\n * `file:///usr/home`, or `scheme:with/path`.\n *\n * @param value A string which represents an URI (see `URI#toString`).\n */\n static parse(value, _strict = false) {\n const match = _regexp.exec(value);\n if (!match) {\n return new Uri(_empty, _empty, _empty, _empty, _empty);\n }\n return new Uri(match[2] || _empty, percentDecode(match[4] || _empty), percentDecode(match[5] || _empty), percentDecode(match[7] || _empty), percentDecode(match[9] || _empty), _strict);\n }\n /**\n * Creates a new URI from a file system path, e.g. `c:\\my\\files`,\n * `/usr/home`, or `\\\\server\\share\\some\\path`.\n *\n * The *difference* between `URI#parse` and `URI#file` is that the latter treats the argument\n * as path, not as stringified-uri. E.g. `URI.file(path)` is **not the same as**\n * `URI.parse('file://' + path)` because the path might contain characters that are\n * interpreted (# and ?). See the following sample:\n * ```ts\n const good = URI.file('/coding/c#/project1');\n good.scheme === 'file';\n good.path === '/coding/c#/project1';\n good.fragment === '';\n const bad = URI.parse('file://' + '/coding/c#/project1');\n bad.scheme === 'file';\n bad.path === '/coding/c'; // path is now broken\n bad.fragment === '/project1';\n ```\n *\n * @param path A file system path (see `URI#fsPath`)\n */\n static file(path) {\n let authority = _empty;\n // normalize to fwd-slashes on windows,\n // on other systems bwd-slashes are valid\n // filename character, eg /f\\oo/ba\\r.txt\n if (isWindows) {\n path = path.replace(/\\\\/g, _slash);\n }\n // check for authority as used in UNC shares\n // or use the path as given\n if (path[0] === _slash && path[1] === _slash) {\n const idx = path.indexOf(_slash, 2);\n if (idx === -1) {\n authority = path.substring(2);\n path = _slash;\n }\n else {\n authority = path.substring(2, idx);\n path = path.substring(idx) || _slash;\n }\n }\n return new Uri('file', authority, path, _empty, _empty);\n }\n /**\n * Creates new URI from uri components.\n *\n * Unless `strict` is `true` the scheme is defaults to be `file`. This function performs\n * validation and should be used for untrusted uri components retrieved from storage,\n * user input, command arguments etc\n */\n static from(components, strict) {\n const result = new Uri(components.scheme, components.authority, components.path, components.query, components.fragment, strict);\n return result;\n }\n /**\n * Join a URI path with path fragments and normalizes the resulting path.\n *\n * @param uri The input URI.\n * @param pathFragment The path fragment to add to the URI path.\n * @returns The resulting URI.\n */\n static joinPath(uri, ...pathFragment) {\n if (!uri.path) {\n throw new Error(`[UriError]: cannot call joinPath on URI without path`);\n }\n let newPath;\n if (isWindows && uri.scheme === 'file') {\n newPath = URI.file(paths.win32.join(uriToFsPath(uri, true), ...pathFragment)).path;\n }\n else {\n newPath = paths.posix.join(uri.path, ...pathFragment);\n }\n return uri.with({ path: newPath });\n }\n // ---- printing/externalize ---------------------------\n /**\n * Creates a string representation for this URI. It's guaranteed that calling\n * `URI.parse` with the result of this function creates an URI which is equal\n * to this URI.\n *\n * * The result shall *not* be used for display purposes but for externalization or transport.\n * * The result will be encoded using the percentage encoding and encoding happens mostly\n * ignore the scheme-specific encoding rules.\n *\n * @param skipEncoding Do not encode the result, default is `false`\n */\n toString(skipEncoding = false) {\n return _asFormatted(this, skipEncoding);\n }\n toJSON() {\n return this;\n }\n static revive(data) {\n var _a, _b;\n if (!data) {\n return data;\n }\n else if (data instanceof URI) {\n return data;\n }\n else {\n const result = new Uri(data);\n result._formatted = (_a = data.external) !== null && _a !== void 0 ? _a : null;\n result._fsPath = data._sep === _pathSepMarker ? (_b = data.fsPath) !== null && _b !== void 0 ? _b : null : null;\n return result;\n }\n }\n}\nconst _pathSepMarker = isWindows ? 1 : undefined;\n// This class exists so that URI is compatible with vscode.Uri (API).\nclass Uri extends URI {\n constructor() {\n super(...arguments);\n this._formatted = null;\n this._fsPath = null;\n }\n get fsPath() {\n if (!this._fsPath) {\n this._fsPath = uriToFsPath(this, false);\n }\n return this._fsPath;\n }\n toString(skipEncoding = false) {\n if (!skipEncoding) {\n if (!this._formatted) {\n this._formatted = _asFormatted(this, false);\n }\n return this._formatted;\n }\n else {\n // we don't cache that\n return _asFormatted(this, true);\n }\n }\n toJSON() {\n const res = {\n $mid: 1 /* MarshalledId.Uri */\n };\n // cached state\n if (this._fsPath) {\n res.fsPath = this._fsPath;\n res._sep = _pathSepMarker;\n }\n if (this._formatted) {\n res.external = this._formatted;\n }\n //--- uri components\n if (this.path) {\n res.path = this.path;\n }\n // TODO\n // this isn't correct and can violate the UriComponents contract but\n // this is part of the vscode.Uri API and we shouldn't change how that\n // works anymore\n if (this.scheme) {\n res.scheme = this.scheme;\n }\n if (this.authority) {\n res.authority = this.authority;\n }\n if (this.query) {\n res.query = this.query;\n }\n if (this.fragment) {\n res.fragment = this.fragment;\n }\n return res;\n }\n}\n// reserved characters: https://tools.ietf.org/html/rfc3986#section-2.2\nconst encodeTable = {\n [58 /* CharCode.Colon */]: '%3A', // gen-delims\n [47 /* CharCode.Slash */]: '%2F',\n [63 /* CharCode.QuestionMark */]: '%3F',\n [35 /* CharCode.Hash */]: '%23',\n [91 /* CharCode.OpenSquareBracket */]: '%5B',\n [93 /* CharCode.CloseSquareBracket */]: '%5D',\n [64 /* CharCode.AtSign */]: '%40',\n [33 /* CharCode.ExclamationMark */]: '%21', // sub-delims\n [36 /* CharCode.DollarSign */]: '%24',\n [38 /* CharCode.Ampersand */]: '%26',\n [39 /* CharCode.SingleQuote */]: '%27',\n [40 /* CharCode.OpenParen */]: '%28',\n [41 /* CharCode.CloseParen */]: '%29',\n [42 /* CharCode.Asterisk */]: '%2A',\n [43 /* CharCode.Plus */]: '%2B',\n [44 /* CharCode.Comma */]: '%2C',\n [59 /* CharCode.Semicolon */]: '%3B',\n [61 /* CharCode.Equals */]: '%3D',\n [32 /* CharCode.Space */]: '%20',\n};\nfunction encodeURIComponentFast(uriComponent, isPath, isAuthority) {\n let res = undefined;\n let nativeEncodePos = -1;\n for (let pos = 0; pos < uriComponent.length; pos++) {\n const code = uriComponent.charCodeAt(pos);\n // unreserved characters: https://tools.ietf.org/html/rfc3986#section-2.3\n if ((code >= 97 /* CharCode.a */ && code <= 122 /* CharCode.z */)\n || (code >= 65 /* CharCode.A */ && code <= 90 /* CharCode.Z */)\n || (code >= 48 /* CharCode.Digit0 */ && code <= 57 /* CharCode.Digit9 */)\n || code === 45 /* CharCode.Dash */\n || code === 46 /* CharCode.Period */\n || code === 95 /* CharCode.Underline */\n || code === 126 /* CharCode.Tilde */\n || (isPath && code === 47 /* CharCode.Slash */)\n || (isAuthority && code === 91 /* CharCode.OpenSquareBracket */)\n || (isAuthority && code === 93 /* CharCode.CloseSquareBracket */)\n || (isAuthority && code === 58 /* CharCode.Colon */)) {\n // check if we are delaying native encode\n if (nativeEncodePos !== -1) {\n res += encodeURIComponent(uriComponent.substring(nativeEncodePos, pos));\n nativeEncodePos = -1;\n }\n // check if we write into a new string (by default we try to return the param)\n if (res !== undefined) {\n res += uriComponent.charAt(pos);\n }\n }\n else {\n // encoding needed, we need to allocate a new string\n if (res === undefined) {\n res = uriComponent.substr(0, pos);\n }\n // check with default table first\n const escaped = encodeTable[code];\n if (escaped !== undefined) {\n // check if we are delaying native encode\n if (nativeEncodePos !== -1) {\n res += encodeURIComponent(uriComponent.substring(nativeEncodePos, pos));\n nativeEncodePos = -1;\n }\n // append escaped variant to result\n res += escaped;\n }\n else if (nativeEncodePos === -1) {\n // use native encode only when needed\n nativeEncodePos = pos;\n }\n }\n }\n if (nativeEncodePos !== -1) {\n res += encodeURIComponent(uriComponent.substring(nativeEncodePos));\n }\n return res !== undefined ? res : uriComponent;\n}\nfunction encodeURIComponentMinimal(path) {\n let res = undefined;\n for (let pos = 0; pos < path.length; pos++) {\n const code = path.charCodeAt(pos);\n if (code === 35 /* CharCode.Hash */ || code === 63 /* CharCode.QuestionMark */) {\n if (res === undefined) {\n res = path.substr(0, pos);\n }\n res += encodeTable[code];\n }\n else {\n if (res !== undefined) {\n res += path[pos];\n }\n }\n }\n return res !== undefined ? res : path;\n}\n/**\n * Compute `fsPath` for the given uri\n */\nexport function uriToFsPath(uri, keepDriveLetterCasing) {\n let value;\n if (uri.authority && uri.path.length > 1 && uri.scheme === 'file') {\n // unc path: file://shares/c$/far/boo\n value = `//${uri.authority}${uri.path}`;\n }\n else if (uri.path.charCodeAt(0) === 47 /* CharCode.Slash */\n && (uri.path.charCodeAt(1) >= 65 /* CharCode.A */ && uri.path.charCodeAt(1) <= 90 /* CharCode.Z */ || uri.path.charCodeAt(1) >= 97 /* CharCode.a */ && uri.path.charCodeAt(1) <= 122 /* CharCode.z */)\n && uri.path.charCodeAt(2) === 58 /* CharCode.Colon */) {\n if (!keepDriveLetterCasing) {\n // windows drive letter: file:///c:/far/boo\n value = uri.path[1].toLowerCase() + uri.path.substr(2);\n }\n else {\n value = uri.path.substr(1);\n }\n }\n else {\n // other path\n value = uri.path;\n }\n if (isWindows) {\n value = value.replace(/\\//g, '\\\\');\n }\n return value;\n}\n/**\n * Create the external version of a uri\n */\nfunction _asFormatted(uri, skipEncoding) {\n const encoder = !skipEncoding\n ? encodeURIComponentFast\n : encodeURIComponentMinimal;\n let res = '';\n let { scheme, authority, path, query, fragment } = uri;\n if (scheme) {\n res += scheme;\n res += ':';\n }\n if (authority || scheme === 'file') {\n res += _slash;\n res += _slash;\n }\n if (authority) {\n let idx = authority.indexOf('@');\n if (idx !== -1) {\n // @\n const userinfo = authority.substr(0, idx);\n authority = authority.substr(idx + 1);\n idx = userinfo.lastIndexOf(':');\n if (idx === -1) {\n res += encoder(userinfo, false, false);\n }\n else {\n // :@\n res += encoder(userinfo.substr(0, idx), false, false);\n res += ':';\n res += encoder(userinfo.substr(idx + 1), false, true);\n }\n res += '@';\n }\n authority = authority.toLowerCase();\n idx = authority.lastIndexOf(':');\n if (idx === -1) {\n res += encoder(authority, false, true);\n }\n else {\n // :\n res += encoder(authority.substr(0, idx), false, true);\n res += authority.substr(idx);\n }\n }\n if (path) {\n // lower-case windows drive letters in /C:/fff or C:/fff\n if (path.length >= 3 && path.charCodeAt(0) === 47 /* CharCode.Slash */ && path.charCodeAt(2) === 58 /* CharCode.Colon */) {\n const code = path.charCodeAt(1);\n if (code >= 65 /* CharCode.A */ && code <= 90 /* CharCode.Z */) {\n path = `/${String.fromCharCode(code + 32)}:${path.substr(3)}`; // \"/c:\".length === 3\n }\n }\n else if (path.length >= 2 && path.charCodeAt(1) === 58 /* CharCode.Colon */) {\n const code = path.charCodeAt(0);\n if (code >= 65 /* CharCode.A */ && code <= 90 /* CharCode.Z */) {\n path = `${String.fromCharCode(code + 32)}:${path.substr(2)}`; // \"/c:\".length === 3\n }\n }\n // encode the rest of the path\n res += encoder(path, true, false);\n }\n if (query) {\n res += '?';\n res += encoder(query, false, false);\n }\n if (fragment) {\n res += '#';\n res += !skipEncoding ? encodeURIComponentFast(fragment, false, false) : fragment;\n }\n return res;\n}\n// --- decode\nfunction decodeURIComponentGraceful(str) {\n try {\n return decodeURIComponent(str);\n }\n catch (_a) {\n if (str.length > 3) {\n return str.substr(0, 3) + decodeURIComponentGraceful(str.substr(3));\n }\n else {\n return str;\n }\n }\n}\nconst _rEncodedAsHex = /(%[0-9A-Za-z][0-9A-Za-z])+/g;\nfunction percentDecode(str) {\n if (!str.match(_rEncodedAsHex)) {\n return str;\n }\n return str.replace(_rEncodedAsHex, (match) => decodeURIComponentGraceful(match));\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { transformErrorForSerialization } from '../errors.js';\nimport { Emitter } from '../event.js';\nimport { Disposable } from '../lifecycle.js';\nimport { getAllMethodNames } from '../objects.js';\nimport { isWeb } from '../platform.js';\nimport * as strings from '../strings.js';\nconst INITIALIZE = '$initialize';\nlet webWorkerWarningLogged = false;\nexport function logOnceWebWorkerWarning(err) {\n if (!isWeb) {\n // running tests\n return;\n }\n if (!webWorkerWarningLogged) {\n webWorkerWarningLogged = true;\n 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');\n }\n console.warn(err.message);\n}\nclass RequestMessage {\n constructor(vsWorker, req, method, args) {\n this.vsWorker = vsWorker;\n this.req = req;\n this.method = method;\n this.args = args;\n this.type = 0 /* MessageType.Request */;\n }\n}\nclass ReplyMessage {\n constructor(vsWorker, seq, res, err) {\n this.vsWorker = vsWorker;\n this.seq = seq;\n this.res = res;\n this.err = err;\n this.type = 1 /* MessageType.Reply */;\n }\n}\nclass SubscribeEventMessage {\n constructor(vsWorker, req, eventName, arg) {\n this.vsWorker = vsWorker;\n this.req = req;\n this.eventName = eventName;\n this.arg = arg;\n this.type = 2 /* MessageType.SubscribeEvent */;\n }\n}\nclass EventMessage {\n constructor(vsWorker, req, event) {\n this.vsWorker = vsWorker;\n this.req = req;\n this.event = event;\n this.type = 3 /* MessageType.Event */;\n }\n}\nclass UnsubscribeEventMessage {\n constructor(vsWorker, req) {\n this.vsWorker = vsWorker;\n this.req = req;\n this.type = 4 /* MessageType.UnsubscribeEvent */;\n }\n}\nclass SimpleWorkerProtocol {\n constructor(handler) {\n this._workerId = -1;\n this._handler = handler;\n this._lastSentReq = 0;\n this._pendingReplies = Object.create(null);\n this._pendingEmitters = new Map();\n this._pendingEvents = new Map();\n }\n setWorkerId(workerId) {\n this._workerId = workerId;\n }\n sendMessage(method, args) {\n const req = String(++this._lastSentReq);\n return new Promise((resolve, reject) => {\n this._pendingReplies[req] = {\n resolve: resolve,\n reject: reject\n };\n this._send(new RequestMessage(this._workerId, req, method, args));\n });\n }\n listen(eventName, arg) {\n let req = null;\n const emitter = new Emitter({\n onWillAddFirstListener: () => {\n req = String(++this._lastSentReq);\n this._pendingEmitters.set(req, emitter);\n this._send(new SubscribeEventMessage(this._workerId, req, eventName, arg));\n },\n onDidRemoveLastListener: () => {\n this._pendingEmitters.delete(req);\n this._send(new UnsubscribeEventMessage(this._workerId, req));\n req = null;\n }\n });\n return emitter.event;\n }\n handleMessage(message) {\n if (!message || !message.vsWorker) {\n return;\n }\n if (this._workerId !== -1 && message.vsWorker !== this._workerId) {\n return;\n }\n this._handleMessage(message);\n }\n _handleMessage(msg) {\n switch (msg.type) {\n case 1 /* MessageType.Reply */:\n return this._handleReplyMessage(msg);\n case 0 /* MessageType.Request */:\n return this._handleRequestMessage(msg);\n case 2 /* MessageType.SubscribeEvent */:\n return this._handleSubscribeEventMessage(msg);\n case 3 /* MessageType.Event */:\n return this._handleEventMessage(msg);\n case 4 /* MessageType.UnsubscribeEvent */:\n return this._handleUnsubscribeEventMessage(msg);\n }\n }\n _handleReplyMessage(replyMessage) {\n if (!this._pendingReplies[replyMessage.seq]) {\n console.warn('Got reply to unknown seq');\n return;\n }\n const reply = this._pendingReplies[replyMessage.seq];\n delete this._pendingReplies[replyMessage.seq];\n if (replyMessage.err) {\n let err = replyMessage.err;\n if (replyMessage.err.$isError) {\n err = new Error();\n err.name = replyMessage.err.name;\n err.message = replyMessage.err.message;\n err.stack = replyMessage.err.stack;\n }\n reply.reject(err);\n return;\n }\n reply.resolve(replyMessage.res);\n }\n _handleRequestMessage(requestMessage) {\n const req = requestMessage.req;\n const result = this._handler.handleMessage(requestMessage.method, requestMessage.args);\n result.then((r) => {\n this._send(new ReplyMessage(this._workerId, req, r, undefined));\n }, (e) => {\n if (e.detail instanceof Error) {\n // Loading errors have a detail property that points to the actual error\n e.detail = transformErrorForSerialization(e.detail);\n }\n this._send(new ReplyMessage(this._workerId, req, undefined, transformErrorForSerialization(e)));\n });\n }\n _handleSubscribeEventMessage(msg) {\n const req = msg.req;\n const disposable = this._handler.handleEvent(msg.eventName, msg.arg)((event) => {\n this._send(new EventMessage(this._workerId, req, event));\n });\n this._pendingEvents.set(req, disposable);\n }\n _handleEventMessage(msg) {\n if (!this._pendingEmitters.has(msg.req)) {\n console.warn('Got event for unknown req');\n return;\n }\n this._pendingEmitters.get(msg.req).fire(msg.event);\n }\n _handleUnsubscribeEventMessage(msg) {\n if (!this._pendingEvents.has(msg.req)) {\n console.warn('Got unsubscribe for unknown req');\n return;\n }\n this._pendingEvents.get(msg.req).dispose();\n this._pendingEvents.delete(msg.req);\n }\n _send(msg) {\n const transfer = [];\n if (msg.type === 0 /* MessageType.Request */) {\n for (let i = 0; i < msg.args.length; i++) {\n if (msg.args[i] instanceof ArrayBuffer) {\n transfer.push(msg.args[i]);\n }\n }\n }\n else if (msg.type === 1 /* MessageType.Reply */) {\n if (msg.res instanceof ArrayBuffer) {\n transfer.push(msg.res);\n }\n }\n this._handler.sendMessage(msg, transfer);\n }\n}\n/**\n * Main thread side\n */\nexport class SimpleWorkerClient extends Disposable {\n constructor(workerFactory, moduleId, host) {\n super();\n let lazyProxyReject = null;\n this._worker = this._register(workerFactory.create('vs/base/common/worker/simpleWorker', (msg) => {\n this._protocol.handleMessage(msg);\n }, (err) => {\n // in Firefox, web workers fail lazily :(\n // we will reject the proxy\n lazyProxyReject === null || lazyProxyReject === void 0 ? void 0 : lazyProxyReject(err);\n }));\n this._protocol = new SimpleWorkerProtocol({\n sendMessage: (msg, transfer) => {\n this._worker.postMessage(msg, transfer);\n },\n handleMessage: (method, args) => {\n if (typeof host[method] !== 'function') {\n return Promise.reject(new Error('Missing method ' + method + ' on main thread host.'));\n }\n try {\n return Promise.resolve(host[method].apply(host, args));\n }\n catch (e) {\n return Promise.reject(e);\n }\n },\n handleEvent: (eventName, arg) => {\n if (propertyIsDynamicEvent(eventName)) {\n const event = host[eventName].call(host, arg);\n if (typeof event !== 'function') {\n throw new Error(`Missing dynamic event ${eventName} on main thread host.`);\n }\n return event;\n }\n if (propertyIsEvent(eventName)) {\n const event = host[eventName];\n if (typeof event !== 'function') {\n throw new Error(`Missing event ${eventName} on main thread host.`);\n }\n return event;\n }\n throw new Error(`Malformed event name ${eventName}`);\n }\n });\n this._protocol.setWorkerId(this._worker.getId());\n // Gather loader configuration\n let loaderConfiguration = null;\n const globalRequire = globalThis.require;\n if (typeof globalRequire !== 'undefined' && typeof globalRequire.getConfig === 'function') {\n // Get the configuration from the Monaco AMD Loader\n loaderConfiguration = globalRequire.getConfig();\n }\n else if (typeof globalThis.requirejs !== 'undefined') {\n // Get the configuration from requirejs\n loaderConfiguration = globalThis.requirejs.s.contexts._.config;\n }\n const hostMethods = getAllMethodNames(host);\n // Send initialize message\n this._onModuleLoaded = this._protocol.sendMessage(INITIALIZE, [\n this._worker.getId(),\n JSON.parse(JSON.stringify(loaderConfiguration)),\n moduleId,\n hostMethods,\n ]);\n // Create proxy to loaded code\n const proxyMethodRequest = (method, args) => {\n return this._request(method, args);\n };\n const proxyListen = (eventName, arg) => {\n return this._protocol.listen(eventName, arg);\n };\n this._lazyProxy = new Promise((resolve, reject) => {\n lazyProxyReject = reject;\n this._onModuleLoaded.then((availableMethods) => {\n resolve(createProxyObject(availableMethods, proxyMethodRequest, proxyListen));\n }, (e) => {\n reject(e);\n this._onError('Worker failed to load ' + moduleId, e);\n });\n });\n }\n getProxyObject() {\n return this._lazyProxy;\n }\n _request(method, args) {\n return new Promise((resolve, reject) => {\n this._onModuleLoaded.then(() => {\n this._protocol.sendMessage(method, args).then(resolve, reject);\n }, reject);\n });\n }\n _onError(message, error) {\n console.error(message);\n console.info(error);\n }\n}\nfunction propertyIsEvent(name) {\n // Assume a property is an event if it has a form of \"onSomething\"\n return name[0] === 'o' && name[1] === 'n' && strings.isUpperAsciiLetter(name.charCodeAt(2));\n}\nfunction propertyIsDynamicEvent(name) {\n // Assume a property is a dynamic event (a method that returns an event) if it has a form of \"onDynamicSomething\"\n return /^onDynamic/.test(name) && strings.isUpperAsciiLetter(name.charCodeAt(9));\n}\nfunction createProxyObject(methodNames, invoke, proxyListen) {\n const createProxyMethod = (method) => {\n return function () {\n const args = Array.prototype.slice.call(arguments, 0);\n return invoke(method, args);\n };\n };\n const createProxyDynamicEvent = (eventName) => {\n return function (arg) {\n return proxyListen(eventName, arg);\n };\n };\n const result = {};\n for (const methodName of methodNames) {\n if (propertyIsDynamicEvent(methodName)) {\n result[methodName] = createProxyDynamicEvent(methodName);\n continue;\n }\n if (propertyIsEvent(methodName)) {\n result[methodName] = proxyListen(methodName, undefined);\n continue;\n }\n result[methodName] = createProxyMethod(methodName);\n }\n return result;\n}\n/**\n * Worker side\n */\nexport class SimpleWorkerServer {\n constructor(postMessage, requestHandlerFactory) {\n this._requestHandlerFactory = requestHandlerFactory;\n this._requestHandler = null;\n this._protocol = new SimpleWorkerProtocol({\n sendMessage: (msg, transfer) => {\n postMessage(msg, transfer);\n },\n handleMessage: (method, args) => this._handleMessage(method, args),\n handleEvent: (eventName, arg) => this._handleEvent(eventName, arg)\n });\n }\n onmessage(msg) {\n this._protocol.handleMessage(msg);\n }\n _handleMessage(method, args) {\n if (method === INITIALIZE) {\n return this.initialize(args[0], args[1], args[2], args[3]);\n }\n if (!this._requestHandler || typeof this._requestHandler[method] !== 'function') {\n return Promise.reject(new Error('Missing requestHandler or method: ' + method));\n }\n try {\n return Promise.resolve(this._requestHandler[method].apply(this._requestHandler, args));\n }\n catch (e) {\n return Promise.reject(e);\n }\n }\n _handleEvent(eventName, arg) {\n if (!this._requestHandler) {\n throw new Error(`Missing requestHandler`);\n }\n if (propertyIsDynamicEvent(eventName)) {\n const event = this._requestHandler[eventName].call(this._requestHandler, arg);\n if (typeof event !== 'function') {\n throw new Error(`Missing dynamic event ${eventName} on request handler.`);\n }\n return event;\n }\n if (propertyIsEvent(eventName)) {\n const event = this._requestHandler[eventName];\n if (typeof event !== 'function') {\n throw new Error(`Missing event ${eventName} on request handler.`);\n }\n return event;\n }\n throw new Error(`Malformed event name ${eventName}`);\n }\n initialize(workerId, loaderConfig, moduleId, hostMethods) {\n this._protocol.setWorkerId(workerId);\n const proxyMethodRequest = (method, args) => {\n return this._protocol.sendMessage(method, args);\n };\n const proxyListen = (eventName, arg) => {\n return this._protocol.listen(eventName, arg);\n };\n const hostProxy = createProxyObject(hostMethods, proxyMethodRequest, proxyListen);\n if (this._requestHandlerFactory) {\n // static request handler\n this._requestHandler = this._requestHandlerFactory(hostProxy);\n return Promise.resolve(getAllMethodNames(this._requestHandler));\n }\n if (loaderConfig) {\n // Remove 'baseUrl', handling it is beyond scope for now\n if (typeof loaderConfig.baseUrl !== 'undefined') {\n delete loaderConfig['baseUrl'];\n }\n if (typeof loaderConfig.paths !== 'undefined') {\n if (typeof loaderConfig.paths.vs !== 'undefined') {\n delete loaderConfig.paths['vs'];\n }\n }\n if (typeof loaderConfig.trustedTypesPolicy !== undefined) {\n // don't use, it has been destroyed during serialize\n delete loaderConfig['trustedTypesPolicy'];\n }\n // Since this is in a web worker, enable catching errors\n loaderConfig.catchError = true;\n globalThis.require.config(loaderConfig);\n }\n return new Promise((resolve, reject) => {\n // Use the global require to be sure to get the global config\n // ESM-comment-begin\n // \t\t\tconst req = (globalThis.require || require);\n // ESM-comment-end\n // ESM-uncomment-begin\n const req = globalThis.require;\n // ESM-uncomment-end\n req([moduleId], (module) => {\n this._requestHandler = module.create(hostProxy);\n if (!this._requestHandler) {\n reject(new Error(`No RequestHandler!`));\n return;\n }\n resolve(getAllMethodNames(this._requestHandler));\n }, reject);\n });\n }\n}\n/**\n * Called on the worker side\n * @skipMangle\n */\nexport function create(postMessage) {\n return new SimpleWorkerServer(postMessage, null);\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { toUint8 } from '../../../base/common/uint.js';\n/**\n * A fast character classifier that uses a compact array for ASCII values.\n */\nexport class CharacterClassifier {\n constructor(_defaultValue) {\n const defaultValue = toUint8(_defaultValue);\n this._defaultValue = defaultValue;\n this._asciiMap = CharacterClassifier._createAsciiMap(defaultValue);\n this._map = new Map();\n }\n static _createAsciiMap(defaultValue) {\n const asciiMap = new Uint8Array(256);\n asciiMap.fill(defaultValue);\n return asciiMap;\n }\n set(charCode, _value) {\n const value = toUint8(_value);\n if (charCode >= 0 && charCode < 256) {\n this._asciiMap[charCode] = value;\n }\n else {\n this._map.set(charCode, value);\n }\n }\n get(charCode) {\n if (charCode >= 0 && charCode < 256) {\n return this._asciiMap[charCode];\n }\n else {\n return (this._map.get(charCode) || this._defaultValue);\n }\n }\n clear() {\n this._asciiMap.fill(this._defaultValue);\n this._map.clear();\n }\n}\nexport class CharacterSet {\n constructor() {\n this._actual = new CharacterClassifier(0 /* Boolean.False */);\n }\n add(charCode) {\n this._actual.set(charCode, 1 /* Boolean.True */);\n }\n has(charCode) {\n return (this._actual.get(charCode) === 1 /* Boolean.True */);\n }\n clear() {\n return this._actual.clear();\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { BugIndicatingError } from '../../../base/common/errors.js';\nimport { OffsetRange } from './offsetRange.js';\nimport { Range } from './range.js';\nimport { findFirstIdxMonotonousOrArrLen, findLastIdxMonotonous, findLastMonotonous } from '../../../base/common/arraysFind.js';\n/**\n * A range of lines (1-based).\n */\nexport class LineRange {\n static fromRange(range) {\n return new LineRange(range.startLineNumber, range.endLineNumber);\n }\n static fromRangeInclusive(range) {\n return new LineRange(range.startLineNumber, range.endLineNumber + 1);\n }\n /**\n * @param lineRanges An array of sorted line ranges.\n */\n static joinMany(lineRanges) {\n if (lineRanges.length === 0) {\n return [];\n }\n let result = new LineRangeSet(lineRanges[0].slice());\n for (let i = 1; i < lineRanges.length; i++) {\n result = result.getUnion(new LineRangeSet(lineRanges[i].slice()));\n }\n return result.ranges;\n }\n static ofLength(startLineNumber, length) {\n return new LineRange(startLineNumber, startLineNumber + length);\n }\n /**\n * @internal\n */\n static deserialize(lineRange) {\n return new LineRange(lineRange[0], lineRange[1]);\n }\n constructor(startLineNumber, endLineNumberExclusive) {\n if (startLineNumber > endLineNumberExclusive) {\n throw new BugIndicatingError(`startLineNumber ${startLineNumber} cannot be after endLineNumberExclusive ${endLineNumberExclusive}`);\n }\n this.startLineNumber = startLineNumber;\n this.endLineNumberExclusive = endLineNumberExclusive;\n }\n /**\n * Indicates if this line range contains the given line number.\n */\n contains(lineNumber) {\n return this.startLineNumber <= lineNumber && lineNumber < this.endLineNumberExclusive;\n }\n /**\n * Indicates if this line range is empty.\n */\n get isEmpty() {\n return this.startLineNumber === this.endLineNumberExclusive;\n }\n /**\n * Moves this line range by the given offset of line numbers.\n */\n delta(offset) {\n return new LineRange(this.startLineNumber + offset, this.endLineNumberExclusive + offset);\n }\n deltaLength(offset) {\n return new LineRange(this.startLineNumber, this.endLineNumberExclusive + offset);\n }\n /**\n * The number of lines this line range spans.\n */\n get length() {\n return this.endLineNumberExclusive - this.startLineNumber;\n }\n /**\n * Creates a line range that combines this and the given line range.\n */\n join(other) {\n return new LineRange(Math.min(this.startLineNumber, other.startLineNumber), Math.max(this.endLineNumberExclusive, other.endLineNumberExclusive));\n }\n toString() {\n return `[${this.startLineNumber},${this.endLineNumberExclusive})`;\n }\n /**\n * The resulting range is empty if the ranges do not intersect, but touch.\n * If the ranges don't even touch, the result is undefined.\n */\n intersect(other) {\n const startLineNumber = Math.max(this.startLineNumber, other.startLineNumber);\n const endLineNumberExclusive = Math.min(this.endLineNumberExclusive, other.endLineNumberExclusive);\n if (startLineNumber <= endLineNumberExclusive) {\n return new LineRange(startLineNumber, endLineNumberExclusive);\n }\n return undefined;\n }\n intersectsStrict(other) {\n return this.startLineNumber < other.endLineNumberExclusive && other.startLineNumber < this.endLineNumberExclusive;\n }\n overlapOrTouch(other) {\n return this.startLineNumber <= other.endLineNumberExclusive && other.startLineNumber <= this.endLineNumberExclusive;\n }\n equals(b) {\n return this.startLineNumber === b.startLineNumber && this.endLineNumberExclusive === b.endLineNumberExclusive;\n }\n toInclusiveRange() {\n if (this.isEmpty) {\n return null;\n }\n return new Range(this.startLineNumber, 1, this.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER);\n }\n toExclusiveRange() {\n return new Range(this.startLineNumber, 1, this.endLineNumberExclusive, 1);\n }\n mapToLineArray(f) {\n const result = [];\n for (let lineNumber = this.startLineNumber; lineNumber < this.endLineNumberExclusive; lineNumber++) {\n result.push(f(lineNumber));\n }\n return result;\n }\n forEach(f) {\n for (let lineNumber = this.startLineNumber; lineNumber < this.endLineNumberExclusive; lineNumber++) {\n f(lineNumber);\n }\n }\n /**\n * @internal\n */\n serialize() {\n return [this.startLineNumber, this.endLineNumberExclusive];\n }\n includes(lineNumber) {\n return this.startLineNumber <= lineNumber && lineNumber < this.endLineNumberExclusive;\n }\n /**\n * Converts this 1-based line range to a 0-based offset range (subtracts 1!).\n * @internal\n */\n toOffsetRange() {\n return new OffsetRange(this.startLineNumber - 1, this.endLineNumberExclusive - 1);\n }\n}\nexport class LineRangeSet {\n constructor(\n /**\n * Sorted by start line number.\n * No two line ranges are touching or intersecting.\n */\n _normalizedRanges = []) {\n this._normalizedRanges = _normalizedRanges;\n }\n get ranges() {\n return this._normalizedRanges;\n }\n addRange(range) {\n if (range.length === 0) {\n return;\n }\n // Idea: Find joinRange such that:\n // replaceRange = _normalizedRanges.replaceRange(joinRange, range.joinAll(joinRange.map(idx => this._normalizedRanges[idx])))\n // idx of first element that touches range or that is after range\n const joinRangeStartIdx = findFirstIdxMonotonousOrArrLen(this._normalizedRanges, r => r.endLineNumberExclusive >= range.startLineNumber);\n // idx of element after { last element that touches range or that is before range }\n const joinRangeEndIdxExclusive = findLastIdxMonotonous(this._normalizedRanges, r => r.startLineNumber <= range.endLineNumberExclusive) + 1;\n if (joinRangeStartIdx === joinRangeEndIdxExclusive) {\n // If there is no element that touches range, then joinRangeStartIdx === joinRangeEndIdxExclusive and that value is the index of the element after range\n this._normalizedRanges.splice(joinRangeStartIdx, 0, range);\n }\n else if (joinRangeStartIdx === joinRangeEndIdxExclusive - 1) {\n // Else, there is an element that touches range and in this case it is both the first and last element. Thus we can replace it\n const joinRange = this._normalizedRanges[joinRangeStartIdx];\n this._normalizedRanges[joinRangeStartIdx] = joinRange.join(range);\n }\n else {\n // First and last element are different - we need to replace the entire range\n const joinRange = this._normalizedRanges[joinRangeStartIdx].join(this._normalizedRanges[joinRangeEndIdxExclusive - 1]).join(range);\n this._normalizedRanges.splice(joinRangeStartIdx, joinRangeEndIdxExclusive - joinRangeStartIdx, joinRange);\n }\n }\n contains(lineNumber) {\n const rangeThatStartsBeforeEnd = findLastMonotonous(this._normalizedRanges, r => r.startLineNumber <= lineNumber);\n return !!rangeThatStartsBeforeEnd && rangeThatStartsBeforeEnd.endLineNumberExclusive > lineNumber;\n }\n intersects(range) {\n const rangeThatStartsBeforeEnd = findLastMonotonous(this._normalizedRanges, r => r.startLineNumber < range.endLineNumberExclusive);\n return !!rangeThatStartsBeforeEnd && rangeThatStartsBeforeEnd.endLineNumberExclusive > range.startLineNumber;\n }\n getUnion(other) {\n if (this._normalizedRanges.length === 0) {\n return other;\n }\n if (other._normalizedRanges.length === 0) {\n return this;\n }\n const result = [];\n let i1 = 0;\n let i2 = 0;\n let current = null;\n while (i1 < this._normalizedRanges.length || i2 < other._normalizedRanges.length) {\n let next = null;\n if (i1 < this._normalizedRanges.length && i2 < other._normalizedRanges.length) {\n const lineRange1 = this._normalizedRanges[i1];\n const lineRange2 = other._normalizedRanges[i2];\n if (lineRange1.startLineNumber < lineRange2.startLineNumber) {\n next = lineRange1;\n i1++;\n }\n else {\n next = lineRange2;\n i2++;\n }\n }\n else if (i1 < this._normalizedRanges.length) {\n next = this._normalizedRanges[i1];\n i1++;\n }\n else {\n next = other._normalizedRanges[i2];\n i2++;\n }\n if (current === null) {\n current = next;\n }\n else {\n if (current.endLineNumberExclusive >= next.startLineNumber) {\n // merge\n current = new LineRange(current.startLineNumber, Math.max(current.endLineNumberExclusive, next.endLineNumberExclusive));\n }\n else {\n // push\n result.push(current);\n current = next;\n }\n }\n }\n if (current !== null) {\n result.push(current);\n }\n return new LineRangeSet(result);\n }\n /**\n * Subtracts all ranges in this set from `range` and returns the result.\n */\n subtractFrom(range) {\n // idx of first element that touches range or that is after range\n const joinRangeStartIdx = findFirstIdxMonotonousOrArrLen(this._normalizedRanges, r => r.endLineNumberExclusive >= range.startLineNumber);\n // idx of element after { last element that touches range or that is before range }\n const joinRangeEndIdxExclusive = findLastIdxMonotonous(this._normalizedRanges, r => r.startLineNumber <= range.endLineNumberExclusive) + 1;\n if (joinRangeStartIdx === joinRangeEndIdxExclusive) {\n return new LineRangeSet([range]);\n }\n const result = [];\n let startLineNumber = range.startLineNumber;\n for (let i = joinRangeStartIdx; i < joinRangeEndIdxExclusive; i++) {\n const r = this._normalizedRanges[i];\n if (r.startLineNumber > startLineNumber) {\n result.push(new LineRange(startLineNumber, r.startLineNumber));\n }\n startLineNumber = r.endLineNumberExclusive;\n }\n if (startLineNumber < range.endLineNumberExclusive) {\n result.push(new LineRange(startLineNumber, range.endLineNumberExclusive));\n }\n return new LineRangeSet(result);\n }\n toString() {\n return this._normalizedRanges.map(r => r.toString()).join(', ');\n }\n getIntersection(other) {\n const result = [];\n let i1 = 0;\n let i2 = 0;\n while (i1 < this._normalizedRanges.length && i2 < other._normalizedRanges.length) {\n const r1 = this._normalizedRanges[i1];\n const r2 = other._normalizedRanges[i2];\n const i = r1.intersect(r2);\n if (i && !i.isEmpty) {\n result.push(i);\n }\n if (r1.endLineNumberExclusive < r2.endLineNumberExclusive) {\n i1++;\n }\n else {\n i2++;\n }\n }\n return new LineRangeSet(result);\n }\n getWithDelta(value) {\n return new LineRangeSet(this._normalizedRanges.map(r => r.delta(value)));\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { BugIndicatingError } from '../../../base/common/errors.js';\n/**\n * A range of offsets (0-based).\n*/\nexport class OffsetRange {\n static addRange(range, sortedRanges) {\n let i = 0;\n while (i < sortedRanges.length && sortedRanges[i].endExclusive < range.start) {\n i++;\n }\n let j = i;\n while (j < sortedRanges.length && sortedRanges[j].start <= range.endExclusive) {\n j++;\n }\n if (i === j) {\n sortedRanges.splice(i, 0, range);\n }\n else {\n const start = Math.min(range.start, sortedRanges[i].start);\n const end = Math.max(range.endExclusive, sortedRanges[j - 1].endExclusive);\n sortedRanges.splice(i, j - i, new OffsetRange(start, end));\n }\n }\n static tryCreate(start, endExclusive) {\n if (start > endExclusive) {\n return undefined;\n }\n return new OffsetRange(start, endExclusive);\n }\n static ofLength(length) {\n return new OffsetRange(0, length);\n }\n static ofStartAndLength(start, length) {\n return new OffsetRange(start, start + length);\n }\n constructor(start, endExclusive) {\n this.start = start;\n this.endExclusive = endExclusive;\n if (start > endExclusive) {\n throw new BugIndicatingError(`Invalid range: ${this.toString()}`);\n }\n }\n get isEmpty() {\n return this.start === this.endExclusive;\n }\n delta(offset) {\n return new OffsetRange(this.start + offset, this.endExclusive + offset);\n }\n deltaStart(offset) {\n return new OffsetRange(this.start + offset, this.endExclusive);\n }\n deltaEnd(offset) {\n return new OffsetRange(this.start, this.endExclusive + offset);\n }\n get length() {\n return this.endExclusive - this.start;\n }\n toString() {\n return `[${this.start}, ${this.endExclusive})`;\n }\n equals(other) {\n return this.start === other.start && this.endExclusive === other.endExclusive;\n }\n containsRange(other) {\n return this.start <= other.start && other.endExclusive <= this.endExclusive;\n }\n contains(offset) {\n return this.start <= offset && offset < this.endExclusive;\n }\n /**\n * for all numbers n: range1.contains(n) or range2.contains(n) => range1.join(range2).contains(n)\n * The joined range is the smallest range that contains both ranges.\n */\n join(other) {\n return new OffsetRange(Math.min(this.start, other.start), Math.max(this.endExclusive, other.endExclusive));\n }\n /**\n * for all numbers n: range1.contains(n) and range2.contains(n) <=> range1.intersect(range2).contains(n)\n *\n * The resulting range is empty if the ranges do not intersect, but touch.\n * If the ranges don't even touch, the result is undefined.\n */\n intersect(other) {\n const start = Math.max(this.start, other.start);\n const end = Math.min(this.endExclusive, other.endExclusive);\n if (start <= end) {\n return new OffsetRange(start, end);\n }\n return undefined;\n }\n isBefore(other) {\n return this.endExclusive <= other.start;\n }\n isAfter(other) {\n return this.start >= other.endExclusive;\n }\n slice(arr) {\n return arr.slice(this.start, this.endExclusive);\n }\n /**\n * Returns the given value if it is contained in this instance, otherwise the closest value that is contained.\n * The range must not be empty.\n */\n clip(value) {\n if (this.isEmpty) {\n throw new BugIndicatingError(`Invalid clipping range: ${this.toString()}`);\n }\n return Math.max(this.start, Math.min(this.endExclusive - 1, value));\n }\n /**\n * Returns `r := value + k * length` such that `r` is contained in this range.\n * The range must not be empty.\n *\n * E.g. `[5, 10).clipCyclic(10) === 5`, `[5, 10).clipCyclic(11) === 6` and `[5, 10).clipCyclic(4) === 9`.\n */\n clipCyclic(value) {\n if (this.isEmpty) {\n throw new BugIndicatingError(`Invalid clipping range: ${this.toString()}`);\n }\n if (value < this.start) {\n return this.endExclusive - ((this.start - value) % this.length);\n }\n if (value >= this.endExclusive) {\n return this.start + ((value - this.start) % this.length);\n }\n return value;\n }\n forEach(f) {\n for (let i = this.start; i < this.endExclusive; i++) {\n f(i);\n }\n }\n}\nexport class OffsetRangeSet {\n constructor() {\n this._sortedRanges = [];\n }\n addRange(range) {\n let i = 0;\n while (i < this._sortedRanges.length && this._sortedRanges[i].endExclusive < range.start) {\n i++;\n }\n let j = i;\n while (j < this._sortedRanges.length && this._sortedRanges[j].start <= range.endExclusive) {\n j++;\n }\n if (i === j) {\n this._sortedRanges.splice(i, 0, range);\n }\n else {\n const start = Math.min(range.start, this._sortedRanges[i].start);\n const end = Math.max(range.endExclusive, this._sortedRanges[j - 1].endExclusive);\n this._sortedRanges.splice(i, j - i, new OffsetRange(start, end));\n }\n }\n toString() {\n return this._sortedRanges.map(r => r.toString()).join(', ');\n }\n /**\n * Returns of there is a value that is contained in this instance and the given range.\n */\n intersectsStrict(other) {\n // TODO use binary search\n let i = 0;\n while (i < this._sortedRanges.length && this._sortedRanges[i].endExclusive <= other.start) {\n i++;\n }\n return i < this._sortedRanges.length && this._sortedRanges[i].start < other.endExclusive;\n }\n intersectWithRange(other) {\n // TODO use binary search + slice\n const result = new OffsetRangeSet();\n for (const range of this._sortedRanges) {\n const intersection = range.intersect(other);\n if (intersection) {\n result.addRange(intersection);\n }\n }\n return result;\n }\n intersectWithRangeLength(other) {\n return this.intersectWithRange(other).length;\n }\n get length() {\n return this._sortedRanges.reduce((prev, cur) => prev + cur.length, 0);\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\n/**\n * A position in the editor.\n */\nexport class Position {\n constructor(lineNumber, column) {\n this.lineNumber = lineNumber;\n this.column = column;\n }\n /**\n * Create a new position from this position.\n *\n * @param newLineNumber new line number\n * @param newColumn new column\n */\n with(newLineNumber = this.lineNumber, newColumn = this.column) {\n if (newLineNumber === this.lineNumber && newColumn === this.column) {\n return this;\n }\n else {\n return new Position(newLineNumber, newColumn);\n }\n }\n /**\n * Derive a new position from this position.\n *\n * @param deltaLineNumber line number delta\n * @param deltaColumn column delta\n */\n delta(deltaLineNumber = 0, deltaColumn = 0) {\n return this.with(this.lineNumber + deltaLineNumber, this.column + deltaColumn);\n }\n /**\n * Test if this position equals other position\n */\n equals(other) {\n return Position.equals(this, other);\n }\n /**\n * Test if position `a` equals position `b`\n */\n static equals(a, b) {\n if (!a && !b) {\n return true;\n }\n return (!!a &&\n !!b &&\n a.lineNumber === b.lineNumber &&\n a.column === b.column);\n }\n /**\n * Test if this position is before other position.\n * If the two positions are equal, the result will be false.\n */\n isBefore(other) {\n return Position.isBefore(this, other);\n }\n /**\n * Test if position `a` is before position `b`.\n * If the two positions are equal, the result will be false.\n */\n static isBefore(a, b) {\n if (a.lineNumber < b.lineNumber) {\n return true;\n }\n if (b.lineNumber < a.lineNumber) {\n return false;\n }\n return a.column < b.column;\n }\n /**\n * Test if this position is before other position.\n * If the two positions are equal, the result will be true.\n */\n isBeforeOrEqual(other) {\n return Position.isBeforeOrEqual(this, other);\n }\n /**\n * Test if position `a` is before position `b`.\n * If the two positions are equal, the result will be true.\n */\n static isBeforeOrEqual(a, b) {\n if (a.lineNumber < b.lineNumber) {\n return true;\n }\n if (b.lineNumber < a.lineNumber) {\n return false;\n }\n return a.column <= b.column;\n }\n /**\n * A function that compares positions, useful for sorting\n */\n static compare(a, b) {\n const aLineNumber = a.lineNumber | 0;\n const bLineNumber = b.lineNumber | 0;\n if (aLineNumber === bLineNumber) {\n const aColumn = a.column | 0;\n const bColumn = b.column | 0;\n return aColumn - bColumn;\n }\n return aLineNumber - bLineNumber;\n }\n /**\n * Clone this position.\n */\n clone() {\n return new Position(this.lineNumber, this.column);\n }\n /**\n * Convert to a human-readable representation.\n */\n toString() {\n return '(' + this.lineNumber + ',' + this.column + ')';\n }\n // ---\n /**\n * Create a `Position` from an `IPosition`.\n */\n static lift(pos) {\n return new Position(pos.lineNumber, pos.column);\n }\n /**\n * Test if `obj` is an `IPosition`.\n */\n static isIPosition(obj) {\n return (obj\n && (typeof obj.lineNumber === 'number')\n && (typeof obj.column === 'number'));\n }\n toJSON() {\n return {\n lineNumber: this.lineNumber,\n column: this.column\n };\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { Position } from './position.js';\n/**\n * A range in the editor. (startLineNumber,startColumn) is <= (endLineNumber,endColumn)\n */\nexport class Range {\n constructor(startLineNumber, startColumn, endLineNumber, endColumn) {\n if ((startLineNumber > endLineNumber) || (startLineNumber === endLineNumber && startColumn > endColumn)) {\n this.startLineNumber = endLineNumber;\n this.startColumn = endColumn;\n this.endLineNumber = startLineNumber;\n this.endColumn = startColumn;\n }\n else {\n this.startLineNumber = startLineNumber;\n this.startColumn = startColumn;\n this.endLineNumber = endLineNumber;\n this.endColumn = endColumn;\n }\n }\n /**\n * Test if this range is empty.\n */\n isEmpty() {\n return Range.isEmpty(this);\n }\n /**\n * Test if `range` is empty.\n */\n static isEmpty(range) {\n return (range.startLineNumber === range.endLineNumber && range.startColumn === range.endColumn);\n }\n /**\n * Test if position is in this range. If the position is at the edges, will return true.\n */\n containsPosition(position) {\n return Range.containsPosition(this, position);\n }\n /**\n * Test if `position` is in `range`. If the position is at the edges, will return true.\n */\n static containsPosition(range, position) {\n if (position.lineNumber < range.startLineNumber || position.lineNumber > range.endLineNumber) {\n return false;\n }\n if (position.lineNumber === range.startLineNumber && position.column < range.startColumn) {\n return false;\n }\n if (position.lineNumber === range.endLineNumber && position.column > range.endColumn) {\n return false;\n }\n return true;\n }\n /**\n * Test if `position` is in `range`. If the position is at the edges, will return false.\n * @internal\n */\n static strictContainsPosition(range, position) {\n if (position.lineNumber < range.startLineNumber || position.lineNumber > range.endLineNumber) {\n return false;\n }\n if (position.lineNumber === range.startLineNumber && position.column <= range.startColumn) {\n return false;\n }\n if (position.lineNumber === range.endLineNumber && position.column >= range.endColumn) {\n return false;\n }\n return true;\n }\n /**\n * Test if range is in this range. If the range is equal to this range, will return true.\n */\n containsRange(range) {\n return Range.containsRange(this, range);\n }\n /**\n * Test if `otherRange` is in `range`. If the ranges are equal, will return true.\n */\n static containsRange(range, otherRange) {\n if (otherRange.startLineNumber < range.startLineNumber || otherRange.endLineNumber < range.startLineNumber) {\n return false;\n }\n if (otherRange.startLineNumber > range.endLineNumber || otherRange.endLineNumber > range.endLineNumber) {\n return false;\n }\n if (otherRange.startLineNumber === range.startLineNumber && otherRange.startColumn < range.startColumn) {\n return false;\n }\n if (otherRange.endLineNumber === range.endLineNumber && otherRange.endColumn > range.endColumn) {\n return false;\n }\n return true;\n }\n /**\n * Test if `range` is strictly in this range. `range` must start after and end before this range for the result to be true.\n */\n strictContainsRange(range) {\n return Range.strictContainsRange(this, range);\n }\n /**\n * Test if `otherRange` is strictly in `range` (must start after, and end before). If the ranges are equal, will return false.\n */\n static strictContainsRange(range, otherRange) {\n if (otherRange.startLineNumber < range.startLineNumber || otherRange.endLineNumber < range.startLineNumber) {\n return false;\n }\n if (otherRange.startLineNumber > range.endLineNumber || otherRange.endLineNumber > range.endLineNumber) {\n return false;\n }\n if (otherRange.startLineNumber === range.startLineNumber && otherRange.startColumn <= range.startColumn) {\n return false;\n }\n if (otherRange.endLineNumber === range.endLineNumber && otherRange.endColumn >= range.endColumn) {\n return false;\n }\n return true;\n }\n /**\n * A reunion of the two ranges.\n * The smallest position will be used as the start point, and the largest one as the end point.\n */\n plusRange(range) {\n return Range.plusRange(this, range);\n }\n /**\n * A reunion of the two ranges.\n * The smallest position will be used as the start point, and the largest one as the end point.\n */\n static plusRange(a, b) {\n let startLineNumber;\n let startColumn;\n let endLineNumber;\n let endColumn;\n if (b.startLineNumber < a.startLineNumber) {\n startLineNumber = b.startLineNumber;\n startColumn = b.startColumn;\n }\n else if (b.startLineNumber === a.startLineNumber) {\n startLineNumber = b.startLineNumber;\n startColumn = Math.min(b.startColumn, a.startColumn);\n }\n else {\n startLineNumber = a.startLineNumber;\n startColumn = a.startColumn;\n }\n if (b.endLineNumber > a.endLineNumber) {\n endLineNumber = b.endLineNumber;\n endColumn = b.endColumn;\n }\n else if (b.endLineNumber === a.endLineNumber) {\n endLineNumber = b.endLineNumber;\n endColumn = Math.max(b.endColumn, a.endColumn);\n }\n else {\n endLineNumber = a.endLineNumber;\n endColumn = a.endColumn;\n }\n return new Range(startLineNumber, startColumn, endLineNumber, endColumn);\n }\n /**\n * A intersection of the two ranges.\n */\n intersectRanges(range) {\n return Range.intersectRanges(this, range);\n }\n /**\n * A intersection of the two ranges.\n */\n static intersectRanges(a, b) {\n let resultStartLineNumber = a.startLineNumber;\n let resultStartColumn = a.startColumn;\n let resultEndLineNumber = a.endLineNumber;\n let resultEndColumn = a.endColumn;\n const otherStartLineNumber = b.startLineNumber;\n const otherStartColumn = b.startColumn;\n const otherEndLineNumber = b.endLineNumber;\n const otherEndColumn = b.endColumn;\n if (resultStartLineNumber < otherStartLineNumber) {\n resultStartLineNumber = otherStartLineNumber;\n resultStartColumn = otherStartColumn;\n }\n else if (resultStartLineNumber === otherStartLineNumber) {\n resultStartColumn = Math.max(resultStartColumn, otherStartColumn);\n }\n if (resultEndLineNumber > otherEndLineNumber) {\n resultEndLineNumber = otherEndLineNumber;\n resultEndColumn = otherEndColumn;\n }\n else if (resultEndLineNumber === otherEndLineNumber) {\n resultEndColumn = Math.min(resultEndColumn, otherEndColumn);\n }\n // Check if selection is now empty\n if (resultStartLineNumber > resultEndLineNumber) {\n return null;\n }\n if (resultStartLineNumber === resultEndLineNumber && resultStartColumn > resultEndColumn) {\n return null;\n }\n return new Range(resultStartLineNumber, resultStartColumn, resultEndLineNumber, resultEndColumn);\n }\n /**\n * Test if this range equals other.\n */\n equalsRange(other) {\n return Range.equalsRange(this, other);\n }\n /**\n * Test if range `a` equals `b`.\n */\n static equalsRange(a, b) {\n if (!a && !b) {\n return true;\n }\n return (!!a &&\n !!b &&\n a.startLineNumber === b.startLineNumber &&\n a.startColumn === b.startColumn &&\n a.endLineNumber === b.endLineNumber &&\n a.endColumn === b.endColumn);\n }\n /**\n * Return the end position (which will be after or equal to the start position)\n */\n getEndPosition() {\n return Range.getEndPosition(this);\n }\n /**\n * Return the end position (which will be after or equal to the start position)\n */\n static getEndPosition(range) {\n return new Position(range.endLineNumber, range.endColumn);\n }\n /**\n * Return the start position (which will be before or equal to the end position)\n */\n getStartPosition() {\n return Range.getStartPosition(this);\n }\n /**\n * Return the start position (which will be before or equal to the end position)\n */\n static getStartPosition(range) {\n return new Position(range.startLineNumber, range.startColumn);\n }\n /**\n * Transform to a user presentable string representation.\n */\n toString() {\n return '[' + this.startLineNumber + ',' + this.startColumn + ' -> ' + this.endLineNumber + ',' + this.endColumn + ']';\n }\n /**\n * Create a new range using this range's start position, and using endLineNumber and endColumn as the end position.\n */\n setEndPosition(endLineNumber, endColumn) {\n return new Range(this.startLineNumber, this.startColumn, endLineNumber, endColumn);\n }\n /**\n * Create a new range using this range's end position, and using startLineNumber and startColumn as the start position.\n */\n setStartPosition(startLineNumber, startColumn) {\n return new Range(startLineNumber, startColumn, this.endLineNumber, this.endColumn);\n }\n /**\n * Create a new empty range using this range's start position.\n */\n collapseToStart() {\n return Range.collapseToStart(this);\n }\n /**\n * Create a new empty range using this range's start position.\n */\n static collapseToStart(range) {\n return new Range(range.startLineNumber, range.startColumn, range.startLineNumber, range.startColumn);\n }\n /**\n * Create a new empty range using this range's end position.\n */\n collapseToEnd() {\n return Range.collapseToEnd(this);\n }\n /**\n * Create a new empty range using this range's end position.\n */\n static collapseToEnd(range) {\n return new Range(range.endLineNumber, range.endColumn, range.endLineNumber, range.endColumn);\n }\n /**\n * Moves the range by the given amount of lines.\n */\n delta(lineCount) {\n return new Range(this.startLineNumber + lineCount, this.startColumn, this.endLineNumber + lineCount, this.endColumn);\n }\n // ---\n static fromPositions(start, end = start) {\n return new Range(start.lineNumber, start.column, end.lineNumber, end.column);\n }\n static lift(range) {\n if (!range) {\n return null;\n }\n return new Range(range.startLineNumber, range.startColumn, range.endLineNumber, range.endColumn);\n }\n /**\n * Test if `obj` is an `IRange`.\n */\n static isIRange(obj) {\n return (obj\n && (typeof obj.startLineNumber === 'number')\n && (typeof obj.startColumn === 'number')\n && (typeof obj.endLineNumber === 'number')\n && (typeof obj.endColumn === 'number'));\n }\n /**\n * Test if the two ranges are touching in any way.\n */\n static areIntersectingOrTouching(a, b) {\n // Check if `a` is before `b`\n if (a.endLineNumber < b.startLineNumber || (a.endLineNumber === b.startLineNumber && a.endColumn < b.startColumn)) {\n return false;\n }\n // Check if `b` is before `a`\n if (b.endLineNumber < a.startLineNumber || (b.endLineNumber === a.startLineNumber && b.endColumn < a.startColumn)) {\n return false;\n }\n // These ranges must intersect\n return true;\n }\n /**\n * Test if the two ranges are intersecting. If the ranges are touching it returns true.\n */\n static areIntersecting(a, b) {\n // Check if `a` is before `b`\n if (a.endLineNumber < b.startLineNumber || (a.endLineNumber === b.startLineNumber && a.endColumn <= b.startColumn)) {\n return false;\n }\n // Check if `b` is before `a`\n if (b.endLineNumber < a.startLineNumber || (b.endLineNumber === a.startLineNumber && b.endColumn <= a.startColumn)) {\n return false;\n }\n // These ranges must intersect\n return true;\n }\n /**\n * A function that compares ranges, useful for sorting ranges\n * It will first compare ranges on the startPosition and then on the endPosition\n */\n static compareRangesUsingStarts(a, b) {\n if (a && b) {\n const aStartLineNumber = a.startLineNumber | 0;\n const bStartLineNumber = b.startLineNumber | 0;\n if (aStartLineNumber === bStartLineNumber) {\n const aStartColumn = a.startColumn | 0;\n const bStartColumn = b.startColumn | 0;\n if (aStartColumn === bStartColumn) {\n const aEndLineNumber = a.endLineNumber | 0;\n const bEndLineNumber = b.endLineNumber | 0;\n if (aEndLineNumber === bEndLineNumber) {\n const aEndColumn = a.endColumn | 0;\n const bEndColumn = b.endColumn | 0;\n return aEndColumn - bEndColumn;\n }\n return aEndLineNumber - bEndLineNumber;\n }\n return aStartColumn - bStartColumn;\n }\n return aStartLineNumber - bStartLineNumber;\n }\n const aExists = (a ? 1 : 0);\n const bExists = (b ? 1 : 0);\n return aExists - bExists;\n }\n /**\n * A function that compares ranges, useful for sorting ranges\n * It will first compare ranges on the endPosition and then on the startPosition\n */\n static compareRangesUsingEnds(a, b) {\n if (a.endLineNumber === b.endLineNumber) {\n if (a.endColumn === b.endColumn) {\n if (a.startLineNumber === b.startLineNumber) {\n return a.startColumn - b.startColumn;\n }\n return a.startLineNumber - b.startLineNumber;\n }\n return a.endColumn - b.endColumn;\n }\n return a.endLineNumber - b.endLineNumber;\n }\n /**\n * Test if the range spans multiple lines.\n */\n static spansMultipleLines(range) {\n return range.endLineNumber > range.startLineNumber;\n }\n toJSON() {\n return this;\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { Position } from './position.js';\nimport { Range } from './range.js';\n/**\n * A selection in the editor.\n * The selection is a range that has an orientation.\n */\nexport class Selection extends Range {\n constructor(selectionStartLineNumber, selectionStartColumn, positionLineNumber, positionColumn) {\n super(selectionStartLineNumber, selectionStartColumn, positionLineNumber, positionColumn);\n this.selectionStartLineNumber = selectionStartLineNumber;\n this.selectionStartColumn = selectionStartColumn;\n this.positionLineNumber = positionLineNumber;\n this.positionColumn = positionColumn;\n }\n /**\n * Transform to a human-readable representation.\n */\n toString() {\n return '[' + this.selectionStartLineNumber + ',' + this.selectionStartColumn + ' -> ' + this.positionLineNumber + ',' + this.positionColumn + ']';\n }\n /**\n * Test if equals other selection.\n */\n equalsSelection(other) {\n return (Selection.selectionsEqual(this, other));\n }\n /**\n * Test if the two selections are equal.\n */\n static selectionsEqual(a, b) {\n return (a.selectionStartLineNumber === b.selectionStartLineNumber &&\n a.selectionStartColumn === b.selectionStartColumn &&\n a.positionLineNumber === b.positionLineNumber &&\n a.positionColumn === b.positionColumn);\n }\n /**\n * Get directions (LTR or RTL).\n */\n getDirection() {\n if (this.selectionStartLineNumber === this.startLineNumber && this.selectionStartColumn === this.startColumn) {\n return 0 /* SelectionDirection.LTR */;\n }\n return 1 /* SelectionDirection.RTL */;\n }\n /**\n * Create a new selection with a different `positionLineNumber` and `positionColumn`.\n */\n setEndPosition(endLineNumber, endColumn) {\n if (this.getDirection() === 0 /* SelectionDirection.LTR */) {\n return new Selection(this.startLineNumber, this.startColumn, endLineNumber, endColumn);\n }\n return new Selection(endLineNumber, endColumn, this.startLineNumber, this.startColumn);\n }\n /**\n * Get the position at `positionLineNumber` and `positionColumn`.\n */\n getPosition() {\n return new Position(this.positionLineNumber, this.positionColumn);\n }\n /**\n * Get the position at the start of the selection.\n */\n getSelectionStart() {\n return new Position(this.selectionStartLineNumber, this.selectionStartColumn);\n }\n /**\n * Create a new selection with a different `selectionStartLineNumber` and `selectionStartColumn`.\n */\n setStartPosition(startLineNumber, startColumn) {\n if (this.getDirection() === 0 /* SelectionDirection.LTR */) {\n return new Selection(startLineNumber, startColumn, this.endLineNumber, this.endColumn);\n }\n return new Selection(this.endLineNumber, this.endColumn, startLineNumber, startColumn);\n }\n // ----\n /**\n * Create a `Selection` from one or two positions\n */\n static fromPositions(start, end = start) {\n return new Selection(start.lineNumber, start.column, end.lineNumber, end.column);\n }\n /**\n * Creates a `Selection` from a range, given a direction.\n */\n static fromRange(range, direction) {\n if (direction === 0 /* SelectionDirection.LTR */) {\n return new Selection(range.startLineNumber, range.startColumn, range.endLineNumber, range.endColumn);\n }\n else {\n return new Selection(range.endLineNumber, range.endColumn, range.startLineNumber, range.startColumn);\n }\n }\n /**\n * Create a `Selection` from an `ISelection`.\n */\n static liftSelection(sel) {\n return new Selection(sel.selectionStartLineNumber, sel.selectionStartColumn, sel.positionLineNumber, sel.positionColumn);\n }\n /**\n * `a` equals `b`.\n */\n static selectionsArrEqual(a, b) {\n if (a && !b || !a && b) {\n return false;\n }\n if (!a && !b) {\n return true;\n }\n if (a.length !== b.length) {\n return false;\n }\n for (let i = 0, len = a.length; i < len; i++) {\n if (!this.selectionsEqual(a[i], b[i])) {\n return false;\n }\n }\n return true;\n }\n /**\n * Test if `obj` is an `ISelection`.\n */\n static isISelection(obj) {\n return (obj\n && (typeof obj.selectionStartLineNumber === 'number')\n && (typeof obj.selectionStartColumn === 'number')\n && (typeof obj.positionLineNumber === 'number')\n && (typeof obj.positionColumn === 'number'));\n }\n /**\n * Create with a direction.\n */\n static createWithDirection(startLineNumber, startColumn, endLineNumber, endColumn, direction) {\n if (direction === 0 /* SelectionDirection.LTR */) {\n return new Selection(startLineNumber, startColumn, endLineNumber, endColumn);\n }\n return new Selection(endLineNumber, endColumn, startLineNumber, startColumn);\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { CharacterClassifier } from './characterClassifier.js';\nexport class WordCharacterClassifier extends CharacterClassifier {\n constructor(wordSeparators) {\n super(0 /* WordCharacterClass.Regular */);\n for (let i = 0, len = wordSeparators.length; i < len; i++) {\n this.set(wordSeparators.charCodeAt(i), 2 /* WordCharacterClass.WordSeparator */);\n }\n this.set(32 /* CharCode.Space */, 1 /* WordCharacterClass.Whitespace */);\n this.set(9 /* CharCode.Tab */, 1 /* WordCharacterClass.Whitespace */);\n }\n}\nfunction once(computeFn) {\n const cache = {}; // TODO@Alex unbounded cache\n return (input) => {\n if (!cache.hasOwnProperty(input)) {\n cache[input] = computeFn(input);\n }\n return cache[input];\n };\n}\nexport const getMapForWordSeparators = once((input) => new WordCharacterClassifier(input));\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { Iterable } from '../../../base/common/iterator.js';\nimport { LinkedList } from '../../../base/common/linkedList.js';\nexport const USUAL_WORD_SEPARATORS = '`~!@#$%^&*()-=+[{]}\\\\|;:\\'\",.<>/?';\n/**\n * Create a word definition regular expression based on default word separators.\n * Optionally provide allowed separators that should be included in words.\n *\n * The default would look like this:\n * /(-?\\d*\\.\\d\\w*)|([^\\`\\~\\!\\@\\#\\$\\%\\^\\&\\*\\(\\)\\-\\=\\+\\[\\{\\]\\}\\\\\\|\\;\\:\\'\\\"\\,\\.\\<\\>\\/\\?\\s]+)/g\n */\nfunction createWordRegExp(allowInWords = '') {\n let source = '(-?\\\\d*\\\\.\\\\d\\\\w*)|([^';\n for (const sep of USUAL_WORD_SEPARATORS) {\n if (allowInWords.indexOf(sep) >= 0) {\n continue;\n }\n source += '\\\\' + sep;\n }\n source += '\\\\s]+)';\n return new RegExp(source, 'g');\n}\n// catches numbers (including floating numbers) in the first group, and alphanum in the second\nexport const DEFAULT_WORD_REGEXP = createWordRegExp();\nexport function ensureValidWordDefinition(wordDefinition) {\n let result = DEFAULT_WORD_REGEXP;\n if (wordDefinition && (wordDefinition instanceof RegExp)) {\n if (!wordDefinition.global) {\n let flags = 'g';\n if (wordDefinition.ignoreCase) {\n flags += 'i';\n }\n if (wordDefinition.multiline) {\n flags += 'm';\n }\n if (wordDefinition.unicode) {\n flags += 'u';\n }\n result = new RegExp(wordDefinition.source, flags);\n }\n else {\n result = wordDefinition;\n }\n }\n result.lastIndex = 0;\n return result;\n}\nconst _defaultConfig = new LinkedList();\n_defaultConfig.unshift({\n maxLen: 1000,\n windowSize: 15,\n timeBudget: 150\n});\nexport function getWordAtText(column, wordDefinition, text, textOffset, config) {\n // Ensure the regex has the 'g' flag, otherwise this will loop forever\n wordDefinition = ensureValidWordDefinition(wordDefinition);\n if (!config) {\n config = Iterable.first(_defaultConfig);\n }\n if (text.length > config.maxLen) {\n // don't throw strings that long at the regexp\n // but use a sub-string in which a word must occur\n let start = column - config.maxLen / 2;\n if (start < 0) {\n start = 0;\n }\n else {\n textOffset += start;\n }\n text = text.substring(start, column + config.maxLen / 2);\n return getWordAtText(column, wordDefinition, text, textOffset, config);\n }\n const t1 = Date.now();\n const pos = column - 1 - textOffset;\n let prevRegexIndex = -1;\n let match = null;\n for (let i = 1;; i++) {\n // check time budget\n if (Date.now() - t1 >= config.timeBudget) {\n break;\n }\n // reset the index at which the regexp should start matching, also know where it\n // should stop so that subsequent search don't repeat previous searches\n const regexIndex = pos - config.windowSize * i;\n wordDefinition.lastIndex = Math.max(0, regexIndex);\n const thisMatch = _findRegexMatchEnclosingPosition(wordDefinition, text, pos, prevRegexIndex);\n if (!thisMatch && match) {\n // stop: we have something\n break;\n }\n match = thisMatch;\n // stop: searched at start\n if (regexIndex <= 0) {\n break;\n }\n prevRegexIndex = regexIndex;\n }\n if (match) {\n const result = {\n word: match[0],\n startColumn: textOffset + 1 + match.index,\n endColumn: textOffset + 1 + match.index + match[0].length\n };\n wordDefinition.lastIndex = 0;\n return result;\n }\n return null;\n}\nfunction _findRegexMatchEnclosingPosition(wordDefinition, text, pos, stopPos) {\n let match;\n while (match = wordDefinition.exec(text)) {\n const matchIndex = match.index || 0;\n if (matchIndex <= pos && wordDefinition.lastIndex >= pos) {\n return match;\n }\n else if (stopPos > 0 && matchIndex > stopPos) {\n return null;\n }\n }\n return null;\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { forEachAdjacent } from '../../../../../base/common/arrays.js';\nimport { BugIndicatingError } from '../../../../../base/common/errors.js';\nimport { OffsetRange } from '../../../core/offsetRange.js';\nexport class DiffAlgorithmResult {\n static trivial(seq1, seq2) {\n return new DiffAlgorithmResult([new SequenceDiff(OffsetRange.ofLength(seq1.length), OffsetRange.ofLength(seq2.length))], false);\n }\n static trivialTimedOut(seq1, seq2) {\n return new DiffAlgorithmResult([new SequenceDiff(OffsetRange.ofLength(seq1.length), OffsetRange.ofLength(seq2.length))], true);\n }\n constructor(diffs, \n /**\n * Indicates if the time out was reached.\n * In that case, the diffs might be an approximation and the user should be asked to rerun the diff with more time.\n */\n hitTimeout) {\n this.diffs = diffs;\n this.hitTimeout = hitTimeout;\n }\n}\nexport class SequenceDiff {\n static invert(sequenceDiffs, doc1Length) {\n const result = [];\n forEachAdjacent(sequenceDiffs, (a, b) => {\n result.push(SequenceDiff.fromOffsetPairs(a ? a.getEndExclusives() : OffsetPair.zero, b ? b.getStarts() : new OffsetPair(doc1Length, (a ? a.seq2Range.endExclusive - a.seq1Range.endExclusive : 0) + doc1Length)));\n });\n return result;\n }\n static fromOffsetPairs(start, endExclusive) {\n return new SequenceDiff(new OffsetRange(start.offset1, endExclusive.offset1), new OffsetRange(start.offset2, endExclusive.offset2));\n }\n constructor(seq1Range, seq2Range) {\n this.seq1Range = seq1Range;\n this.seq2Range = seq2Range;\n }\n swap() {\n return new SequenceDiff(this.seq2Range, this.seq1Range);\n }\n toString() {\n return `${this.seq1Range} <-> ${this.seq2Range}`;\n }\n join(other) {\n return new SequenceDiff(this.seq1Range.join(other.seq1Range), this.seq2Range.join(other.seq2Range));\n }\n delta(offset) {\n if (offset === 0) {\n return this;\n }\n return new SequenceDiff(this.seq1Range.delta(offset), this.seq2Range.delta(offset));\n }\n deltaStart(offset) {\n if (offset === 0) {\n return this;\n }\n return new SequenceDiff(this.seq1Range.deltaStart(offset), this.seq2Range.deltaStart(offset));\n }\n deltaEnd(offset) {\n if (offset === 0) {\n return this;\n }\n return new SequenceDiff(this.seq1Range.deltaEnd(offset), this.seq2Range.deltaEnd(offset));\n }\n intersect(other) {\n const i1 = this.seq1Range.intersect(other.seq1Range);\n const i2 = this.seq2Range.intersect(other.seq2Range);\n if (!i1 || !i2) {\n return undefined;\n }\n return new SequenceDiff(i1, i2);\n }\n getStarts() {\n return new OffsetPair(this.seq1Range.start, this.seq2Range.start);\n }\n getEndExclusives() {\n return new OffsetPair(this.seq1Range.endExclusive, this.seq2Range.endExclusive);\n }\n}\nexport class OffsetPair {\n constructor(offset1, offset2) {\n this.offset1 = offset1;\n this.offset2 = offset2;\n }\n toString() {\n return `${this.offset1} <-> ${this.offset2}`;\n }\n}\nOffsetPair.zero = new OffsetPair(0, 0);\nOffsetPair.max = new OffsetPair(Number.MAX_SAFE_INTEGER, Number.MAX_SAFE_INTEGER);\nexport class InfiniteTimeout {\n isValid() {\n return true;\n }\n}\nInfiniteTimeout.instance = new InfiniteTimeout();\nexport class DateTimeout {\n constructor(timeout) {\n this.timeout = timeout;\n this.startTime = Date.now();\n this.valid = true;\n if (timeout <= 0) {\n throw new BugIndicatingError('timeout must be positive');\n }\n }\n // Recommendation: Set a log-point `{this.disable()}` in the body\n isValid() {\n const valid = Date.now() - this.startTime < this.timeout;\n if (!valid && this.valid) {\n this.valid = false; // timeout reached\n // eslint-disable-next-line no-debugger\n debugger; // WARNING: Most likely debugging caused the timeout. Call `this.disable()` to continue without timing out.\n }\n return this.valid;\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { OffsetRange } from '../../../core/offsetRange.js';\nimport { SequenceDiff, InfiniteTimeout, DiffAlgorithmResult } from './diffAlgorithm.js';\nimport { Array2D } from '../utils.js';\n/**\n * A O(MN) diffing algorithm that supports a score function.\n * The algorithm can be improved by processing the 2d array diagonally.\n*/\nexport class DynamicProgrammingDiffing {\n compute(sequence1, sequence2, timeout = InfiniteTimeout.instance, equalityScore) {\n if (sequence1.length === 0 || sequence2.length === 0) {\n return DiffAlgorithmResult.trivial(sequence1, sequence2);\n }\n /**\n * lcsLengths.get(i, j): Length of the longest common subsequence of sequence1.substring(0, i + 1) and sequence2.substring(0, j + 1).\n */\n const lcsLengths = new Array2D(sequence1.length, sequence2.length);\n const directions = new Array2D(sequence1.length, sequence2.length);\n const lengths = new Array2D(sequence1.length, sequence2.length);\n // ==== Initializing lcsLengths ====\n for (let s1 = 0; s1 < sequence1.length; s1++) {\n for (let s2 = 0; s2 < sequence2.length; s2++) {\n if (!timeout.isValid()) {\n return DiffAlgorithmResult.trivialTimedOut(sequence1, sequence2);\n }\n const horizontalLen = s1 === 0 ? 0 : lcsLengths.get(s1 - 1, s2);\n const verticalLen = s2 === 0 ? 0 : lcsLengths.get(s1, s2 - 1);\n let extendedSeqScore;\n if (sequence1.getElement(s1) === sequence2.getElement(s2)) {\n if (s1 === 0 || s2 === 0) {\n extendedSeqScore = 0;\n }\n else {\n extendedSeqScore = lcsLengths.get(s1 - 1, s2 - 1);\n }\n if (s1 > 0 && s2 > 0 && directions.get(s1 - 1, s2 - 1) === 3) {\n // Prefer consecutive diagonals\n extendedSeqScore += lengths.get(s1 - 1, s2 - 1);\n }\n extendedSeqScore += (equalityScore ? equalityScore(s1, s2) : 1);\n }\n else {\n extendedSeqScore = -1;\n }\n const newValue = Math.max(horizontalLen, verticalLen, extendedSeqScore);\n if (newValue === extendedSeqScore) {\n // Prefer diagonals\n const prevLen = s1 > 0 && s2 > 0 ? lengths.get(s1 - 1, s2 - 1) : 0;\n lengths.set(s1, s2, prevLen + 1);\n directions.set(s1, s2, 3);\n }\n else if (newValue === horizontalLen) {\n lengths.set(s1, s2, 0);\n directions.set(s1, s2, 1);\n }\n else if (newValue === verticalLen) {\n lengths.set(s1, s2, 0);\n directions.set(s1, s2, 2);\n }\n lcsLengths.set(s1, s2, newValue);\n }\n }\n // ==== Backtracking ====\n const result = [];\n let lastAligningPosS1 = sequence1.length;\n let lastAligningPosS2 = sequence2.length;\n function reportDecreasingAligningPositions(s1, s2) {\n if (s1 + 1 !== lastAligningPosS1 || s2 + 1 !== lastAligningPosS2) {\n result.push(new SequenceDiff(new OffsetRange(s1 + 1, lastAligningPosS1), new OffsetRange(s2 + 1, lastAligningPosS2)));\n }\n lastAligningPosS1 = s1;\n lastAligningPosS2 = s2;\n }\n let s1 = sequence1.length - 1;\n let s2 = sequence2.length - 1;\n while (s1 >= 0 && s2 >= 0) {\n if (directions.get(s1, s2) === 3) {\n reportDecreasingAligningPositions(s1, s2);\n s1--;\n s2--;\n }\n else {\n if (directions.get(s1, s2) === 1) {\n s1--;\n }\n else {\n s2--;\n }\n }\n }\n reportDecreasingAligningPositions(-1, -1);\n result.reverse();\n return new DiffAlgorithmResult(result, false);\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { OffsetRange } from '../../../core/offsetRange.js';\nimport { DiffAlgorithmResult, InfiniteTimeout, SequenceDiff } from './diffAlgorithm.js';\n/**\n * An O(ND) diff algorithm that has a quadratic space worst-case complexity.\n*/\nexport class MyersDiffAlgorithm {\n compute(seq1, seq2, timeout = InfiniteTimeout.instance) {\n // These are common special cases.\n // The early return improves performance dramatically.\n if (seq1.length === 0 || seq2.length === 0) {\n return DiffAlgorithmResult.trivial(seq1, seq2);\n }\n const seqX = seq1; // Text on the x axis\n const seqY = seq2; // Text on the y axis\n function getXAfterSnake(x, y) {\n while (x < seqX.length && y < seqY.length && seqX.getElement(x) === seqY.getElement(y)) {\n x++;\n y++;\n }\n return x;\n }\n let d = 0;\n // V[k]: X value of longest d-line that ends in diagonal k.\n // d-line: path from (0,0) to (x,y) that uses exactly d non-diagonals.\n // diagonal k: Set of points (x,y) with x-y = k.\n // k=1 -> (1,0),(2,1)\n const V = new FastInt32Array();\n V.set(0, getXAfterSnake(0, 0));\n const paths = new FastArrayNegativeIndices();\n paths.set(0, V.get(0) === 0 ? null : new SnakePath(null, 0, 0, V.get(0)));\n let k = 0;\n loop: while (true) {\n d++;\n if (!timeout.isValid()) {\n return DiffAlgorithmResult.trivialTimedOut(seqX, seqY);\n }\n // The paper has `for (k = -d; k <= d; k += 2)`, but we can ignore diagonals that cannot influence the result.\n const lowerBound = -Math.min(d, seqY.length + (d % 2));\n const upperBound = Math.min(d, seqX.length + (d % 2));\n for (k = lowerBound; k <= upperBound; k += 2) {\n let step = 0;\n // We can use the X values of (d-1)-lines to compute X value of the longest d-lines.\n const maxXofDLineTop = k === upperBound ? -1 : V.get(k + 1); // We take a vertical non-diagonal (add a symbol in seqX)\n const maxXofDLineLeft = k === lowerBound ? -1 : V.get(k - 1) + 1; // We take a horizontal non-diagonal (+1 x) (delete a symbol in seqX)\n step++;\n const x = Math.min(Math.max(maxXofDLineTop, maxXofDLineLeft), seqX.length);\n const y = x - k;\n step++;\n if (x > seqX.length || y > seqY.length) {\n // This diagonal is irrelevant for the result.\n // TODO: Don't pay the cost for this in the next iteration.\n continue;\n }\n const newMaxX = getXAfterSnake(x, y);\n V.set(k, newMaxX);\n const lastPath = x === maxXofDLineTop ? paths.get(k + 1) : paths.get(k - 1);\n paths.set(k, newMaxX !== x ? new SnakePath(lastPath, x, y, newMaxX - x) : lastPath);\n if (V.get(k) === seqX.length && V.get(k) - k === seqY.length) {\n break loop;\n }\n }\n }\n let path = paths.get(k);\n const result = [];\n let lastAligningPosS1 = seqX.length;\n let lastAligningPosS2 = seqY.length;\n while (true) {\n const endX = path ? path.x + path.length : 0;\n const endY = path ? path.y + path.length : 0;\n if (endX !== lastAligningPosS1 || endY !== lastAligningPosS2) {\n result.push(new SequenceDiff(new OffsetRange(endX, lastAligningPosS1), new OffsetRange(endY, lastAligningPosS2)));\n }\n if (!path) {\n break;\n }\n lastAligningPosS1 = path.x;\n lastAligningPosS2 = path.y;\n path = path.prev;\n }\n result.reverse();\n return new DiffAlgorithmResult(result, false);\n }\n}\nclass SnakePath {\n constructor(prev, x, y, length) {\n this.prev = prev;\n this.x = x;\n this.y = y;\n this.length = length;\n }\n}\n/**\n * An array that supports fast negative indices.\n*/\nclass FastInt32Array {\n constructor() {\n this.positiveArr = new Int32Array(10);\n this.negativeArr = new Int32Array(10);\n }\n get(idx) {\n if (idx < 0) {\n idx = -idx - 1;\n return this.negativeArr[idx];\n }\n else {\n return this.positiveArr[idx];\n }\n }\n set(idx, value) {\n if (idx < 0) {\n idx = -idx - 1;\n if (idx >= this.negativeArr.length) {\n const arr = this.negativeArr;\n this.negativeArr = new Int32Array(arr.length * 2);\n this.negativeArr.set(arr);\n }\n this.negativeArr[idx] = value;\n }\n else {\n if (idx >= this.positiveArr.length) {\n const arr = this.positiveArr;\n this.positiveArr = new Int32Array(arr.length * 2);\n this.positiveArr.set(arr);\n }\n this.positiveArr[idx] = value;\n }\n }\n}\n/**\n * An array that supports fast negative indices.\n*/\nclass FastArrayNegativeIndices {\n constructor() {\n this.positiveArr = [];\n this.negativeArr = [];\n }\n get(idx) {\n if (idx < 0) {\n idx = -idx - 1;\n return this.negativeArr[idx];\n }\n else {\n return this.positiveArr[idx];\n }\n }\n set(idx, value) {\n if (idx < 0) {\n idx = -idx - 1;\n this.negativeArr[idx] = value;\n }\n else {\n this.positiveArr[idx] = value;\n }\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { SequenceDiff } from './algorithms/diffAlgorithm.js';\nimport { LineRangeMapping } from '../rangeMapping.js';\nimport { pushMany, compareBy, numberComparator, reverseOrder } from '../../../../base/common/arrays.js';\nimport { MonotonousArray, findLastMonotonous } from '../../../../base/common/arraysFind.js';\nimport { SetMap } from '../../../../base/common/map.js';\nimport { LineRange, LineRangeSet } from '../../core/lineRange.js';\nimport { OffsetRange } from '../../core/offsetRange.js';\nimport { LinesSliceCharSequence } from './linesSliceCharSequence.js';\nimport { LineRangeFragment, isSpace } from './utils.js';\nimport { MyersDiffAlgorithm } from './algorithms/myersDiffAlgorithm.js';\nexport function computeMovedLines(changes, originalLines, modifiedLines, hashedOriginalLines, hashedModifiedLines, timeout) {\n let { moves, excludedChanges } = computeMovesFromSimpleDeletionsToSimpleInsertions(changes, originalLines, modifiedLines, timeout);\n if (!timeout.isValid()) {\n return [];\n }\n const filteredChanges = changes.filter(c => !excludedChanges.has(c));\n const unchangedMoves = computeUnchangedMoves(filteredChanges, hashedOriginalLines, hashedModifiedLines, originalLines, modifiedLines, timeout);\n pushMany(moves, unchangedMoves);\n moves = joinCloseConsecutiveMoves(moves);\n // Ignore too short moves\n moves = moves.filter(current => {\n const lines = current.original.toOffsetRange().slice(originalLines).map(l => l.trim());\n const originalText = lines.join('\\n');\n return originalText.length >= 15 && countWhere(lines, l => l.length >= 2) >= 2;\n });\n moves = removeMovesInSameDiff(changes, moves);\n return moves;\n}\nfunction countWhere(arr, predicate) {\n let count = 0;\n for (const t of arr) {\n if (predicate(t)) {\n count++;\n }\n }\n return count;\n}\nfunction computeMovesFromSimpleDeletionsToSimpleInsertions(changes, originalLines, modifiedLines, timeout) {\n const moves = [];\n const deletions = changes\n .filter(c => c.modified.isEmpty && c.original.length >= 3)\n .map(d => new LineRangeFragment(d.original, originalLines, d));\n const insertions = new Set(changes\n .filter(c => c.original.isEmpty && c.modified.length >= 3)\n .map(d => new LineRangeFragment(d.modified, modifiedLines, d)));\n const excludedChanges = new Set();\n for (const deletion of deletions) {\n let highestSimilarity = -1;\n let best;\n for (const insertion of insertions) {\n const similarity = deletion.computeSimilarity(insertion);\n if (similarity > highestSimilarity) {\n highestSimilarity = similarity;\n best = insertion;\n }\n }\n if (highestSimilarity > 0.90 && best) {\n insertions.delete(best);\n moves.push(new LineRangeMapping(deletion.range, best.range));\n excludedChanges.add(deletion.source);\n excludedChanges.add(best.source);\n }\n if (!timeout.isValid()) {\n return { moves, excludedChanges };\n }\n }\n return { moves, excludedChanges };\n}\nfunction computeUnchangedMoves(changes, hashedOriginalLines, hashedModifiedLines, originalLines, modifiedLines, timeout) {\n const moves = [];\n const original3LineHashes = new SetMap();\n for (const change of changes) {\n for (let i = change.original.startLineNumber; i < change.original.endLineNumberExclusive - 2; i++) {\n const key = `${hashedOriginalLines[i - 1]}:${hashedOriginalLines[i + 1 - 1]}:${hashedOriginalLines[i + 2 - 1]}`;\n original3LineHashes.add(key, { range: new LineRange(i, i + 3) });\n }\n }\n const possibleMappings = [];\n changes.sort(compareBy(c => c.modified.startLineNumber, numberComparator));\n for (const change of changes) {\n let lastMappings = [];\n for (let i = change.modified.startLineNumber; i < change.modified.endLineNumberExclusive - 2; i++) {\n const key = `${hashedModifiedLines[i - 1]}:${hashedModifiedLines[i + 1 - 1]}:${hashedModifiedLines[i + 2 - 1]}`;\n const currentModifiedRange = new LineRange(i, i + 3);\n const nextMappings = [];\n original3LineHashes.forEach(key, ({ range }) => {\n for (const lastMapping of lastMappings) {\n // does this match extend some last match?\n if (lastMapping.originalLineRange.endLineNumberExclusive + 1 === range.endLineNumberExclusive &&\n lastMapping.modifiedLineRange.endLineNumberExclusive + 1 === currentModifiedRange.endLineNumberExclusive) {\n lastMapping.originalLineRange = new LineRange(lastMapping.originalLineRange.startLineNumber, range.endLineNumberExclusive);\n lastMapping.modifiedLineRange = new LineRange(lastMapping.modifiedLineRange.startLineNumber, currentModifiedRange.endLineNumberExclusive);\n nextMappings.push(lastMapping);\n return;\n }\n }\n const mapping = {\n modifiedLineRange: currentModifiedRange,\n originalLineRange: range,\n };\n possibleMappings.push(mapping);\n nextMappings.push(mapping);\n });\n lastMappings = nextMappings;\n }\n if (!timeout.isValid()) {\n return [];\n }\n }\n possibleMappings.sort(reverseOrder(compareBy(m => m.modifiedLineRange.length, numberComparator)));\n const modifiedSet = new LineRangeSet();\n const originalSet = new LineRangeSet();\n for (const mapping of possibleMappings) {\n const diffOrigToMod = mapping.modifiedLineRange.startLineNumber - mapping.originalLineRange.startLineNumber;\n const modifiedSections = modifiedSet.subtractFrom(mapping.modifiedLineRange);\n const originalTranslatedSections = originalSet.subtractFrom(mapping.originalLineRange).getWithDelta(diffOrigToMod);\n const modifiedIntersectedSections = modifiedSections.getIntersection(originalTranslatedSections);\n for (const s of modifiedIntersectedSections.ranges) {\n if (s.length < 3) {\n continue;\n }\n const modifiedLineRange = s;\n const originalLineRange = s.delta(-diffOrigToMod);\n moves.push(new LineRangeMapping(originalLineRange, modifiedLineRange));\n modifiedSet.addRange(modifiedLineRange);\n originalSet.addRange(originalLineRange);\n }\n }\n moves.sort(compareBy(m => m.original.startLineNumber, numberComparator));\n const monotonousChanges = new MonotonousArray(changes);\n for (let i = 0; i < moves.length; i++) {\n const move = moves[i];\n const firstTouchingChangeOrig = monotonousChanges.findLastMonotonous(c => c.original.startLineNumber <= move.original.startLineNumber);\n const firstTouchingChangeMod = findLastMonotonous(changes, c => c.modified.startLineNumber <= move.modified.startLineNumber);\n const linesAbove = Math.max(move.original.startLineNumber - firstTouchingChangeOrig.original.startLineNumber, move.modified.startLineNumber - firstTouchingChangeMod.modified.startLineNumber);\n const lastTouchingChangeOrig = monotonousChanges.findLastMonotonous(c => c.original.startLineNumber < move.original.endLineNumberExclusive);\n const lastTouchingChangeMod = findLastMonotonous(changes, c => c.modified.startLineNumber < move.modified.endLineNumberExclusive);\n const linesBelow = Math.max(lastTouchingChangeOrig.original.endLineNumberExclusive - move.original.endLineNumberExclusive, lastTouchingChangeMod.modified.endLineNumberExclusive - move.modified.endLineNumberExclusive);\n let extendToTop;\n for (extendToTop = 0; extendToTop < linesAbove; extendToTop++) {\n const origLine = move.original.startLineNumber - extendToTop - 1;\n const modLine = move.modified.startLineNumber - extendToTop - 1;\n if (origLine > originalLines.length || modLine > modifiedLines.length) {\n break;\n }\n if (modifiedSet.contains(modLine) || originalSet.contains(origLine)) {\n break;\n }\n if (!areLinesSimilar(originalLines[origLine - 1], modifiedLines[modLine - 1], timeout)) {\n break;\n }\n }\n if (extendToTop > 0) {\n originalSet.addRange(new LineRange(move.original.startLineNumber - extendToTop, move.original.startLineNumber));\n modifiedSet.addRange(new LineRange(move.modified.startLineNumber - extendToTop, move.modified.startLineNumber));\n }\n let extendToBottom;\n for (extendToBottom = 0; extendToBottom < linesBelow; extendToBottom++) {\n const origLine = move.original.endLineNumberExclusive + extendToBottom;\n const modLine = move.modified.endLineNumberExclusive + extendToBottom;\n if (origLine > originalLines.length || modLine > modifiedLines.length) {\n break;\n }\n if (modifiedSet.contains(modLine) || originalSet.contains(origLine)) {\n break;\n }\n if (!areLinesSimilar(originalLines[origLine - 1], modifiedLines[modLine - 1], timeout)) {\n break;\n }\n }\n if (extendToBottom > 0) {\n originalSet.addRange(new LineRange(move.original.endLineNumberExclusive, move.original.endLineNumberExclusive + extendToBottom));\n modifiedSet.addRange(new LineRange(move.modified.endLineNumberExclusive, move.modified.endLineNumberExclusive + extendToBottom));\n }\n if (extendToTop > 0 || extendToBottom > 0) {\n moves[i] = new LineRangeMapping(new LineRange(move.original.startLineNumber - extendToTop, move.original.endLineNumberExclusive + extendToBottom), new LineRange(move.modified.startLineNumber - extendToTop, move.modified.endLineNumberExclusive + extendToBottom));\n }\n }\n return moves;\n}\nfunction areLinesSimilar(line1, line2, timeout) {\n if (line1.trim() === line2.trim()) {\n return true;\n }\n if (line1.length > 300 && line2.length > 300) {\n return false;\n }\n const myersDiffingAlgorithm = new MyersDiffAlgorithm();\n const result = myersDiffingAlgorithm.compute(new LinesSliceCharSequence([line1], new OffsetRange(0, 1), false), new LinesSliceCharSequence([line2], new OffsetRange(0, 1), false), timeout);\n let commonNonSpaceCharCount = 0;\n const inverted = SequenceDiff.invert(result.diffs, line1.length);\n for (const seq of inverted) {\n seq.seq1Range.forEach(idx => {\n if (!isSpace(line1.charCodeAt(idx))) {\n commonNonSpaceCharCount++;\n }\n });\n }\n function countNonWsChars(str) {\n let count = 0;\n for (let i = 0; i < line1.length; i++) {\n if (!isSpace(str.charCodeAt(i))) {\n count++;\n }\n }\n return count;\n }\n const longerLineLength = countNonWsChars(line1.length > line2.length ? line1 : line2);\n const r = commonNonSpaceCharCount / longerLineLength > 0.6 && longerLineLength > 10;\n return r;\n}\nfunction joinCloseConsecutiveMoves(moves) {\n if (moves.length === 0) {\n return moves;\n }\n moves.sort(compareBy(m => m.original.startLineNumber, numberComparator));\n const result = [moves[0]];\n for (let i = 1; i < moves.length; i++) {\n const last = result[result.length - 1];\n const current = moves[i];\n const originalDist = current.original.startLineNumber - last.original.endLineNumberExclusive;\n const modifiedDist = current.modified.startLineNumber - last.modified.endLineNumberExclusive;\n const currentMoveAfterLast = originalDist >= 0 && modifiedDist >= 0;\n if (currentMoveAfterLast && originalDist + modifiedDist <= 2) {\n result[result.length - 1] = last.join(current);\n continue;\n }\n result.push(current);\n }\n return result;\n}\nfunction removeMovesInSameDiff(changes, moves) {\n const changesMonotonous = new MonotonousArray(changes);\n moves = moves.filter(m => {\n const diffBeforeEndOfMoveOriginal = changesMonotonous.findLastMonotonous(c => c.original.startLineNumber < m.original.endLineNumberExclusive)\n || new LineRangeMapping(new LineRange(1, 1), new LineRange(1, 1));\n const diffBeforeEndOfMoveModified = findLastMonotonous(changes, c => c.modified.startLineNumber < m.modified.endLineNumberExclusive);\n const differentDiffs = diffBeforeEndOfMoveOriginal !== diffBeforeEndOfMoveModified;\n return differentDiffs;\n });\n return moves;\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { equals, groupAdjacentBy } from '../../../../base/common/arrays.js';\nimport { assertFn, checkAdjacentItems } from '../../../../base/common/assert.js';\nimport { LineRange } from '../../core/lineRange.js';\nimport { OffsetRange } from '../../core/offsetRange.js';\nimport { Range } from '../../core/range.js';\nimport { DateTimeout, InfiniteTimeout, SequenceDiff } from './algorithms/diffAlgorithm.js';\nimport { DynamicProgrammingDiffing } from './algorithms/dynamicProgrammingDiffing.js';\nimport { MyersDiffAlgorithm } from './algorithms/myersDiffAlgorithm.js';\nimport { computeMovedLines } from './computeMovedLines.js';\nimport { extendDiffsToEntireWordIfAppropriate, optimizeSequenceDiffs, removeVeryShortMatchingLinesBetweenDiffs, removeVeryShortMatchingTextBetweenLongDiffs, removeShortMatches } from './heuristicSequenceOptimizations.js';\nimport { LinesDiff, MovedText } from '../linesDiffComputer.js';\nimport { DetailedLineRangeMapping, RangeMapping } from '../rangeMapping.js';\nimport { LinesSliceCharSequence } from './linesSliceCharSequence.js';\nimport { LineSequence } from './lineSequence.js';\nexport class DefaultLinesDiffComputer {\n constructor() {\n this.dynamicProgrammingDiffing = new DynamicProgrammingDiffing();\n this.myersDiffingAlgorithm = new MyersDiffAlgorithm();\n }\n computeDiff(originalLines, modifiedLines, options) {\n if (originalLines.length <= 1 && equals(originalLines, modifiedLines, (a, b) => a === b)) {\n return new LinesDiff([], [], false);\n }\n if (originalLines.length === 1 && originalLines[0].length === 0 || modifiedLines.length === 1 && modifiedLines[0].length === 0) {\n return new LinesDiff([\n new DetailedLineRangeMapping(new LineRange(1, originalLines.length + 1), new LineRange(1, modifiedLines.length + 1), [\n new RangeMapping(new Range(1, 1, originalLines.length, originalLines[0].length + 1), new Range(1, 1, modifiedLines.length, modifiedLines[0].length + 1))\n ])\n ], [], false);\n }\n const timeout = options.maxComputationTimeMs === 0 ? InfiniteTimeout.instance : new DateTimeout(options.maxComputationTimeMs);\n const considerWhitespaceChanges = !options.ignoreTrimWhitespace;\n const perfectHashes = new Map();\n function getOrCreateHash(text) {\n let hash = perfectHashes.get(text);\n if (hash === undefined) {\n hash = perfectHashes.size;\n perfectHashes.set(text, hash);\n }\n return hash;\n }\n const originalLinesHashes = originalLines.map((l) => getOrCreateHash(l.trim()));\n const modifiedLinesHashes = modifiedLines.map((l) => getOrCreateHash(l.trim()));\n const sequence1 = new LineSequence(originalLinesHashes, originalLines);\n const sequence2 = new LineSequence(modifiedLinesHashes, modifiedLines);\n const lineAlignmentResult = (() => {\n if (sequence1.length + sequence2.length < 1700) {\n // Use the improved algorithm for small files\n return this.dynamicProgrammingDiffing.compute(sequence1, sequence2, timeout, (offset1, offset2) => originalLines[offset1] === modifiedLines[offset2]\n ? modifiedLines[offset2].length === 0\n ? 0.1\n : 1 + Math.log(1 + modifiedLines[offset2].length)\n : 0.99);\n }\n return this.myersDiffingAlgorithm.compute(sequence1, sequence2);\n })();\n let lineAlignments = lineAlignmentResult.diffs;\n let hitTimeout = lineAlignmentResult.hitTimeout;\n lineAlignments = optimizeSequenceDiffs(sequence1, sequence2, lineAlignments);\n lineAlignments = removeVeryShortMatchingLinesBetweenDiffs(sequence1, sequence2, lineAlignments);\n const alignments = [];\n const scanForWhitespaceChanges = (equalLinesCount) => {\n if (!considerWhitespaceChanges) {\n return;\n }\n for (let i = 0; i < equalLinesCount; i++) {\n const seq1Offset = seq1LastStart + i;\n const seq2Offset = seq2LastStart + i;\n if (originalLines[seq1Offset] !== modifiedLines[seq2Offset]) {\n // This is because of whitespace changes, diff these lines\n const characterDiffs = this.refineDiff(originalLines, modifiedLines, new SequenceDiff(new OffsetRange(seq1Offset, seq1Offset + 1), new OffsetRange(seq2Offset, seq2Offset + 1)), timeout, considerWhitespaceChanges);\n for (const a of characterDiffs.mappings) {\n alignments.push(a);\n }\n if (characterDiffs.hitTimeout) {\n hitTimeout = true;\n }\n }\n }\n };\n let seq1LastStart = 0;\n let seq2LastStart = 0;\n for (const diff of lineAlignments) {\n assertFn(() => diff.seq1Range.start - seq1LastStart === diff.seq2Range.start - seq2LastStart);\n const equalLinesCount = diff.seq1Range.start - seq1LastStart;\n scanForWhitespaceChanges(equalLinesCount);\n seq1LastStart = diff.seq1Range.endExclusive;\n seq2LastStart = diff.seq2Range.endExclusive;\n const characterDiffs = this.refineDiff(originalLines, modifiedLines, diff, timeout, considerWhitespaceChanges);\n if (characterDiffs.hitTimeout) {\n hitTimeout = true;\n }\n for (const a of characterDiffs.mappings) {\n alignments.push(a);\n }\n }\n scanForWhitespaceChanges(originalLines.length - seq1LastStart);\n const changes = lineRangeMappingFromRangeMappings(alignments, originalLines, modifiedLines);\n let moves = [];\n if (options.computeMoves) {\n moves = this.computeMoves(changes, originalLines, modifiedLines, originalLinesHashes, modifiedLinesHashes, timeout, considerWhitespaceChanges);\n }\n // Make sure all ranges are valid\n assertFn(() => {\n function validatePosition(pos, lines) {\n if (pos.lineNumber < 1 || pos.lineNumber > lines.length) {\n return false;\n }\n const line = lines[pos.lineNumber - 1];\n if (pos.column < 1 || pos.column > line.length + 1) {\n return false;\n }\n return true;\n }\n function validateRange(range, lines) {\n if (range.startLineNumber < 1 || range.startLineNumber > lines.length + 1) {\n return false;\n }\n if (range.endLineNumberExclusive < 1 || range.endLineNumberExclusive > lines.length + 1) {\n return false;\n }\n return true;\n }\n for (const c of changes) {\n if (!c.innerChanges) {\n return false;\n }\n for (const ic of c.innerChanges) {\n const valid = validatePosition(ic.modifiedRange.getStartPosition(), modifiedLines) && validatePosition(ic.modifiedRange.getEndPosition(), modifiedLines) &&\n validatePosition(ic.originalRange.getStartPosition(), originalLines) && validatePosition(ic.originalRange.getEndPosition(), originalLines);\n if (!valid) {\n return false;\n }\n }\n if (!validateRange(c.modified, modifiedLines) || !validateRange(c.original, originalLines)) {\n return false;\n }\n }\n return true;\n });\n return new LinesDiff(changes, moves, hitTimeout);\n }\n computeMoves(changes, originalLines, modifiedLines, hashedOriginalLines, hashedModifiedLines, timeout, considerWhitespaceChanges) {\n const moves = computeMovedLines(changes, originalLines, modifiedLines, hashedOriginalLines, hashedModifiedLines, timeout);\n const movesWithDiffs = moves.map(m => {\n const moveChanges = this.refineDiff(originalLines, modifiedLines, new SequenceDiff(m.original.toOffsetRange(), m.modified.toOffsetRange()), timeout, considerWhitespaceChanges);\n const mappings = lineRangeMappingFromRangeMappings(moveChanges.mappings, originalLines, modifiedLines, true);\n return new MovedText(m, mappings);\n });\n return movesWithDiffs;\n }\n refineDiff(originalLines, modifiedLines, diff, timeout, considerWhitespaceChanges) {\n const slice1 = new LinesSliceCharSequence(originalLines, diff.seq1Range, considerWhitespaceChanges);\n const slice2 = new LinesSliceCharSequence(modifiedLines, diff.seq2Range, considerWhitespaceChanges);\n const diffResult = slice1.length + slice2.length < 500\n ? this.dynamicProgrammingDiffing.compute(slice1, slice2, timeout)\n : this.myersDiffingAlgorithm.compute(slice1, slice2, timeout);\n let diffs = diffResult.diffs;\n diffs = optimizeSequenceDiffs(slice1, slice2, diffs);\n diffs = extendDiffsToEntireWordIfAppropriate(slice1, slice2, diffs);\n diffs = removeShortMatches(slice1, slice2, diffs);\n diffs = removeVeryShortMatchingTextBetweenLongDiffs(slice1, slice2, diffs);\n const result = diffs.map((d) => new RangeMapping(slice1.translateRange(d.seq1Range), slice2.translateRange(d.seq2Range)));\n // Assert: result applied on original should be the same as diff applied to original\n return {\n mappings: result,\n hitTimeout: diffResult.hitTimeout,\n };\n }\n}\nexport function lineRangeMappingFromRangeMappings(alignments, originalLines, modifiedLines, dontAssertStartLine = false) {\n const changes = [];\n for (const g of groupAdjacentBy(alignments.map(a => getLineRangeMapping(a, originalLines, modifiedLines)), (a1, a2) => a1.original.overlapOrTouch(a2.original)\n || a1.modified.overlapOrTouch(a2.modified))) {\n const first = g[0];\n const last = g[g.length - 1];\n changes.push(new DetailedLineRangeMapping(first.original.join(last.original), first.modified.join(last.modified), g.map(a => a.innerChanges[0])));\n }\n assertFn(() => {\n if (!dontAssertStartLine) {\n if (changes.length > 0 && changes[0].original.startLineNumber !== changes[0].modified.startLineNumber) {\n return false;\n }\n }\n return checkAdjacentItems(changes, (m1, m2) => m2.original.startLineNumber - m1.original.endLineNumberExclusive === m2.modified.startLineNumber - m1.modified.endLineNumberExclusive &&\n // There has to be an unchanged line in between (otherwise both diffs should have been joined)\n m1.original.endLineNumberExclusive < m2.original.startLineNumber &&\n m1.modified.endLineNumberExclusive < m2.modified.startLineNumber);\n });\n return changes;\n}\nexport function getLineRangeMapping(rangeMapping, originalLines, modifiedLines) {\n let lineStartDelta = 0;\n let lineEndDelta = 0;\n // rangeMapping describes the edit that replaces `rangeMapping.originalRange` with `newText := getText(modifiedLines, rangeMapping.modifiedRange)`.\n // original: ]xxx \\n <- this line is not modified\n // modified: ]xx \\n\n if (rangeMapping.modifiedRange.endColumn === 1 && rangeMapping.originalRange.endColumn === 1\n && rangeMapping.originalRange.startLineNumber + lineStartDelta <= rangeMapping.originalRange.endLineNumber\n && rangeMapping.modifiedRange.startLineNumber + lineStartDelta <= rangeMapping.modifiedRange.endLineNumber) {\n // We can only do this if the range is not empty yet\n lineEndDelta = -1;\n }\n // original: xxx[ \\n <- this line is not modified\n // modified: xxx[ \\n\n if (rangeMapping.modifiedRange.startColumn - 1 >= modifiedLines[rangeMapping.modifiedRange.startLineNumber - 1].length\n && rangeMapping.originalRange.startColumn - 1 >= originalLines[rangeMapping.originalRange.startLineNumber - 1].length\n && rangeMapping.originalRange.startLineNumber <= rangeMapping.originalRange.endLineNumber + lineEndDelta\n && rangeMapping.modifiedRange.startLineNumber <= rangeMapping.modifiedRange.endLineNumber + lineEndDelta) {\n // We can only do this if the range is not empty yet\n lineStartDelta = 1;\n }\n const originalLineRange = new LineRange(rangeMapping.originalRange.startLineNumber + lineStartDelta, rangeMapping.originalRange.endLineNumber + 1 + lineEndDelta);\n const modifiedLineRange = new LineRange(rangeMapping.modifiedRange.startLineNumber + lineStartDelta, rangeMapping.modifiedRange.endLineNumber + 1 + lineEndDelta);\n return new DetailedLineRangeMapping(originalLineRange, modifiedLineRange, [rangeMapping]);\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { forEachWithNeighbors } from '../../../../base/common/arrays.js';\nimport { OffsetRange } from '../../core/offsetRange.js';\nimport { OffsetPair, SequenceDiff } from './algorithms/diffAlgorithm.js';\nexport function optimizeSequenceDiffs(sequence1, sequence2, sequenceDiffs) {\n let result = sequenceDiffs;\n result = joinSequenceDiffsByShifting(sequence1, sequence2, result);\n // Sometimes, calling this function twice improves the result.\n // Uncomment the second invocation and run the tests to see the difference.\n result = joinSequenceDiffsByShifting(sequence1, sequence2, result);\n result = shiftSequenceDiffs(sequence1, sequence2, result);\n return result;\n}\n/**\n * This function fixes issues like this:\n * ```\n * import { Baz, Bar } from \"foo\";\n * ```\n * <->\n * ```\n * import { Baz, Bar, Foo } from \"foo\";\n * ```\n * Computed diff: [ {Add \",\" after Bar}, {Add \"Foo \" after space} }\n * Improved diff: [{Add \", Foo\" after Bar}]\n */\nfunction joinSequenceDiffsByShifting(sequence1, sequence2, sequenceDiffs) {\n if (sequenceDiffs.length === 0) {\n return sequenceDiffs;\n }\n const result = [];\n result.push(sequenceDiffs[0]);\n // First move them all to the left as much as possible and join them if possible\n for (let i = 1; i < sequenceDiffs.length; i++) {\n const prevResult = result[result.length - 1];\n let cur = sequenceDiffs[i];\n if (cur.seq1Range.isEmpty || cur.seq2Range.isEmpty) {\n const length = cur.seq1Range.start - prevResult.seq1Range.endExclusive;\n let d;\n for (d = 1; d <= length; d++) {\n if (sequence1.getElement(cur.seq1Range.start - d) !== sequence1.getElement(cur.seq1Range.endExclusive - d) ||\n sequence2.getElement(cur.seq2Range.start - d) !== sequence2.getElement(cur.seq2Range.endExclusive - d)) {\n break;\n }\n }\n d--;\n if (d === length) {\n // Merge previous and current diff\n result[result.length - 1] = new SequenceDiff(new OffsetRange(prevResult.seq1Range.start, cur.seq1Range.endExclusive - length), new OffsetRange(prevResult.seq2Range.start, cur.seq2Range.endExclusive - length));\n continue;\n }\n cur = cur.delta(-d);\n }\n result.push(cur);\n }\n const result2 = [];\n // Then move them all to the right and join them again if possible\n for (let i = 0; i < result.length - 1; i++) {\n const nextResult = result[i + 1];\n let cur = result[i];\n if (cur.seq1Range.isEmpty || cur.seq2Range.isEmpty) {\n const length = nextResult.seq1Range.start - cur.seq1Range.endExclusive;\n let d;\n for (d = 0; d < length; d++) {\n if (!sequence1.isStronglyEqual(cur.seq1Range.start + d, cur.seq1Range.endExclusive + d) ||\n !sequence2.isStronglyEqual(cur.seq2Range.start + d, cur.seq2Range.endExclusive + d)) {\n break;\n }\n }\n if (d === length) {\n // Merge previous and current diff, write to result!\n result[i + 1] = new SequenceDiff(new OffsetRange(cur.seq1Range.start + length, nextResult.seq1Range.endExclusive), new OffsetRange(cur.seq2Range.start + length, nextResult.seq2Range.endExclusive));\n continue;\n }\n if (d > 0) {\n cur = cur.delta(d);\n }\n }\n result2.push(cur);\n }\n if (result.length > 0) {\n result2.push(result[result.length - 1]);\n }\n return result2;\n}\n// align character level diffs at whitespace characters\n// import { IBar } from \"foo\";\n// import { I[Arr, I]Bar } from \"foo\";\n// ->\n// import { [IArr, ]IBar } from \"foo\";\n// import { ITransaction, observableValue, transaction } from 'vs/base/common/observable';\n// import { ITransaction, observable[FromEvent, observable]Value, transaction } from 'vs/base/common/observable';\n// ->\n// import { ITransaction, [observableFromEvent, ]observableValue, transaction } from 'vs/base/common/observable';\n// collectBrackets(level + 1, levelPerBracketType);\n// collectBrackets(level + 1, levelPerBracket[ + 1, levelPerBracket]Type);\n// ->\n// collectBrackets(level + 1, [levelPerBracket + 1, ]levelPerBracketType);\nfunction shiftSequenceDiffs(sequence1, sequence2, sequenceDiffs) {\n if (!sequence1.getBoundaryScore || !sequence2.getBoundaryScore) {\n return sequenceDiffs;\n }\n for (let i = 0; i < sequenceDiffs.length; i++) {\n const prevDiff = (i > 0 ? sequenceDiffs[i - 1] : undefined);\n const diff = sequenceDiffs[i];\n const nextDiff = (i + 1 < sequenceDiffs.length ? sequenceDiffs[i + 1] : undefined);\n const seq1ValidRange = new OffsetRange(prevDiff ? prevDiff.seq1Range.start + 1 : 0, nextDiff ? nextDiff.seq1Range.endExclusive - 1 : sequence1.length);\n const seq2ValidRange = new OffsetRange(prevDiff ? prevDiff.seq2Range.start + 1 : 0, nextDiff ? nextDiff.seq2Range.endExclusive - 1 : sequence2.length);\n if (diff.seq1Range.isEmpty) {\n sequenceDiffs[i] = shiftDiffToBetterPosition(diff, sequence1, sequence2, seq1ValidRange, seq2ValidRange);\n }\n else if (diff.seq2Range.isEmpty) {\n sequenceDiffs[i] = shiftDiffToBetterPosition(diff.swap(), sequence2, sequence1, seq2ValidRange, seq1ValidRange).swap();\n }\n }\n return sequenceDiffs;\n}\nfunction shiftDiffToBetterPosition(diff, sequence1, sequence2, seq1ValidRange, seq2ValidRange) {\n const maxShiftLimit = 100; // To prevent performance issues\n // don't touch previous or next!\n let deltaBefore = 1;\n while (diff.seq1Range.start - deltaBefore >= seq1ValidRange.start &&\n diff.seq2Range.start - deltaBefore >= seq2ValidRange.start &&\n sequence2.isStronglyEqual(diff.seq2Range.start - deltaBefore, diff.seq2Range.endExclusive - deltaBefore) && deltaBefore < maxShiftLimit) {\n deltaBefore++;\n }\n deltaBefore--;\n let deltaAfter = 0;\n while (diff.seq1Range.start + deltaAfter < seq1ValidRange.endExclusive &&\n diff.seq2Range.endExclusive + deltaAfter < seq2ValidRange.endExclusive &&\n sequence2.isStronglyEqual(diff.seq2Range.start + deltaAfter, diff.seq2Range.endExclusive + deltaAfter) && deltaAfter < maxShiftLimit) {\n deltaAfter++;\n }\n if (deltaBefore === 0 && deltaAfter === 0) {\n return diff;\n }\n // Visualize `[sequence1.text, diff.seq1Range.start + deltaAfter]`\n // and `[sequence2.text, diff.seq2Range.start + deltaAfter, diff.seq2Range.endExclusive + deltaAfter]`\n let bestDelta = 0;\n let bestScore = -1;\n // find best scored delta\n for (let delta = -deltaBefore; delta <= deltaAfter; delta++) {\n const seq2OffsetStart = diff.seq2Range.start + delta;\n const seq2OffsetEndExclusive = diff.seq2Range.endExclusive + delta;\n const seq1Offset = diff.seq1Range.start + delta;\n const score = sequence1.getBoundaryScore(seq1Offset) + sequence2.getBoundaryScore(seq2OffsetStart) + sequence2.getBoundaryScore(seq2OffsetEndExclusive);\n if (score > bestScore) {\n bestScore = score;\n bestDelta = delta;\n }\n }\n return diff.delta(bestDelta);\n}\nexport function removeShortMatches(sequence1, sequence2, sequenceDiffs) {\n const result = [];\n for (const s of sequenceDiffs) {\n const last = result[result.length - 1];\n if (!last) {\n result.push(s);\n continue;\n }\n if (s.seq1Range.start - last.seq1Range.endExclusive <= 2 || s.seq2Range.start - last.seq2Range.endExclusive <= 2) {\n result[result.length - 1] = new SequenceDiff(last.seq1Range.join(s.seq1Range), last.seq2Range.join(s.seq2Range));\n }\n else {\n result.push(s);\n }\n }\n return result;\n}\nexport function extendDiffsToEntireWordIfAppropriate(sequence1, sequence2, sequenceDiffs) {\n const additional = [];\n let lastModifiedWord = undefined;\n function maybePushWordToAdditional() {\n if (!lastModifiedWord) {\n return;\n }\n const originalLength1 = lastModifiedWord.s1Range.length - lastModifiedWord.deleted;\n const originalLength2 = lastModifiedWord.s2Range.length - lastModifiedWord.added;\n if (originalLength1 !== originalLength2) {\n // TODO figure out why this happens\n }\n if (Math.max(lastModifiedWord.deleted, lastModifiedWord.added) + (lastModifiedWord.count - 1) > originalLength1) {\n additional.push(new SequenceDiff(lastModifiedWord.s1Range, lastModifiedWord.s2Range));\n }\n lastModifiedWord = undefined;\n }\n for (const s of sequenceDiffs) {\n function processWord(s1Range, s2Range) {\n var _a, _b, _c, _d;\n if (!lastModifiedWord || !lastModifiedWord.s1Range.containsRange(s1Range) || !lastModifiedWord.s2Range.containsRange(s2Range)) {\n if (lastModifiedWord && !(lastModifiedWord.s1Range.endExclusive < s1Range.start && lastModifiedWord.s2Range.endExclusive < s2Range.start)) {\n const s1Added = OffsetRange.tryCreate(lastModifiedWord.s1Range.endExclusive, s1Range.start);\n const s2Added = OffsetRange.tryCreate(lastModifiedWord.s2Range.endExclusive, s2Range.start);\n lastModifiedWord.deleted += (_a = s1Added === null || s1Added === void 0 ? void 0 : s1Added.length) !== null && _a !== void 0 ? _a : 0;\n lastModifiedWord.added += (_b = s2Added === null || s2Added === void 0 ? void 0 : s2Added.length) !== null && _b !== void 0 ? _b : 0;\n lastModifiedWord.s1Range = lastModifiedWord.s1Range.join(s1Range);\n lastModifiedWord.s2Range = lastModifiedWord.s2Range.join(s2Range);\n }\n else {\n maybePushWordToAdditional();\n lastModifiedWord = { added: 0, deleted: 0, count: 0, s1Range: s1Range, s2Range: s2Range };\n }\n }\n const changedS1 = s1Range.intersect(s.seq1Range);\n const changedS2 = s2Range.intersect(s.seq2Range);\n lastModifiedWord.count++;\n lastModifiedWord.deleted += (_c = changedS1 === null || changedS1 === void 0 ? void 0 : changedS1.length) !== null && _c !== void 0 ? _c : 0;\n lastModifiedWord.added += (_d = changedS2 === null || changedS2 === void 0 ? void 0 : changedS2.length) !== null && _d !== void 0 ? _d : 0;\n }\n const w1Before = sequence1.findWordContaining(s.seq1Range.start - 1);\n const w2Before = sequence2.findWordContaining(s.seq2Range.start - 1);\n const w1After = sequence1.findWordContaining(s.seq1Range.endExclusive);\n const w2After = sequence2.findWordContaining(s.seq2Range.endExclusive);\n if (w1Before && w1After && w2Before && w2After && w1Before.equals(w1After) && w2Before.equals(w2After)) {\n processWord(w1Before, w2Before);\n }\n else {\n if (w1Before && w2Before) {\n processWord(w1Before, w2Before);\n }\n if (w1After && w2After) {\n processWord(w1After, w2After);\n }\n }\n }\n maybePushWordToAdditional();\n const merged = mergeSequenceDiffs(sequenceDiffs, additional);\n return merged;\n}\nfunction mergeSequenceDiffs(sequenceDiffs1, sequenceDiffs2) {\n const result = [];\n while (sequenceDiffs1.length > 0 || sequenceDiffs2.length > 0) {\n const sd1 = sequenceDiffs1[0];\n const sd2 = sequenceDiffs2[0];\n let next;\n if (sd1 && (!sd2 || sd1.seq1Range.start < sd2.seq1Range.start)) {\n next = sequenceDiffs1.shift();\n }\n else {\n next = sequenceDiffs2.shift();\n }\n if (result.length > 0 && result[result.length - 1].seq1Range.endExclusive >= next.seq1Range.start) {\n result[result.length - 1] = result[result.length - 1].join(next);\n }\n else {\n result.push(next);\n }\n }\n return result;\n}\nexport function removeVeryShortMatchingLinesBetweenDiffs(sequence1, _sequence2, sequenceDiffs) {\n let diffs = sequenceDiffs;\n if (diffs.length === 0) {\n return diffs;\n }\n let counter = 0;\n let shouldRepeat;\n do {\n shouldRepeat = false;\n const result = [\n diffs[0]\n ];\n for (let i = 1; i < diffs.length; i++) {\n const cur = diffs[i];\n const lastResult = result[result.length - 1];\n function shouldJoinDiffs(before, after) {\n const unchangedRange = new OffsetRange(lastResult.seq1Range.endExclusive, cur.seq1Range.start);\n const unchangedText = sequence1.getText(unchangedRange);\n const unchangedTextWithoutWs = unchangedText.replace(/\\s/g, '');\n if (unchangedTextWithoutWs.length <= 4\n && (before.seq1Range.length + before.seq2Range.length > 5 || after.seq1Range.length + after.seq2Range.length > 5)) {\n return true;\n }\n return false;\n }\n const shouldJoin = shouldJoinDiffs(lastResult, cur);\n if (shouldJoin) {\n shouldRepeat = true;\n result[result.length - 1] = result[result.length - 1].join(cur);\n }\n else {\n result.push(cur);\n }\n }\n diffs = result;\n } while (counter++ < 10 && shouldRepeat);\n return diffs;\n}\nexport function removeVeryShortMatchingTextBetweenLongDiffs(sequence1, sequence2, sequenceDiffs) {\n let diffs = sequenceDiffs;\n if (diffs.length === 0) {\n return diffs;\n }\n let counter = 0;\n let shouldRepeat;\n do {\n shouldRepeat = false;\n const result = [\n diffs[0]\n ];\n for (let i = 1; i < diffs.length; i++) {\n const cur = diffs[i];\n const lastResult = result[result.length - 1];\n function shouldJoinDiffs(before, after) {\n const unchangedRange = new OffsetRange(lastResult.seq1Range.endExclusive, cur.seq1Range.start);\n const unchangedLineCount = sequence1.countLinesIn(unchangedRange);\n if (unchangedLineCount > 5 || unchangedRange.length > 500) {\n return false;\n }\n const unchangedText = sequence1.getText(unchangedRange).trim();\n if (unchangedText.length > 20 || unchangedText.split(/\\r\\n|\\r|\\n/).length > 1) {\n return false;\n }\n const beforeLineCount1 = sequence1.countLinesIn(before.seq1Range);\n const beforeSeq1Length = before.seq1Range.length;\n const beforeLineCount2 = sequence2.countLinesIn(before.seq2Range);\n const beforeSeq2Length = before.seq2Range.length;\n const afterLineCount1 = sequence1.countLinesIn(after.seq1Range);\n const afterSeq1Length = after.seq1Range.length;\n const afterLineCount2 = sequence2.countLinesIn(after.seq2Range);\n const afterSeq2Length = after.seq2Range.length;\n // TODO: Maybe a neural net can be used to derive the result from these numbers\n const max = 2 * 40 + 50;\n function cap(v) {\n return Math.min(v, max);\n }\n if (Math.pow(Math.pow(cap(beforeLineCount1 * 40 + beforeSeq1Length), 1.5) + Math.pow(cap(beforeLineCount2 * 40 + beforeSeq2Length), 1.5), 1.5)\n + Math.pow(Math.pow(cap(afterLineCount1 * 40 + afterSeq1Length), 1.5) + Math.pow(cap(afterLineCount2 * 40 + afterSeq2Length), 1.5), 1.5) > ((max ** 1.5) ** 1.5) * 1.3) {\n return true;\n }\n return false;\n }\n const shouldJoin = shouldJoinDiffs(lastResult, cur);\n if (shouldJoin) {\n shouldRepeat = true;\n result[result.length - 1] = result[result.length - 1].join(cur);\n }\n else {\n result.push(cur);\n }\n }\n diffs = result;\n } while (counter++ < 10 && shouldRepeat);\n const newDiffs = [];\n // Remove short suffixes/prefixes\n forEachWithNeighbors(diffs, (prev, cur, next) => {\n let newDiff = cur;\n function shouldMarkAsChanged(text) {\n return text.length > 0 && text.trim().length <= 3 && cur.seq1Range.length + cur.seq2Range.length > 100;\n }\n const fullRange1 = sequence1.extendToFullLines(cur.seq1Range);\n const prefix = sequence1.getText(new OffsetRange(fullRange1.start, cur.seq1Range.start));\n if (shouldMarkAsChanged(prefix)) {\n newDiff = newDiff.deltaStart(-prefix.length);\n }\n const suffix = sequence1.getText(new OffsetRange(cur.seq1Range.endExclusive, fullRange1.endExclusive));\n if (shouldMarkAsChanged(suffix)) {\n newDiff = newDiff.deltaEnd(suffix.length);\n }\n const availableSpace = SequenceDiff.fromOffsetPairs(prev ? prev.getEndExclusives() : OffsetPair.zero, next ? next.getStarts() : OffsetPair.max);\n const result = newDiff.intersect(availableSpace);\n newDiffs.push(result);\n });\n return newDiffs;\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nexport class LineSequence {\n constructor(trimmedHash, lines) {\n this.trimmedHash = trimmedHash;\n this.lines = lines;\n }\n getElement(offset) {\n return this.trimmedHash[offset];\n }\n get length() {\n return this.trimmedHash.length;\n }\n getBoundaryScore(length) {\n const indentationBefore = length === 0 ? 0 : getIndentation(this.lines[length - 1]);\n const indentationAfter = length === this.lines.length ? 0 : getIndentation(this.lines[length]);\n return 1000 - (indentationBefore + indentationAfter);\n }\n getText(range) {\n return this.lines.slice(range.start, range.endExclusive).join('\\n');\n }\n isStronglyEqual(offset1, offset2) {\n return this.lines[offset1] === this.lines[offset2];\n }\n}\nfunction getIndentation(str) {\n let i = 0;\n while (i < str.length && (str.charCodeAt(i) === 32 /* CharCode.Space */ || str.charCodeAt(i) === 9 /* CharCode.Tab */)) {\n i++;\n }\n return i;\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { findLastIdxMonotonous, findLastMonotonous, findFirstMonotonous } from '../../../../base/common/arraysFind.js';\nimport { OffsetRange } from '../../core/offsetRange.js';\nimport { Position } from '../../core/position.js';\nimport { Range } from '../../core/range.js';\nimport { isSpace } from './utils.js';\nexport class LinesSliceCharSequence {\n constructor(lines, lineRange, considerWhitespaceChanges) {\n // This slice has to have lineRange.length many \\n! (otherwise diffing against an empty slice will be problematic)\n // (Unless it covers the entire document, in that case the other slice also has to cover the entire document ands it's okay)\n this.lines = lines;\n this.considerWhitespaceChanges = considerWhitespaceChanges;\n this.elements = [];\n this.firstCharOffsetByLine = [];\n // To account for trimming\n this.additionalOffsetByLine = [];\n // If the slice covers the end, but does not start at the beginning, we include just the \\n of the previous line.\n let trimFirstLineFully = false;\n if (lineRange.start > 0 && lineRange.endExclusive >= lines.length) {\n lineRange = new OffsetRange(lineRange.start - 1, lineRange.endExclusive);\n trimFirstLineFully = true;\n }\n this.lineRange = lineRange;\n this.firstCharOffsetByLine[0] = 0;\n for (let i = this.lineRange.start; i < this.lineRange.endExclusive; i++) {\n let line = lines[i];\n let offset = 0;\n if (trimFirstLineFully) {\n offset = line.length;\n line = '';\n trimFirstLineFully = false;\n }\n else if (!considerWhitespaceChanges) {\n const trimmedStartLine = line.trimStart();\n offset = line.length - trimmedStartLine.length;\n line = trimmedStartLine.trimEnd();\n }\n this.additionalOffsetByLine.push(offset);\n for (let i = 0; i < line.length; i++) {\n this.elements.push(line.charCodeAt(i));\n }\n // Don't add an \\n that does not exist in the document.\n if (i < lines.length - 1) {\n this.elements.push('\\n'.charCodeAt(0));\n this.firstCharOffsetByLine[i - this.lineRange.start + 1] = this.elements.length;\n }\n }\n // To account for the last line\n this.additionalOffsetByLine.push(0);\n }\n toString() {\n return `Slice: \"${this.text}\"`;\n }\n get text() {\n return this.getText(new OffsetRange(0, this.length));\n }\n getText(range) {\n return this.elements.slice(range.start, range.endExclusive).map(e => String.fromCharCode(e)).join('');\n }\n getElement(offset) {\n return this.elements[offset];\n }\n get length() {\n return this.elements.length;\n }\n getBoundaryScore(length) {\n // a b c , d e f\n // 11 0 0 12 15 6 13 0 0 11\n const prevCategory = getCategory(length > 0 ? this.elements[length - 1] : -1);\n const nextCategory = getCategory(length < this.elements.length ? this.elements[length] : -1);\n if (prevCategory === 7 /* CharBoundaryCategory.LineBreakCR */ && nextCategory === 8 /* CharBoundaryCategory.LineBreakLF */) {\n // don't break between \\r and \\n\n return 0;\n }\n let score = 0;\n if (prevCategory !== nextCategory) {\n score += 10;\n if (prevCategory === 0 /* CharBoundaryCategory.WordLower */ && nextCategory === 1 /* CharBoundaryCategory.WordUpper */) {\n score += 1;\n }\n }\n score += getCategoryBoundaryScore(prevCategory);\n score += getCategoryBoundaryScore(nextCategory);\n return score;\n }\n translateOffset(offset) {\n // find smallest i, so that lineBreakOffsets[i] <= offset using binary search\n if (this.lineRange.isEmpty) {\n return new Position(this.lineRange.start + 1, 1);\n }\n const i = findLastIdxMonotonous(this.firstCharOffsetByLine, (value) => value <= offset);\n return new Position(this.lineRange.start + i + 1, offset - this.firstCharOffsetByLine[i] + this.additionalOffsetByLine[i] + 1);\n }\n translateRange(range) {\n return Range.fromPositions(this.translateOffset(range.start), this.translateOffset(range.endExclusive));\n }\n /**\n * Finds the word that contains the character at the given offset\n */\n findWordContaining(offset) {\n if (offset < 0 || offset >= this.elements.length) {\n return undefined;\n }\n if (!isWordChar(this.elements[offset])) {\n return undefined;\n }\n // find start\n let start = offset;\n while (start > 0 && isWordChar(this.elements[start - 1])) {\n start--;\n }\n // find end\n let end = offset;\n while (end < this.elements.length && isWordChar(this.elements[end])) {\n end++;\n }\n return new OffsetRange(start, end);\n }\n countLinesIn(range) {\n return this.translateOffset(range.endExclusive).lineNumber - this.translateOffset(range.start).lineNumber;\n }\n isStronglyEqual(offset1, offset2) {\n return this.elements[offset1] === this.elements[offset2];\n }\n extendToFullLines(range) {\n var _a, _b;\n const start = (_a = findLastMonotonous(this.firstCharOffsetByLine, x => x <= range.start)) !== null && _a !== void 0 ? _a : 0;\n const end = (_b = findFirstMonotonous(this.firstCharOffsetByLine, x => range.endExclusive <= x)) !== null && _b !== void 0 ? _b : this.elements.length;\n return new OffsetRange(start, end);\n }\n}\nfunction isWordChar(charCode) {\n return charCode >= 97 /* CharCode.a */ && charCode <= 122 /* CharCode.z */\n || charCode >= 65 /* CharCode.A */ && charCode <= 90 /* CharCode.Z */\n || charCode >= 48 /* CharCode.Digit0 */ && charCode <= 57 /* CharCode.Digit9 */;\n}\nconst score = {\n [0 /* CharBoundaryCategory.WordLower */]: 0,\n [1 /* CharBoundaryCategory.WordUpper */]: 0,\n [2 /* CharBoundaryCategory.WordNumber */]: 0,\n [3 /* CharBoundaryCategory.End */]: 10,\n [4 /* CharBoundaryCategory.Other */]: 2,\n [5 /* CharBoundaryCategory.Separator */]: 3,\n [6 /* CharBoundaryCategory.Space */]: 3,\n [7 /* CharBoundaryCategory.LineBreakCR */]: 10,\n [8 /* CharBoundaryCategory.LineBreakLF */]: 10,\n};\nfunction getCategoryBoundaryScore(category) {\n return score[category];\n}\nfunction getCategory(charCode) {\n if (charCode === 10 /* CharCode.LineFeed */) {\n return 8 /* CharBoundaryCategory.LineBreakLF */;\n }\n else if (charCode === 13 /* CharCode.CarriageReturn */) {\n return 7 /* CharBoundaryCategory.LineBreakCR */;\n }\n else if (isSpace(charCode)) {\n return 6 /* CharBoundaryCategory.Space */;\n }\n else if (charCode >= 97 /* CharCode.a */ && charCode <= 122 /* CharCode.z */) {\n return 0 /* CharBoundaryCategory.WordLower */;\n }\n else if (charCode >= 65 /* CharCode.A */ && charCode <= 90 /* CharCode.Z */) {\n return 1 /* CharBoundaryCategory.WordUpper */;\n }\n else if (charCode >= 48 /* CharCode.Digit0 */ && charCode <= 57 /* CharCode.Digit9 */) {\n return 2 /* CharBoundaryCategory.WordNumber */;\n }\n else if (charCode === -1) {\n return 3 /* CharBoundaryCategory.End */;\n }\n else if (charCode === 44 /* CharCode.Comma */ || charCode === 59 /* CharCode.Semicolon */) {\n return 5 /* CharBoundaryCategory.Separator */;\n }\n else {\n return 4 /* CharBoundaryCategory.Other */;\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nexport class Array2D {\n constructor(width, height) {\n this.width = width;\n this.height = height;\n this.array = [];\n this.array = new Array(width * height);\n }\n get(x, y) {\n return this.array[x + y * this.width];\n }\n set(x, y, value) {\n this.array[x + y * this.width] = value;\n }\n}\nexport function isSpace(charCode) {\n return charCode === 32 /* CharCode.Space */ || charCode === 9 /* CharCode.Tab */;\n}\nexport class LineRangeFragment {\n static getKey(chr) {\n let key = this.chrKeys.get(chr);\n if (key === undefined) {\n key = this.chrKeys.size;\n this.chrKeys.set(chr, key);\n }\n return key;\n }\n constructor(range, lines, source) {\n this.range = range;\n this.lines = lines;\n this.source = source;\n this.histogram = [];\n let counter = 0;\n for (let i = range.startLineNumber - 1; i < range.endLineNumberExclusive - 1; i++) {\n const line = lines[i];\n for (let j = 0; j < line.length; j++) {\n counter++;\n const chr = line[j];\n const key = LineRangeFragment.getKey(chr);\n this.histogram[key] = (this.histogram[key] || 0) + 1;\n }\n counter++;\n const key = LineRangeFragment.getKey('\\n');\n this.histogram[key] = (this.histogram[key] || 0) + 1;\n }\n this.totalCount = counter;\n }\n computeSimilarity(other) {\n var _a, _b;\n let sumDifferences = 0;\n const maxLength = Math.max(this.histogram.length, other.histogram.length);\n for (let i = 0; i < maxLength; i++) {\n sumDifferences += Math.abs(((_a = this.histogram[i]) !== null && _a !== void 0 ? _a : 0) - ((_b = other.histogram[i]) !== null && _b !== void 0 ? _b : 0));\n }\n return 1 - (sumDifferences / (this.totalCount + other.totalCount));\n }\n}\nLineRangeFragment.chrKeys = new Map();\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { LcsDiff } from '../../../base/common/diff/diff.js';\nimport { LinesDiff } from './linesDiffComputer.js';\nimport { RangeMapping, DetailedLineRangeMapping } from './rangeMapping.js';\nimport * as strings from '../../../base/common/strings.js';\nimport { Range } from '../core/range.js';\nimport { assertFn, checkAdjacentItems } from '../../../base/common/assert.js';\nimport { LineRange } from '../core/lineRange.js';\nconst MINIMUM_MATCHING_CHARACTER_LENGTH = 3;\nexport class LegacyLinesDiffComputer {\n computeDiff(originalLines, modifiedLines, options) {\n var _a;\n const diffComputer = new DiffComputer(originalLines, modifiedLines, {\n maxComputationTime: options.maxComputationTimeMs,\n shouldIgnoreTrimWhitespace: options.ignoreTrimWhitespace,\n shouldComputeCharChanges: true,\n shouldMakePrettyDiff: true,\n shouldPostProcessCharChanges: true,\n });\n const result = diffComputer.computeDiff();\n const changes = [];\n let lastChange = null;\n for (const c of result.changes) {\n let originalRange;\n if (c.originalEndLineNumber === 0) {\n // Insertion\n originalRange = new LineRange(c.originalStartLineNumber + 1, c.originalStartLineNumber + 1);\n }\n else {\n originalRange = new LineRange(c.originalStartLineNumber, c.originalEndLineNumber + 1);\n }\n let modifiedRange;\n if (c.modifiedEndLineNumber === 0) {\n // Deletion\n modifiedRange = new LineRange(c.modifiedStartLineNumber + 1, c.modifiedStartLineNumber + 1);\n }\n else {\n modifiedRange = new LineRange(c.modifiedStartLineNumber, c.modifiedEndLineNumber + 1);\n }\n let change = new DetailedLineRangeMapping(originalRange, modifiedRange, (_a = c.charChanges) === null || _a === void 0 ? void 0 : _a.map(c => new RangeMapping(new Range(c.originalStartLineNumber, c.originalStartColumn, c.originalEndLineNumber, c.originalEndColumn), new Range(c.modifiedStartLineNumber, c.modifiedStartColumn, c.modifiedEndLineNumber, c.modifiedEndColumn))));\n if (lastChange) {\n if (lastChange.modified.endLineNumberExclusive === change.modified.startLineNumber\n || lastChange.original.endLineNumberExclusive === change.original.startLineNumber) {\n // join touching diffs. Probably moving diffs up/down in the algorithm causes touching diffs.\n change = new DetailedLineRangeMapping(lastChange.original.join(change.original), lastChange.modified.join(change.modified), lastChange.innerChanges && change.innerChanges ?\n lastChange.innerChanges.concat(change.innerChanges) : undefined);\n changes.pop();\n }\n }\n changes.push(change);\n lastChange = change;\n }\n assertFn(() => {\n return checkAdjacentItems(changes, (m1, m2) => m2.original.startLineNumber - m1.original.endLineNumberExclusive === m2.modified.startLineNumber - m1.modified.endLineNumberExclusive &&\n // There has to be an unchanged line in between (otherwise both diffs should have been joined)\n m1.original.endLineNumberExclusive < m2.original.startLineNumber &&\n m1.modified.endLineNumberExclusive < m2.modified.startLineNumber);\n });\n return new LinesDiff(changes, [], result.quitEarly);\n }\n}\nfunction computeDiff(originalSequence, modifiedSequence, continueProcessingPredicate, pretty) {\n const diffAlgo = new LcsDiff(originalSequence, modifiedSequence, continueProcessingPredicate);\n return diffAlgo.ComputeDiff(pretty);\n}\nclass LineSequence {\n constructor(lines) {\n const startColumns = [];\n const endColumns = [];\n for (let i = 0, length = lines.length; i < length; i++) {\n startColumns[i] = getFirstNonBlankColumn(lines[i], 1);\n endColumns[i] = getLastNonBlankColumn(lines[i], 1);\n }\n this.lines = lines;\n this._startColumns = startColumns;\n this._endColumns = endColumns;\n }\n getElements() {\n const elements = [];\n for (let i = 0, len = this.lines.length; i < len; i++) {\n elements[i] = this.lines[i].substring(this._startColumns[i] - 1, this._endColumns[i] - 1);\n }\n return elements;\n }\n getStrictElement(index) {\n return this.lines[index];\n }\n getStartLineNumber(i) {\n return i + 1;\n }\n getEndLineNumber(i) {\n return i + 1;\n }\n createCharSequence(shouldIgnoreTrimWhitespace, startIndex, endIndex) {\n const charCodes = [];\n const lineNumbers = [];\n const columns = [];\n let len = 0;\n for (let index = startIndex; index <= endIndex; index++) {\n const lineContent = this.lines[index];\n const startColumn = (shouldIgnoreTrimWhitespace ? this._startColumns[index] : 1);\n const endColumn = (shouldIgnoreTrimWhitespace ? this._endColumns[index] : lineContent.length + 1);\n for (let col = startColumn; col < endColumn; col++) {\n charCodes[len] = lineContent.charCodeAt(col - 1);\n lineNumbers[len] = index + 1;\n columns[len] = col;\n len++;\n }\n if (!shouldIgnoreTrimWhitespace && index < endIndex) {\n // Add \\n if trim whitespace is not ignored\n charCodes[len] = 10 /* CharCode.LineFeed */;\n lineNumbers[len] = index + 1;\n columns[len] = lineContent.length + 1;\n len++;\n }\n }\n return new CharSequence(charCodes, lineNumbers, columns);\n }\n}\nclass CharSequence {\n constructor(charCodes, lineNumbers, columns) {\n this._charCodes = charCodes;\n this._lineNumbers = lineNumbers;\n this._columns = columns;\n }\n toString() {\n return ('[' + this._charCodes.map((s, idx) => (s === 10 /* CharCode.LineFeed */ ? '\\\\n' : String.fromCharCode(s)) + `-(${this._lineNumbers[idx]},${this._columns[idx]})`).join(', ') + ']');\n }\n _assertIndex(index, arr) {\n if (index < 0 || index >= arr.length) {\n throw new Error(`Illegal index`);\n }\n }\n getElements() {\n return this._charCodes;\n }\n getStartLineNumber(i) {\n if (i > 0 && i === this._lineNumbers.length) {\n // the start line number of the element after the last element\n // is the end line number of the last element\n return this.getEndLineNumber(i - 1);\n }\n this._assertIndex(i, this._lineNumbers);\n return this._lineNumbers[i];\n }\n getEndLineNumber(i) {\n if (i === -1) {\n // the end line number of the element before the first element\n // is the start line number of the first element\n return this.getStartLineNumber(i + 1);\n }\n this._assertIndex(i, this._lineNumbers);\n if (this._charCodes[i] === 10 /* CharCode.LineFeed */) {\n return this._lineNumbers[i] + 1;\n }\n return this._lineNumbers[i];\n }\n getStartColumn(i) {\n if (i > 0 && i === this._columns.length) {\n // the start column of the element after the last element\n // is the end column of the last element\n return this.getEndColumn(i - 1);\n }\n this._assertIndex(i, this._columns);\n return this._columns[i];\n }\n getEndColumn(i) {\n if (i === -1) {\n // the end column of the element before the first element\n // is the start column of the first element\n return this.getStartColumn(i + 1);\n }\n this._assertIndex(i, this._columns);\n if (this._charCodes[i] === 10 /* CharCode.LineFeed */) {\n return 1;\n }\n return this._columns[i] + 1;\n }\n}\nclass CharChange {\n constructor(originalStartLineNumber, originalStartColumn, originalEndLineNumber, originalEndColumn, modifiedStartLineNumber, modifiedStartColumn, modifiedEndLineNumber, modifiedEndColumn) {\n this.originalStartLineNumber = originalStartLineNumber;\n this.originalStartColumn = originalStartColumn;\n this.originalEndLineNumber = originalEndLineNumber;\n this.originalEndColumn = originalEndColumn;\n this.modifiedStartLineNumber = modifiedStartLineNumber;\n this.modifiedStartColumn = modifiedStartColumn;\n this.modifiedEndLineNumber = modifiedEndLineNumber;\n this.modifiedEndColumn = modifiedEndColumn;\n }\n static createFromDiffChange(diffChange, originalCharSequence, modifiedCharSequence) {\n const originalStartLineNumber = originalCharSequence.getStartLineNumber(diffChange.originalStart);\n const originalStartColumn = originalCharSequence.getStartColumn(diffChange.originalStart);\n const originalEndLineNumber = originalCharSequence.getEndLineNumber(diffChange.originalStart + diffChange.originalLength - 1);\n const originalEndColumn = originalCharSequence.getEndColumn(diffChange.originalStart + diffChange.originalLength - 1);\n const modifiedStartLineNumber = modifiedCharSequence.getStartLineNumber(diffChange.modifiedStart);\n const modifiedStartColumn = modifiedCharSequence.getStartColumn(diffChange.modifiedStart);\n const modifiedEndLineNumber = modifiedCharSequence.getEndLineNumber(diffChange.modifiedStart + diffChange.modifiedLength - 1);\n const modifiedEndColumn = modifiedCharSequence.getEndColumn(diffChange.modifiedStart + diffChange.modifiedLength - 1);\n return new CharChange(originalStartLineNumber, originalStartColumn, originalEndLineNumber, originalEndColumn, modifiedStartLineNumber, modifiedStartColumn, modifiedEndLineNumber, modifiedEndColumn);\n }\n}\nfunction postProcessCharChanges(rawChanges) {\n if (rawChanges.length <= 1) {\n return rawChanges;\n }\n const result = [rawChanges[0]];\n let prevChange = result[0];\n for (let i = 1, len = rawChanges.length; i < len; i++) {\n const currChange = rawChanges[i];\n const originalMatchingLength = currChange.originalStart - (prevChange.originalStart + prevChange.originalLength);\n const modifiedMatchingLength = currChange.modifiedStart - (prevChange.modifiedStart + prevChange.modifiedLength);\n // Both of the above should be equal, but the continueProcessingPredicate may prevent this from being true\n const matchingLength = Math.min(originalMatchingLength, modifiedMatchingLength);\n if (matchingLength < MINIMUM_MATCHING_CHARACTER_LENGTH) {\n // Merge the current change into the previous one\n prevChange.originalLength = (currChange.originalStart + currChange.originalLength) - prevChange.originalStart;\n prevChange.modifiedLength = (currChange.modifiedStart + currChange.modifiedLength) - prevChange.modifiedStart;\n }\n else {\n // Add the current change\n result.push(currChange);\n prevChange = currChange;\n }\n }\n return result;\n}\nclass LineChange {\n constructor(originalStartLineNumber, originalEndLineNumber, modifiedStartLineNumber, modifiedEndLineNumber, charChanges) {\n this.originalStartLineNumber = originalStartLineNumber;\n this.originalEndLineNumber = originalEndLineNumber;\n this.modifiedStartLineNumber = modifiedStartLineNumber;\n this.modifiedEndLineNumber = modifiedEndLineNumber;\n this.charChanges = charChanges;\n }\n static createFromDiffResult(shouldIgnoreTrimWhitespace, diffChange, originalLineSequence, modifiedLineSequence, continueCharDiff, shouldComputeCharChanges, shouldPostProcessCharChanges) {\n let originalStartLineNumber;\n let originalEndLineNumber;\n let modifiedStartLineNumber;\n let modifiedEndLineNumber;\n let charChanges = undefined;\n if (diffChange.originalLength === 0) {\n originalStartLineNumber = originalLineSequence.getStartLineNumber(diffChange.originalStart) - 1;\n originalEndLineNumber = 0;\n }\n else {\n originalStartLineNumber = originalLineSequence.getStartLineNumber(diffChange.originalStart);\n originalEndLineNumber = originalLineSequence.getEndLineNumber(diffChange.originalStart + diffChange.originalLength - 1);\n }\n if (diffChange.modifiedLength === 0) {\n modifiedStartLineNumber = modifiedLineSequence.getStartLineNumber(diffChange.modifiedStart) - 1;\n modifiedEndLineNumber = 0;\n }\n else {\n modifiedStartLineNumber = modifiedLineSequence.getStartLineNumber(diffChange.modifiedStart);\n modifiedEndLineNumber = modifiedLineSequence.getEndLineNumber(diffChange.modifiedStart + diffChange.modifiedLength - 1);\n }\n if (shouldComputeCharChanges && diffChange.originalLength > 0 && diffChange.originalLength < 20 && diffChange.modifiedLength > 0 && diffChange.modifiedLength < 20 && continueCharDiff()) {\n // Compute character changes for diff chunks of at most 20 lines...\n const originalCharSequence = originalLineSequence.createCharSequence(shouldIgnoreTrimWhitespace, diffChange.originalStart, diffChange.originalStart + diffChange.originalLength - 1);\n const modifiedCharSequence = modifiedLineSequence.createCharSequence(shouldIgnoreTrimWhitespace, diffChange.modifiedStart, diffChange.modifiedStart + diffChange.modifiedLength - 1);\n if (originalCharSequence.getElements().length > 0 && modifiedCharSequence.getElements().length > 0) {\n let rawChanges = computeDiff(originalCharSequence, modifiedCharSequence, continueCharDiff, true).changes;\n if (shouldPostProcessCharChanges) {\n rawChanges = postProcessCharChanges(rawChanges);\n }\n charChanges = [];\n for (let i = 0, length = rawChanges.length; i < length; i++) {\n charChanges.push(CharChange.createFromDiffChange(rawChanges[i], originalCharSequence, modifiedCharSequence));\n }\n }\n }\n return new LineChange(originalStartLineNumber, originalEndLineNumber, modifiedStartLineNumber, modifiedEndLineNumber, charChanges);\n }\n}\nexport class DiffComputer {\n constructor(originalLines, modifiedLines, opts) {\n this.shouldComputeCharChanges = opts.shouldComputeCharChanges;\n this.shouldPostProcessCharChanges = opts.shouldPostProcessCharChanges;\n this.shouldIgnoreTrimWhitespace = opts.shouldIgnoreTrimWhitespace;\n this.shouldMakePrettyDiff = opts.shouldMakePrettyDiff;\n this.originalLines = originalLines;\n this.modifiedLines = modifiedLines;\n this.original = new LineSequence(originalLines);\n this.modified = new LineSequence(modifiedLines);\n this.continueLineDiff = createContinueProcessingPredicate(opts.maxComputationTime);\n this.continueCharDiff = createContinueProcessingPredicate(opts.maxComputationTime === 0 ? 0 : Math.min(opts.maxComputationTime, 5000)); // never run after 5s for character changes...\n }\n computeDiff() {\n if (this.original.lines.length === 1 && this.original.lines[0].length === 0) {\n // empty original => fast path\n if (this.modified.lines.length === 1 && this.modified.lines[0].length === 0) {\n return {\n quitEarly: false,\n changes: []\n };\n }\n return {\n quitEarly: false,\n changes: [{\n originalStartLineNumber: 1,\n originalEndLineNumber: 1,\n modifiedStartLineNumber: 1,\n modifiedEndLineNumber: this.modified.lines.length,\n charChanges: undefined\n }]\n };\n }\n if (this.modified.lines.length === 1 && this.modified.lines[0].length === 0) {\n // empty modified => fast path\n return {\n quitEarly: false,\n changes: [{\n originalStartLineNumber: 1,\n originalEndLineNumber: this.original.lines.length,\n modifiedStartLineNumber: 1,\n modifiedEndLineNumber: 1,\n charChanges: undefined\n }]\n };\n }\n const diffResult = computeDiff(this.original, this.modified, this.continueLineDiff, this.shouldMakePrettyDiff);\n const rawChanges = diffResult.changes;\n const quitEarly = diffResult.quitEarly;\n // The diff is always computed with ignoring trim whitespace\n // This ensures we get the prettiest diff\n if (this.shouldIgnoreTrimWhitespace) {\n const lineChanges = [];\n for (let i = 0, length = rawChanges.length; i < length; i++) {\n lineChanges.push(LineChange.createFromDiffResult(this.shouldIgnoreTrimWhitespace, rawChanges[i], this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges));\n }\n return {\n quitEarly: quitEarly,\n changes: lineChanges\n };\n }\n // Need to post-process and introduce changes where the trim whitespace is different\n // Note that we are looping starting at -1 to also cover the lines before the first change\n const result = [];\n let originalLineIndex = 0;\n let modifiedLineIndex = 0;\n for (let i = -1 /* !!!! */, len = rawChanges.length; i < len; i++) {\n const nextChange = (i + 1 < len ? rawChanges[i + 1] : null);\n const originalStop = (nextChange ? nextChange.originalStart : this.originalLines.length);\n const modifiedStop = (nextChange ? nextChange.modifiedStart : this.modifiedLines.length);\n while (originalLineIndex < originalStop && modifiedLineIndex < modifiedStop) {\n const originalLine = this.originalLines[originalLineIndex];\n const modifiedLine = this.modifiedLines[modifiedLineIndex];\n if (originalLine !== modifiedLine) {\n // These lines differ only in trim whitespace\n // Check the leading whitespace\n {\n let originalStartColumn = getFirstNonBlankColumn(originalLine, 1);\n let modifiedStartColumn = getFirstNonBlankColumn(modifiedLine, 1);\n while (originalStartColumn > 1 && modifiedStartColumn > 1) {\n const originalChar = originalLine.charCodeAt(originalStartColumn - 2);\n const modifiedChar = modifiedLine.charCodeAt(modifiedStartColumn - 2);\n if (originalChar !== modifiedChar) {\n break;\n }\n originalStartColumn--;\n modifiedStartColumn--;\n }\n if (originalStartColumn > 1 || modifiedStartColumn > 1) {\n this._pushTrimWhitespaceCharChange(result, originalLineIndex + 1, 1, originalStartColumn, modifiedLineIndex + 1, 1, modifiedStartColumn);\n }\n }\n // Check the trailing whitespace\n {\n let originalEndColumn = getLastNonBlankColumn(originalLine, 1);\n let modifiedEndColumn = getLastNonBlankColumn(modifiedLine, 1);\n const originalMaxColumn = originalLine.length + 1;\n const modifiedMaxColumn = modifiedLine.length + 1;\n while (originalEndColumn < originalMaxColumn && modifiedEndColumn < modifiedMaxColumn) {\n const originalChar = originalLine.charCodeAt(originalEndColumn - 1);\n const modifiedChar = originalLine.charCodeAt(modifiedEndColumn - 1);\n if (originalChar !== modifiedChar) {\n break;\n }\n originalEndColumn++;\n modifiedEndColumn++;\n }\n if (originalEndColumn < originalMaxColumn || modifiedEndColumn < modifiedMaxColumn) {\n this._pushTrimWhitespaceCharChange(result, originalLineIndex + 1, originalEndColumn, originalMaxColumn, modifiedLineIndex + 1, modifiedEndColumn, modifiedMaxColumn);\n }\n }\n }\n originalLineIndex++;\n modifiedLineIndex++;\n }\n if (nextChange) {\n // Emit the actual change\n result.push(LineChange.createFromDiffResult(this.shouldIgnoreTrimWhitespace, nextChange, this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges));\n originalLineIndex += nextChange.originalLength;\n modifiedLineIndex += nextChange.modifiedLength;\n }\n }\n return {\n quitEarly: quitEarly,\n changes: result\n };\n }\n _pushTrimWhitespaceCharChange(result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn) {\n if (this._mergeTrimWhitespaceCharChange(result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn)) {\n // Merged into previous\n return;\n }\n let charChanges = undefined;\n if (this.shouldComputeCharChanges) {\n charChanges = [new CharChange(originalLineNumber, originalStartColumn, originalLineNumber, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedLineNumber, modifiedEndColumn)];\n }\n result.push(new LineChange(originalLineNumber, originalLineNumber, modifiedLineNumber, modifiedLineNumber, charChanges));\n }\n _mergeTrimWhitespaceCharChange(result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn) {\n const len = result.length;\n if (len === 0) {\n return false;\n }\n const prevChange = result[len - 1];\n if (prevChange.originalEndLineNumber === 0 || prevChange.modifiedEndLineNumber === 0) {\n // Don't merge with inserts/deletes\n return false;\n }\n if (prevChange.originalEndLineNumber === originalLineNumber && prevChange.modifiedEndLineNumber === modifiedLineNumber) {\n if (this.shouldComputeCharChanges && prevChange.charChanges) {\n prevChange.charChanges.push(new CharChange(originalLineNumber, originalStartColumn, originalLineNumber, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedLineNumber, modifiedEndColumn));\n }\n return true;\n }\n if (prevChange.originalEndLineNumber + 1 === originalLineNumber && prevChange.modifiedEndLineNumber + 1 === modifiedLineNumber) {\n prevChange.originalEndLineNumber = originalLineNumber;\n prevChange.modifiedEndLineNumber = modifiedLineNumber;\n if (this.shouldComputeCharChanges && prevChange.charChanges) {\n prevChange.charChanges.push(new CharChange(originalLineNumber, originalStartColumn, originalLineNumber, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedLineNumber, modifiedEndColumn));\n }\n return true;\n }\n return false;\n }\n}\nfunction getFirstNonBlankColumn(txt, defaultValue) {\n const r = strings.firstNonWhitespaceIndex(txt);\n if (r === -1) {\n return defaultValue;\n }\n return r + 1;\n}\nfunction getLastNonBlankColumn(txt, defaultValue) {\n const r = strings.lastNonWhitespaceIndex(txt);\n if (r === -1) {\n return defaultValue;\n }\n return r + 2;\n}\nfunction createContinueProcessingPredicate(maximumRuntime) {\n if (maximumRuntime === 0) {\n return () => true;\n }\n const startTime = Date.now();\n return () => {\n return Date.now() - startTime < maximumRuntime;\n };\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nexport class LinesDiff {\n constructor(changes, \n /**\n * Sorted by original line ranges.\n * The original line ranges and the modified line ranges must be disjoint (but can be touching).\n */\n moves, \n /**\n * Indicates if the time out was reached.\n * In that case, the diffs might be an approximation and the user should be asked to rerun the diff with more time.\n */\n hitTimeout) {\n this.changes = changes;\n this.moves = moves;\n this.hitTimeout = hitTimeout;\n }\n}\nexport class MovedText {\n constructor(lineRangeMapping, changes) {\n this.lineRangeMapping = lineRangeMapping;\n this.changes = changes;\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { LegacyLinesDiffComputer } from './legacyLinesDiffComputer.js';\nimport { DefaultLinesDiffComputer } from './defaultLinesDiffComputer/defaultLinesDiffComputer.js';\nexport const linesDiffComputers = {\n getLegacy: () => new LegacyLinesDiffComputer(),\n getDefault: () => new DefaultLinesDiffComputer(),\n};\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { LineRange } from '../core/lineRange.js';\n/**\n * Maps a line range in the original text model to a line range in the modified text model.\n */\nexport class LineRangeMapping {\n static inverse(mapping, originalLineCount, modifiedLineCount) {\n const result = [];\n let lastOriginalEndLineNumber = 1;\n let lastModifiedEndLineNumber = 1;\n for (const m of mapping) {\n const r = new DetailedLineRangeMapping(new LineRange(lastOriginalEndLineNumber, m.original.startLineNumber), new LineRange(lastModifiedEndLineNumber, m.modified.startLineNumber), undefined);\n if (!r.modified.isEmpty) {\n result.push(r);\n }\n lastOriginalEndLineNumber = m.original.endLineNumberExclusive;\n lastModifiedEndLineNumber = m.modified.endLineNumberExclusive;\n }\n const r = new DetailedLineRangeMapping(new LineRange(lastOriginalEndLineNumber, originalLineCount + 1), new LineRange(lastModifiedEndLineNumber, modifiedLineCount + 1), undefined);\n if (!r.modified.isEmpty) {\n result.push(r);\n }\n return result;\n }\n constructor(originalRange, modifiedRange) {\n this.original = originalRange;\n this.modified = modifiedRange;\n }\n toString() {\n return `{${this.original.toString()}->${this.modified.toString()}}`;\n }\n flip() {\n return new LineRangeMapping(this.modified, this.original);\n }\n join(other) {\n return new LineRangeMapping(this.original.join(other.original), this.modified.join(other.modified));\n }\n}\n/**\n * Maps a line range in the original text model to a line range in the modified text model.\n * Also contains inner range mappings.\n */\nexport class DetailedLineRangeMapping extends LineRangeMapping {\n constructor(originalRange, modifiedRange, innerChanges) {\n super(originalRange, modifiedRange);\n this.innerChanges = innerChanges;\n }\n flip() {\n var _a;\n return new DetailedLineRangeMapping(this.modified, this.original, (_a = this.innerChanges) === null || _a === void 0 ? void 0 : _a.map(c => c.flip()));\n }\n}\n/**\n * Maps a range in the original text model to a range in the modified text model.\n */\nexport class RangeMapping {\n constructor(originalRange, modifiedRange) {\n this.originalRange = originalRange;\n this.modifiedRange = modifiedRange;\n }\n toString() {\n return `{${this.originalRange.toString()}->${this.modifiedRange.toString()}}`;\n }\n flip() {\n return new RangeMapping(this.modifiedRange, this.originalRange);\n }\n}\n","import { Codicon } from '../../base/common/codicons.js';\nimport { URI } from '../../base/common/uri.js';\nimport { Range } from './core/range.js';\nimport { TokenizationRegistry as TokenizationRegistryImpl } from './tokenizationRegistry.js';\nimport { localize } from '../../nls.js';\nexport class Token {\n constructor(offset, type, language) {\n this.offset = offset;\n this.type = type;\n this.language = language;\n this._tokenBrand = undefined;\n }\n toString() {\n return '(' + this.offset + ', ' + this.type + ')';\n }\n}\n/**\n * @internal\n */\nexport class TokenizationResult {\n constructor(tokens, endState) {\n this.tokens = tokens;\n this.endState = endState;\n this._tokenizationResultBrand = undefined;\n }\n}\n/**\n * @internal\n */\nexport class EncodedTokenizationResult {\n constructor(\n /**\n * The tokens in binary format. Each token occupies two array indices. For token i:\n * - at offset 2*i => startIndex\n * - at offset 2*i + 1 => metadata\n *\n */\n tokens, endState) {\n this.tokens = tokens;\n this.endState = endState;\n this._encodedTokenizationResultBrand = undefined;\n }\n}\n/**\n * @internal\n */\nexport var CompletionItemKinds;\n(function (CompletionItemKinds) {\n const byKind = new Map();\n byKind.set(0 /* CompletionItemKind.Method */, Codicon.symbolMethod);\n byKind.set(1 /* CompletionItemKind.Function */, Codicon.symbolFunction);\n byKind.set(2 /* CompletionItemKind.Constructor */, Codicon.symbolConstructor);\n byKind.set(3 /* CompletionItemKind.Field */, Codicon.symbolField);\n byKind.set(4 /* CompletionItemKind.Variable */, Codicon.symbolVariable);\n byKind.set(5 /* CompletionItemKind.Class */, Codicon.symbolClass);\n byKind.set(6 /* CompletionItemKind.Struct */, Codicon.symbolStruct);\n byKind.set(7 /* CompletionItemKind.Interface */, Codicon.symbolInterface);\n byKind.set(8 /* CompletionItemKind.Module */, Codicon.symbolModule);\n byKind.set(9 /* CompletionItemKind.Property */, Codicon.symbolProperty);\n byKind.set(10 /* CompletionItemKind.Event */, Codicon.symbolEvent);\n byKind.set(11 /* CompletionItemKind.Operator */, Codicon.symbolOperator);\n byKind.set(12 /* CompletionItemKind.Unit */, Codicon.symbolUnit);\n byKind.set(13 /* CompletionItemKind.Value */, Codicon.symbolValue);\n byKind.set(15 /* CompletionItemKind.Enum */, Codicon.symbolEnum);\n byKind.set(14 /* CompletionItemKind.Constant */, Codicon.symbolConstant);\n byKind.set(15 /* CompletionItemKind.Enum */, Codicon.symbolEnum);\n byKind.set(16 /* CompletionItemKind.EnumMember */, Codicon.symbolEnumMember);\n byKind.set(17 /* CompletionItemKind.Keyword */, Codicon.symbolKeyword);\n byKind.set(27 /* CompletionItemKind.Snippet */, Codicon.symbolSnippet);\n byKind.set(18 /* CompletionItemKind.Text */, Codicon.symbolText);\n byKind.set(19 /* CompletionItemKind.Color */, Codicon.symbolColor);\n byKind.set(20 /* CompletionItemKind.File */, Codicon.symbolFile);\n byKind.set(21 /* CompletionItemKind.Reference */, Codicon.symbolReference);\n byKind.set(22 /* CompletionItemKind.Customcolor */, Codicon.symbolCustomColor);\n byKind.set(23 /* CompletionItemKind.Folder */, Codicon.symbolFolder);\n byKind.set(24 /* CompletionItemKind.TypeParameter */, Codicon.symbolTypeParameter);\n byKind.set(25 /* CompletionItemKind.User */, Codicon.account);\n byKind.set(26 /* CompletionItemKind.Issue */, Codicon.issues);\n /**\n * @internal\n */\n function toIcon(kind) {\n let codicon = byKind.get(kind);\n if (!codicon) {\n console.info('No codicon found for CompletionItemKind ' + kind);\n codicon = Codicon.symbolProperty;\n }\n return codicon;\n }\n CompletionItemKinds.toIcon = toIcon;\n const data = new Map();\n data.set('method', 0 /* CompletionItemKind.Method */);\n data.set('function', 1 /* CompletionItemKind.Function */);\n data.set('constructor', 2 /* CompletionItemKind.Constructor */);\n data.set('field', 3 /* CompletionItemKind.Field */);\n data.set('variable', 4 /* CompletionItemKind.Variable */);\n data.set('class', 5 /* CompletionItemKind.Class */);\n data.set('struct', 6 /* CompletionItemKind.Struct */);\n data.set('interface', 7 /* CompletionItemKind.Interface */);\n data.set('module', 8 /* CompletionItemKind.Module */);\n data.set('property', 9 /* CompletionItemKind.Property */);\n data.set('event', 10 /* CompletionItemKind.Event */);\n data.set('operator', 11 /* CompletionItemKind.Operator */);\n data.set('unit', 12 /* CompletionItemKind.Unit */);\n data.set('value', 13 /* CompletionItemKind.Value */);\n data.set('constant', 14 /* CompletionItemKind.Constant */);\n data.set('enum', 15 /* CompletionItemKind.Enum */);\n data.set('enum-member', 16 /* CompletionItemKind.EnumMember */);\n data.set('enumMember', 16 /* CompletionItemKind.EnumMember */);\n data.set('keyword', 17 /* CompletionItemKind.Keyword */);\n data.set('snippet', 27 /* CompletionItemKind.Snippet */);\n data.set('text', 18 /* CompletionItemKind.Text */);\n data.set('color', 19 /* CompletionItemKind.Color */);\n data.set('file', 20 /* CompletionItemKind.File */);\n data.set('reference', 21 /* CompletionItemKind.Reference */);\n data.set('customcolor', 22 /* CompletionItemKind.Customcolor */);\n data.set('folder', 23 /* CompletionItemKind.Folder */);\n data.set('type-parameter', 24 /* CompletionItemKind.TypeParameter */);\n data.set('typeParameter', 24 /* CompletionItemKind.TypeParameter */);\n data.set('account', 25 /* CompletionItemKind.User */);\n data.set('issue', 26 /* CompletionItemKind.Issue */);\n /**\n * @internal\n */\n function fromString(value, strict) {\n let res = data.get(value);\n if (typeof res === 'undefined' && !strict) {\n res = 9 /* CompletionItemKind.Property */;\n }\n return res;\n }\n CompletionItemKinds.fromString = fromString;\n})(CompletionItemKinds || (CompletionItemKinds = {}));\n/**\n * How an {@link InlineCompletionsProvider inline completion provider} was triggered.\n */\nexport var InlineCompletionTriggerKind;\n(function (InlineCompletionTriggerKind) {\n /**\n * Completion was triggered automatically while editing.\n * It is sufficient to return a single completion item in this case.\n */\n InlineCompletionTriggerKind[InlineCompletionTriggerKind[\"Automatic\"] = 0] = \"Automatic\";\n /**\n * Completion was triggered explicitly by a user gesture.\n * Return multiple completion items to enable cycling through them.\n */\n InlineCompletionTriggerKind[InlineCompletionTriggerKind[\"Explicit\"] = 1] = \"Explicit\";\n})(InlineCompletionTriggerKind || (InlineCompletionTriggerKind = {}));\nexport class SelectedSuggestionInfo {\n constructor(range, text, completionKind, isSnippetText) {\n this.range = range;\n this.text = text;\n this.completionKind = completionKind;\n this.isSnippetText = isSnippetText;\n }\n equals(other) {\n return Range.lift(this.range).equalsRange(other.range)\n && this.text === other.text\n && this.completionKind === other.completionKind\n && this.isSnippetText === other.isSnippetText;\n }\n}\nexport var SignatureHelpTriggerKind;\n(function (SignatureHelpTriggerKind) {\n SignatureHelpTriggerKind[SignatureHelpTriggerKind[\"Invoke\"] = 1] = \"Invoke\";\n SignatureHelpTriggerKind[SignatureHelpTriggerKind[\"TriggerCharacter\"] = 2] = \"TriggerCharacter\";\n SignatureHelpTriggerKind[SignatureHelpTriggerKind[\"ContentChange\"] = 3] = \"ContentChange\";\n})(SignatureHelpTriggerKind || (SignatureHelpTriggerKind = {}));\n/**\n * A document highlight kind.\n */\nexport var DocumentHighlightKind;\n(function (DocumentHighlightKind) {\n /**\n * A textual occurrence.\n */\n DocumentHighlightKind[DocumentHighlightKind[\"Text\"] = 0] = \"Text\";\n /**\n * Read-access of a symbol, like reading a variable.\n */\n DocumentHighlightKind[DocumentHighlightKind[\"Read\"] = 1] = \"Read\";\n /**\n * Write-access of a symbol, like writing to a variable.\n */\n DocumentHighlightKind[DocumentHighlightKind[\"Write\"] = 2] = \"Write\";\n})(DocumentHighlightKind || (DocumentHighlightKind = {}));\n/**\n * @internal\n */\nexport function isLocationLink(thing) {\n return thing\n && URI.isUri(thing.uri)\n && Range.isIRange(thing.range)\n && (Range.isIRange(thing.originSelectionRange) || Range.isIRange(thing.targetSelectionRange));\n}\n/**\n * @internal\n */\nexport const symbolKindNames = {\n [17 /* SymbolKind.Array */]: localize('Array', \"array\"),\n [16 /* SymbolKind.Boolean */]: localize('Boolean', \"boolean\"),\n [4 /* SymbolKind.Class */]: localize('Class', \"class\"),\n [13 /* SymbolKind.Constant */]: localize('Constant', \"constant\"),\n [8 /* SymbolKind.Constructor */]: localize('Constructor', \"constructor\"),\n [9 /* SymbolKind.Enum */]: localize('Enum', \"enumeration\"),\n [21 /* SymbolKind.EnumMember */]: localize('EnumMember', \"enumeration member\"),\n [23 /* SymbolKind.Event */]: localize('Event', \"event\"),\n [7 /* SymbolKind.Field */]: localize('Field', \"field\"),\n [0 /* SymbolKind.File */]: localize('File', \"file\"),\n [11 /* SymbolKind.Function */]: localize('Function', \"function\"),\n [10 /* SymbolKind.Interface */]: localize('Interface', \"interface\"),\n [19 /* SymbolKind.Key */]: localize('Key', \"key\"),\n [5 /* SymbolKind.Method */]: localize('Method', \"method\"),\n [1 /* SymbolKind.Module */]: localize('Module', \"module\"),\n [2 /* SymbolKind.Namespace */]: localize('Namespace', \"namespace\"),\n [20 /* SymbolKind.Null */]: localize('Null', \"null\"),\n [15 /* SymbolKind.Number */]: localize('Number', \"number\"),\n [18 /* SymbolKind.Object */]: localize('Object', \"object\"),\n [24 /* SymbolKind.Operator */]: localize('Operator', \"operator\"),\n [3 /* SymbolKind.Package */]: localize('Package', \"package\"),\n [6 /* SymbolKind.Property */]: localize('Property', \"property\"),\n [14 /* SymbolKind.String */]: localize('String', \"string\"),\n [22 /* SymbolKind.Struct */]: localize('Struct', \"struct\"),\n [25 /* SymbolKind.TypeParameter */]: localize('TypeParameter', \"type parameter\"),\n [12 /* SymbolKind.Variable */]: localize('Variable', \"variable\"),\n};\n/**\n * @internal\n */\nexport function getAriaLabelForSymbol(symbolName, kind) {\n return localize('symbolAriaLabel', '{0} ({1})', symbolName, symbolKindNames[kind]);\n}\n/**\n * @internal\n */\nexport var SymbolKinds;\n(function (SymbolKinds) {\n const byKind = new Map();\n byKind.set(0 /* SymbolKind.File */, Codicon.symbolFile);\n byKind.set(1 /* SymbolKind.Module */, Codicon.symbolModule);\n byKind.set(2 /* SymbolKind.Namespace */, Codicon.symbolNamespace);\n byKind.set(3 /* SymbolKind.Package */, Codicon.symbolPackage);\n byKind.set(4 /* SymbolKind.Class */, Codicon.symbolClass);\n byKind.set(5 /* SymbolKind.Method */, Codicon.symbolMethod);\n byKind.set(6 /* SymbolKind.Property */, Codicon.symbolProperty);\n byKind.set(7 /* SymbolKind.Field */, Codicon.symbolField);\n byKind.set(8 /* SymbolKind.Constructor */, Codicon.symbolConstructor);\n byKind.set(9 /* SymbolKind.Enum */, Codicon.symbolEnum);\n byKind.set(10 /* SymbolKind.Interface */, Codicon.symbolInterface);\n byKind.set(11 /* SymbolKind.Function */, Codicon.symbolFunction);\n byKind.set(12 /* SymbolKind.Variable */, Codicon.symbolVariable);\n byKind.set(13 /* SymbolKind.Constant */, Codicon.symbolConstant);\n byKind.set(14 /* SymbolKind.String */, Codicon.symbolString);\n byKind.set(15 /* SymbolKind.Number */, Codicon.symbolNumber);\n byKind.set(16 /* SymbolKind.Boolean */, Codicon.symbolBoolean);\n byKind.set(17 /* SymbolKind.Array */, Codicon.symbolArray);\n byKind.set(18 /* SymbolKind.Object */, Codicon.symbolObject);\n byKind.set(19 /* SymbolKind.Key */, Codicon.symbolKey);\n byKind.set(20 /* SymbolKind.Null */, Codicon.symbolNull);\n byKind.set(21 /* SymbolKind.EnumMember */, Codicon.symbolEnumMember);\n byKind.set(22 /* SymbolKind.Struct */, Codicon.symbolStruct);\n byKind.set(23 /* SymbolKind.Event */, Codicon.symbolEvent);\n byKind.set(24 /* SymbolKind.Operator */, Codicon.symbolOperator);\n byKind.set(25 /* SymbolKind.TypeParameter */, Codicon.symbolTypeParameter);\n /**\n * @internal\n */\n function toIcon(kind) {\n let icon = byKind.get(kind);\n if (!icon) {\n console.info('No codicon found for SymbolKind ' + kind);\n icon = Codicon.symbolProperty;\n }\n return icon;\n }\n SymbolKinds.toIcon = toIcon;\n})(SymbolKinds || (SymbolKinds = {}));\n/** @internal */\nexport class TextEdit {\n}\nexport class FoldingRangeKind {\n /**\n * Returns a {@link FoldingRangeKind} for the given value.\n *\n * @param value of the kind.\n */\n static fromValue(value) {\n switch (value) {\n case 'comment': return FoldingRangeKind.Comment;\n case 'imports': return FoldingRangeKind.Imports;\n case 'region': return FoldingRangeKind.Region;\n }\n return new FoldingRangeKind(value);\n }\n /**\n * Creates a new {@link FoldingRangeKind}.\n *\n * @param value of the kind.\n */\n constructor(value) {\n this.value = value;\n }\n}\n/**\n * Kind for folding range representing a comment. The value of the kind is 'comment'.\n */\nFoldingRangeKind.Comment = new FoldingRangeKind('comment');\n/**\n * Kind for folding range representing a import. The value of the kind is 'imports'.\n */\nFoldingRangeKind.Imports = new FoldingRangeKind('imports');\n/**\n * Kind for folding range representing regions (for example marked by `#region`, `#endregion`).\n * The value of the kind is 'region'.\n */\nFoldingRangeKind.Region = new FoldingRangeKind('region');\n/**\n * @internal\n */\nexport var Command;\n(function (Command) {\n /**\n * @internal\n */\n function is(obj) {\n if (!obj || typeof obj !== 'object') {\n return false;\n }\n return typeof obj.id === 'string' &&\n typeof obj.title === 'string';\n }\n Command.is = is;\n})(Command || (Command = {}));\nexport var InlayHintKind;\n(function (InlayHintKind) {\n InlayHintKind[InlayHintKind[\"Type\"] = 1] = \"Type\";\n InlayHintKind[InlayHintKind[\"Parameter\"] = 2] = \"Parameter\";\n})(InlayHintKind || (InlayHintKind = {}));\n/**\n * @internal\n */\nexport class LazyTokenizationSupport {\n constructor(createSupport) {\n this.createSupport = createSupport;\n this._tokenizationSupport = null;\n }\n dispose() {\n if (this._tokenizationSupport) {\n this._tokenizationSupport.then((support) => {\n if (support) {\n support.dispose();\n }\n });\n }\n }\n get tokenizationSupport() {\n if (!this._tokenizationSupport) {\n this._tokenizationSupport = this.createSupport();\n }\n return this._tokenizationSupport;\n }\n}\n/**\n * @internal\n */\nexport const TokenizationRegistry = new TokenizationRegistryImpl();\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { Color, HSLA } from '../../../base/common/color.js';\nfunction _parseCaptureGroups(captureGroups) {\n const values = [];\n for (const captureGroup of captureGroups) {\n const parsedNumber = Number(captureGroup);\n if (parsedNumber || parsedNumber === 0 && captureGroup.replace(/\\s/g, '') !== '') {\n values.push(parsedNumber);\n }\n }\n return values;\n}\nfunction _toIColor(r, g, b, a) {\n return {\n red: r / 255,\n blue: b / 255,\n green: g / 255,\n alpha: a\n };\n}\nfunction _findRange(model, match) {\n const index = match.index;\n const length = match[0].length;\n if (!index) {\n return;\n }\n const startPosition = model.positionAt(index);\n const range = {\n startLineNumber: startPosition.lineNumber,\n startColumn: startPosition.column,\n endLineNumber: startPosition.lineNumber,\n endColumn: startPosition.column + length\n };\n return range;\n}\nfunction _findHexColorInformation(range, hexValue) {\n if (!range) {\n return;\n }\n const parsedHexColor = Color.Format.CSS.parseHex(hexValue);\n if (!parsedHexColor) {\n return;\n }\n return {\n range: range,\n color: _toIColor(parsedHexColor.rgba.r, parsedHexColor.rgba.g, parsedHexColor.rgba.b, parsedHexColor.rgba.a)\n };\n}\nfunction _findRGBColorInformation(range, matches, isAlpha) {\n if (!range || matches.length !== 1) {\n return;\n }\n const match = matches[0];\n const captureGroups = match.values();\n const parsedRegex = _parseCaptureGroups(captureGroups);\n return {\n range: range,\n color: _toIColor(parsedRegex[0], parsedRegex[1], parsedRegex[2], isAlpha ? parsedRegex[3] : 1)\n };\n}\nfunction _findHSLColorInformation(range, matches, isAlpha) {\n if (!range || matches.length !== 1) {\n return;\n }\n const match = matches[0];\n const captureGroups = match.values();\n const parsedRegex = _parseCaptureGroups(captureGroups);\n const colorEquivalent = new Color(new HSLA(parsedRegex[0], parsedRegex[1] / 100, parsedRegex[2] / 100, isAlpha ? parsedRegex[3] : 1));\n return {\n range: range,\n color: _toIColor(colorEquivalent.rgba.r, colorEquivalent.rgba.g, colorEquivalent.rgba.b, colorEquivalent.rgba.a)\n };\n}\nfunction _findMatches(model, regex) {\n if (typeof model === 'string') {\n return [...model.matchAll(regex)];\n }\n else {\n return model.findMatches(regex);\n }\n}\nfunction computeColors(model) {\n const result = [];\n // Early validation for RGB and HSL\n const initialValidationRegex = /\\b(rgb|rgba|hsl|hsla)(\\([0-9\\s,.\\%]*\\))|(#)([A-Fa-f0-9]{3})\\b|(#)([A-Fa-f0-9]{4})\\b|(#)([A-Fa-f0-9]{6})\\b|(#)([A-Fa-f0-9]{8})\\b/gm;\n const initialValidationMatches = _findMatches(model, initialValidationRegex);\n // Potential colors have been found, validate the parameters\n if (initialValidationMatches.length > 0) {\n for (const initialMatch of initialValidationMatches) {\n const initialCaptureGroups = initialMatch.filter(captureGroup => captureGroup !== undefined);\n const colorScheme = initialCaptureGroups[1];\n const colorParameters = initialCaptureGroups[2];\n if (!colorParameters) {\n continue;\n }\n let colorInformation;\n if (colorScheme === 'rgb') {\n const regexParameters = /^\\(\\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\\s*,\\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\\s*,\\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\\s*\\)$/gm;\n colorInformation = _findRGBColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), false);\n }\n else if (colorScheme === 'rgba') {\n const regexParameters = /^\\(\\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\\s*,\\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\\s*,\\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\\s*,\\s*(0[.][0-9]+|[.][0-9]+|[01][.]|[01])\\s*\\)$/gm;\n colorInformation = _findRGBColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), true);\n }\n else if (colorScheme === 'hsl') {\n const regexParameters = /^\\(\\s*(36[0]|3[0-5][0-9]|[12][0-9][0-9]|[1-9]?[0-9])\\s*,\\s*(100|\\d{1,2}[.]\\d*|\\d{1,2})%\\s*,\\s*(100|\\d{1,2}[.]\\d*|\\d{1,2})%\\s*\\)$/gm;\n colorInformation = _findHSLColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), false);\n }\n else if (colorScheme === 'hsla') {\n const regexParameters = /^\\(\\s*(36[0]|3[0-5][0-9]|[12][0-9][0-9]|[1-9]?[0-9])\\s*,\\s*(100|\\d{1,2}[.]\\d*|\\d{1,2})%\\s*,\\s*(100|\\d{1,2}[.]\\d*|\\d{1,2})%\\s*,\\s*(0[.][0-9]+|[.][0-9]+|[01][.]|[01])\\s*\\)$/gm;\n colorInformation = _findHSLColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), true);\n }\n else if (colorScheme === '#') {\n colorInformation = _findHexColorInformation(_findRange(model, initialMatch), colorScheme + colorParameters);\n }\n if (colorInformation) {\n result.push(colorInformation);\n }\n }\n }\n return result;\n}\n/**\n * Returns an array of all default document colors in the provided document\n */\nexport function computeDefaultDocumentColors(model) {\n if (!model || typeof model.getValue !== 'function' || typeof model.positionAt !== 'function') {\n // Unknown caller!\n return [];\n }\n return computeColors(model);\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { CharacterClassifier } from '../core/characterClassifier.js';\nclass Uint8Matrix {\n constructor(rows, cols, defaultValue) {\n const data = new Uint8Array(rows * cols);\n for (let i = 0, len = rows * cols; i < len; i++) {\n data[i] = defaultValue;\n }\n this._data = data;\n this.rows = rows;\n this.cols = cols;\n }\n get(row, col) {\n return this._data[row * this.cols + col];\n }\n set(row, col, value) {\n this._data[row * this.cols + col] = value;\n }\n}\nexport class StateMachine {\n constructor(edges) {\n let maxCharCode = 0;\n let maxState = 0 /* State.Invalid */;\n for (let i = 0, len = edges.length; i < len; i++) {\n const [from, chCode, to] = edges[i];\n if (chCode > maxCharCode) {\n maxCharCode = chCode;\n }\n if (from > maxState) {\n maxState = from;\n }\n if (to > maxState) {\n maxState = to;\n }\n }\n maxCharCode++;\n maxState++;\n const states = new Uint8Matrix(maxState, maxCharCode, 0 /* State.Invalid */);\n for (let i = 0, len = edges.length; i < len; i++) {\n const [from, chCode, to] = edges[i];\n states.set(from, chCode, to);\n }\n this._states = states;\n this._maxCharCode = maxCharCode;\n }\n nextState(currentState, chCode) {\n if (chCode < 0 || chCode >= this._maxCharCode) {\n return 0 /* State.Invalid */;\n }\n return this._states.get(currentState, chCode);\n }\n}\n// State machine for http:// or https:// or file://\nlet _stateMachine = null;\nfunction getStateMachine() {\n if (_stateMachine === null) {\n _stateMachine = new StateMachine([\n [1 /* State.Start */, 104 /* CharCode.h */, 2 /* State.H */],\n [1 /* State.Start */, 72 /* CharCode.H */, 2 /* State.H */],\n [1 /* State.Start */, 102 /* CharCode.f */, 6 /* State.F */],\n [1 /* State.Start */, 70 /* CharCode.F */, 6 /* State.F */],\n [2 /* State.H */, 116 /* CharCode.t */, 3 /* State.HT */],\n [2 /* State.H */, 84 /* CharCode.T */, 3 /* State.HT */],\n [3 /* State.HT */, 116 /* CharCode.t */, 4 /* State.HTT */],\n [3 /* State.HT */, 84 /* CharCode.T */, 4 /* State.HTT */],\n [4 /* State.HTT */, 112 /* CharCode.p */, 5 /* State.HTTP */],\n [4 /* State.HTT */, 80 /* CharCode.P */, 5 /* State.HTTP */],\n [5 /* State.HTTP */, 115 /* CharCode.s */, 9 /* State.BeforeColon */],\n [5 /* State.HTTP */, 83 /* CharCode.S */, 9 /* State.BeforeColon */],\n [5 /* State.HTTP */, 58 /* CharCode.Colon */, 10 /* State.AfterColon */],\n [6 /* State.F */, 105 /* CharCode.i */, 7 /* State.FI */],\n [6 /* State.F */, 73 /* CharCode.I */, 7 /* State.FI */],\n [7 /* State.FI */, 108 /* CharCode.l */, 8 /* State.FIL */],\n [7 /* State.FI */, 76 /* CharCode.L */, 8 /* State.FIL */],\n [8 /* State.FIL */, 101 /* CharCode.e */, 9 /* State.BeforeColon */],\n [8 /* State.FIL */, 69 /* CharCode.E */, 9 /* State.BeforeColon */],\n [9 /* State.BeforeColon */, 58 /* CharCode.Colon */, 10 /* State.AfterColon */],\n [10 /* State.AfterColon */, 47 /* CharCode.Slash */, 11 /* State.AlmostThere */],\n [11 /* State.AlmostThere */, 47 /* CharCode.Slash */, 12 /* State.End */],\n ]);\n }\n return _stateMachine;\n}\nlet _classifier = null;\nfunction getClassifier() {\n if (_classifier === null) {\n _classifier = new CharacterClassifier(0 /* CharacterClass.None */);\n // allow-any-unicode-next-line\n const FORCE_TERMINATION_CHARACTERS = ' \\t<>\\'\\\"、。。、,.:;‘〈「『〔([{「」}])〕』」〉’`~…';\n for (let i = 0; i < FORCE_TERMINATION_CHARACTERS.length; i++) {\n _classifier.set(FORCE_TERMINATION_CHARACTERS.charCodeAt(i), 1 /* CharacterClass.ForceTermination */);\n }\n const CANNOT_END_WITH_CHARACTERS = '.,;:';\n for (let i = 0; i < CANNOT_END_WITH_CHARACTERS.length; i++) {\n _classifier.set(CANNOT_END_WITH_CHARACTERS.charCodeAt(i), 2 /* CharacterClass.CannotEndIn */);\n }\n }\n return _classifier;\n}\nexport class LinkComputer {\n static _createLink(classifier, line, lineNumber, linkBeginIndex, linkEndIndex) {\n // Do not allow to end link in certain characters...\n let lastIncludedCharIndex = linkEndIndex - 1;\n do {\n const chCode = line.charCodeAt(lastIncludedCharIndex);\n const chClass = classifier.get(chCode);\n if (chClass !== 2 /* CharacterClass.CannotEndIn */) {\n break;\n }\n lastIncludedCharIndex--;\n } while (lastIncludedCharIndex > linkBeginIndex);\n // Handle links enclosed in parens, square brackets and curlys.\n if (linkBeginIndex > 0) {\n const charCodeBeforeLink = line.charCodeAt(linkBeginIndex - 1);\n const lastCharCodeInLink = line.charCodeAt(lastIncludedCharIndex);\n if ((charCodeBeforeLink === 40 /* CharCode.OpenParen */ && lastCharCodeInLink === 41 /* CharCode.CloseParen */)\n || (charCodeBeforeLink === 91 /* CharCode.OpenSquareBracket */ && lastCharCodeInLink === 93 /* CharCode.CloseSquareBracket */)\n || (charCodeBeforeLink === 123 /* CharCode.OpenCurlyBrace */ && lastCharCodeInLink === 125 /* CharCode.CloseCurlyBrace */)) {\n // Do not end in ) if ( is before the link start\n // Do not end in ] if [ is before the link start\n // Do not end in } if { is before the link start\n lastIncludedCharIndex--;\n }\n }\n return {\n range: {\n startLineNumber: lineNumber,\n startColumn: linkBeginIndex + 1,\n endLineNumber: lineNumber,\n endColumn: lastIncludedCharIndex + 2\n },\n url: line.substring(linkBeginIndex, lastIncludedCharIndex + 1)\n };\n }\n static computeLinks(model, stateMachine = getStateMachine()) {\n const classifier = getClassifier();\n const result = [];\n for (let i = 1, lineCount = model.getLineCount(); i <= lineCount; i++) {\n const line = model.getLineContent(i);\n const len = line.length;\n let j = 0;\n let linkBeginIndex = 0;\n let linkBeginChCode = 0;\n let state = 1 /* State.Start */;\n let hasOpenParens = false;\n let hasOpenSquareBracket = false;\n let inSquareBrackets = false;\n let hasOpenCurlyBracket = false;\n while (j < len) {\n let resetStateMachine = false;\n const chCode = line.charCodeAt(j);\n if (state === 13 /* State.Accept */) {\n let chClass;\n switch (chCode) {\n case 40 /* CharCode.OpenParen */:\n hasOpenParens = true;\n chClass = 0 /* CharacterClass.None */;\n break;\n case 41 /* CharCode.CloseParen */:\n chClass = (hasOpenParens ? 0 /* CharacterClass.None */ : 1 /* CharacterClass.ForceTermination */);\n break;\n case 91 /* CharCode.OpenSquareBracket */:\n inSquareBrackets = true;\n hasOpenSquareBracket = true;\n chClass = 0 /* CharacterClass.None */;\n break;\n case 93 /* CharCode.CloseSquareBracket */:\n inSquareBrackets = false;\n chClass = (hasOpenSquareBracket ? 0 /* CharacterClass.None */ : 1 /* CharacterClass.ForceTermination */);\n break;\n case 123 /* CharCode.OpenCurlyBrace */:\n hasOpenCurlyBracket = true;\n chClass = 0 /* CharacterClass.None */;\n break;\n case 125 /* CharCode.CloseCurlyBrace */:\n chClass = (hasOpenCurlyBracket ? 0 /* CharacterClass.None */ : 1 /* CharacterClass.ForceTermination */);\n break;\n // The following three rules make it that ' or \" or ` are allowed inside links\n // only if the link is wrapped by some other quote character\n case 39 /* CharCode.SingleQuote */:\n case 34 /* CharCode.DoubleQuote */:\n case 96 /* CharCode.BackTick */:\n if (linkBeginChCode === chCode) {\n chClass = 1 /* CharacterClass.ForceTermination */;\n }\n else if (linkBeginChCode === 39 /* CharCode.SingleQuote */ || linkBeginChCode === 34 /* CharCode.DoubleQuote */ || linkBeginChCode === 96 /* CharCode.BackTick */) {\n chClass = 0 /* CharacterClass.None */;\n }\n else {\n chClass = 1 /* CharacterClass.ForceTermination */;\n }\n break;\n case 42 /* CharCode.Asterisk */:\n // `*` terminates a link if the link began with `*`\n chClass = (linkBeginChCode === 42 /* CharCode.Asterisk */) ? 1 /* CharacterClass.ForceTermination */ : 0 /* CharacterClass.None */;\n break;\n case 124 /* CharCode.Pipe */:\n // `|` terminates a link if the link began with `|`\n chClass = (linkBeginChCode === 124 /* CharCode.Pipe */) ? 1 /* CharacterClass.ForceTermination */ : 0 /* CharacterClass.None */;\n break;\n case 32 /* CharCode.Space */:\n // ` ` allow space in between [ and ]\n chClass = (inSquareBrackets ? 0 /* CharacterClass.None */ : 1 /* CharacterClass.ForceTermination */);\n break;\n default:\n chClass = classifier.get(chCode);\n }\n // Check if character terminates link\n if (chClass === 1 /* CharacterClass.ForceTermination */) {\n result.push(LinkComputer._createLink(classifier, line, i, linkBeginIndex, j));\n resetStateMachine = true;\n }\n }\n else if (state === 12 /* State.End */) {\n let chClass;\n if (chCode === 91 /* CharCode.OpenSquareBracket */) {\n // Allow for the authority part to contain ipv6 addresses which contain [ and ]\n hasOpenSquareBracket = true;\n chClass = 0 /* CharacterClass.None */;\n }\n else {\n chClass = classifier.get(chCode);\n }\n // Check if character terminates link\n if (chClass === 1 /* CharacterClass.ForceTermination */) {\n resetStateMachine = true;\n }\n else {\n state = 13 /* State.Accept */;\n }\n }\n else {\n state = stateMachine.nextState(state, chCode);\n if (state === 0 /* State.Invalid */) {\n resetStateMachine = true;\n }\n }\n if (resetStateMachine) {\n state = 1 /* State.Start */;\n hasOpenParens = false;\n hasOpenSquareBracket = false;\n hasOpenCurlyBracket = false;\n // Record where the link started\n linkBeginIndex = j + 1;\n linkBeginChCode = chCode;\n }\n j++;\n }\n if (state === 13 /* State.Accept */) {\n result.push(LinkComputer._createLink(classifier, line, i, linkBeginIndex, len));\n }\n }\n return result;\n }\n}\n/**\n * Returns an array of all links contains in the provided\n * document. *Note* that this operation is computational\n * expensive and should not run in the UI thread.\n */\nexport function computeLinks(model) {\n if (!model || typeof model.getLineCount !== 'function' || typeof model.getLineContent !== 'function') {\n // Unknown caller!\n return [];\n }\n return LinkComputer.computeLinks(model);\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nexport class BasicInplaceReplace {\n constructor() {\n this._defaultValueSet = [\n ['true', 'false'],\n ['True', 'False'],\n ['Private', 'Public', 'Friend', 'ReadOnly', 'Partial', 'Protected', 'WriteOnly'],\n ['public', 'protected', 'private'],\n ];\n }\n navigateValueSet(range1, text1, range2, text2, up) {\n if (range1 && text1) {\n const result = this.doNavigateValueSet(text1, up);\n if (result) {\n return {\n range: range1,\n value: result\n };\n }\n }\n if (range2 && text2) {\n const result = this.doNavigateValueSet(text2, up);\n if (result) {\n return {\n range: range2,\n value: result\n };\n }\n }\n return null;\n }\n doNavigateValueSet(text, up) {\n const numberResult = this.numberReplace(text, up);\n if (numberResult !== null) {\n return numberResult;\n }\n return this.textReplace(text, up);\n }\n numberReplace(value, up) {\n const precision = Math.pow(10, value.length - (value.lastIndexOf('.') + 1));\n let n1 = Number(value);\n const n2 = parseFloat(value);\n if (!isNaN(n1) && !isNaN(n2) && n1 === n2) {\n if (n1 === 0 && !up) {\n return null; // don't do negative\n //\t\t\t} else if(n1 === 9 && up) {\n //\t\t\t\treturn null; // don't insert 10 into a number\n }\n else {\n n1 = Math.floor(n1 * precision);\n n1 += up ? precision : -precision;\n return String(n1 / precision);\n }\n }\n return null;\n }\n textReplace(value, up) {\n return this.valueSetsReplace(this._defaultValueSet, value, up);\n }\n valueSetsReplace(valueSets, value, up) {\n let result = null;\n for (let i = 0, len = valueSets.length; result === null && i < len; i++) {\n result = this.valueSetReplace(valueSets[i], value, up);\n }\n return result;\n }\n valueSetReplace(valueSet, value, up) {\n let idx = valueSet.indexOf(value);\n if (idx >= 0) {\n idx += up ? +1 : -1;\n if (idx < 0) {\n idx = valueSet.length - 1;\n }\n else {\n idx %= valueSet.length;\n }\n return valueSet[idx];\n }\n return null;\n }\n}\nBasicInplaceReplace.INSTANCE = new BasicInplaceReplace();\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { equals } from '../../base/common/objects.js';\n/**\n * Vertical Lane in the overview ruler of the editor.\n */\nexport var OverviewRulerLane;\n(function (OverviewRulerLane) {\n OverviewRulerLane[OverviewRulerLane[\"Left\"] = 1] = \"Left\";\n OverviewRulerLane[OverviewRulerLane[\"Center\"] = 2] = \"Center\";\n OverviewRulerLane[OverviewRulerLane[\"Right\"] = 4] = \"Right\";\n OverviewRulerLane[OverviewRulerLane[\"Full\"] = 7] = \"Full\";\n})(OverviewRulerLane || (OverviewRulerLane = {}));\n/**\n * Vertical Lane in the glyph margin of the editor.\n */\nexport var GlyphMarginLane;\n(function (GlyphMarginLane) {\n GlyphMarginLane[GlyphMarginLane[\"Left\"] = 1] = \"Left\";\n GlyphMarginLane[GlyphMarginLane[\"Right\"] = 2] = \"Right\";\n})(GlyphMarginLane || (GlyphMarginLane = {}));\n/**\n * Position in the minimap to render the decoration.\n */\nexport var MinimapPosition;\n(function (MinimapPosition) {\n MinimapPosition[MinimapPosition[\"Inline\"] = 1] = \"Inline\";\n MinimapPosition[MinimapPosition[\"Gutter\"] = 2] = \"Gutter\";\n})(MinimapPosition || (MinimapPosition = {}));\nexport var InjectedTextCursorStops;\n(function (InjectedTextCursorStops) {\n InjectedTextCursorStops[InjectedTextCursorStops[\"Both\"] = 0] = \"Both\";\n InjectedTextCursorStops[InjectedTextCursorStops[\"Right\"] = 1] = \"Right\";\n InjectedTextCursorStops[InjectedTextCursorStops[\"Left\"] = 2] = \"Left\";\n InjectedTextCursorStops[InjectedTextCursorStops[\"None\"] = 3] = \"None\";\n})(InjectedTextCursorStops || (InjectedTextCursorStops = {}));\nexport class TextModelResolvedOptions {\n get originalIndentSize() {\n return this._indentSizeIsTabSize ? 'tabSize' : this.indentSize;\n }\n /**\n * @internal\n */\n constructor(src) {\n this._textModelResolvedOptionsBrand = undefined;\n this.tabSize = Math.max(1, src.tabSize | 0);\n if (src.indentSize === 'tabSize') {\n this.indentSize = this.tabSize;\n this._indentSizeIsTabSize = true;\n }\n else {\n this.indentSize = Math.max(1, src.indentSize | 0);\n this._indentSizeIsTabSize = false;\n }\n this.insertSpaces = Boolean(src.insertSpaces);\n this.defaultEOL = src.defaultEOL | 0;\n this.trimAutoWhitespace = Boolean(src.trimAutoWhitespace);\n this.bracketPairColorizationOptions = src.bracketPairColorizationOptions;\n }\n /**\n * @internal\n */\n equals(other) {\n return (this.tabSize === other.tabSize\n && this._indentSizeIsTabSize === other._indentSizeIsTabSize\n && this.indentSize === other.indentSize\n && this.insertSpaces === other.insertSpaces\n && this.defaultEOL === other.defaultEOL\n && this.trimAutoWhitespace === other.trimAutoWhitespace\n && equals(this.bracketPairColorizationOptions, other.bracketPairColorizationOptions));\n }\n /**\n * @internal\n */\n createChangeEvent(newOpts) {\n return {\n tabSize: this.tabSize !== newOpts.tabSize,\n indentSize: this.indentSize !== newOpts.indentSize,\n insertSpaces: this.insertSpaces !== newOpts.insertSpaces,\n trimAutoWhitespace: this.trimAutoWhitespace !== newOpts.trimAutoWhitespace,\n };\n }\n}\nexport class FindMatch {\n /**\n * @internal\n */\n constructor(range, matches) {\n this._findMatchBrand = undefined;\n this.range = range;\n this.matches = matches;\n }\n}\n/**\n * @internal\n */\nexport function isITextSnapshot(obj) {\n return (obj && typeof obj.read === 'function');\n}\n/**\n * @internal\n */\nexport class ValidAnnotatedEditOperation {\n constructor(identifier, range, text, forceMoveMarkers, isAutoWhitespaceEdit, _isTracked) {\n this.identifier = identifier;\n this.range = range;\n this.text = text;\n this.forceMoveMarkers = forceMoveMarkers;\n this.isAutoWhitespaceEdit = isAutoWhitespaceEdit;\n this._isTracked = _isTracked;\n }\n}\n/**\n * @internal\n */\nexport class SearchData {\n constructor(regex, wordSeparators, simpleSearch) {\n this.regex = regex;\n this.wordSeparators = wordSeparators;\n this.simpleSearch = simpleSearch;\n }\n}\n/**\n * @internal\n */\nexport class ApplyEditsResult {\n constructor(reverseEdits, changes, trimAutoWhitespaceLineNumbers) {\n this.reverseEdits = reverseEdits;\n this.changes = changes;\n this.trimAutoWhitespaceLineNumbers = trimAutoWhitespaceLineNumbers;\n }\n}\n/**\n * @internal\n */\nexport function shouldSynchronizeModel(model) {\n return (!model.isTooLargeForSyncing() && !model.isForSimpleWidget);\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { splitLines } from '../../../base/common/strings.js';\nimport { Position } from '../core/position.js';\nimport { PrefixSumComputer } from './prefixSumComputer.js';\nexport class MirrorTextModel {\n constructor(uri, lines, eol, versionId) {\n this._uri = uri;\n this._lines = lines;\n this._eol = eol;\n this._versionId = versionId;\n this._lineStarts = null;\n this._cachedTextValue = null;\n }\n dispose() {\n this._lines.length = 0;\n }\n get version() {\n return this._versionId;\n }\n getText() {\n if (this._cachedTextValue === null) {\n this._cachedTextValue = this._lines.join(this._eol);\n }\n return this._cachedTextValue;\n }\n onEvents(e) {\n if (e.eol && e.eol !== this._eol) {\n this._eol = e.eol;\n this._lineStarts = null;\n }\n // Update my lines\n const changes = e.changes;\n for (const change of changes) {\n this._acceptDeleteRange(change.range);\n this._acceptInsertText(new Position(change.range.startLineNumber, change.range.startColumn), change.text);\n }\n this._versionId = e.versionId;\n this._cachedTextValue = null;\n }\n _ensureLineStarts() {\n if (!this._lineStarts) {\n const eolLength = this._eol.length;\n const linesLength = this._lines.length;\n const lineStartValues = new Uint32Array(linesLength);\n for (let i = 0; i < linesLength; i++) {\n lineStartValues[i] = this._lines[i].length + eolLength;\n }\n this._lineStarts = new PrefixSumComputer(lineStartValues);\n }\n }\n /**\n * All changes to a line's text go through this method\n */\n _setLineText(lineIndex, newValue) {\n this._lines[lineIndex] = newValue;\n if (this._lineStarts) {\n // update prefix sum\n this._lineStarts.setValue(lineIndex, this._lines[lineIndex].length + this._eol.length);\n }\n }\n _acceptDeleteRange(range) {\n if (range.startLineNumber === range.endLineNumber) {\n if (range.startColumn === range.endColumn) {\n // Nothing to delete\n return;\n }\n // Delete text on the affected line\n this._setLineText(range.startLineNumber - 1, this._lines[range.startLineNumber - 1].substring(0, range.startColumn - 1)\n + this._lines[range.startLineNumber - 1].substring(range.endColumn - 1));\n return;\n }\n // Take remaining text on last line and append it to remaining text on first line\n this._setLineText(range.startLineNumber - 1, this._lines[range.startLineNumber - 1].substring(0, range.startColumn - 1)\n + this._lines[range.endLineNumber - 1].substring(range.endColumn - 1));\n // Delete middle lines\n this._lines.splice(range.startLineNumber, range.endLineNumber - range.startLineNumber);\n if (this._lineStarts) {\n // update prefix sum\n this._lineStarts.removeValues(range.startLineNumber, range.endLineNumber - range.startLineNumber);\n }\n }\n _acceptInsertText(position, insertText) {\n if (insertText.length === 0) {\n // Nothing to insert\n return;\n }\n const insertLines = splitLines(insertText);\n if (insertLines.length === 1) {\n // Inserting text on one line\n this._setLineText(position.lineNumber - 1, this._lines[position.lineNumber - 1].substring(0, position.column - 1)\n + insertLines[0]\n + this._lines[position.lineNumber - 1].substring(position.column - 1));\n return;\n }\n // Append overflowing text from first line to the end of text to insert\n insertLines[insertLines.length - 1] += this._lines[position.lineNumber - 1].substring(position.column - 1);\n // Delete overflowing text from first line and insert text on first line\n this._setLineText(position.lineNumber - 1, this._lines[position.lineNumber - 1].substring(0, position.column - 1)\n + insertLines[0]);\n // Insert new lines & store lengths\n const newLengths = new Uint32Array(insertLines.length - 1);\n for (let i = 1; i < insertLines.length; i++) {\n this._lines.splice(position.lineNumber + i - 1, 0, insertLines[i]);\n newLengths[i - 1] = insertLines[i].length + this._eol.length;\n }\n if (this._lineStarts) {\n // update prefix sum\n this._lineStarts.insertValues(position.lineNumber, newLengths);\n }\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { arrayInsert } from '../../../base/common/arrays.js';\nimport { toUint32 } from '../../../base/common/uint.js';\nexport class PrefixSumComputer {\n constructor(values) {\n this.values = values;\n this.prefixSum = new Uint32Array(values.length);\n this.prefixSumValidIndex = new Int32Array(1);\n this.prefixSumValidIndex[0] = -1;\n }\n insertValues(insertIndex, insertValues) {\n insertIndex = toUint32(insertIndex);\n const oldValues = this.values;\n const oldPrefixSum = this.prefixSum;\n const insertValuesLen = insertValues.length;\n if (insertValuesLen === 0) {\n return false;\n }\n this.values = new Uint32Array(oldValues.length + insertValuesLen);\n this.values.set(oldValues.subarray(0, insertIndex), 0);\n this.values.set(oldValues.subarray(insertIndex), insertIndex + insertValuesLen);\n this.values.set(insertValues, insertIndex);\n if (insertIndex - 1 < this.prefixSumValidIndex[0]) {\n this.prefixSumValidIndex[0] = insertIndex - 1;\n }\n this.prefixSum = new Uint32Array(this.values.length);\n if (this.prefixSumValidIndex[0] >= 0) {\n this.prefixSum.set(oldPrefixSum.subarray(0, this.prefixSumValidIndex[0] + 1));\n }\n return true;\n }\n setValue(index, value) {\n index = toUint32(index);\n value = toUint32(value);\n if (this.values[index] === value) {\n return false;\n }\n this.values[index] = value;\n if (index - 1 < this.prefixSumValidIndex[0]) {\n this.prefixSumValidIndex[0] = index - 1;\n }\n return true;\n }\n removeValues(startIndex, count) {\n startIndex = toUint32(startIndex);\n count = toUint32(count);\n const oldValues = this.values;\n const oldPrefixSum = this.prefixSum;\n if (startIndex >= oldValues.length) {\n return false;\n }\n const maxCount = oldValues.length - startIndex;\n if (count >= maxCount) {\n count = maxCount;\n }\n if (count === 0) {\n return false;\n }\n this.values = new Uint32Array(oldValues.length - count);\n this.values.set(oldValues.subarray(0, startIndex), 0);\n this.values.set(oldValues.subarray(startIndex + count), startIndex);\n this.prefixSum = new Uint32Array(this.values.length);\n if (startIndex - 1 < this.prefixSumValidIndex[0]) {\n this.prefixSumValidIndex[0] = startIndex - 1;\n }\n if (this.prefixSumValidIndex[0] >= 0) {\n this.prefixSum.set(oldPrefixSum.subarray(0, this.prefixSumValidIndex[0] + 1));\n }\n return true;\n }\n getTotalSum() {\n if (this.values.length === 0) {\n return 0;\n }\n return this._getPrefixSum(this.values.length - 1);\n }\n /**\n * Returns the sum of the first `index + 1` many items.\n * @returns `SUM(0 <= j <= index, values[j])`.\n */\n getPrefixSum(index) {\n if (index < 0) {\n return 0;\n }\n index = toUint32(index);\n return this._getPrefixSum(index);\n }\n _getPrefixSum(index) {\n if (index <= this.prefixSumValidIndex[0]) {\n return this.prefixSum[index];\n }\n let startIndex = this.prefixSumValidIndex[0] + 1;\n if (startIndex === 0) {\n this.prefixSum[0] = this.values[0];\n startIndex++;\n }\n if (index >= this.values.length) {\n index = this.values.length - 1;\n }\n for (let i = startIndex; i <= index; i++) {\n this.prefixSum[i] = this.prefixSum[i - 1] + this.values[i];\n }\n this.prefixSumValidIndex[0] = Math.max(this.prefixSumValidIndex[0], index);\n return this.prefixSum[index];\n }\n getIndexOf(sum) {\n sum = Math.floor(sum);\n // Compute all sums (to get a fully valid prefixSum)\n this.getTotalSum();\n let low = 0;\n let high = this.values.length - 1;\n let mid = 0;\n let midStop = 0;\n let midStart = 0;\n while (low <= high) {\n mid = low + ((high - low) / 2) | 0;\n midStop = this.prefixSum[mid];\n midStart = midStop - this.values[mid];\n if (sum < midStart) {\n high = mid - 1;\n }\n else if (sum >= midStop) {\n low = mid + 1;\n }\n else {\n break;\n }\n }\n return new PrefixSumIndexOfResult(mid, sum - midStart);\n }\n}\n/**\n * {@link getIndexOf} has an amortized runtime complexity of O(1).\n *\n * ({@link PrefixSumComputer.getIndexOf} is just O(log n))\n*/\nexport class ConstantTimePrefixSumComputer {\n constructor(values) {\n this._values = values;\n this._isValid = false;\n this._validEndIndex = -1;\n this._prefixSum = [];\n this._indexBySum = [];\n }\n /**\n * @returns SUM(0 <= j < values.length, values[j])\n */\n getTotalSum() {\n this._ensureValid();\n return this._indexBySum.length;\n }\n /**\n * Returns the sum of the first `count` many items.\n * @returns `SUM(0 <= j < count, values[j])`.\n */\n getPrefixSum(count) {\n this._ensureValid();\n if (count === 0) {\n return 0;\n }\n return this._prefixSum[count - 1];\n }\n /**\n * @returns `result`, such that `getPrefixSum(result.index) + result.remainder = sum`\n */\n getIndexOf(sum) {\n this._ensureValid();\n const idx = this._indexBySum[sum];\n const viewLinesAbove = idx > 0 ? this._prefixSum[idx - 1] : 0;\n return new PrefixSumIndexOfResult(idx, sum - viewLinesAbove);\n }\n removeValues(start, deleteCount) {\n this._values.splice(start, deleteCount);\n this._invalidate(start);\n }\n insertValues(insertIndex, insertArr) {\n this._values = arrayInsert(this._values, insertIndex, insertArr);\n this._invalidate(insertIndex);\n }\n _invalidate(index) {\n this._isValid = false;\n this._validEndIndex = Math.min(this._validEndIndex, index - 1);\n }\n _ensureValid() {\n if (this._isValid) {\n return;\n }\n for (let i = this._validEndIndex + 1, len = this._values.length; i < len; i++) {\n const value = this._values[i];\n const sumAbove = i > 0 ? this._prefixSum[i - 1] : 0;\n this._prefixSum[i] = sumAbove + value;\n for (let j = 0; j < value; j++) {\n this._indexBySum[sumAbove + j] = i;\n }\n }\n // trim things\n this._prefixSum.length = this._values.length;\n this._indexBySum.length = this._prefixSum[this._prefixSum.length - 1];\n // mark as valid\n this._isValid = true;\n this._validEndIndex = this._values.length - 1;\n }\n setValue(index, value) {\n if (this._values[index] === value) {\n // no change\n return;\n }\n this._values[index] = value;\n this._invalidate(index);\n }\n}\nexport class PrefixSumIndexOfResult {\n constructor(index, remainder) {\n this.index = index;\n this.remainder = remainder;\n this._prefixSumIndexOfResultBrand = undefined;\n this.index = index;\n this.remainder = remainder;\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport * as strings from '../../../base/common/strings.js';\nimport { getMapForWordSeparators } from '../core/wordCharacterClassifier.js';\nimport { Position } from '../core/position.js';\nimport { Range } from '../core/range.js';\nimport { FindMatch, SearchData } from '../model.js';\nconst LIMIT_FIND_COUNT = 999;\nexport class SearchParams {\n constructor(searchString, isRegex, matchCase, wordSeparators) {\n this.searchString = searchString;\n this.isRegex = isRegex;\n this.matchCase = matchCase;\n this.wordSeparators = wordSeparators;\n }\n parseSearchRequest() {\n if (this.searchString === '') {\n return null;\n }\n // Try to create a RegExp out of the params\n let multiline;\n if (this.isRegex) {\n multiline = isMultilineRegexSource(this.searchString);\n }\n else {\n multiline = (this.searchString.indexOf('\\n') >= 0);\n }\n let regex = null;\n try {\n regex = strings.createRegExp(this.searchString, this.isRegex, {\n matchCase: this.matchCase,\n wholeWord: false,\n multiline: multiline,\n global: true,\n unicode: true\n });\n }\n catch (err) {\n return null;\n }\n if (!regex) {\n return null;\n }\n let canUseSimpleSearch = (!this.isRegex && !multiline);\n if (canUseSimpleSearch && this.searchString.toLowerCase() !== this.searchString.toUpperCase()) {\n // casing might make a difference\n canUseSimpleSearch = this.matchCase;\n }\n return new SearchData(regex, this.wordSeparators ? getMapForWordSeparators(this.wordSeparators) : null, canUseSimpleSearch ? this.searchString : null);\n }\n}\nexport function isMultilineRegexSource(searchString) {\n if (!searchString || searchString.length === 0) {\n return false;\n }\n for (let i = 0, len = searchString.length; i < len; i++) {\n const chCode = searchString.charCodeAt(i);\n if (chCode === 10 /* CharCode.LineFeed */) {\n return true;\n }\n if (chCode === 92 /* CharCode.Backslash */) {\n // move to next char\n i++;\n if (i >= len) {\n // string ends with a \\\n break;\n }\n const nextChCode = searchString.charCodeAt(i);\n if (nextChCode === 110 /* CharCode.n */ || nextChCode === 114 /* CharCode.r */ || nextChCode === 87 /* CharCode.W */) {\n return true;\n }\n }\n }\n return false;\n}\nexport function createFindMatch(range, rawMatches, captureMatches) {\n if (!captureMatches) {\n return new FindMatch(range, null);\n }\n const matches = [];\n for (let i = 0, len = rawMatches.length; i < len; i++) {\n matches[i] = rawMatches[i];\n }\n return new FindMatch(range, matches);\n}\nclass LineFeedCounter {\n constructor(text) {\n const lineFeedsOffsets = [];\n let lineFeedsOffsetsLen = 0;\n for (let i = 0, textLen = text.length; i < textLen; i++) {\n if (text.charCodeAt(i) === 10 /* CharCode.LineFeed */) {\n lineFeedsOffsets[lineFeedsOffsetsLen++] = i;\n }\n }\n this._lineFeedsOffsets = lineFeedsOffsets;\n }\n findLineFeedCountBeforeOffset(offset) {\n const lineFeedsOffsets = this._lineFeedsOffsets;\n let min = 0;\n let max = lineFeedsOffsets.length - 1;\n if (max === -1) {\n // no line feeds\n return 0;\n }\n if (offset <= lineFeedsOffsets[0]) {\n // before first line feed\n return 0;\n }\n while (min < max) {\n const mid = min + ((max - min) / 2 >> 0);\n if (lineFeedsOffsets[mid] >= offset) {\n max = mid - 1;\n }\n else {\n if (lineFeedsOffsets[mid + 1] >= offset) {\n // bingo!\n min = mid;\n max = mid;\n }\n else {\n min = mid + 1;\n }\n }\n }\n return min + 1;\n }\n}\nexport class TextModelSearch {\n static findMatches(model, searchParams, searchRange, captureMatches, limitResultCount) {\n const searchData = searchParams.parseSearchRequest();\n if (!searchData) {\n return [];\n }\n if (searchData.regex.multiline) {\n return this._doFindMatchesMultiline(model, searchRange, new Searcher(searchData.wordSeparators, searchData.regex), captureMatches, limitResultCount);\n }\n return this._doFindMatchesLineByLine(model, searchRange, searchData, captureMatches, limitResultCount);\n }\n /**\n * Multiline search always executes on the lines concatenated with \\n.\n * We must therefore compensate for the count of \\n in case the model is CRLF\n */\n static _getMultilineMatchRange(model, deltaOffset, text, lfCounter, matchIndex, match0) {\n let startOffset;\n let lineFeedCountBeforeMatch = 0;\n if (lfCounter) {\n lineFeedCountBeforeMatch = lfCounter.findLineFeedCountBeforeOffset(matchIndex);\n startOffset = deltaOffset + matchIndex + lineFeedCountBeforeMatch /* add as many \\r as there were \\n */;\n }\n else {\n startOffset = deltaOffset + matchIndex;\n }\n let endOffset;\n if (lfCounter) {\n const lineFeedCountBeforeEndOfMatch = lfCounter.findLineFeedCountBeforeOffset(matchIndex + match0.length);\n const lineFeedCountInMatch = lineFeedCountBeforeEndOfMatch - lineFeedCountBeforeMatch;\n endOffset = startOffset + match0.length + lineFeedCountInMatch /* add as many \\r as there were \\n */;\n }\n else {\n endOffset = startOffset + match0.length;\n }\n const startPosition = model.getPositionAt(startOffset);\n const endPosition = model.getPositionAt(endOffset);\n return new Range(startPosition.lineNumber, startPosition.column, endPosition.lineNumber, endPosition.column);\n }\n static _doFindMatchesMultiline(model, searchRange, searcher, captureMatches, limitResultCount) {\n const deltaOffset = model.getOffsetAt(searchRange.getStartPosition());\n // We always execute multiline search over the lines joined with \\n\n // This makes it that \\n will match the EOL for both CRLF and LF models\n // We compensate for offset errors in `_getMultilineMatchRange`\n const text = model.getValueInRange(searchRange, 1 /* EndOfLinePreference.LF */);\n const lfCounter = (model.getEOL() === '\\r\\n' ? new LineFeedCounter(text) : null);\n const result = [];\n let counter = 0;\n let m;\n searcher.reset(0);\n while ((m = searcher.next(text))) {\n result[counter++] = createFindMatch(this._getMultilineMatchRange(model, deltaOffset, text, lfCounter, m.index, m[0]), m, captureMatches);\n if (counter >= limitResultCount) {\n return result;\n }\n }\n return result;\n }\n static _doFindMatchesLineByLine(model, searchRange, searchData, captureMatches, limitResultCount) {\n const result = [];\n let resultLen = 0;\n // Early case for a search range that starts & stops on the same line number\n if (searchRange.startLineNumber === searchRange.endLineNumber) {\n const text = model.getLineContent(searchRange.startLineNumber).substring(searchRange.startColumn - 1, searchRange.endColumn - 1);\n resultLen = this._findMatchesInLine(searchData, text, searchRange.startLineNumber, searchRange.startColumn - 1, resultLen, result, captureMatches, limitResultCount);\n return result;\n }\n // Collect results from first line\n const text = model.getLineContent(searchRange.startLineNumber).substring(searchRange.startColumn - 1);\n resultLen = this._findMatchesInLine(searchData, text, searchRange.startLineNumber, searchRange.startColumn - 1, resultLen, result, captureMatches, limitResultCount);\n // Collect results from middle lines\n for (let lineNumber = searchRange.startLineNumber + 1; lineNumber < searchRange.endLineNumber && resultLen < limitResultCount; lineNumber++) {\n resultLen = this._findMatchesInLine(searchData, model.getLineContent(lineNumber), lineNumber, 0, resultLen, result, captureMatches, limitResultCount);\n }\n // Collect results from last line\n if (resultLen < limitResultCount) {\n const text = model.getLineContent(searchRange.endLineNumber).substring(0, searchRange.endColumn - 1);\n resultLen = this._findMatchesInLine(searchData, text, searchRange.endLineNumber, 0, resultLen, result, captureMatches, limitResultCount);\n }\n return result;\n }\n static _findMatchesInLine(searchData, text, lineNumber, deltaOffset, resultLen, result, captureMatches, limitResultCount) {\n const wordSeparators = searchData.wordSeparators;\n if (!captureMatches && searchData.simpleSearch) {\n const searchString = searchData.simpleSearch;\n const searchStringLen = searchString.length;\n const textLength = text.length;\n let lastMatchIndex = -searchStringLen;\n while ((lastMatchIndex = text.indexOf(searchString, lastMatchIndex + searchStringLen)) !== -1) {\n if (!wordSeparators || isValidMatch(wordSeparators, text, textLength, lastMatchIndex, searchStringLen)) {\n result[resultLen++] = new FindMatch(new Range(lineNumber, lastMatchIndex + 1 + deltaOffset, lineNumber, lastMatchIndex + 1 + searchStringLen + deltaOffset), null);\n if (resultLen >= limitResultCount) {\n return resultLen;\n }\n }\n }\n return resultLen;\n }\n const searcher = new Searcher(searchData.wordSeparators, searchData.regex);\n let m;\n // Reset regex to search from the beginning\n searcher.reset(0);\n do {\n m = searcher.next(text);\n if (m) {\n result[resultLen++] = createFindMatch(new Range(lineNumber, m.index + 1 + deltaOffset, lineNumber, m.index + 1 + m[0].length + deltaOffset), m, captureMatches);\n if (resultLen >= limitResultCount) {\n return resultLen;\n }\n }\n } while (m);\n return resultLen;\n }\n static findNextMatch(model, searchParams, searchStart, captureMatches) {\n const searchData = searchParams.parseSearchRequest();\n if (!searchData) {\n return null;\n }\n const searcher = new Searcher(searchData.wordSeparators, searchData.regex);\n if (searchData.regex.multiline) {\n return this._doFindNextMatchMultiline(model, searchStart, searcher, captureMatches);\n }\n return this._doFindNextMatchLineByLine(model, searchStart, searcher, captureMatches);\n }\n static _doFindNextMatchMultiline(model, searchStart, searcher, captureMatches) {\n const searchTextStart = new Position(searchStart.lineNumber, 1);\n const deltaOffset = model.getOffsetAt(searchTextStart);\n const lineCount = model.getLineCount();\n // We always execute multiline search over the lines joined with \\n\n // This makes it that \\n will match the EOL for both CRLF and LF models\n // We compensate for offset errors in `_getMultilineMatchRange`\n const text = model.getValueInRange(new Range(searchTextStart.lineNumber, searchTextStart.column, lineCount, model.getLineMaxColumn(lineCount)), 1 /* EndOfLinePreference.LF */);\n const lfCounter = (model.getEOL() === '\\r\\n' ? new LineFeedCounter(text) : null);\n searcher.reset(searchStart.column - 1);\n const m = searcher.next(text);\n if (m) {\n return createFindMatch(this._getMultilineMatchRange(model, deltaOffset, text, lfCounter, m.index, m[0]), m, captureMatches);\n }\n if (searchStart.lineNumber !== 1 || searchStart.column !== 1) {\n // Try again from the top\n return this._doFindNextMatchMultiline(model, new Position(1, 1), searcher, captureMatches);\n }\n return null;\n }\n static _doFindNextMatchLineByLine(model, searchStart, searcher, captureMatches) {\n const lineCount = model.getLineCount();\n const startLineNumber = searchStart.lineNumber;\n // Look in first line\n const text = model.getLineContent(startLineNumber);\n const r = this._findFirstMatchInLine(searcher, text, startLineNumber, searchStart.column, captureMatches);\n if (r) {\n return r;\n }\n for (let i = 1; i <= lineCount; i++) {\n const lineIndex = (startLineNumber + i - 1) % lineCount;\n const text = model.getLineContent(lineIndex + 1);\n const r = this._findFirstMatchInLine(searcher, text, lineIndex + 1, 1, captureMatches);\n if (r) {\n return r;\n }\n }\n return null;\n }\n static _findFirstMatchInLine(searcher, text, lineNumber, fromColumn, captureMatches) {\n // Set regex to search from column\n searcher.reset(fromColumn - 1);\n const m = searcher.next(text);\n if (m) {\n return createFindMatch(new Range(lineNumber, m.index + 1, lineNumber, m.index + 1 + m[0].length), m, captureMatches);\n }\n return null;\n }\n static findPreviousMatch(model, searchParams, searchStart, captureMatches) {\n const searchData = searchParams.parseSearchRequest();\n if (!searchData) {\n return null;\n }\n const searcher = new Searcher(searchData.wordSeparators, searchData.regex);\n if (searchData.regex.multiline) {\n return this._doFindPreviousMatchMultiline(model, searchStart, searcher, captureMatches);\n }\n return this._doFindPreviousMatchLineByLine(model, searchStart, searcher, captureMatches);\n }\n static _doFindPreviousMatchMultiline(model, searchStart, searcher, captureMatches) {\n const matches = this._doFindMatchesMultiline(model, new Range(1, 1, searchStart.lineNumber, searchStart.column), searcher, captureMatches, 10 * LIMIT_FIND_COUNT);\n if (matches.length > 0) {\n return matches[matches.length - 1];\n }\n const lineCount = model.getLineCount();\n if (searchStart.lineNumber !== lineCount || searchStart.column !== model.getLineMaxColumn(lineCount)) {\n // Try again with all content\n return this._doFindPreviousMatchMultiline(model, new Position(lineCount, model.getLineMaxColumn(lineCount)), searcher, captureMatches);\n }\n return null;\n }\n static _doFindPreviousMatchLineByLine(model, searchStart, searcher, captureMatches) {\n const lineCount = model.getLineCount();\n const startLineNumber = searchStart.lineNumber;\n // Look in first line\n const text = model.getLineContent(startLineNumber).substring(0, searchStart.column - 1);\n const r = this._findLastMatchInLine(searcher, text, startLineNumber, captureMatches);\n if (r) {\n return r;\n }\n for (let i = 1; i <= lineCount; i++) {\n const lineIndex = (lineCount + startLineNumber - i - 1) % lineCount;\n const text = model.getLineContent(lineIndex + 1);\n const r = this._findLastMatchInLine(searcher, text, lineIndex + 1, captureMatches);\n if (r) {\n return r;\n }\n }\n return null;\n }\n static _findLastMatchInLine(searcher, text, lineNumber, captureMatches) {\n let bestResult = null;\n let m;\n searcher.reset(0);\n while ((m = searcher.next(text))) {\n bestResult = createFindMatch(new Range(lineNumber, m.index + 1, lineNumber, m.index + 1 + m[0].length), m, captureMatches);\n }\n return bestResult;\n }\n}\nfunction leftIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength) {\n if (matchStartIndex === 0) {\n // Match starts at start of string\n return true;\n }\n const charBefore = text.charCodeAt(matchStartIndex - 1);\n if (wordSeparators.get(charBefore) !== 0 /* WordCharacterClass.Regular */) {\n // The character before the match is a word separator\n return true;\n }\n if (charBefore === 13 /* CharCode.CarriageReturn */ || charBefore === 10 /* CharCode.LineFeed */) {\n // The character before the match is line break or carriage return.\n return true;\n }\n if (matchLength > 0) {\n const firstCharInMatch = text.charCodeAt(matchStartIndex);\n if (wordSeparators.get(firstCharInMatch) !== 0 /* WordCharacterClass.Regular */) {\n // The first character inside the match is a word separator\n return true;\n }\n }\n return false;\n}\nfunction rightIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength) {\n if (matchStartIndex + matchLength === textLength) {\n // Match ends at end of string\n return true;\n }\n const charAfter = text.charCodeAt(matchStartIndex + matchLength);\n if (wordSeparators.get(charAfter) !== 0 /* WordCharacterClass.Regular */) {\n // The character after the match is a word separator\n return true;\n }\n if (charAfter === 13 /* CharCode.CarriageReturn */ || charAfter === 10 /* CharCode.LineFeed */) {\n // The character after the match is line break or carriage return.\n return true;\n }\n if (matchLength > 0) {\n const lastCharInMatch = text.charCodeAt(matchStartIndex + matchLength - 1);\n if (wordSeparators.get(lastCharInMatch) !== 0 /* WordCharacterClass.Regular */) {\n // The last character in the match is a word separator\n return true;\n }\n }\n return false;\n}\nexport function isValidMatch(wordSeparators, text, textLength, matchStartIndex, matchLength) {\n return (leftIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength)\n && rightIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength));\n}\nexport class Searcher {\n constructor(wordSeparators, searchRegex) {\n this._wordSeparators = wordSeparators;\n this._searchRegex = searchRegex;\n this._prevMatchStartIndex = -1;\n this._prevMatchLength = 0;\n }\n reset(lastIndex) {\n this._searchRegex.lastIndex = lastIndex;\n this._prevMatchStartIndex = -1;\n this._prevMatchLength = 0;\n }\n next(text) {\n const textLength = text.length;\n let m;\n do {\n if (this._prevMatchStartIndex + this._prevMatchLength === textLength) {\n // Reached the end of the line\n return null;\n }\n m = this._searchRegex.exec(text);\n if (!m) {\n return null;\n }\n const matchStartIndex = m.index;\n const matchLength = m[0].length;\n if (matchStartIndex === this._prevMatchStartIndex && matchLength === this._prevMatchLength) {\n if (matchLength === 0) {\n // the search result is an empty string and won't advance `regex.lastIndex`, so `regex.exec` will stuck here\n // we attempt to recover from that by advancing by two if surrogate pair found and by one otherwise\n if (strings.getNextCodePoint(text, textLength, this._searchRegex.lastIndex) > 0xFFFF) {\n this._searchRegex.lastIndex += 2;\n }\n else {\n this._searchRegex.lastIndex += 1;\n }\n continue;\n }\n // Exit early if the regex matches the same range twice\n return null;\n }\n this._prevMatchStartIndex = matchStartIndex;\n this._prevMatchLength = matchLength;\n if (!this._wordSeparators || isValidMatch(this._wordSeparators, text, textLength, matchStartIndex, matchLength)) {\n return m;\n }\n } while (m);\n return null;\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { CancellationTokenSource } from '../../../base/common/cancellation.js';\nimport { Emitter } from '../../../base/common/event.js';\nimport { KeyChord } from '../../../base/common/keyCodes.js';\nimport { URI } from '../../../base/common/uri.js';\nimport { Position } from '../core/position.js';\nimport { Range } from '../core/range.js';\nimport { Selection } from '../core/selection.js';\nimport { Token } from '../languages.js';\nimport * as standaloneEnums from '../standalone/standaloneEnums.js';\nexport class KeyMod {\n static chord(firstPart, secondPart) {\n return KeyChord(firstPart, secondPart);\n }\n}\nKeyMod.CtrlCmd = 2048 /* ConstKeyMod.CtrlCmd */;\nKeyMod.Shift = 1024 /* ConstKeyMod.Shift */;\nKeyMod.Alt = 512 /* ConstKeyMod.Alt */;\nKeyMod.WinCtrl = 256 /* ConstKeyMod.WinCtrl */;\nexport function createMonacoBaseAPI() {\n return {\n editor: undefined, // undefined override expected here\n languages: undefined, // undefined override expected here\n CancellationTokenSource: CancellationTokenSource,\n Emitter: Emitter,\n KeyCode: standaloneEnums.KeyCode,\n KeyMod: KeyMod,\n Position: Position,\n Range: Range,\n Selection: Selection,\n SelectionDirection: standaloneEnums.SelectionDirection,\n MarkerSeverity: standaloneEnums.MarkerSeverity,\n MarkerTag: standaloneEnums.MarkerTag,\n Uri: URI,\n Token: Token\n };\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { stringDiff } from '../../../base/common/diff/diff.js';\nimport { URI } from '../../../base/common/uri.js';\nimport { Position } from '../core/position.js';\nimport { Range } from '../core/range.js';\nimport { MirrorTextModel as BaseMirrorModel } from '../model/mirrorTextModel.js';\nimport { ensureValidWordDefinition, getWordAtText } from '../core/wordHelper.js';\nimport { computeLinks } from '../languages/linkComputer.js';\nimport { BasicInplaceReplace } from '../languages/supports/inplaceReplaceSupport.js';\nimport { createMonacoBaseAPI } from './editorBaseApi.js';\nimport { StopWatch } from '../../../base/common/stopwatch.js';\nimport { UnicodeTextModelHighlighter } from './unicodeTextModelHighlighter.js';\nimport { linesDiffComputers } from '../diff/linesDiffComputers.js';\nimport { createProxyObject, getAllMethodNames } from '../../../base/common/objects.js';\nimport { computeDefaultDocumentColors } from '../languages/defaultDocumentColorsComputer.js';\n/**\n * @internal\n */\nclass MirrorModel extends BaseMirrorModel {\n get uri() {\n return this._uri;\n }\n get eol() {\n return this._eol;\n }\n getValue() {\n return this.getText();\n }\n findMatches(regex) {\n const matches = [];\n for (let i = 0; i < this._lines.length; i++) {\n const line = this._lines[i];\n const offsetToAdd = this.offsetAt(new Position(i + 1, 1));\n const iteratorOverMatches = line.matchAll(regex);\n for (const match of iteratorOverMatches) {\n if (match.index || match.index === 0) {\n match.index = match.index + offsetToAdd;\n }\n matches.push(match);\n }\n }\n return matches;\n }\n getLinesContent() {\n return this._lines.slice(0);\n }\n getLineCount() {\n return this._lines.length;\n }\n getLineContent(lineNumber) {\n return this._lines[lineNumber - 1];\n }\n getWordAtPosition(position, wordDefinition) {\n const wordAtText = getWordAtText(position.column, ensureValidWordDefinition(wordDefinition), this._lines[position.lineNumber - 1], 0);\n if (wordAtText) {\n return new Range(position.lineNumber, wordAtText.startColumn, position.lineNumber, wordAtText.endColumn);\n }\n return null;\n }\n words(wordDefinition) {\n const lines = this._lines;\n const wordenize = this._wordenize.bind(this);\n let lineNumber = 0;\n let lineText = '';\n let wordRangesIdx = 0;\n let wordRanges = [];\n return {\n *[Symbol.iterator]() {\n while (true) {\n if (wordRangesIdx < wordRanges.length) {\n const value = lineText.substring(wordRanges[wordRangesIdx].start, wordRanges[wordRangesIdx].end);\n wordRangesIdx += 1;\n yield value;\n }\n else {\n if (lineNumber < lines.length) {\n lineText = lines[lineNumber];\n wordRanges = wordenize(lineText, wordDefinition);\n wordRangesIdx = 0;\n lineNumber += 1;\n }\n else {\n break;\n }\n }\n }\n }\n };\n }\n getLineWords(lineNumber, wordDefinition) {\n const content = this._lines[lineNumber - 1];\n const ranges = this._wordenize(content, wordDefinition);\n const words = [];\n for (const range of ranges) {\n words.push({\n word: content.substring(range.start, range.end),\n startColumn: range.start + 1,\n endColumn: range.end + 1\n });\n }\n return words;\n }\n _wordenize(content, wordDefinition) {\n const result = [];\n let match;\n wordDefinition.lastIndex = 0; // reset lastIndex just to be sure\n while (match = wordDefinition.exec(content)) {\n if (match[0].length === 0) {\n // it did match the empty string\n break;\n }\n result.push({ start: match.index, end: match.index + match[0].length });\n }\n return result;\n }\n getValueInRange(range) {\n range = this._validateRange(range);\n if (range.startLineNumber === range.endLineNumber) {\n return this._lines[range.startLineNumber - 1].substring(range.startColumn - 1, range.endColumn - 1);\n }\n const lineEnding = this._eol;\n const startLineIndex = range.startLineNumber - 1;\n const endLineIndex = range.endLineNumber - 1;\n const resultLines = [];\n resultLines.push(this._lines[startLineIndex].substring(range.startColumn - 1));\n for (let i = startLineIndex + 1; i < endLineIndex; i++) {\n resultLines.push(this._lines[i]);\n }\n resultLines.push(this._lines[endLineIndex].substring(0, range.endColumn - 1));\n return resultLines.join(lineEnding);\n }\n offsetAt(position) {\n position = this._validatePosition(position);\n this._ensureLineStarts();\n return this._lineStarts.getPrefixSum(position.lineNumber - 2) + (position.column - 1);\n }\n positionAt(offset) {\n offset = Math.floor(offset);\n offset = Math.max(0, offset);\n this._ensureLineStarts();\n const out = this._lineStarts.getIndexOf(offset);\n const lineLength = this._lines[out.index].length;\n // Ensure we return a valid position\n return {\n lineNumber: 1 + out.index,\n column: 1 + Math.min(out.remainder, lineLength)\n };\n }\n _validateRange(range) {\n const start = this._validatePosition({ lineNumber: range.startLineNumber, column: range.startColumn });\n const end = this._validatePosition({ lineNumber: range.endLineNumber, column: range.endColumn });\n if (start.lineNumber !== range.startLineNumber\n || start.column !== range.startColumn\n || end.lineNumber !== range.endLineNumber\n || end.column !== range.endColumn) {\n return {\n startLineNumber: start.lineNumber,\n startColumn: start.column,\n endLineNumber: end.lineNumber,\n endColumn: end.column\n };\n }\n return range;\n }\n _validatePosition(position) {\n if (!Position.isIPosition(position)) {\n throw new Error('bad position');\n }\n let { lineNumber, column } = position;\n let hasChanged = false;\n if (lineNumber < 1) {\n lineNumber = 1;\n column = 1;\n hasChanged = true;\n }\n else if (lineNumber > this._lines.length) {\n lineNumber = this._lines.length;\n column = this._lines[lineNumber - 1].length + 1;\n hasChanged = true;\n }\n else {\n const maxCharacter = this._lines[lineNumber - 1].length + 1;\n if (column < 1) {\n column = 1;\n hasChanged = true;\n }\n else if (column > maxCharacter) {\n column = maxCharacter;\n hasChanged = true;\n }\n }\n if (!hasChanged) {\n return position;\n }\n else {\n return { lineNumber, column };\n }\n }\n}\n/**\n * @internal\n */\nexport class EditorSimpleWorker {\n constructor(host, foreignModuleFactory) {\n this._host = host;\n this._models = Object.create(null);\n this._foreignModuleFactory = foreignModuleFactory;\n this._foreignModule = null;\n }\n dispose() {\n this._models = Object.create(null);\n }\n _getModel(uri) {\n return this._models[uri];\n }\n _getModels() {\n const all = [];\n Object.keys(this._models).forEach((key) => all.push(this._models[key]));\n return all;\n }\n acceptNewModel(data) {\n this._models[data.url] = new MirrorModel(URI.parse(data.url), data.lines, data.EOL, data.versionId);\n }\n acceptModelChanged(strURL, e) {\n if (!this._models[strURL]) {\n return;\n }\n const model = this._models[strURL];\n model.onEvents(e);\n }\n acceptRemovedModel(strURL) {\n if (!this._models[strURL]) {\n return;\n }\n delete this._models[strURL];\n }\n async computeUnicodeHighlights(url, options, range) {\n const model = this._getModel(url);\n if (!model) {\n return { ranges: [], hasMore: false, ambiguousCharacterCount: 0, invisibleCharacterCount: 0, nonBasicAsciiCharacterCount: 0 };\n }\n return UnicodeTextModelHighlighter.computeUnicodeHighlights(model, options, range);\n }\n // ---- BEGIN diff --------------------------------------------------------------------------\n async computeDiff(originalUrl, modifiedUrl, options, algorithm) {\n const original = this._getModel(originalUrl);\n const modified = this._getModel(modifiedUrl);\n if (!original || !modified) {\n return null;\n }\n return EditorSimpleWorker.computeDiff(original, modified, options, algorithm);\n }\n static computeDiff(originalTextModel, modifiedTextModel, options, algorithm) {\n const diffAlgorithm = algorithm === 'advanced' ? linesDiffComputers.getDefault() : linesDiffComputers.getLegacy();\n const originalLines = originalTextModel.getLinesContent();\n const modifiedLines = modifiedTextModel.getLinesContent();\n const result = diffAlgorithm.computeDiff(originalLines, modifiedLines, options);\n const identical = (result.changes.length > 0 ? false : this._modelsAreIdentical(originalTextModel, modifiedTextModel));\n function getLineChanges(changes) {\n return changes.map(m => {\n var _a;\n return ([m.original.startLineNumber, m.original.endLineNumberExclusive, m.modified.startLineNumber, m.modified.endLineNumberExclusive, (_a = m.innerChanges) === null || _a === void 0 ? void 0 : _a.map(m => [\n m.originalRange.startLineNumber,\n m.originalRange.startColumn,\n m.originalRange.endLineNumber,\n m.originalRange.endColumn,\n m.modifiedRange.startLineNumber,\n m.modifiedRange.startColumn,\n m.modifiedRange.endLineNumber,\n m.modifiedRange.endColumn,\n ])]);\n });\n }\n return {\n identical,\n quitEarly: result.hitTimeout,\n changes: getLineChanges(result.changes),\n moves: result.moves.map(m => ([\n m.lineRangeMapping.original.startLineNumber,\n m.lineRangeMapping.original.endLineNumberExclusive,\n m.lineRangeMapping.modified.startLineNumber,\n m.lineRangeMapping.modified.endLineNumberExclusive,\n getLineChanges(m.changes)\n ])),\n };\n }\n static _modelsAreIdentical(original, modified) {\n const originalLineCount = original.getLineCount();\n const modifiedLineCount = modified.getLineCount();\n if (originalLineCount !== modifiedLineCount) {\n return false;\n }\n for (let line = 1; line <= originalLineCount; line++) {\n const originalLine = original.getLineContent(line);\n const modifiedLine = modified.getLineContent(line);\n if (originalLine !== modifiedLine) {\n return false;\n }\n }\n return true;\n }\n async computeMoreMinimalEdits(modelUrl, edits, pretty) {\n const model = this._getModel(modelUrl);\n if (!model) {\n return edits;\n }\n const result = [];\n let lastEol = undefined;\n edits = edits.slice(0).sort((a, b) => {\n if (a.range && b.range) {\n return Range.compareRangesUsingStarts(a.range, b.range);\n }\n // eol only changes should go to the end\n const aRng = a.range ? 0 : 1;\n const bRng = b.range ? 0 : 1;\n return aRng - bRng;\n });\n // merge adjacent edits\n let writeIndex = 0;\n for (let readIndex = 1; readIndex < edits.length; readIndex++) {\n if (Range.getEndPosition(edits[writeIndex].range).equals(Range.getStartPosition(edits[readIndex].range))) {\n edits[writeIndex].range = Range.fromPositions(Range.getStartPosition(edits[writeIndex].range), Range.getEndPosition(edits[readIndex].range));\n edits[writeIndex].text += edits[readIndex].text;\n }\n else {\n writeIndex++;\n edits[writeIndex] = edits[readIndex];\n }\n }\n edits.length = writeIndex + 1;\n for (let { range, text, eol } of edits) {\n if (typeof eol === 'number') {\n lastEol = eol;\n }\n if (Range.isEmpty(range) && !text) {\n // empty change\n continue;\n }\n const original = model.getValueInRange(range);\n text = text.replace(/\\r\\n|\\n|\\r/g, model.eol);\n if (original === text) {\n // noop\n continue;\n }\n // make sure diff won't take too long\n if (Math.max(text.length, original.length) > EditorSimpleWorker._diffLimit) {\n result.push({ range, text });\n continue;\n }\n // compute diff between original and edit.text\n const changes = stringDiff(original, text, pretty);\n const editOffset = model.offsetAt(Range.lift(range).getStartPosition());\n for (const change of changes) {\n const start = model.positionAt(editOffset + change.originalStart);\n const end = model.positionAt(editOffset + change.originalStart + change.originalLength);\n const newEdit = {\n text: text.substr(change.modifiedStart, change.modifiedLength),\n range: { startLineNumber: start.lineNumber, startColumn: start.column, endLineNumber: end.lineNumber, endColumn: end.column }\n };\n if (model.getValueInRange(newEdit.range) !== newEdit.text) {\n result.push(newEdit);\n }\n }\n }\n if (typeof lastEol === 'number') {\n result.push({ eol: lastEol, text: '', range: { startLineNumber: 0, startColumn: 0, endLineNumber: 0, endColumn: 0 } });\n }\n return result;\n }\n // ---- END minimal edits ---------------------------------------------------------------\n async computeLinks(modelUrl) {\n const model = this._getModel(modelUrl);\n if (!model) {\n return null;\n }\n return computeLinks(model);\n }\n // --- BEGIN default document colors -----------------------------------------------------------\n async computeDefaultDocumentColors(modelUrl) {\n const model = this._getModel(modelUrl);\n if (!model) {\n return null;\n }\n return computeDefaultDocumentColors(model);\n }\n async textualSuggest(modelUrls, leadingWord, wordDef, wordDefFlags) {\n const sw = new StopWatch();\n const wordDefRegExp = new RegExp(wordDef, wordDefFlags);\n const seen = new Set();\n outer: for (const url of modelUrls) {\n const model = this._getModel(url);\n if (!model) {\n continue;\n }\n for (const word of model.words(wordDefRegExp)) {\n if (word === leadingWord || !isNaN(Number(word))) {\n continue;\n }\n seen.add(word);\n if (seen.size > EditorSimpleWorker._suggestionsLimit) {\n break outer;\n }\n }\n }\n return { words: Array.from(seen), duration: sw.elapsed() };\n }\n // ---- END suggest --------------------------------------------------------------------------\n //#region -- word ranges --\n async computeWordRanges(modelUrl, range, wordDef, wordDefFlags) {\n const model = this._getModel(modelUrl);\n if (!model) {\n return Object.create(null);\n }\n const wordDefRegExp = new RegExp(wordDef, wordDefFlags);\n const result = Object.create(null);\n for (let line = range.startLineNumber; line < range.endLineNumber; line++) {\n const words = model.getLineWords(line, wordDefRegExp);\n for (const word of words) {\n if (!isNaN(Number(word.word))) {\n continue;\n }\n let array = result[word.word];\n if (!array) {\n array = [];\n result[word.word] = array;\n }\n array.push({\n startLineNumber: line,\n startColumn: word.startColumn,\n endLineNumber: line,\n endColumn: word.endColumn\n });\n }\n }\n return result;\n }\n //#endregion\n async navigateValueSet(modelUrl, range, up, wordDef, wordDefFlags) {\n const model = this._getModel(modelUrl);\n if (!model) {\n return null;\n }\n const wordDefRegExp = new RegExp(wordDef, wordDefFlags);\n if (range.startColumn === range.endColumn) {\n range = {\n startLineNumber: range.startLineNumber,\n startColumn: range.startColumn,\n endLineNumber: range.endLineNumber,\n endColumn: range.endColumn + 1\n };\n }\n const selectionText = model.getValueInRange(range);\n const wordRange = model.getWordAtPosition({ lineNumber: range.startLineNumber, column: range.startColumn }, wordDefRegExp);\n if (!wordRange) {\n return null;\n }\n const word = model.getValueInRange(wordRange);\n const result = BasicInplaceReplace.INSTANCE.navigateValueSet(range, selectionText, wordRange, word, up);\n return result;\n }\n // ---- BEGIN foreign module support --------------------------------------------------------------------------\n loadForeignModule(moduleId, createData, foreignHostMethods) {\n const proxyMethodRequest = (method, args) => {\n return this._host.fhr(method, args);\n };\n const foreignHost = createProxyObject(foreignHostMethods, proxyMethodRequest);\n const ctx = {\n host: foreignHost,\n getMirrorModels: () => {\n return this._getModels();\n }\n };\n if (this._foreignModuleFactory) {\n this._foreignModule = this._foreignModuleFactory(ctx, createData);\n // static foreing module\n return Promise.resolve(getAllMethodNames(this._foreignModule));\n }\n // ESM-comment-begin\n // \t\treturn new Promise((resolve, reject) => {\n // \t\t\trequire([moduleId], (foreignModule: { create: IForeignModuleFactory }) => {\n // \t\t\t\tthis._foreignModule = foreignModule.create(ctx, createData);\n // \n // \t\t\t\tresolve(getAllMethodNames(this._foreignModule));\n // \n // \t\t\t}, reject);\n // \t\t});\n // ESM-comment-end\n // ESM-uncomment-begin\n return Promise.reject(new Error(`Unexpected usage`));\n // ESM-uncomment-end\n }\n // foreign method request\n fmr(method, args) {\n if (!this._foreignModule || typeof this._foreignModule[method] !== 'function') {\n return Promise.reject(new Error('Missing requestHandler or method: ' + method));\n }\n try {\n return Promise.resolve(this._foreignModule[method].apply(this._foreignModule, args));\n }\n catch (e) {\n return Promise.reject(e);\n }\n }\n}\n// ---- END diff --------------------------------------------------------------------------\n// ---- BEGIN minimal edits ---------------------------------------------------------------\nEditorSimpleWorker._diffLimit = 100000;\n// ---- BEGIN suggest --------------------------------------------------------------------------\nEditorSimpleWorker._suggestionsLimit = 10000;\n/**\n * Called on the worker side\n * @internal\n */\nexport function create(host) {\n return new EditorSimpleWorker(host, null);\n}\nif (typeof importScripts === 'function') {\n // Running in a web worker\n globalThis.monaco = createMonacoBaseAPI();\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { Range } from '../core/range.js';\nimport { Searcher } from '../model/textModelSearch.js';\nimport * as strings from '../../../base/common/strings.js';\nimport { assertNever } from '../../../base/common/assert.js';\nimport { DEFAULT_WORD_REGEXP, getWordAtText } from '../core/wordHelper.js';\nexport class UnicodeTextModelHighlighter {\n static computeUnicodeHighlights(model, options, range) {\n const startLine = range ? range.startLineNumber : 1;\n const endLine = range ? range.endLineNumber : model.getLineCount();\n const codePointHighlighter = new CodePointHighlighter(options);\n const candidates = codePointHighlighter.getCandidateCodePoints();\n let regex;\n if (candidates === 'allNonBasicAscii') {\n regex = new RegExp('[^\\\\t\\\\n\\\\r\\\\x20-\\\\x7E]', 'g');\n }\n else {\n regex = new RegExp(`${buildRegExpCharClassExpr(Array.from(candidates))}`, 'g');\n }\n const searcher = new Searcher(null, regex);\n const ranges = [];\n let hasMore = false;\n let m;\n let ambiguousCharacterCount = 0;\n let invisibleCharacterCount = 0;\n let nonBasicAsciiCharacterCount = 0;\n forLoop: for (let lineNumber = startLine, lineCount = endLine; lineNumber <= lineCount; lineNumber++) {\n const lineContent = model.getLineContent(lineNumber);\n const lineLength = lineContent.length;\n // Reset regex to search from the beginning\n searcher.reset(0);\n do {\n m = searcher.next(lineContent);\n if (m) {\n let startIndex = m.index;\n let endIndex = m.index + m[0].length;\n // Extend range to entire code point\n if (startIndex > 0) {\n const charCodeBefore = lineContent.charCodeAt(startIndex - 1);\n if (strings.isHighSurrogate(charCodeBefore)) {\n startIndex--;\n }\n }\n if (endIndex + 1 < lineLength) {\n const charCodeBefore = lineContent.charCodeAt(endIndex - 1);\n if (strings.isHighSurrogate(charCodeBefore)) {\n endIndex++;\n }\n }\n const str = lineContent.substring(startIndex, endIndex);\n let word = getWordAtText(startIndex + 1, DEFAULT_WORD_REGEXP, lineContent, 0);\n if (word && word.endColumn <= startIndex + 1) {\n // The word does not include the problematic character, ignore the word\n word = null;\n }\n const highlightReason = codePointHighlighter.shouldHighlightNonBasicASCII(str, word ? word.word : null);\n if (highlightReason !== 0 /* SimpleHighlightReason.None */) {\n if (highlightReason === 3 /* SimpleHighlightReason.Ambiguous */) {\n ambiguousCharacterCount++;\n }\n else if (highlightReason === 2 /* SimpleHighlightReason.Invisible */) {\n invisibleCharacterCount++;\n }\n else if (highlightReason === 1 /* SimpleHighlightReason.NonBasicASCII */) {\n nonBasicAsciiCharacterCount++;\n }\n else {\n assertNever(highlightReason);\n }\n const MAX_RESULT_LENGTH = 1000;\n if (ranges.length >= MAX_RESULT_LENGTH) {\n hasMore = true;\n break forLoop;\n }\n ranges.push(new Range(lineNumber, startIndex + 1, lineNumber, endIndex + 1));\n }\n }\n } while (m);\n }\n return {\n ranges,\n hasMore,\n ambiguousCharacterCount,\n invisibleCharacterCount,\n nonBasicAsciiCharacterCount\n };\n }\n static computeUnicodeHighlightReason(char, options) {\n const codePointHighlighter = new CodePointHighlighter(options);\n const reason = codePointHighlighter.shouldHighlightNonBasicASCII(char, null);\n switch (reason) {\n case 0 /* SimpleHighlightReason.None */:\n return null;\n case 2 /* SimpleHighlightReason.Invisible */:\n return { kind: 1 /* UnicodeHighlighterReasonKind.Invisible */ };\n case 3 /* SimpleHighlightReason.Ambiguous */: {\n const codePoint = char.codePointAt(0);\n const primaryConfusable = codePointHighlighter.ambiguousCharacters.getPrimaryConfusable(codePoint);\n const notAmbiguousInLocales = strings.AmbiguousCharacters.getLocales().filter((l) => !strings.AmbiguousCharacters.getInstance(new Set([...options.allowedLocales, l])).isAmbiguous(codePoint));\n return { kind: 0 /* UnicodeHighlighterReasonKind.Ambiguous */, confusableWith: String.fromCodePoint(primaryConfusable), notAmbiguousInLocales };\n }\n case 1 /* SimpleHighlightReason.NonBasicASCII */:\n return { kind: 2 /* UnicodeHighlighterReasonKind.NonBasicAscii */ };\n }\n }\n}\nfunction buildRegExpCharClassExpr(codePoints, flags) {\n const src = `[${strings.escapeRegExpCharacters(codePoints.map((i) => String.fromCodePoint(i)).join(''))}]`;\n return src;\n}\nclass CodePointHighlighter {\n constructor(options) {\n this.options = options;\n this.allowedCodePoints = new Set(options.allowedCodePoints);\n this.ambiguousCharacters = strings.AmbiguousCharacters.getInstance(new Set(options.allowedLocales));\n }\n getCandidateCodePoints() {\n if (this.options.nonBasicASCII) {\n return 'allNonBasicAscii';\n }\n const set = new Set();\n if (this.options.invisibleCharacters) {\n for (const cp of strings.InvisibleCharacters.codePoints) {\n if (!isAllowedInvisibleCharacter(String.fromCodePoint(cp))) {\n set.add(cp);\n }\n }\n }\n if (this.options.ambiguousCharacters) {\n for (const cp of this.ambiguousCharacters.getConfusableCodePoints()) {\n set.add(cp);\n }\n }\n for (const cp of this.allowedCodePoints) {\n set.delete(cp);\n }\n return set;\n }\n shouldHighlightNonBasicASCII(character, wordContext) {\n const codePoint = character.codePointAt(0);\n if (this.allowedCodePoints.has(codePoint)) {\n return 0 /* SimpleHighlightReason.None */;\n }\n if (this.options.nonBasicASCII) {\n return 1 /* SimpleHighlightReason.NonBasicASCII */;\n }\n let hasBasicASCIICharacters = false;\n let hasNonConfusableNonBasicAsciiCharacter = false;\n if (wordContext) {\n for (const char of wordContext) {\n const codePoint = char.codePointAt(0);\n const isBasicASCII = strings.isBasicASCII(char);\n hasBasicASCIICharacters = hasBasicASCIICharacters || isBasicASCII;\n if (!isBasicASCII &&\n !this.ambiguousCharacters.isAmbiguous(codePoint) &&\n !strings.InvisibleCharacters.isInvisibleCharacter(codePoint)) {\n hasNonConfusableNonBasicAsciiCharacter = true;\n }\n }\n }\n if (\n /* Don't allow mixing weird looking characters with ASCII */ !hasBasicASCIICharacters &&\n /* Is there an obviously weird looking character? */ hasNonConfusableNonBasicAsciiCharacter) {\n return 0 /* SimpleHighlightReason.None */;\n }\n if (this.options.invisibleCharacters) {\n // TODO check for emojis\n if (!isAllowedInvisibleCharacter(character) && strings.InvisibleCharacters.isInvisibleCharacter(codePoint)) {\n return 2 /* SimpleHighlightReason.Invisible */;\n }\n }\n if (this.options.ambiguousCharacters) {\n if (this.ambiguousCharacters.isAmbiguous(codePoint)) {\n return 3 /* SimpleHighlightReason.Ambiguous */;\n }\n }\n return 0 /* SimpleHighlightReason.None */;\n }\n}\nfunction isAllowedInvisibleCharacter(character) {\n return character === ' ' || character === '\\n' || character === '\\t';\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\n// THIS IS A GENERATED FILE. DO NOT EDIT DIRECTLY.\nexport var AccessibilitySupport;\n(function (AccessibilitySupport) {\n /**\n * This should be the browser case where it is not known if a screen reader is attached or no.\n */\n AccessibilitySupport[AccessibilitySupport[\"Unknown\"] = 0] = \"Unknown\";\n AccessibilitySupport[AccessibilitySupport[\"Disabled\"] = 1] = \"Disabled\";\n AccessibilitySupport[AccessibilitySupport[\"Enabled\"] = 2] = \"Enabled\";\n})(AccessibilitySupport || (AccessibilitySupport = {}));\nexport var CodeActionTriggerType;\n(function (CodeActionTriggerType) {\n CodeActionTriggerType[CodeActionTriggerType[\"Invoke\"] = 1] = \"Invoke\";\n CodeActionTriggerType[CodeActionTriggerType[\"Auto\"] = 2] = \"Auto\";\n})(CodeActionTriggerType || (CodeActionTriggerType = {}));\nexport var CompletionItemInsertTextRule;\n(function (CompletionItemInsertTextRule) {\n CompletionItemInsertTextRule[CompletionItemInsertTextRule[\"None\"] = 0] = \"None\";\n /**\n * Adjust whitespace/indentation of multiline insert texts to\n * match the current line indentation.\n */\n CompletionItemInsertTextRule[CompletionItemInsertTextRule[\"KeepWhitespace\"] = 1] = \"KeepWhitespace\";\n /**\n * `insertText` is a snippet.\n */\n CompletionItemInsertTextRule[CompletionItemInsertTextRule[\"InsertAsSnippet\"] = 4] = \"InsertAsSnippet\";\n})(CompletionItemInsertTextRule || (CompletionItemInsertTextRule = {}));\nexport var CompletionItemKind;\n(function (CompletionItemKind) {\n CompletionItemKind[CompletionItemKind[\"Method\"] = 0] = \"Method\";\n CompletionItemKind[CompletionItemKind[\"Function\"] = 1] = \"Function\";\n CompletionItemKind[CompletionItemKind[\"Constructor\"] = 2] = \"Constructor\";\n CompletionItemKind[CompletionItemKind[\"Field\"] = 3] = \"Field\";\n CompletionItemKind[CompletionItemKind[\"Variable\"] = 4] = \"Variable\";\n CompletionItemKind[CompletionItemKind[\"Class\"] = 5] = \"Class\";\n CompletionItemKind[CompletionItemKind[\"Struct\"] = 6] = \"Struct\";\n CompletionItemKind[CompletionItemKind[\"Interface\"] = 7] = \"Interface\";\n CompletionItemKind[CompletionItemKind[\"Module\"] = 8] = \"Module\";\n CompletionItemKind[CompletionItemKind[\"Property\"] = 9] = \"Property\";\n CompletionItemKind[CompletionItemKind[\"Event\"] = 10] = \"Event\";\n CompletionItemKind[CompletionItemKind[\"Operator\"] = 11] = \"Operator\";\n CompletionItemKind[CompletionItemKind[\"Unit\"] = 12] = \"Unit\";\n CompletionItemKind[CompletionItemKind[\"Value\"] = 13] = \"Value\";\n CompletionItemKind[CompletionItemKind[\"Constant\"] = 14] = \"Constant\";\n CompletionItemKind[CompletionItemKind[\"Enum\"] = 15] = \"Enum\";\n CompletionItemKind[CompletionItemKind[\"EnumMember\"] = 16] = \"EnumMember\";\n CompletionItemKind[CompletionItemKind[\"Keyword\"] = 17] = \"Keyword\";\n CompletionItemKind[CompletionItemKind[\"Text\"] = 18] = \"Text\";\n CompletionItemKind[CompletionItemKind[\"Color\"] = 19] = \"Color\";\n CompletionItemKind[CompletionItemKind[\"File\"] = 20] = \"File\";\n CompletionItemKind[CompletionItemKind[\"Reference\"] = 21] = \"Reference\";\n CompletionItemKind[CompletionItemKind[\"Customcolor\"] = 22] = \"Customcolor\";\n CompletionItemKind[CompletionItemKind[\"Folder\"] = 23] = \"Folder\";\n CompletionItemKind[CompletionItemKind[\"TypeParameter\"] = 24] = \"TypeParameter\";\n CompletionItemKind[CompletionItemKind[\"User\"] = 25] = \"User\";\n CompletionItemKind[CompletionItemKind[\"Issue\"] = 26] = \"Issue\";\n CompletionItemKind[CompletionItemKind[\"Snippet\"] = 27] = \"Snippet\";\n})(CompletionItemKind || (CompletionItemKind = {}));\nexport var CompletionItemTag;\n(function (CompletionItemTag) {\n CompletionItemTag[CompletionItemTag[\"Deprecated\"] = 1] = \"Deprecated\";\n})(CompletionItemTag || (CompletionItemTag = {}));\n/**\n * How a suggest provider was triggered.\n */\nexport var CompletionTriggerKind;\n(function (CompletionTriggerKind) {\n CompletionTriggerKind[CompletionTriggerKind[\"Invoke\"] = 0] = \"Invoke\";\n CompletionTriggerKind[CompletionTriggerKind[\"TriggerCharacter\"] = 1] = \"TriggerCharacter\";\n CompletionTriggerKind[CompletionTriggerKind[\"TriggerForIncompleteCompletions\"] = 2] = \"TriggerForIncompleteCompletions\";\n})(CompletionTriggerKind || (CompletionTriggerKind = {}));\n/**\n * A positioning preference for rendering content widgets.\n */\nexport var ContentWidgetPositionPreference;\n(function (ContentWidgetPositionPreference) {\n /**\n * Place the content widget exactly at a position\n */\n ContentWidgetPositionPreference[ContentWidgetPositionPreference[\"EXACT\"] = 0] = \"EXACT\";\n /**\n * Place the content widget above a position\n */\n ContentWidgetPositionPreference[ContentWidgetPositionPreference[\"ABOVE\"] = 1] = \"ABOVE\";\n /**\n * Place the content widget below a position\n */\n ContentWidgetPositionPreference[ContentWidgetPositionPreference[\"BELOW\"] = 2] = \"BELOW\";\n})(ContentWidgetPositionPreference || (ContentWidgetPositionPreference = {}));\n/**\n * Describes the reason the cursor has changed its position.\n */\nexport var CursorChangeReason;\n(function (CursorChangeReason) {\n /**\n * Unknown or not set.\n */\n CursorChangeReason[CursorChangeReason[\"NotSet\"] = 0] = \"NotSet\";\n /**\n * A `model.setValue()` was called.\n */\n CursorChangeReason[CursorChangeReason[\"ContentFlush\"] = 1] = \"ContentFlush\";\n /**\n * The `model` has been changed outside of this cursor and the cursor recovers its position from associated markers.\n */\n CursorChangeReason[CursorChangeReason[\"RecoverFromMarkers\"] = 2] = \"RecoverFromMarkers\";\n /**\n * There was an explicit user gesture.\n */\n CursorChangeReason[CursorChangeReason[\"Explicit\"] = 3] = \"Explicit\";\n /**\n * There was a Paste.\n */\n CursorChangeReason[CursorChangeReason[\"Paste\"] = 4] = \"Paste\";\n /**\n * There was an Undo.\n */\n CursorChangeReason[CursorChangeReason[\"Undo\"] = 5] = \"Undo\";\n /**\n * There was a Redo.\n */\n CursorChangeReason[CursorChangeReason[\"Redo\"] = 6] = \"Redo\";\n})(CursorChangeReason || (CursorChangeReason = {}));\n/**\n * The default end of line to use when instantiating models.\n */\nexport var DefaultEndOfLine;\n(function (DefaultEndOfLine) {\n /**\n * Use line feed (\\n) as the end of line character.\n */\n DefaultEndOfLine[DefaultEndOfLine[\"LF\"] = 1] = \"LF\";\n /**\n * Use carriage return and line feed (\\r\\n) as the end of line character.\n */\n DefaultEndOfLine[DefaultEndOfLine[\"CRLF\"] = 2] = \"CRLF\";\n})(DefaultEndOfLine || (DefaultEndOfLine = {}));\n/**\n * A document highlight kind.\n */\nexport var DocumentHighlightKind;\n(function (DocumentHighlightKind) {\n /**\n * A textual occurrence.\n */\n DocumentHighlightKind[DocumentHighlightKind[\"Text\"] = 0] = \"Text\";\n /**\n * Read-access of a symbol, like reading a variable.\n */\n DocumentHighlightKind[DocumentHighlightKind[\"Read\"] = 1] = \"Read\";\n /**\n * Write-access of a symbol, like writing to a variable.\n */\n DocumentHighlightKind[DocumentHighlightKind[\"Write\"] = 2] = \"Write\";\n})(DocumentHighlightKind || (DocumentHighlightKind = {}));\n/**\n * Configuration options for auto indentation in the editor\n */\nexport var EditorAutoIndentStrategy;\n(function (EditorAutoIndentStrategy) {\n EditorAutoIndentStrategy[EditorAutoIndentStrategy[\"None\"] = 0] = \"None\";\n EditorAutoIndentStrategy[EditorAutoIndentStrategy[\"Keep\"] = 1] = \"Keep\";\n EditorAutoIndentStrategy[EditorAutoIndentStrategy[\"Brackets\"] = 2] = \"Brackets\";\n EditorAutoIndentStrategy[EditorAutoIndentStrategy[\"Advanced\"] = 3] = \"Advanced\";\n EditorAutoIndentStrategy[EditorAutoIndentStrategy[\"Full\"] = 4] = \"Full\";\n})(EditorAutoIndentStrategy || (EditorAutoIndentStrategy = {}));\nexport var EditorOption;\n(function (EditorOption) {\n EditorOption[EditorOption[\"acceptSuggestionOnCommitCharacter\"] = 0] = \"acceptSuggestionOnCommitCharacter\";\n EditorOption[EditorOption[\"acceptSuggestionOnEnter\"] = 1] = \"acceptSuggestionOnEnter\";\n EditorOption[EditorOption[\"accessibilitySupport\"] = 2] = \"accessibilitySupport\";\n EditorOption[EditorOption[\"accessibilityPageSize\"] = 3] = \"accessibilityPageSize\";\n EditorOption[EditorOption[\"ariaLabel\"] = 4] = \"ariaLabel\";\n EditorOption[EditorOption[\"ariaRequired\"] = 5] = \"ariaRequired\";\n EditorOption[EditorOption[\"autoClosingBrackets\"] = 6] = \"autoClosingBrackets\";\n EditorOption[EditorOption[\"autoClosingComments\"] = 7] = \"autoClosingComments\";\n EditorOption[EditorOption[\"screenReaderAnnounceInlineSuggestion\"] = 8] = \"screenReaderAnnounceInlineSuggestion\";\n EditorOption[EditorOption[\"autoClosingDelete\"] = 9] = \"autoClosingDelete\";\n EditorOption[EditorOption[\"autoClosingOvertype\"] = 10] = \"autoClosingOvertype\";\n EditorOption[EditorOption[\"autoClosingQuotes\"] = 11] = \"autoClosingQuotes\";\n EditorOption[EditorOption[\"autoIndent\"] = 12] = \"autoIndent\";\n EditorOption[EditorOption[\"automaticLayout\"] = 13] = \"automaticLayout\";\n EditorOption[EditorOption[\"autoSurround\"] = 14] = \"autoSurround\";\n EditorOption[EditorOption[\"bracketPairColorization\"] = 15] = \"bracketPairColorization\";\n EditorOption[EditorOption[\"guides\"] = 16] = \"guides\";\n EditorOption[EditorOption[\"codeLens\"] = 17] = \"codeLens\";\n EditorOption[EditorOption[\"codeLensFontFamily\"] = 18] = \"codeLensFontFamily\";\n EditorOption[EditorOption[\"codeLensFontSize\"] = 19] = \"codeLensFontSize\";\n EditorOption[EditorOption[\"colorDecorators\"] = 20] = \"colorDecorators\";\n EditorOption[EditorOption[\"colorDecoratorsLimit\"] = 21] = \"colorDecoratorsLimit\";\n EditorOption[EditorOption[\"columnSelection\"] = 22] = \"columnSelection\";\n EditorOption[EditorOption[\"comments\"] = 23] = \"comments\";\n EditorOption[EditorOption[\"contextmenu\"] = 24] = \"contextmenu\";\n EditorOption[EditorOption[\"copyWithSyntaxHighlighting\"] = 25] = \"copyWithSyntaxHighlighting\";\n EditorOption[EditorOption[\"cursorBlinking\"] = 26] = \"cursorBlinking\";\n EditorOption[EditorOption[\"cursorSmoothCaretAnimation\"] = 27] = \"cursorSmoothCaretAnimation\";\n EditorOption[EditorOption[\"cursorStyle\"] = 28] = \"cursorStyle\";\n EditorOption[EditorOption[\"cursorSurroundingLines\"] = 29] = \"cursorSurroundingLines\";\n EditorOption[EditorOption[\"cursorSurroundingLinesStyle\"] = 30] = \"cursorSurroundingLinesStyle\";\n EditorOption[EditorOption[\"cursorWidth\"] = 31] = \"cursorWidth\";\n EditorOption[EditorOption[\"disableLayerHinting\"] = 32] = \"disableLayerHinting\";\n EditorOption[EditorOption[\"disableMonospaceOptimizations\"] = 33] = \"disableMonospaceOptimizations\";\n EditorOption[EditorOption[\"domReadOnly\"] = 34] = \"domReadOnly\";\n EditorOption[EditorOption[\"dragAndDrop\"] = 35] = \"dragAndDrop\";\n EditorOption[EditorOption[\"dropIntoEditor\"] = 36] = \"dropIntoEditor\";\n EditorOption[EditorOption[\"emptySelectionClipboard\"] = 37] = \"emptySelectionClipboard\";\n EditorOption[EditorOption[\"experimentalWhitespaceRendering\"] = 38] = \"experimentalWhitespaceRendering\";\n EditorOption[EditorOption[\"extraEditorClassName\"] = 39] = \"extraEditorClassName\";\n EditorOption[EditorOption[\"fastScrollSensitivity\"] = 40] = \"fastScrollSensitivity\";\n EditorOption[EditorOption[\"find\"] = 41] = \"find\";\n EditorOption[EditorOption[\"fixedOverflowWidgets\"] = 42] = \"fixedOverflowWidgets\";\n EditorOption[EditorOption[\"folding\"] = 43] = \"folding\";\n EditorOption[EditorOption[\"foldingStrategy\"] = 44] = \"foldingStrategy\";\n EditorOption[EditorOption[\"foldingHighlight\"] = 45] = \"foldingHighlight\";\n EditorOption[EditorOption[\"foldingImportsByDefault\"] = 46] = \"foldingImportsByDefault\";\n EditorOption[EditorOption[\"foldingMaximumRegions\"] = 47] = \"foldingMaximumRegions\";\n EditorOption[EditorOption[\"unfoldOnClickAfterEndOfLine\"] = 48] = \"unfoldOnClickAfterEndOfLine\";\n EditorOption[EditorOption[\"fontFamily\"] = 49] = \"fontFamily\";\n EditorOption[EditorOption[\"fontInfo\"] = 50] = \"fontInfo\";\n EditorOption[EditorOption[\"fontLigatures\"] = 51] = \"fontLigatures\";\n EditorOption[EditorOption[\"fontSize\"] = 52] = \"fontSize\";\n EditorOption[EditorOption[\"fontWeight\"] = 53] = \"fontWeight\";\n EditorOption[EditorOption[\"fontVariations\"] = 54] = \"fontVariations\";\n EditorOption[EditorOption[\"formatOnPaste\"] = 55] = \"formatOnPaste\";\n EditorOption[EditorOption[\"formatOnType\"] = 56] = \"formatOnType\";\n EditorOption[EditorOption[\"glyphMargin\"] = 57] = \"glyphMargin\";\n EditorOption[EditorOption[\"gotoLocation\"] = 58] = \"gotoLocation\";\n EditorOption[EditorOption[\"hideCursorInOverviewRuler\"] = 59] = \"hideCursorInOverviewRuler\";\n EditorOption[EditorOption[\"hover\"] = 60] = \"hover\";\n EditorOption[EditorOption[\"inDiffEditor\"] = 61] = \"inDiffEditor\";\n EditorOption[EditorOption[\"inlineSuggest\"] = 62] = \"inlineSuggest\";\n EditorOption[EditorOption[\"letterSpacing\"] = 63] = \"letterSpacing\";\n EditorOption[EditorOption[\"lightbulb\"] = 64] = \"lightbulb\";\n EditorOption[EditorOption[\"lineDecorationsWidth\"] = 65] = \"lineDecorationsWidth\";\n EditorOption[EditorOption[\"lineHeight\"] = 66] = \"lineHeight\";\n EditorOption[EditorOption[\"lineNumbers\"] = 67] = \"lineNumbers\";\n EditorOption[EditorOption[\"lineNumbersMinChars\"] = 68] = \"lineNumbersMinChars\";\n EditorOption[EditorOption[\"linkedEditing\"] = 69] = \"linkedEditing\";\n EditorOption[EditorOption[\"links\"] = 70] = \"links\";\n EditorOption[EditorOption[\"matchBrackets\"] = 71] = \"matchBrackets\";\n EditorOption[EditorOption[\"minimap\"] = 72] = \"minimap\";\n EditorOption[EditorOption[\"mouseStyle\"] = 73] = \"mouseStyle\";\n EditorOption[EditorOption[\"mouseWheelScrollSensitivity\"] = 74] = \"mouseWheelScrollSensitivity\";\n EditorOption[EditorOption[\"mouseWheelZoom\"] = 75] = \"mouseWheelZoom\";\n EditorOption[EditorOption[\"multiCursorMergeOverlapping\"] = 76] = \"multiCursorMergeOverlapping\";\n EditorOption[EditorOption[\"multiCursorModifier\"] = 77] = \"multiCursorModifier\";\n EditorOption[EditorOption[\"multiCursorPaste\"] = 78] = \"multiCursorPaste\";\n EditorOption[EditorOption[\"multiCursorLimit\"] = 79] = \"multiCursorLimit\";\n EditorOption[EditorOption[\"occurrencesHighlight\"] = 80] = \"occurrencesHighlight\";\n EditorOption[EditorOption[\"overviewRulerBorder\"] = 81] = \"overviewRulerBorder\";\n EditorOption[EditorOption[\"overviewRulerLanes\"] = 82] = \"overviewRulerLanes\";\n EditorOption[EditorOption[\"padding\"] = 83] = \"padding\";\n EditorOption[EditorOption[\"pasteAs\"] = 84] = \"pasteAs\";\n EditorOption[EditorOption[\"parameterHints\"] = 85] = \"parameterHints\";\n EditorOption[EditorOption[\"peekWidgetDefaultFocus\"] = 86] = \"peekWidgetDefaultFocus\";\n EditorOption[EditorOption[\"definitionLinkOpensInPeek\"] = 87] = \"definitionLinkOpensInPeek\";\n EditorOption[EditorOption[\"quickSuggestions\"] = 88] = \"quickSuggestions\";\n EditorOption[EditorOption[\"quickSuggestionsDelay\"] = 89] = \"quickSuggestionsDelay\";\n EditorOption[EditorOption[\"readOnly\"] = 90] = \"readOnly\";\n EditorOption[EditorOption[\"readOnlyMessage\"] = 91] = \"readOnlyMessage\";\n EditorOption[EditorOption[\"renameOnType\"] = 92] = \"renameOnType\";\n EditorOption[EditorOption[\"renderControlCharacters\"] = 93] = \"renderControlCharacters\";\n EditorOption[EditorOption[\"renderFinalNewline\"] = 94] = \"renderFinalNewline\";\n EditorOption[EditorOption[\"renderLineHighlight\"] = 95] = \"renderLineHighlight\";\n EditorOption[EditorOption[\"renderLineHighlightOnlyWhenFocus\"] = 96] = \"renderLineHighlightOnlyWhenFocus\";\n EditorOption[EditorOption[\"renderValidationDecorations\"] = 97] = \"renderValidationDecorations\";\n EditorOption[EditorOption[\"renderWhitespace\"] = 98] = \"renderWhitespace\";\n EditorOption[EditorOption[\"revealHorizontalRightPadding\"] = 99] = \"revealHorizontalRightPadding\";\n EditorOption[EditorOption[\"roundedSelection\"] = 100] = \"roundedSelection\";\n EditorOption[EditorOption[\"rulers\"] = 101] = \"rulers\";\n EditorOption[EditorOption[\"scrollbar\"] = 102] = \"scrollbar\";\n EditorOption[EditorOption[\"scrollBeyondLastColumn\"] = 103] = \"scrollBeyondLastColumn\";\n EditorOption[EditorOption[\"scrollBeyondLastLine\"] = 104] = \"scrollBeyondLastLine\";\n EditorOption[EditorOption[\"scrollPredominantAxis\"] = 105] = \"scrollPredominantAxis\";\n EditorOption[EditorOption[\"selectionClipboard\"] = 106] = \"selectionClipboard\";\n EditorOption[EditorOption[\"selectionHighlight\"] = 107] = \"selectionHighlight\";\n EditorOption[EditorOption[\"selectOnLineNumbers\"] = 108] = \"selectOnLineNumbers\";\n EditorOption[EditorOption[\"showFoldingControls\"] = 109] = \"showFoldingControls\";\n EditorOption[EditorOption[\"showUnused\"] = 110] = \"showUnused\";\n EditorOption[EditorOption[\"snippetSuggestions\"] = 111] = \"snippetSuggestions\";\n EditorOption[EditorOption[\"smartSelect\"] = 112] = \"smartSelect\";\n EditorOption[EditorOption[\"smoothScrolling\"] = 113] = \"smoothScrolling\";\n EditorOption[EditorOption[\"stickyScroll\"] = 114] = \"stickyScroll\";\n EditorOption[EditorOption[\"stickyTabStops\"] = 115] = \"stickyTabStops\";\n EditorOption[EditorOption[\"stopRenderingLineAfter\"] = 116] = \"stopRenderingLineAfter\";\n EditorOption[EditorOption[\"suggest\"] = 117] = \"suggest\";\n EditorOption[EditorOption[\"suggestFontSize\"] = 118] = \"suggestFontSize\";\n EditorOption[EditorOption[\"suggestLineHeight\"] = 119] = \"suggestLineHeight\";\n EditorOption[EditorOption[\"suggestOnTriggerCharacters\"] = 120] = \"suggestOnTriggerCharacters\";\n EditorOption[EditorOption[\"suggestSelection\"] = 121] = \"suggestSelection\";\n EditorOption[EditorOption[\"tabCompletion\"] = 122] = \"tabCompletion\";\n EditorOption[EditorOption[\"tabIndex\"] = 123] = \"tabIndex\";\n EditorOption[EditorOption[\"unicodeHighlighting\"] = 124] = \"unicodeHighlighting\";\n EditorOption[EditorOption[\"unusualLineTerminators\"] = 125] = \"unusualLineTerminators\";\n EditorOption[EditorOption[\"useShadowDOM\"] = 126] = \"useShadowDOM\";\n EditorOption[EditorOption[\"useTabStops\"] = 127] = \"useTabStops\";\n EditorOption[EditorOption[\"wordBreak\"] = 128] = \"wordBreak\";\n EditorOption[EditorOption[\"wordSeparators\"] = 129] = \"wordSeparators\";\n EditorOption[EditorOption[\"wordWrap\"] = 130] = \"wordWrap\";\n EditorOption[EditorOption[\"wordWrapBreakAfterCharacters\"] = 131] = \"wordWrapBreakAfterCharacters\";\n EditorOption[EditorOption[\"wordWrapBreakBeforeCharacters\"] = 132] = \"wordWrapBreakBeforeCharacters\";\n EditorOption[EditorOption[\"wordWrapColumn\"] = 133] = \"wordWrapColumn\";\n EditorOption[EditorOption[\"wordWrapOverride1\"] = 134] = \"wordWrapOverride1\";\n EditorOption[EditorOption[\"wordWrapOverride2\"] = 135] = \"wordWrapOverride2\";\n EditorOption[EditorOption[\"wrappingIndent\"] = 136] = \"wrappingIndent\";\n EditorOption[EditorOption[\"wrappingStrategy\"] = 137] = \"wrappingStrategy\";\n EditorOption[EditorOption[\"showDeprecated\"] = 138] = \"showDeprecated\";\n EditorOption[EditorOption[\"inlayHints\"] = 139] = \"inlayHints\";\n EditorOption[EditorOption[\"editorClassName\"] = 140] = \"editorClassName\";\n EditorOption[EditorOption[\"pixelRatio\"] = 141] = \"pixelRatio\";\n EditorOption[EditorOption[\"tabFocusMode\"] = 142] = \"tabFocusMode\";\n EditorOption[EditorOption[\"layoutInfo\"] = 143] = \"layoutInfo\";\n EditorOption[EditorOption[\"wrappingInfo\"] = 144] = \"wrappingInfo\";\n EditorOption[EditorOption[\"defaultColorDecorators\"] = 145] = \"defaultColorDecorators\";\n EditorOption[EditorOption[\"colorDecoratorsActivatedOn\"] = 146] = \"colorDecoratorsActivatedOn\";\n EditorOption[EditorOption[\"inlineCompletionsAccessibilityVerbose\"] = 147] = \"inlineCompletionsAccessibilityVerbose\";\n})(EditorOption || (EditorOption = {}));\n/**\n * End of line character preference.\n */\nexport var EndOfLinePreference;\n(function (EndOfLinePreference) {\n /**\n * Use the end of line character identified in the text buffer.\n */\n EndOfLinePreference[EndOfLinePreference[\"TextDefined\"] = 0] = \"TextDefined\";\n /**\n * Use line feed (\\n) as the end of line character.\n */\n EndOfLinePreference[EndOfLinePreference[\"LF\"] = 1] = \"LF\";\n /**\n * Use carriage return and line feed (\\r\\n) as the end of line character.\n */\n EndOfLinePreference[EndOfLinePreference[\"CRLF\"] = 2] = \"CRLF\";\n})(EndOfLinePreference || (EndOfLinePreference = {}));\n/**\n * End of line character preference.\n */\nexport var EndOfLineSequence;\n(function (EndOfLineSequence) {\n /**\n * Use line feed (\\n) as the end of line character.\n */\n EndOfLineSequence[EndOfLineSequence[\"LF\"] = 0] = \"LF\";\n /**\n * Use carriage return and line feed (\\r\\n) as the end of line character.\n */\n EndOfLineSequence[EndOfLineSequence[\"CRLF\"] = 1] = \"CRLF\";\n})(EndOfLineSequence || (EndOfLineSequence = {}));\n/**\n * Vertical Lane in the glyph margin of the editor.\n */\nexport var GlyphMarginLane;\n(function (GlyphMarginLane) {\n GlyphMarginLane[GlyphMarginLane[\"Left\"] = 1] = \"Left\";\n GlyphMarginLane[GlyphMarginLane[\"Right\"] = 2] = \"Right\";\n})(GlyphMarginLane || (GlyphMarginLane = {}));\n/**\n * Describes what to do with the indentation when pressing Enter.\n */\nexport var IndentAction;\n(function (IndentAction) {\n /**\n * Insert new line and copy the previous line's indentation.\n */\n IndentAction[IndentAction[\"None\"] = 0] = \"None\";\n /**\n * Insert new line and indent once (relative to the previous line's indentation).\n */\n IndentAction[IndentAction[\"Indent\"] = 1] = \"Indent\";\n /**\n * Insert two new lines:\n * - the first one indented which will hold the cursor\n * - the second one at the same indentation level\n */\n IndentAction[IndentAction[\"IndentOutdent\"] = 2] = \"IndentOutdent\";\n /**\n * Insert new line and outdent once (relative to the previous line's indentation).\n */\n IndentAction[IndentAction[\"Outdent\"] = 3] = \"Outdent\";\n})(IndentAction || (IndentAction = {}));\nexport var InjectedTextCursorStops;\n(function (InjectedTextCursorStops) {\n InjectedTextCursorStops[InjectedTextCursorStops[\"Both\"] = 0] = \"Both\";\n InjectedTextCursorStops[InjectedTextCursorStops[\"Right\"] = 1] = \"Right\";\n InjectedTextCursorStops[InjectedTextCursorStops[\"Left\"] = 2] = \"Left\";\n InjectedTextCursorStops[InjectedTextCursorStops[\"None\"] = 3] = \"None\";\n})(InjectedTextCursorStops || (InjectedTextCursorStops = {}));\nexport var InlayHintKind;\n(function (InlayHintKind) {\n InlayHintKind[InlayHintKind[\"Type\"] = 1] = \"Type\";\n InlayHintKind[InlayHintKind[\"Parameter\"] = 2] = \"Parameter\";\n})(InlayHintKind || (InlayHintKind = {}));\n/**\n * How an {@link InlineCompletionsProvider inline completion provider} was triggered.\n */\nexport var InlineCompletionTriggerKind;\n(function (InlineCompletionTriggerKind) {\n /**\n * Completion was triggered automatically while editing.\n * It is sufficient to return a single completion item in this case.\n */\n InlineCompletionTriggerKind[InlineCompletionTriggerKind[\"Automatic\"] = 0] = \"Automatic\";\n /**\n * Completion was triggered explicitly by a user gesture.\n * Return multiple completion items to enable cycling through them.\n */\n InlineCompletionTriggerKind[InlineCompletionTriggerKind[\"Explicit\"] = 1] = \"Explicit\";\n})(InlineCompletionTriggerKind || (InlineCompletionTriggerKind = {}));\n/**\n * Virtual Key Codes, the value does not hold any inherent meaning.\n * Inspired somewhat from https://msdn.microsoft.com/en-us/library/windows/desktop/dd375731(v=vs.85).aspx\n * But these are \"more general\", as they should work across browsers & OS`s.\n */\nexport var KeyCode;\n(function (KeyCode) {\n KeyCode[KeyCode[\"DependsOnKbLayout\"] = -1] = \"DependsOnKbLayout\";\n /**\n * Placed first to cover the 0 value of the enum.\n */\n KeyCode[KeyCode[\"Unknown\"] = 0] = \"Unknown\";\n KeyCode[KeyCode[\"Backspace\"] = 1] = \"Backspace\";\n KeyCode[KeyCode[\"Tab\"] = 2] = \"Tab\";\n KeyCode[KeyCode[\"Enter\"] = 3] = \"Enter\";\n KeyCode[KeyCode[\"Shift\"] = 4] = \"Shift\";\n KeyCode[KeyCode[\"Ctrl\"] = 5] = \"Ctrl\";\n KeyCode[KeyCode[\"Alt\"] = 6] = \"Alt\";\n KeyCode[KeyCode[\"PauseBreak\"] = 7] = \"PauseBreak\";\n KeyCode[KeyCode[\"CapsLock\"] = 8] = \"CapsLock\";\n KeyCode[KeyCode[\"Escape\"] = 9] = \"Escape\";\n KeyCode[KeyCode[\"Space\"] = 10] = \"Space\";\n KeyCode[KeyCode[\"PageUp\"] = 11] = \"PageUp\";\n KeyCode[KeyCode[\"PageDown\"] = 12] = \"PageDown\";\n KeyCode[KeyCode[\"End\"] = 13] = \"End\";\n KeyCode[KeyCode[\"Home\"] = 14] = \"Home\";\n KeyCode[KeyCode[\"LeftArrow\"] = 15] = \"LeftArrow\";\n KeyCode[KeyCode[\"UpArrow\"] = 16] = \"UpArrow\";\n KeyCode[KeyCode[\"RightArrow\"] = 17] = \"RightArrow\";\n KeyCode[KeyCode[\"DownArrow\"] = 18] = \"DownArrow\";\n KeyCode[KeyCode[\"Insert\"] = 19] = \"Insert\";\n KeyCode[KeyCode[\"Delete\"] = 20] = \"Delete\";\n KeyCode[KeyCode[\"Digit0\"] = 21] = \"Digit0\";\n KeyCode[KeyCode[\"Digit1\"] = 22] = \"Digit1\";\n KeyCode[KeyCode[\"Digit2\"] = 23] = \"Digit2\";\n KeyCode[KeyCode[\"Digit3\"] = 24] = \"Digit3\";\n KeyCode[KeyCode[\"Digit4\"] = 25] = \"Digit4\";\n KeyCode[KeyCode[\"Digit5\"] = 26] = \"Digit5\";\n KeyCode[KeyCode[\"Digit6\"] = 27] = \"Digit6\";\n KeyCode[KeyCode[\"Digit7\"] = 28] = \"Digit7\";\n KeyCode[KeyCode[\"Digit8\"] = 29] = \"Digit8\";\n KeyCode[KeyCode[\"Digit9\"] = 30] = \"Digit9\";\n KeyCode[KeyCode[\"KeyA\"] = 31] = \"KeyA\";\n KeyCode[KeyCode[\"KeyB\"] = 32] = \"KeyB\";\n KeyCode[KeyCode[\"KeyC\"] = 33] = \"KeyC\";\n KeyCode[KeyCode[\"KeyD\"] = 34] = \"KeyD\";\n KeyCode[KeyCode[\"KeyE\"] = 35] = \"KeyE\";\n KeyCode[KeyCode[\"KeyF\"] = 36] = \"KeyF\";\n KeyCode[KeyCode[\"KeyG\"] = 37] = \"KeyG\";\n KeyCode[KeyCode[\"KeyH\"] = 38] = \"KeyH\";\n KeyCode[KeyCode[\"KeyI\"] = 39] = \"KeyI\";\n KeyCode[KeyCode[\"KeyJ\"] = 40] = \"KeyJ\";\n KeyCode[KeyCode[\"KeyK\"] = 41] = \"KeyK\";\n KeyCode[KeyCode[\"KeyL\"] = 42] = \"KeyL\";\n KeyCode[KeyCode[\"KeyM\"] = 43] = \"KeyM\";\n KeyCode[KeyCode[\"KeyN\"] = 44] = \"KeyN\";\n KeyCode[KeyCode[\"KeyO\"] = 45] = \"KeyO\";\n KeyCode[KeyCode[\"KeyP\"] = 46] = \"KeyP\";\n KeyCode[KeyCode[\"KeyQ\"] = 47] = \"KeyQ\";\n KeyCode[KeyCode[\"KeyR\"] = 48] = \"KeyR\";\n KeyCode[KeyCode[\"KeyS\"] = 49] = \"KeyS\";\n KeyCode[KeyCode[\"KeyT\"] = 50] = \"KeyT\";\n KeyCode[KeyCode[\"KeyU\"] = 51] = \"KeyU\";\n KeyCode[KeyCode[\"KeyV\"] = 52] = \"KeyV\";\n KeyCode[KeyCode[\"KeyW\"] = 53] = \"KeyW\";\n KeyCode[KeyCode[\"KeyX\"] = 54] = \"KeyX\";\n KeyCode[KeyCode[\"KeyY\"] = 55] = \"KeyY\";\n KeyCode[KeyCode[\"KeyZ\"] = 56] = \"KeyZ\";\n KeyCode[KeyCode[\"Meta\"] = 57] = \"Meta\";\n KeyCode[KeyCode[\"ContextMenu\"] = 58] = \"ContextMenu\";\n KeyCode[KeyCode[\"F1\"] = 59] = \"F1\";\n KeyCode[KeyCode[\"F2\"] = 60] = \"F2\";\n KeyCode[KeyCode[\"F3\"] = 61] = \"F3\";\n KeyCode[KeyCode[\"F4\"] = 62] = \"F4\";\n KeyCode[KeyCode[\"F5\"] = 63] = \"F5\";\n KeyCode[KeyCode[\"F6\"] = 64] = \"F6\";\n KeyCode[KeyCode[\"F7\"] = 65] = \"F7\";\n KeyCode[KeyCode[\"F8\"] = 66] = \"F8\";\n KeyCode[KeyCode[\"F9\"] = 67] = \"F9\";\n KeyCode[KeyCode[\"F10\"] = 68] = \"F10\";\n KeyCode[KeyCode[\"F11\"] = 69] = \"F11\";\n KeyCode[KeyCode[\"F12\"] = 70] = \"F12\";\n KeyCode[KeyCode[\"F13\"] = 71] = \"F13\";\n KeyCode[KeyCode[\"F14\"] = 72] = \"F14\";\n KeyCode[KeyCode[\"F15\"] = 73] = \"F15\";\n KeyCode[KeyCode[\"F16\"] = 74] = \"F16\";\n KeyCode[KeyCode[\"F17\"] = 75] = \"F17\";\n KeyCode[KeyCode[\"F18\"] = 76] = \"F18\";\n KeyCode[KeyCode[\"F19\"] = 77] = \"F19\";\n KeyCode[KeyCode[\"F20\"] = 78] = \"F20\";\n KeyCode[KeyCode[\"F21\"] = 79] = \"F21\";\n KeyCode[KeyCode[\"F22\"] = 80] = \"F22\";\n KeyCode[KeyCode[\"F23\"] = 81] = \"F23\";\n KeyCode[KeyCode[\"F24\"] = 82] = \"F24\";\n KeyCode[KeyCode[\"NumLock\"] = 83] = \"NumLock\";\n KeyCode[KeyCode[\"ScrollLock\"] = 84] = \"ScrollLock\";\n /**\n * Used for miscellaneous characters; it can vary by keyboard.\n * For the US standard keyboard, the ';:' key\n */\n KeyCode[KeyCode[\"Semicolon\"] = 85] = \"Semicolon\";\n /**\n * For any country/region, the '+' key\n * For the US standard keyboard, the '=+' key\n */\n KeyCode[KeyCode[\"Equal\"] = 86] = \"Equal\";\n /**\n * For any country/region, the ',' key\n * For the US standard keyboard, the ',<' key\n */\n KeyCode[KeyCode[\"Comma\"] = 87] = \"Comma\";\n /**\n * For any country/region, the '-' key\n * For the US standard keyboard, the '-_' key\n */\n KeyCode[KeyCode[\"Minus\"] = 88] = \"Minus\";\n /**\n * For any country/region, the '.' key\n * For the US standard keyboard, the '.>' key\n */\n KeyCode[KeyCode[\"Period\"] = 89] = \"Period\";\n /**\n * Used for miscellaneous characters; it can vary by keyboard.\n * For the US standard keyboard, the '/?' key\n */\n KeyCode[KeyCode[\"Slash\"] = 90] = \"Slash\";\n /**\n * Used for miscellaneous characters; it can vary by keyboard.\n * For the US standard keyboard, the '`~' key\n */\n KeyCode[KeyCode[\"Backquote\"] = 91] = \"Backquote\";\n /**\n * Used for miscellaneous characters; it can vary by keyboard.\n * For the US standard keyboard, the '[{' key\n */\n KeyCode[KeyCode[\"BracketLeft\"] = 92] = \"BracketLeft\";\n /**\n * Used for miscellaneous characters; it can vary by keyboard.\n * For the US standard keyboard, the '\\|' key\n */\n KeyCode[KeyCode[\"Backslash\"] = 93] = \"Backslash\";\n /**\n * Used for miscellaneous characters; it can vary by keyboard.\n * For the US standard keyboard, the ']}' key\n */\n KeyCode[KeyCode[\"BracketRight\"] = 94] = \"BracketRight\";\n /**\n * Used for miscellaneous characters; it can vary by keyboard.\n * For the US standard keyboard, the ''\"' key\n */\n KeyCode[KeyCode[\"Quote\"] = 95] = \"Quote\";\n /**\n * Used for miscellaneous characters; it can vary by keyboard.\n */\n KeyCode[KeyCode[\"OEM_8\"] = 96] = \"OEM_8\";\n /**\n * Either the angle bracket key or the backslash key on the RT 102-key keyboard.\n */\n KeyCode[KeyCode[\"IntlBackslash\"] = 97] = \"IntlBackslash\";\n KeyCode[KeyCode[\"Numpad0\"] = 98] = \"Numpad0\";\n KeyCode[KeyCode[\"Numpad1\"] = 99] = \"Numpad1\";\n KeyCode[KeyCode[\"Numpad2\"] = 100] = \"Numpad2\";\n KeyCode[KeyCode[\"Numpad3\"] = 101] = \"Numpad3\";\n KeyCode[KeyCode[\"Numpad4\"] = 102] = \"Numpad4\";\n KeyCode[KeyCode[\"Numpad5\"] = 103] = \"Numpad5\";\n KeyCode[KeyCode[\"Numpad6\"] = 104] = \"Numpad6\";\n KeyCode[KeyCode[\"Numpad7\"] = 105] = \"Numpad7\";\n KeyCode[KeyCode[\"Numpad8\"] = 106] = \"Numpad8\";\n KeyCode[KeyCode[\"Numpad9\"] = 107] = \"Numpad9\";\n KeyCode[KeyCode[\"NumpadMultiply\"] = 108] = \"NumpadMultiply\";\n KeyCode[KeyCode[\"NumpadAdd\"] = 109] = \"NumpadAdd\";\n KeyCode[KeyCode[\"NUMPAD_SEPARATOR\"] = 110] = \"NUMPAD_SEPARATOR\";\n KeyCode[KeyCode[\"NumpadSubtract\"] = 111] = \"NumpadSubtract\";\n KeyCode[KeyCode[\"NumpadDecimal\"] = 112] = \"NumpadDecimal\";\n KeyCode[KeyCode[\"NumpadDivide\"] = 113] = \"NumpadDivide\";\n /**\n * Cover all key codes when IME is processing input.\n */\n KeyCode[KeyCode[\"KEY_IN_COMPOSITION\"] = 114] = \"KEY_IN_COMPOSITION\";\n KeyCode[KeyCode[\"ABNT_C1\"] = 115] = \"ABNT_C1\";\n KeyCode[KeyCode[\"ABNT_C2\"] = 116] = \"ABNT_C2\";\n KeyCode[KeyCode[\"AudioVolumeMute\"] = 117] = \"AudioVolumeMute\";\n KeyCode[KeyCode[\"AudioVolumeUp\"] = 118] = \"AudioVolumeUp\";\n KeyCode[KeyCode[\"AudioVolumeDown\"] = 119] = \"AudioVolumeDown\";\n KeyCode[KeyCode[\"BrowserSearch\"] = 120] = \"BrowserSearch\";\n KeyCode[KeyCode[\"BrowserHome\"] = 121] = \"BrowserHome\";\n KeyCode[KeyCode[\"BrowserBack\"] = 122] = \"BrowserBack\";\n KeyCode[KeyCode[\"BrowserForward\"] = 123] = \"BrowserForward\";\n KeyCode[KeyCode[\"MediaTrackNext\"] = 124] = \"MediaTrackNext\";\n KeyCode[KeyCode[\"MediaTrackPrevious\"] = 125] = \"MediaTrackPrevious\";\n KeyCode[KeyCode[\"MediaStop\"] = 126] = \"MediaStop\";\n KeyCode[KeyCode[\"MediaPlayPause\"] = 127] = \"MediaPlayPause\";\n KeyCode[KeyCode[\"LaunchMediaPlayer\"] = 128] = \"LaunchMediaPlayer\";\n KeyCode[KeyCode[\"LaunchMail\"] = 129] = \"LaunchMail\";\n KeyCode[KeyCode[\"LaunchApp2\"] = 130] = \"LaunchApp2\";\n /**\n * VK_CLEAR, 0x0C, CLEAR key\n */\n KeyCode[KeyCode[\"Clear\"] = 131] = \"Clear\";\n /**\n * Placed last to cover the length of the enum.\n * Please do not depend on this value!\n */\n KeyCode[KeyCode[\"MAX_VALUE\"] = 132] = \"MAX_VALUE\";\n})(KeyCode || (KeyCode = {}));\nexport var MarkerSeverity;\n(function (MarkerSeverity) {\n MarkerSeverity[MarkerSeverity[\"Hint\"] = 1] = \"Hint\";\n MarkerSeverity[MarkerSeverity[\"Info\"] = 2] = \"Info\";\n MarkerSeverity[MarkerSeverity[\"Warning\"] = 4] = \"Warning\";\n MarkerSeverity[MarkerSeverity[\"Error\"] = 8] = \"Error\";\n})(MarkerSeverity || (MarkerSeverity = {}));\nexport var MarkerTag;\n(function (MarkerTag) {\n MarkerTag[MarkerTag[\"Unnecessary\"] = 1] = \"Unnecessary\";\n MarkerTag[MarkerTag[\"Deprecated\"] = 2] = \"Deprecated\";\n})(MarkerTag || (MarkerTag = {}));\n/**\n * Position in the minimap to render the decoration.\n */\nexport var MinimapPosition;\n(function (MinimapPosition) {\n MinimapPosition[MinimapPosition[\"Inline\"] = 1] = \"Inline\";\n MinimapPosition[MinimapPosition[\"Gutter\"] = 2] = \"Gutter\";\n})(MinimapPosition || (MinimapPosition = {}));\n/**\n * Type of hit element with the mouse in the editor.\n */\nexport var MouseTargetType;\n(function (MouseTargetType) {\n /**\n * Mouse is on top of an unknown element.\n */\n MouseTargetType[MouseTargetType[\"UNKNOWN\"] = 0] = \"UNKNOWN\";\n /**\n * Mouse is on top of the textarea used for input.\n */\n MouseTargetType[MouseTargetType[\"TEXTAREA\"] = 1] = \"TEXTAREA\";\n /**\n * Mouse is on top of the glyph margin\n */\n MouseTargetType[MouseTargetType[\"GUTTER_GLYPH_MARGIN\"] = 2] = \"GUTTER_GLYPH_MARGIN\";\n /**\n * Mouse is on top of the line numbers\n */\n MouseTargetType[MouseTargetType[\"GUTTER_LINE_NUMBERS\"] = 3] = \"GUTTER_LINE_NUMBERS\";\n /**\n * Mouse is on top of the line decorations\n */\n MouseTargetType[MouseTargetType[\"GUTTER_LINE_DECORATIONS\"] = 4] = \"GUTTER_LINE_DECORATIONS\";\n /**\n * Mouse is on top of the whitespace left in the gutter by a view zone.\n */\n MouseTargetType[MouseTargetType[\"GUTTER_VIEW_ZONE\"] = 5] = \"GUTTER_VIEW_ZONE\";\n /**\n * Mouse is on top of text in the content.\n */\n MouseTargetType[MouseTargetType[\"CONTENT_TEXT\"] = 6] = \"CONTENT_TEXT\";\n /**\n * Mouse is on top of empty space in the content (e.g. after line text or below last line)\n */\n MouseTargetType[MouseTargetType[\"CONTENT_EMPTY\"] = 7] = \"CONTENT_EMPTY\";\n /**\n * Mouse is on top of a view zone in the content.\n */\n MouseTargetType[MouseTargetType[\"CONTENT_VIEW_ZONE\"] = 8] = \"CONTENT_VIEW_ZONE\";\n /**\n * Mouse is on top of a content widget.\n */\n MouseTargetType[MouseTargetType[\"CONTENT_WIDGET\"] = 9] = \"CONTENT_WIDGET\";\n /**\n * Mouse is on top of the decorations overview ruler.\n */\n MouseTargetType[MouseTargetType[\"OVERVIEW_RULER\"] = 10] = \"OVERVIEW_RULER\";\n /**\n * Mouse is on top of a scrollbar.\n */\n MouseTargetType[MouseTargetType[\"SCROLLBAR\"] = 11] = \"SCROLLBAR\";\n /**\n * Mouse is on top of an overlay widget.\n */\n MouseTargetType[MouseTargetType[\"OVERLAY_WIDGET\"] = 12] = \"OVERLAY_WIDGET\";\n /**\n * Mouse is outside of the editor.\n */\n MouseTargetType[MouseTargetType[\"OUTSIDE_EDITOR\"] = 13] = \"OUTSIDE_EDITOR\";\n})(MouseTargetType || (MouseTargetType = {}));\n/**\n * A positioning preference for rendering overlay widgets.\n */\nexport var OverlayWidgetPositionPreference;\n(function (OverlayWidgetPositionPreference) {\n /**\n * Position the overlay widget in the top right corner\n */\n OverlayWidgetPositionPreference[OverlayWidgetPositionPreference[\"TOP_RIGHT_CORNER\"] = 0] = \"TOP_RIGHT_CORNER\";\n /**\n * Position the overlay widget in the bottom right corner\n */\n OverlayWidgetPositionPreference[OverlayWidgetPositionPreference[\"BOTTOM_RIGHT_CORNER\"] = 1] = \"BOTTOM_RIGHT_CORNER\";\n /**\n * Position the overlay widget in the top center\n */\n OverlayWidgetPositionPreference[OverlayWidgetPositionPreference[\"TOP_CENTER\"] = 2] = \"TOP_CENTER\";\n})(OverlayWidgetPositionPreference || (OverlayWidgetPositionPreference = {}));\n/**\n * Vertical Lane in the overview ruler of the editor.\n */\nexport var OverviewRulerLane;\n(function (OverviewRulerLane) {\n OverviewRulerLane[OverviewRulerLane[\"Left\"] = 1] = \"Left\";\n OverviewRulerLane[OverviewRulerLane[\"Center\"] = 2] = \"Center\";\n OverviewRulerLane[OverviewRulerLane[\"Right\"] = 4] = \"Right\";\n OverviewRulerLane[OverviewRulerLane[\"Full\"] = 7] = \"Full\";\n})(OverviewRulerLane || (OverviewRulerLane = {}));\nexport var PositionAffinity;\n(function (PositionAffinity) {\n /**\n * Prefers the left most position.\n */\n PositionAffinity[PositionAffinity[\"Left\"] = 0] = \"Left\";\n /**\n * Prefers the right most position.\n */\n PositionAffinity[PositionAffinity[\"Right\"] = 1] = \"Right\";\n /**\n * No preference.\n */\n PositionAffinity[PositionAffinity[\"None\"] = 2] = \"None\";\n /**\n * If the given position is on injected text, prefers the position left of it.\n */\n PositionAffinity[PositionAffinity[\"LeftOfInjectedText\"] = 3] = \"LeftOfInjectedText\";\n /**\n * If the given position is on injected text, prefers the position right of it.\n */\n PositionAffinity[PositionAffinity[\"RightOfInjectedText\"] = 4] = \"RightOfInjectedText\";\n})(PositionAffinity || (PositionAffinity = {}));\nexport var RenderLineNumbersType;\n(function (RenderLineNumbersType) {\n RenderLineNumbersType[RenderLineNumbersType[\"Off\"] = 0] = \"Off\";\n RenderLineNumbersType[RenderLineNumbersType[\"On\"] = 1] = \"On\";\n RenderLineNumbersType[RenderLineNumbersType[\"Relative\"] = 2] = \"Relative\";\n RenderLineNumbersType[RenderLineNumbersType[\"Interval\"] = 3] = \"Interval\";\n RenderLineNumbersType[RenderLineNumbersType[\"Custom\"] = 4] = \"Custom\";\n})(RenderLineNumbersType || (RenderLineNumbersType = {}));\nexport var RenderMinimap;\n(function (RenderMinimap) {\n RenderMinimap[RenderMinimap[\"None\"] = 0] = \"None\";\n RenderMinimap[RenderMinimap[\"Text\"] = 1] = \"Text\";\n RenderMinimap[RenderMinimap[\"Blocks\"] = 2] = \"Blocks\";\n})(RenderMinimap || (RenderMinimap = {}));\nexport var ScrollType;\n(function (ScrollType) {\n ScrollType[ScrollType[\"Smooth\"] = 0] = \"Smooth\";\n ScrollType[ScrollType[\"Immediate\"] = 1] = \"Immediate\";\n})(ScrollType || (ScrollType = {}));\nexport var ScrollbarVisibility;\n(function (ScrollbarVisibility) {\n ScrollbarVisibility[ScrollbarVisibility[\"Auto\"] = 1] = \"Auto\";\n ScrollbarVisibility[ScrollbarVisibility[\"Hidden\"] = 2] = \"Hidden\";\n ScrollbarVisibility[ScrollbarVisibility[\"Visible\"] = 3] = \"Visible\";\n})(ScrollbarVisibility || (ScrollbarVisibility = {}));\n/**\n * The direction of a selection.\n */\nexport var SelectionDirection;\n(function (SelectionDirection) {\n /**\n * The selection starts above where it ends.\n */\n SelectionDirection[SelectionDirection[\"LTR\"] = 0] = \"LTR\";\n /**\n * The selection starts below where it ends.\n */\n SelectionDirection[SelectionDirection[\"RTL\"] = 1] = \"RTL\";\n})(SelectionDirection || (SelectionDirection = {}));\nexport var ShowAiIconMode;\n(function (ShowAiIconMode) {\n ShowAiIconMode[\"Off\"] = \"off\";\n ShowAiIconMode[\"OnCode\"] = \"onCode\";\n ShowAiIconMode[\"On\"] = \"on\";\n})(ShowAiIconMode || (ShowAiIconMode = {}));\nexport var SignatureHelpTriggerKind;\n(function (SignatureHelpTriggerKind) {\n SignatureHelpTriggerKind[SignatureHelpTriggerKind[\"Invoke\"] = 1] = \"Invoke\";\n SignatureHelpTriggerKind[SignatureHelpTriggerKind[\"TriggerCharacter\"] = 2] = \"TriggerCharacter\";\n SignatureHelpTriggerKind[SignatureHelpTriggerKind[\"ContentChange\"] = 3] = \"ContentChange\";\n})(SignatureHelpTriggerKind || (SignatureHelpTriggerKind = {}));\n/**\n * A symbol kind.\n */\nexport var SymbolKind;\n(function (SymbolKind) {\n SymbolKind[SymbolKind[\"File\"] = 0] = \"File\";\n SymbolKind[SymbolKind[\"Module\"] = 1] = \"Module\";\n SymbolKind[SymbolKind[\"Namespace\"] = 2] = \"Namespace\";\n SymbolKind[SymbolKind[\"Package\"] = 3] = \"Package\";\n SymbolKind[SymbolKind[\"Class\"] = 4] = \"Class\";\n SymbolKind[SymbolKind[\"Method\"] = 5] = \"Method\";\n SymbolKind[SymbolKind[\"Property\"] = 6] = \"Property\";\n SymbolKind[SymbolKind[\"Field\"] = 7] = \"Field\";\n SymbolKind[SymbolKind[\"Constructor\"] = 8] = \"Constructor\";\n SymbolKind[SymbolKind[\"Enum\"] = 9] = \"Enum\";\n SymbolKind[SymbolKind[\"Interface\"] = 10] = \"Interface\";\n SymbolKind[SymbolKind[\"Function\"] = 11] = \"Function\";\n SymbolKind[SymbolKind[\"Variable\"] = 12] = \"Variable\";\n SymbolKind[SymbolKind[\"Constant\"] = 13] = \"Constant\";\n SymbolKind[SymbolKind[\"String\"] = 14] = \"String\";\n SymbolKind[SymbolKind[\"Number\"] = 15] = \"Number\";\n SymbolKind[SymbolKind[\"Boolean\"] = 16] = \"Boolean\";\n SymbolKind[SymbolKind[\"Array\"] = 17] = \"Array\";\n SymbolKind[SymbolKind[\"Object\"] = 18] = \"Object\";\n SymbolKind[SymbolKind[\"Key\"] = 19] = \"Key\";\n SymbolKind[SymbolKind[\"Null\"] = 20] = \"Null\";\n SymbolKind[SymbolKind[\"EnumMember\"] = 21] = \"EnumMember\";\n SymbolKind[SymbolKind[\"Struct\"] = 22] = \"Struct\";\n SymbolKind[SymbolKind[\"Event\"] = 23] = \"Event\";\n SymbolKind[SymbolKind[\"Operator\"] = 24] = \"Operator\";\n SymbolKind[SymbolKind[\"TypeParameter\"] = 25] = \"TypeParameter\";\n})(SymbolKind || (SymbolKind = {}));\nexport var SymbolTag;\n(function (SymbolTag) {\n SymbolTag[SymbolTag[\"Deprecated\"] = 1] = \"Deprecated\";\n})(SymbolTag || (SymbolTag = {}));\n/**\n * The kind of animation in which the editor's cursor should be rendered.\n */\nexport var TextEditorCursorBlinkingStyle;\n(function (TextEditorCursorBlinkingStyle) {\n /**\n * Hidden\n */\n TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle[\"Hidden\"] = 0] = \"Hidden\";\n /**\n * Blinking\n */\n TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle[\"Blink\"] = 1] = \"Blink\";\n /**\n * Blinking with smooth fading\n */\n TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle[\"Smooth\"] = 2] = \"Smooth\";\n /**\n * Blinking with prolonged filled state and smooth fading\n */\n TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle[\"Phase\"] = 3] = \"Phase\";\n /**\n * Expand collapse animation on the y axis\n */\n TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle[\"Expand\"] = 4] = \"Expand\";\n /**\n * No-Blinking\n */\n TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle[\"Solid\"] = 5] = \"Solid\";\n})(TextEditorCursorBlinkingStyle || (TextEditorCursorBlinkingStyle = {}));\n/**\n * The style in which the editor's cursor should be rendered.\n */\nexport var TextEditorCursorStyle;\n(function (TextEditorCursorStyle) {\n /**\n * As a vertical line (sitting between two characters).\n */\n TextEditorCursorStyle[TextEditorCursorStyle[\"Line\"] = 1] = \"Line\";\n /**\n * As a block (sitting on top of a character).\n */\n TextEditorCursorStyle[TextEditorCursorStyle[\"Block\"] = 2] = \"Block\";\n /**\n * As a horizontal line (sitting under a character).\n */\n TextEditorCursorStyle[TextEditorCursorStyle[\"Underline\"] = 3] = \"Underline\";\n /**\n * As a thin vertical line (sitting between two characters).\n */\n TextEditorCursorStyle[TextEditorCursorStyle[\"LineThin\"] = 4] = \"LineThin\";\n /**\n * As an outlined block (sitting on top of a character).\n */\n TextEditorCursorStyle[TextEditorCursorStyle[\"BlockOutline\"] = 5] = \"BlockOutline\";\n /**\n * As a thin horizontal line (sitting under a character).\n */\n TextEditorCursorStyle[TextEditorCursorStyle[\"UnderlineThin\"] = 6] = \"UnderlineThin\";\n})(TextEditorCursorStyle || (TextEditorCursorStyle = {}));\n/**\n * Describes the behavior of decorations when typing/editing near their edges.\n * Note: Please do not edit the values, as they very carefully match `DecorationRangeBehavior`\n */\nexport var TrackedRangeStickiness;\n(function (TrackedRangeStickiness) {\n TrackedRangeStickiness[TrackedRangeStickiness[\"AlwaysGrowsWhenTypingAtEdges\"] = 0] = \"AlwaysGrowsWhenTypingAtEdges\";\n TrackedRangeStickiness[TrackedRangeStickiness[\"NeverGrowsWhenTypingAtEdges\"] = 1] = \"NeverGrowsWhenTypingAtEdges\";\n TrackedRangeStickiness[TrackedRangeStickiness[\"GrowsOnlyWhenTypingBefore\"] = 2] = \"GrowsOnlyWhenTypingBefore\";\n TrackedRangeStickiness[TrackedRangeStickiness[\"GrowsOnlyWhenTypingAfter\"] = 3] = \"GrowsOnlyWhenTypingAfter\";\n})(TrackedRangeStickiness || (TrackedRangeStickiness = {}));\n/**\n * Describes how to indent wrapped lines.\n */\nexport var WrappingIndent;\n(function (WrappingIndent) {\n /**\n * No indentation => wrapped lines begin at column 1.\n */\n WrappingIndent[WrappingIndent[\"None\"] = 0] = \"None\";\n /**\n * Same => wrapped lines get the same indentation as the parent.\n */\n WrappingIndent[WrappingIndent[\"Same\"] = 1] = \"Same\";\n /**\n * Indent => wrapped lines get +1 indentation toward the parent.\n */\n WrappingIndent[WrappingIndent[\"Indent\"] = 2] = \"Indent\";\n /**\n * DeepIndent => wrapped lines get +2 indentation toward the parent.\n */\n WrappingIndent[WrappingIndent[\"DeepIndent\"] = 3] = \"DeepIndent\";\n})(WrappingIndent || (WrappingIndent = {}));\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { Emitter } from '../../base/common/event.js';\nimport { Disposable, toDisposable } from '../../base/common/lifecycle.js';\nexport class TokenizationRegistry {\n constructor() {\n this._tokenizationSupports = new Map();\n this._factories = new Map();\n this._onDidChange = new Emitter();\n this.onDidChange = this._onDidChange.event;\n this._colorMap = null;\n }\n handleChange(languageIds) {\n this._onDidChange.fire({\n changedLanguages: languageIds,\n changedColorMap: false\n });\n }\n register(languageId, support) {\n this._tokenizationSupports.set(languageId, support);\n this.handleChange([languageId]);\n return toDisposable(() => {\n if (this._tokenizationSupports.get(languageId) !== support) {\n return;\n }\n this._tokenizationSupports.delete(languageId);\n this.handleChange([languageId]);\n });\n }\n get(languageId) {\n return this._tokenizationSupports.get(languageId) || null;\n }\n registerFactory(languageId, factory) {\n var _a;\n (_a = this._factories.get(languageId)) === null || _a === void 0 ? void 0 : _a.dispose();\n const myData = new TokenizationSupportFactoryData(this, languageId, factory);\n this._factories.set(languageId, myData);\n return toDisposable(() => {\n const v = this._factories.get(languageId);\n if (!v || v !== myData) {\n return;\n }\n this._factories.delete(languageId);\n v.dispose();\n });\n }\n async getOrCreate(languageId) {\n // check first if the support is already set\n const tokenizationSupport = this.get(languageId);\n if (tokenizationSupport) {\n return tokenizationSupport;\n }\n const factory = this._factories.get(languageId);\n if (!factory || factory.isResolved) {\n // no factory or factory.resolve already finished\n return null;\n }\n await factory.resolve();\n return this.get(languageId);\n }\n isResolved(languageId) {\n const tokenizationSupport = this.get(languageId);\n if (tokenizationSupport) {\n return true;\n }\n const factory = this._factories.get(languageId);\n if (!factory || factory.isResolved) {\n return true;\n }\n return false;\n }\n setColorMap(colorMap) {\n this._colorMap = colorMap;\n this._onDidChange.fire({\n changedLanguages: Array.from(this._tokenizationSupports.keys()),\n changedColorMap: true\n });\n }\n getColorMap() {\n return this._colorMap;\n }\n getDefaultBackground() {\n if (this._colorMap && this._colorMap.length > 2 /* ColorId.DefaultBackground */) {\n return this._colorMap[2 /* ColorId.DefaultBackground */];\n }\n return null;\n }\n}\nclass TokenizationSupportFactoryData extends Disposable {\n get isResolved() {\n return this._isResolved;\n }\n constructor(_registry, _languageId, _factory) {\n super();\n this._registry = _registry;\n this._languageId = _languageId;\n this._factory = _factory;\n this._isDisposed = false;\n this._resolvePromise = null;\n this._isResolved = false;\n }\n dispose() {\n this._isDisposed = true;\n super.dispose();\n }\n async resolve() {\n if (!this._resolvePromise) {\n this._resolvePromise = this._create();\n }\n return this._resolvePromise;\n }\n async _create() {\n const value = await this._factory.tokenizationSupport;\n this._isResolved = true;\n if (value && !this._isDisposed) {\n this._register(this._registry.register(this._languageId, value));\n }\n }\n}\n","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nlet isPseudo = (typeof document !== 'undefined' && document.location && document.location.hash.indexOf('pseudo=true') >= 0);\nconst DEFAULT_TAG = 'i-default';\nfunction _format(message, args) {\n let result;\n if (args.length === 0) {\n result = message;\n }\n else {\n result = message.replace(/\\{(\\d+)\\}/g, (match, rest) => {\n const index = rest[0];\n const arg = args[index];\n let result = match;\n if (typeof arg === 'string') {\n result = arg;\n }\n else if (typeof arg === 'number' || typeof arg === 'boolean' || arg === void 0 || arg === null) {\n result = String(arg);\n }\n return result;\n });\n }\n if (isPseudo) {\n // FF3B and FF3D is the Unicode zenkaku representation for [ and ]\n result = '\\uFF3B' + result.replace(/[aouei]/g, '$&$&') + '\\uFF3D';\n }\n return result;\n}\nfunction findLanguageForModule(config, name) {\n let result = config[name];\n if (result) {\n return result;\n }\n result = config['*'];\n if (result) {\n return result;\n }\n return null;\n}\nfunction endWithSlash(path) {\n if (path.charAt(path.length - 1) === '/') {\n return path;\n }\n return path + '/';\n}\nasync function getMessagesFromTranslationsService(translationServiceUrl, language, name) {\n const url = endWithSlash(translationServiceUrl) + endWithSlash(language) + 'vscode/' + endWithSlash(name);\n const res = await fetch(url);\n if (res.ok) {\n const messages = await res.json();\n return messages;\n }\n throw new Error(`${res.status} - ${res.statusText}`);\n}\nfunction createScopedLocalize(scope) {\n return function (idx, defaultValue) {\n const restArgs = Array.prototype.slice.call(arguments, 2);\n return _format(scope[idx], restArgs);\n };\n}\nfunction createScopedLocalize2(scope) {\n return (idx, defaultValue, ...args) => ({\n value: _format(scope[idx], args),\n original: _format(defaultValue, args)\n });\n}\n/**\n * @skipMangle\n */\nexport function localize(data, message, ...args) {\n return _format(message, args);\n}\n/**\n * @skipMangle\n */\nexport function localize2(data, message, ...args) {\n const original = _format(message, args);\n return {\n value: original,\n original\n };\n}\n/**\n * @skipMangle\n */\nexport function getConfiguredDefaultLocale(_) {\n // This returns undefined because this implementation isn't used and is overwritten by the loader\n // when loaded.\n return undefined;\n}\n/**\n * @skipMangle\n */\nexport function setPseudoTranslation(value) {\n isPseudo = value;\n}\n/**\n * Invoked in a built product at run-time\n * @skipMangle\n */\nexport function create(key, data) {\n var _a;\n return {\n localize: createScopedLocalize(data[key]),\n localize2: createScopedLocalize2(data[key]),\n getConfiguredDefaultLocale: (_a = data.getConfiguredDefaultLocale) !== null && _a !== void 0 ? _a : ((_) => undefined)\n };\n}\n/**\n * Invoked by the loader at run-time\n * @skipMangle\n */\nexport function load(name, req, load, config) {\n var _a;\n const pluginConfig = (_a = config['vs/nls']) !== null && _a !== void 0 ? _a : {};\n if (!name || name.length === 0) {\n // TODO: We need to give back the mangled names here\n return load({\n localize: localize,\n localize2: localize2,\n getConfiguredDefaultLocale: () => { var _a; return (_a = pluginConfig.availableLanguages) === null || _a === void 0 ? void 0 : _a['*']; }\n });\n }\n const language = pluginConfig.availableLanguages ? findLanguageForModule(pluginConfig.availableLanguages, name) : null;\n const useDefaultLanguage = language === null || language === DEFAULT_TAG;\n let suffix = '.nls';\n if (!useDefaultLanguage) {\n suffix = suffix + '.' + language;\n }\n const messagesLoaded = (messages) => {\n if (Array.isArray(messages)) {\n messages.localize = createScopedLocalize(messages);\n messages.localize2 = createScopedLocalize2(messages);\n }\n else {\n messages.localize = createScopedLocalize(messages[name]);\n messages.localize2 = createScopedLocalize2(messages[name]);\n }\n messages.getConfiguredDefaultLocale = () => { var _a; return (_a = pluginConfig.availableLanguages) === null || _a === void 0 ? void 0 : _a['*']; };\n load(messages);\n };\n if (typeof pluginConfig.loadBundle === 'function') {\n pluginConfig.loadBundle(name, language, (err, messages) => {\n // We have an error. Load the English default strings to not fail\n if (err) {\n req([name + '.nls'], messagesLoaded);\n }\n else {\n messagesLoaded(messages);\n }\n });\n }\n else if (pluginConfig.translationServiceUrl && !useDefaultLanguage) {\n (async () => {\n var _a;\n try {\n const messages = await getMessagesFromTranslationsService(pluginConfig.translationServiceUrl, language, name);\n return messagesLoaded(messages);\n }\n catch (err) {\n // Language is already as generic as it gets, so require default messages\n if (!language.includes('-')) {\n console.error(err);\n return req([name + '.nls'], messagesLoaded);\n }\n try {\n // Since there is a dash, the language configured is a specific sub-language of the same generic language.\n // Since we were unable to load the specific language, try to load the generic language. Ex. we failed to find a\n // Swiss German (de-CH), so try to load the generic German (de) messages instead.\n const genericLanguage = language.split('-')[0];\n const messages = await getMessagesFromTranslationsService(pluginConfig.translationServiceUrl, genericLanguage, name);\n // We got some messages, so we configure the configuration to use the generic language for this session.\n (_a = pluginConfig.availableLanguages) !== null && _a !== void 0 ? _a : (pluginConfig.availableLanguages = {});\n pluginConfig.availableLanguages['*'] = genericLanguage;\n return messagesLoaded(messages);\n }\n catch (err) {\n console.error(err);\n return req([name + '.nls'], messagesLoaded);\n }\n }\n })();\n }\n else {\n req([name + suffix], messagesLoaded, (err) => {\n if (suffix === '.nls') {\n console.error('Failed trying to load default language strings', err);\n return;\n }\n console.error(`Failed to load message bundle for language ${language}. Falling back to the default language:`, err);\n req([name + '.nls'], messagesLoaded);\n });\n }\n}\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { SimpleWorkerServer } from '../base/common/worker/simpleWorker.js';\nimport { EditorSimpleWorker } from './common/services/editorSimpleWorker.js';\nlet initialized = false;\nexport function initialize(foreignModule) {\n if (initialized) {\n return;\n }\n initialized = true;\n const simpleWorker = new SimpleWorkerServer((msg) => {\n globalThis.postMessage(msg);\n }, (host) => new EditorSimpleWorker(host, foreignModule));\n globalThis.onmessage = (e) => {\n simpleWorker.onmessage(e.data);\n };\n}\nglobalThis.onmessage = (e) => {\n // Ignore first message in this case and initialize if not yet initialized\n if (!initialized) {\n initialize(null);\n }\n};\n"],"names":[],"sourceRoot":""}
\ No newline at end of file
diff --git a/dist/examples.json b/dist/examples.json
new file mode 100644
index 00000000..7b250148
--- /dev/null
+++ b/dist/examples.json
@@ -0,0 +1 @@
+{"path":"./src/static/examples","name":"examples","children":[{"path":"examples/ambisonics","name":"ambisonics","children":[{"path":"examples/ambisonics/fourSourcesToOcto.dsp","name":"fourSourcesToOcto.dsp","size":981,"extension":".dsp","type":"file"},{"path":"examples/ambisonics/oneSourceToStereo.dsp","name":"oneSourceToStereo.dsp","size":404,"extension":".dsp","type":"file"}],"size":1385,"type":"directory"},{"path":"examples/analysis","name":"analysis","children":[{"path":"examples/analysis/dbmeter.dsp","name":"dbmeter.dsp","size":628,"extension":".dsp","type":"file"},{"path":"examples/analysis/FFT.dsp","name":"FFT.dsp","size":874,"extension":".dsp","type":"file"},{"path":"examples/analysis/spectralLevel.dsp","name":"spectralLevel.dsp","size":233,"extension":".dsp","type":"file"},{"path":"examples/analysis/spectralTiltLab.dsp","name":"spectralTiltLab.dsp","size":668,"extension":".dsp","type":"file"},{"path":"examples/analysis/vumeter.dsp","name":"vumeter.dsp","size":545,"extension":".dsp","type":"file"}],"size":2948,"type":"directory"},{"path":"examples/bela","name":"bela","children":[{"path":"examples/bela/AdditiveSynth.dsp","name":"AdditiveSynth.dsp","size":1462,"extension":".dsp","type":"file"},{"path":"examples/bela/AdditiveSynth_Analog.dsp","name":"AdditiveSynth_Analog.dsp","size":1525,"extension":".dsp","type":"file"},{"path":"examples/bela/crossDelay2.dsp","name":"crossDelay2.dsp","size":2314,"extension":".dsp","type":"file"},{"path":"examples/bela/Faust-complement.lib","name":"Faust-complement.lib","size":2032,"extension":".lib","type":"file"},{"path":"examples/bela/FMSynth2.dsp","name":"FMSynth2.dsp","size":1956,"extension":".dsp","type":"file"},{"path":"examples/bela/FMSynth2_Analog.dsp","name":"FMSynth2_Analog.dsp","size":1873,"extension":".dsp","type":"file"},{"path":"examples/bela/FMSynth2_FX.dsp","name":"FMSynth2_FX.dsp","size":4569,"extension":".dsp","type":"file"},{"path":"examples/bela/FMSynth2_FX_Analog.dsp","name":"FMSynth2_FX_Analog.dsp","size":4683,"extension":".dsp","type":"file"},{"path":"examples/bela/FXChaine2.dsp","name":"FXChaine2.dsp","size":5513,"extension":".dsp","type":"file"},{"path":"examples/bela/GrainGenerator.dsp","name":"GrainGenerator.dsp","size":3631,"extension":".dsp","type":"file"},{"path":"examples/bela/granulator.dsp","name":"granulator.dsp","size":2429,"extension":".dsp","type":"file"},{"path":"examples/bela/repeater.dsp","name":"repeater.dsp","size":2315,"extension":".dsp","type":"file"},{"path":"examples/bela/simpleFX.dsp","name":"simpleFX.dsp","size":2434,"extension":".dsp","type":"file"},{"path":"examples/bela/simpleFX_Analog.dsp","name":"simpleFX_Analog.dsp","size":2582,"extension":".dsp","type":"file"},{"path":"examples/bela/simpleSynth.dsp","name":"simpleSynth.dsp","size":2562,"extension":".dsp","type":"file"},{"path":"examples/bela/simpleSynth_Analog.dsp","name":"simpleSynth_Analog.dsp","size":2596,"extension":".dsp","type":"file"},{"path":"examples/bela/simpleSynth_FX.dsp","name":"simpleSynth_FX.dsp","size":5153,"extension":".dsp","type":"file"},{"path":"examples/bela/simpleSynth_FX_Analog.dsp","name":"simpleSynth_FX_Analog.dsp","size":5350,"extension":".dsp","type":"file"},{"path":"examples/bela/WaveSynth.dsp","name":"WaveSynth.dsp","size":2230,"extension":".dsp","type":"file"},{"path":"examples/bela/WaveSynth_Analog.dsp","name":"WaveSynth_Analog.dsp","size":2345,"extension":".dsp","type":"file"},{"path":"examples/bela/WaveSynth_FX.dsp","name":"WaveSynth_FX.dsp","size":4895,"extension":".dsp","type":"file"},{"path":"examples/bela/WaveSynth_FX_Analog.dsp","name":"WaveSynth_FX_Analog.dsp","size":5084,"extension":".dsp","type":"file"}],"size":69533,"type":"directory"},{"path":"examples/delayEcho","name":"delayEcho","children":[{"path":"examples/delayEcho/echo.dsp","name":"echo.dsp","size":462,"extension":".dsp","type":"file"},{"path":"examples/delayEcho/quadEcho.dsp","name":"quadEcho.dsp","size":561,"extension":".dsp","type":"file"},{"path":"examples/delayEcho/smoothDelay.dsp","name":"smoothDelay.dsp","size":825,"extension":".dsp","type":"file"},{"path":"examples/delayEcho/stereoEcho.dsp","name":"stereoEcho.dsp","size":491,"extension":".dsp","type":"file"},{"path":"examples/delayEcho/tapiir.dsp","name":"tapiir.dsp","size":1263,"extension":".dsp","type":"file"}],"size":3602,"type":"directory"},{"path":"examples/dynamic","name":"dynamic","children":[{"path":"examples/dynamic/compressor.dsp","name":"compressor.dsp","size":194,"extension":".dsp","type":"file"},{"path":"examples/dynamic/distortion.dsp","name":"distortion.dsp","size":192,"extension":".dsp","type":"file"},{"path":"examples/dynamic/gateCompressor.dsp","name":"gateCompressor.dsp","size":333,"extension":".dsp","type":"file"},{"path":"examples/dynamic/noiseGate.dsp","name":"noiseGate.dsp","size":182,"extension":".dsp","type":"file"},{"path":"examples/dynamic/volume.dsp","name":"volume.dsp","size":376,"extension":".dsp","type":"file"}],"size":1277,"type":"directory"},{"path":"examples/fft","name":"fft","children":[{"path":"examples/fft/fft_bandpass.dsp","name":"fft_bandpass.dsp","size":734,"extension":".dsp","type":"file"},{"path":"examples/fft/fft_centroid.dsp","name":"fft_centroid.dsp","size":865,"extension":".dsp","type":"file"},{"path":"examples/fft/fft_delay.dsp","name":"fft_delay.dsp","size":918,"extension":".dsp","type":"file"},{"path":"examples/fft/fft_gain.dsp","name":"fft_gain.dsp","size":67,"extension":".dsp","type":"file"},{"path":"examples/fft/fft_remove_phase.dsp","name":"fft_remove_phase.dsp","size":734,"extension":".dsp","type":"file"},{"path":"examples/fft/fft_synth.dsp","name":"fft_synth.dsp","size":97,"extension":".dsp","type":"file"}],"size":3415,"type":"directory"},{"path":"examples/filtering","name":"filtering","children":[{"path":"examples/filtering/APF.dsp","name":"APF.dsp","size":337,"extension":".dsp","type":"file"},{"path":"examples/filtering/bandFilter.dsp","name":"bandFilter.dsp","size":1314,"extension":".dsp","type":"file"},{"path":"examples/filtering/BPF.dsp","name":"BPF.dsp","size":337,"extension":".dsp","type":"file"},{"path":"examples/filtering/cryBaby.dsp","name":"cryBaby.dsp","size":156,"extension":".dsp","type":"file"},{"path":"examples/filtering/diodeLadder.dsp","name":"diodeLadder.dsp","size":381,"extension":".dsp","type":"file"},{"path":"examples/filtering/DNN.dsp","name":"DNN.dsp","size":806,"extension":".dsp","type":"file"},{"path":"examples/filtering/filterBank.dsp","name":"filterBank.dsp","size":177,"extension":".dsp","type":"file"},{"path":"examples/filtering/graphicEqLab.dsp","name":"graphicEqLab.dsp","size":354,"extension":".dsp","type":"file"},{"path":"examples/filtering/highShelf.dsp","name":"highShelf.dsp","size":349,"extension":".dsp","type":"file"},{"path":"examples/filtering/HPF.dsp","name":"HPF.dsp","size":337,"extension":".dsp","type":"file"},{"path":"examples/filtering/korg35HPF.dsp","name":"korg35HPF.dsp","size":379,"extension":".dsp","type":"file"},{"path":"examples/filtering/korg35LPF.dsp","name":"korg35LPF.dsp","size":379,"extension":".dsp","type":"file"},{"path":"examples/filtering/lfBoost.dsp","name":"lfBoost.dsp","size":1348,"extension":".dsp","type":"file"},{"path":"examples/filtering/lowBoost.dsp","name":"lowBoost.dsp","size":1478,"extension":".dsp","type":"file"},{"path":"examples/filtering/lowCut.dsp","name":"lowCut.dsp","size":1453,"extension":".dsp","type":"file"},{"path":"examples/filtering/lowShelf.dsp","name":"lowShelf.dsp","size":347,"extension":".dsp","type":"file"},{"path":"examples/filtering/LPF.dsp","name":"LPF.dsp","size":337,"extension":".dsp","type":"file"},{"path":"examples/filtering/moogHalfLadder.dsp","name":"moogHalfLadder.dsp","size":390,"extension":".dsp","type":"file"},{"path":"examples/filtering/moogLadder.dsp","name":"moogLadder.dsp","size":378,"extension":".dsp","type":"file"},{"path":"examples/filtering/moogVCF.dsp","name":"moogVCF.dsp","size":153,"extension":".dsp","type":"file"},{"path":"examples/filtering/multibandFilter.dsp","name":"multibandFilter.dsp","size":561,"extension":".dsp","type":"file"},{"path":"examples/filtering/notch.dsp","name":"notch.dsp","size":341,"extension":".dsp","type":"file"},{"path":"examples/filtering/oberheim.dsp","name":"oberheim.dsp","size":457,"extension":".dsp","type":"file"},{"path":"examples/filtering/oberheimBPF.dsp","name":"oberheimBPF.dsp","size":397,"extension":".dsp","type":"file"},{"path":"examples/filtering/oberheimBSF.dsp","name":"oberheimBSF.dsp","size":397,"extension":".dsp","type":"file"},{"path":"examples/filtering/oberheimHPF.dsp","name":"oberheimHPF.dsp","size":397,"extension":".dsp","type":"file"},{"path":"examples/filtering/oberheimLPF.dsp","name":"oberheimLPF.dsp","size":396,"extension":".dsp","type":"file"},{"path":"examples/filtering/parametricEqLab.dsp","name":"parametricEqLab.dsp","size":437,"extension":".dsp","type":"file"},{"path":"examples/filtering/parametricEqualizer.dsp","name":"parametricEqualizer.dsp","size":185,"extension":".dsp","type":"file"},{"path":"examples/filtering/peakingEQ.dsp","name":"peakingEQ.dsp","size":349,"extension":".dsp","type":"file"},{"path":"examples/filtering/peakNotch.dsp","name":"peakNotch.dsp","size":350,"extension":".dsp","type":"file"},{"path":"examples/filtering/sallenKey2ndOrder.dsp","name":"sallenKey2ndOrder.dsp","size":481,"extension":".dsp","type":"file"},{"path":"examples/filtering/sallenKey2ndOrderBPF.dsp","name":"sallenKey2ndOrderBPF.dsp","size":430,"extension":".dsp","type":"file"},{"path":"examples/filtering/sallenKey2ndOrderHPF.dsp","name":"sallenKey2ndOrderHPF.dsp","size":429,"extension":".dsp","type":"file"},{"path":"examples/filtering/sallenKey2ndOrderLPF.dsp","name":"sallenKey2ndOrderLPF.dsp","size":429,"extension":".dsp","type":"file"},{"path":"examples/filtering/sallenKeyOnePole.dsp","name":"sallenKeyOnePole.dsp","size":444,"extension":".dsp","type":"file"},{"path":"examples/filtering/sallenKeyOnePoleHPF.dsp","name":"sallenKeyOnePoleHPF.dsp","size":390,"extension":".dsp","type":"file"},{"path":"examples/filtering/sallenKeyOnePoleLPF.dsp","name":"sallenKeyOnePoleLPF.dsp","size":389,"extension":".dsp","type":"file"},{"path":"examples/filtering/spectralTilt.dsp","name":"spectralTilt.dsp","size":191,"extension":".dsp","type":"file"},{"path":"examples/filtering/vcfWahLab.dsp","name":"vcfWahLab.dsp","size":504,"extension":".dsp","type":"file"},{"path":"examples/filtering/vocoder.dsp","name":"vocoder.dsp","size":226,"extension":".dsp","type":"file"},{"path":"examples/filtering/wahPedal.dsp","name":"wahPedal.dsp","size":163,"extension":".dsp","type":"file"}],"size":19533,"type":"directory"},{"path":"examples/gameaudio","name":"gameaudio","children":[{"path":"examples/gameaudio/bubble.dsp","name":"bubble.dsp","size":1037,"extension":".dsp","type":"file"},{"path":"examples/gameaudio/door.dsp","name":"door.dsp","size":1892,"extension":".dsp","type":"file"},{"path":"examples/gameaudio/fire.dsp","name":"fire.dsp","size":1312,"extension":".dsp","type":"file"},{"path":"examples/gameaudio/insects.dsp","name":"insects.dsp","size":4953,"extension":".dsp","type":"file"},{"path":"examples/gameaudio/rain.dsp","name":"rain.dsp","size":622,"extension":".dsp","type":"file"},{"path":"examples/gameaudio/wind.dsp","name":"wind.dsp","size":551,"extension":".dsp","type":"file"}],"size":10367,"type":"directory"},{"path":"examples/generator","name":"generator","children":[{"path":"examples/generator/filterOsc.dsp","name":"filterOsc.dsp","size":213,"extension":".dsp","type":"file"},{"path":"examples/generator/noise.dsp","name":"noise.dsp","size":1813,"extension":".dsp","type":"file"},{"path":"examples/generator/noiseMetadata.dsp","name":"noiseMetadata.dsp","size":2356,"extension":".dsp","type":"file"},{"path":"examples/generator/osc.dsp","name":"osc.dsp","size":471,"extension":".dsp","type":"file"},{"path":"examples/generator/osci.dsp","name":"osci.dsp","size":505,"extension":".dsp","type":"file"},{"path":"examples/generator/sawtoothLab.dsp","name":"sawtoothLab.dsp","size":239,"extension":".dsp","type":"file"},{"path":"examples/generator/virtualAnalog.dsp","name":"virtualAnalog.dsp","size":228,"extension":".dsp","type":"file"},{"path":"examples/generator/virtualAnalogLab.dsp","name":"virtualAnalogLab.dsp","size":268,"extension":".dsp","type":"file"}],"size":6093,"type":"directory"},{"path":"examples/LIBRARIES","name":"LIBRARIES","children":[{"path":"examples/LIBRARIES/aanl.lib","name":"aanl.lib","size":27753,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/all.lib","name":"all.lib","size":1016,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/analyzers.lib","name":"analyzers.lib","size":37512,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/basics.lib","name":"basics.lib","size":60106,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/compressors.lib","name":"compressors.lib","size":64754,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/delays.lib","name":"delays.lib","size":15122,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/demos.lib","name":"demos.lib","size":65185,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/dx7.lib","name":"dx7.lib","size":69103,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/envelopes.lib","name":"envelopes.lib","size":12032,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/fds.lib","name":"fds.lib","size":20559,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/filters.lib","name":"filters.lib","size":115548,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/hoa.lib","name":"hoa.lib","size":42799,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/instruments.lib","name":"instruments.lib","size":9395,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/interpolators.lib","name":"interpolators.lib","size":23955,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/maths.lib","name":"maths.lib","size":21483,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/maxmsp.lib","name":"maxmsp.lib","size":8174,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/mi.lib","name":"mi.lib","size":17280,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/misceffects.lib","name":"misceffects.lib","size":21753,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/noises.lib","name":"noises.lib","size":16086,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/oscillators.lib","name":"oscillators.lib","size":53381,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/phaflangers.lib","name":"phaflangers.lib","size":10024,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/physmodels.lib","name":"physmodels.lib","size":171348,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/platform.lib","name":"platform.lib","size":3131,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/quantizers.lib","name":"quantizers.lib","size":9855,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/reducemaps.lib","name":"reducemaps.lib","size":4836,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/reverbs.lib","name":"reverbs.lib","size":37506,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/routes.lib","name":"routes.lib","size":8565,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/sf.lib","name":"sf.lib","size":1066,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/signals.lib","name":"signals.lib","size":16416,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/soundfiles.lib","name":"soundfiles.lib","size":9361,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/spats.lib","name":"spats.lib","size":5193,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/stdfaust.lib","name":"stdfaust.lib","size":1270,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/synths.lib","name":"synths.lib","size":11395,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/tonestacks.lib","name":"tonestacks.lib","size":12354,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/tubes.lib","name":"tubes.lib","size":349789,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/vaeffects.lib","name":"vaeffects.lib","size":35897,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/version.lib","name":"version.lib","size":910,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/wdmodels.lib","name":"wdmodels.lib","size":89953,"extension":".lib","type":"file"},{"path":"examples/LIBRARIES/webaudio.lib","name":"webaudio.lib","size":12119,"extension":".lib","type":"file"}],"size":1493984,"type":"directory"},{"path":"examples/misc","name":"misc","children":[{"path":"examples/misc/autopan.dsp","name":"autopan.dsp","size":2292,"extension":".dsp","type":"file"},{"path":"examples/misc/capture.dsp","name":"capture.dsp","size":802,"extension":".dsp","type":"file"},{"path":"examples/misc/drumkit.dsp","name":"drumkit.dsp","size":1307,"extension":".dsp","type":"file"},{"path":"examples/misc/guitarix.dsp","name":"guitarix.dsp","size":8986,"extension":".dsp","type":"file"},{"path":"examples/misc/matrix.dsp","name":"matrix.dsp","size":551,"extension":".dsp","type":"file"},{"path":"examples/misc/midiTester.dsp","name":"midiTester.dsp","size":7986,"extension":".dsp","type":"file"},{"path":"examples/misc/mixer.dsp","name":"mixer.dsp","size":667,"extension":".dsp","type":"file"},{"path":"examples/misc/statespace.dsp","name":"statespace.dsp","size":1356,"extension":".dsp","type":"file"},{"path":"examples/misc/switcher.dsp","name":"switcher.dsp","size":564,"extension":".dsp","type":"file"},{"path":"examples/misc/tester.dsp","name":"tester.dsp","size":1082,"extension":".dsp","type":"file"},{"path":"examples/misc/tester2.dsp","name":"tester2.dsp","size":1189,"extension":".dsp","type":"file"},{"path":"examples/misc/UITester.dsp","name":"UITester.dsp","size":2158,"extension":".dsp","type":"file"}],"size":28940,"type":"directory"},{"path":"examples/phasing","name":"phasing","children":[{"path":"examples/phasing/flanger.dsp","name":"flanger.dsp","size":188,"extension":".dsp","type":"file"},{"path":"examples/phasing/phaser.dsp","name":"phaser.dsp","size":184,"extension":".dsp","type":"file"},{"path":"examples/phasing/phaserFlangerLab.dsp","name":"phaserFlangerLab.dsp","size":395,"extension":".dsp","type":"file"}],"size":767,"type":"directory"},{"path":"examples/physicalModeling","name":"physicalModeling","children":[{"path":"examples/physicalModeling/brass.dsp","name":"brass.dsp","size":263,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/brassMIDI.dsp","name":"brassMIDI.dsp","size":290,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/churchBell.dsp","name":"churchBell.dsp","size":244,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/clarinet.dsp","name":"clarinet.dsp","size":261,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/clarinetMIDI.dsp","name":"clarinetMIDI.dsp","size":288,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/djembeMIDI.dsp","name":"djembeMIDI.dsp","size":257,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/elecGuitarMIDI.dsp","name":"elecGuitarMIDI.dsp","size":330,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/englishBell.dsp","name":"englishBell.dsp","size":252,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/faust-stk","name":"faust-stk","children":[{"path":"examples/physicalModeling/faust-stk/blowBottle.dsp","name":"blowBottle.dsp","size":5036,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/faust-stk/bowed.dsp","name":"bowed.dsp","size":5791,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/faust-stk/brass.dsp","name":"brass.dsp","size":5421,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/faust-stk/clarinet.dsp","name":"clarinet.dsp","size":5439,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/faust-stk/flute.dsp","name":"flute.dsp","size":5763,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/faust-stk/fluteStk.dsp","name":"fluteStk.dsp","size":6147,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/faust-stk/glassHarmonica.dsp","name":"glassHarmonica.dsp","size":5550,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/faust-stk/NLFeks.dsp","name":"NLFeks.dsp","size":3140,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/faust-stk/NLFfm.dsp","name":"NLFfm.dsp","size":3849,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/faust-stk/saxophony.dsp","name":"saxophony.dsp","size":6161,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/faust-stk/sitar.dsp","name":"sitar.dsp","size":1747,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/faust-stk/tibetanBowl.dsp","name":"tibetanBowl.dsp","size":6118,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/faust-stk/tunedBar.dsp","name":"tunedBar.dsp","size":5350,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/faust-stk/uniBar.dsp","name":"uniBar.dsp","size":3872,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/faust-stk/voiceForm.dsp","name":"voiceForm.dsp","size":5988,"extension":".dsp","type":"file"}],"size":75372,"type":"directory"},{"path":"examples/physicalModeling/flute.dsp","name":"flute.dsp","size":252,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/fluteMIDI.dsp","name":"fluteMIDI.dsp","size":279,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/frenchBell.dsp","name":"frenchBell.dsp","size":249,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/germanBell.dsp","name":"germanBell.dsp","size":249,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/guitarMIDI.dsp","name":"guitarMIDI.dsp","size":258,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/karplus.dsp","name":"karplus.dsp","size":288,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/marimbaMIDI.dsp","name":"marimbaMIDI.dsp","size":336,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/modularInterpInstrMIDI.dsp","name":"modularInterpInstrMIDI.dsp","size":310,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/nylonGuitarMIDI.dsp","name":"nylonGuitarMIDI.dsp","size":268,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/russianBell.dsp","name":"russianBell.dsp","size":252,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/standardBell.dsp","name":"standardBell.dsp","size":255,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/violin.dsp","name":"violin.dsp","size":268,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/violinMIDI.dsp","name":"violinMIDI.dsp","size":257,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/vocalBP.dsp","name":"vocalBP.dsp","size":258,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/vocalBPMIDI.dsp","name":"vocalBPMIDI.dsp","size":286,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/vocalFOF.dsp","name":"vocalFOF.dsp","size":233,"extension":".dsp","type":"file"},{"path":"examples/physicalModeling/vocalFOFMIDI.dsp","name":"vocalFOFMIDI.dsp","size":261,"extension":".dsp","type":"file"}],"size":82116,"type":"directory"},{"path":"examples/pitchShifting","name":"pitchShifting","children":[{"path":"examples/pitchShifting/pitchShifter.dsp","name":"pitchShifter.dsp","size":559,"extension":".dsp","type":"file"}],"size":559,"type":"directory"},{"path":"examples/psychoacoustic","name":"psychoacoustic","children":[{"path":"examples/psychoacoustic/harmonicExciter.dsp","name":"harmonicExciter.dsp","size":379,"extension":".dsp","type":"file"}],"size":379,"type":"directory"},{"path":"examples/reverb","name":"reverb","children":[{"path":"examples/reverb/dattorro.dsp","name":"dattorro.dsp","size":189,"extension":".dsp","type":"file"},{"path":"examples/reverb/fdnRev.dsp","name":"fdnRev.dsp","size":200,"extension":".dsp","type":"file"},{"path":"examples/reverb/freeverb.dsp","name":"freeverb.dsp","size":173,"extension":".dsp","type":"file"},{"path":"examples/reverb/greyhole.dsp","name":"greyhole.dsp","size":177,"extension":".dsp","type":"file"},{"path":"examples/reverb/jprev.dsp","name":"jprev.dsp","size":168,"extension":".dsp","type":"file"},{"path":"examples/reverb/reverbDesigner.dsp","name":"reverbDesigner.dsp","size":307,"extension":".dsp","type":"file"},{"path":"examples/reverb/reverbTester.dsp","name":"reverbTester.dsp","size":205,"extension":".dsp","type":"file"},{"path":"examples/reverb/zitaRev.dsp","name":"zitaRev.dsp","size":239,"extension":".dsp","type":"file"},{"path":"examples/reverb/zitaRevFDN.dsp","name":"zitaRevFDN.dsp","size":217,"extension":".dsp","type":"file"}],"size":1875,"type":"directory"},{"path":"examples/smartKeyboard","name":"smartKeyboard","children":[{"path":"examples/smartKeyboard/acGuitar.dsp","name":"acGuitar.dsp","size":3902,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/associatedEffects","name":"associatedEffects","children":[{"path":"examples/smartKeyboard/associatedEffects/elecGuitarEffect.dsp","name":"elecGuitarEffect.dsp","size":186,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/associatedEffects/myEffect.dsp","name":"myEffect.dsp","size":89,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/associatedEffects/reverb.dsp","name":"reverb.dsp","size":89,"extension":".dsp","type":"file"}],"size":364,"type":"directory"},{"path":"examples/smartKeyboard/bells.dsp","name":"bells.dsp","size":3002,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/bowed.dsp","name":"bowed.dsp","size":3130,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/brass.dsp","name":"brass.dsp","size":3151,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/clarinet.dsp","name":"clarinet.dsp","size":5188,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/crazyGuiro.dsp","name":"crazyGuiro.dsp","size":3916,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/drums.dsp","name":"drums.dsp","size":2550,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/dubDub.dsp","name":"dubDub.dsp","size":3264,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/elecGuitar.dsp","name":"elecGuitar.dsp","size":2516,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/fm.dsp","name":"fm.dsp","size":2974,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/frog.dsp","name":"frog.dsp","size":2868,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/harp.dsp","name":"harp.dsp","size":3329,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/midiOnly.dsp","name":"midiOnly.dsp","size":2458,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/multiSynth.dsp","name":"multiSynth.dsp","size":2550,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/toy.dsp","name":"toy.dsp","size":2823,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/trumpet.dsp","name":"trumpet.dsp","size":1922,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/turenas.dsp","name":"turenas.dsp","size":4268,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/violin.dsp","name":"violin.dsp","size":3439,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/violin2.dsp","name":"violin2.dsp","size":3017,"extension":".dsp","type":"file"},{"path":"examples/smartKeyboard/vocal.dsp","name":"vocal.dsp","size":1384,"extension":".dsp","type":"file"}],"size":62015,"type":"directory"},{"path":"examples/spat","name":"spat","children":[{"path":"examples/spat/panpot.dsp","name":"panpot.dsp","size":392,"extension":".dsp","type":"file"},{"path":"examples/spat/spat.dsp","name":"spat.dsp","size":695,"extension":".dsp","type":"file"}],"size":1087,"type":"directory"}],"size":1789875,"type":"directory"}
\ No newline at end of file
diff --git a/dist/examples/LIBRARIES/aanl.lib b/dist/examples/LIBRARIES/aanl.lib
new file mode 100644
index 00000000..9b3f3a45
--- /dev/null
+++ b/dist/examples/LIBRARIES/aanl.lib
@@ -0,0 +1,898 @@
+//################################ aanl.lib ##########################################
+// A library for antialiased nonlinearities. Its official prefix is `aa`.
+//
+// This library provides aliasing-suppressed nonlinearities through first-order
+// and second-order approximations of continuous-time signals, functions,
+// and convolution based on antiderivatives. This technique is particularly
+// effective if combined with low-factor oversampling, for example, operating
+// at 96 kHz or 192 kHz sample-rate.
+//
+// The library contains trigonometric functions as well as other nonlinear
+// functions such as bounded and unbounded saturators.
+//
+// Due to their limited domains or ranges, some of these functions may not
+// suitable for audio nonlinear processing or waveshaping, although
+// they have been included for completeness. Some other functions,
+// for example, tan() and tanh(), are only available with first-order
+// antialiasing due to the complexity of the antiderivative of the
+// x * f(x) term, particularly because of the necessity of the dilogarithm
+// function, which requires special implementation.
+//
+// Future improvements to this library may include an adaptive
+// mechanism to set the ill-conditioned cases threshold to improve
+// performance in varying cases.
+//
+// Note that the antialiasing functions introduce a delay in the path,
+// respectively half and one-sample delay for first and second-order functions.
+//
+// Also note that due to division by differences, it is vital to use
+// double-precision or more to reduce errors.
+//
+// The environment identifier for this library is `aa`. After importing
+// the standard libraries in Faust, the functions below can be called as `aa.function_name`.
+//
+// #### References
+// *
+// *
+//########################################################################################
+
+ba = library("basics.lib");
+ma = library("maths.lib");
+
+declare name "Faust Antialiased Nonlinearities";
+declare version "0.3";
+
+//==============================Auxiliary Functions=======================================
+//========================================================================================
+
+//-------`(aa.)clip`-----------
+// Clipping function.
+//-----------------------------
+clip(l, h, x) = max(l, min(h, x));
+
+
+//-------`(aa.)Rsqrt`----------
+// Real-valued sqrt().
+//-----------------------------
+Rsqrt(x) = sqrt(max(0.0, x));
+
+
+//-------`(aa.)Rlog`-----------
+// Real-valued log().
+//-----------------------------
+Rlog(x) = log(max(ma.EPSILON, x));
+
+
+//-------`(aa.)Rtan`-----------
+// Real-valued tan().
+//-----------------------------
+Rtan(x) = tan(clip(-ma.MAX, ma.MAX, x));
+
+
+//-------`(aa.)Racos`----------
+// Real-valued acos().
+//-----------------------------
+Racos(x) = acos(clip(-1.0, 1.0, x));
+
+
+//-------`(aa.)Rasin`----------
+// Real-valued asin().
+//-----------------------------
+Rasin(x) = asin(clip(-1.0, 1.0, x));
+
+
+//-------`(aa.)Racosh`----------
+// Real-valued acosh()
+//------------------------------
+Racosh(x) = ma.acosh(clip(1.0, ma.MAX, x));
+
+
+//-------`(aa.)Rcosh`----------
+// Real-valued cosh().
+//-----------------------------
+Rcosh(x) = min(ma.MAX, ma.cosh(x));
+
+
+//-------`(aa.)Rsinh`-----------
+// Real-valued sinh().
+//------------------------------
+Rsinh(x) = clip(-ma.MAX, ma.MAX, ma.sinh(x));
+
+
+//-------`(aa.)Ratanh`----------
+// Real-valued atanh().
+//------------------------------
+Ratanh(x) = ma.atanh(clip(-1.0 + ma.EPSILON, 1.0 - ma.EPSILON, x));
+
+
+//-------`(aa.)ADAA1`---------------------
+// Generalised first-order ADAA function.
+//
+// #### Usage
+//
+// ```
+// _ : ADAA1(EPS, f, F1) : _
+// ```
+//
+// Where:
+//
+// * `EPS`: a threshold to handle ill-conditioned cases
+// * `f`: a function that we want to process with ADAA
+// * `F1`: f's first antiderivative
+
+declare ADAA1 author "Dario Sanfilippo";
+declare ADAA1 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare ADAA1 license "LGPL v3.0 license";
+ADAA1(EPS, f, F1, x) = D1q
+ with {
+ D1q = ba.if(abs(x - x') <= EPS, ill_D1q, safe_D1q)
+ with {
+ ill_D1q = f(x_m);
+ safe_D1q = (F1(x) - F1(x')) / (x - x');
+ x_m = .5 * (x + x');
+ };
+ };
+
+
+//-------`(aa.)ADAA2`---------------------
+// Generalised second-order ADAA function.
+//
+// #### Usage
+//
+// ```
+// _ : ADAA2(EPS, f, F1, F2) : _
+// ```
+//
+// Where:
+//
+// * `EPS`: a threshold to handle ill-conditioned cases
+// * `f`: a function that we want to process with ADAA
+// * `F1`: f's first antiderivative
+// * `F2`: f's second antiderivative
+
+declare ADAA2 author "Dario Sanfilippo";
+declare ADAA2 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare ADAA2 license "LGPL v3.0 license";
+ADAA2(EPS, f, F1, F2, x) = T1 + T2
+ with {
+ T1 = ba.if((x - x') ^ 2.0 <= EPS, ill_T1, safe_T1)
+ with {
+ ill_T1 = .5 * f((x + 2.0 * x') / 3.0);
+ safe_T1 = (x * (F1(x) - F1(x')) - (F2(x) - F2(x'))) /
+ ((x - x') ^ 2.0);
+ };
+ T2 = ba.if((x' - x'') ^ 2.0 <= EPS, ill_T2, safe_T2)
+ with {
+ ill_T2 = .5 * f((x'' + 2.0 * x') / 3.0);
+ safe_T2 = (x'' * (F1(x'') - F1(x')) - (F2(x'') - F2(x'))) /
+ ((x'' - x') ^ 2.0);
+ };
+ };
+
+
+//==============================Main functions============================================
+//========================================================================================
+
+//================= Saturators ===============
+//
+// These antialiased saturators perform best with high-amplitude input
+// signals. If the input is only slightly saturated, hence producing
+// negligible aliasing, the trivial saturator may result in a better
+// overall output, as noise can be introduced by first and second ADAA
+// at low amplitudes.
+//
+// Once determining the lowest saturation level for which the antialiased
+// functions perform adequately, it might be sensible to cross-fade
+// between the trivial and the antialiased saturators according to the
+// amplitude profile of the input signal.
+//==============================================
+
+//-------`(aa.)hardclip`---------------------
+//
+// First-order ADAA hard-clip.
+//
+// The domain of this function is ℝ; its theoretical range is [-1.0; 1.0].
+//
+// #### Usage
+// ```
+// _ : aa.hardclip : _
+// ```
+//---------------------------------------------
+declare hardclip author "Dario Sanfilippo";
+declare hardclip copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare hardclip license "LGPL v3.0 license";
+hardclip(x) = ADAA1(EPS, f, F1, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = clip(-1.0, 1.0, x_f);
+ F1(x_F1) = ba.if( (x_F1 <= 1.0) & (x_F1 >= -1.0),
+ .5 * x_F1 ^ 2.0,
+ x_F1 * ma.signum(x_F1) - .5);
+ };
+
+
+//-------`(aa.)hardclip2`---------------------
+//
+// Second-order ADAA hard-clip.
+//
+// The domain of this function is ℝ; its theoretical range is [-1.0; 1.0].
+//
+// #### Usage
+// ```
+// _ : aa.hardclip2 : _
+// ```
+//---------------------------------------------
+declare hardclip2 author "Dario Sanfilippo";
+declare hardclip2 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare hardclip2 license "LGPL v3.0 license";
+hardclip2(x) = ADAA2(EPS, f, F1, F2, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = clip(-1.0, 1.0, x_f);
+ F1(x_F1) = ba.if( (x_F1 <= 1.0) & (x_F1 >= -1.0),
+ .5 * x_F1 ^ 2.0,
+ x_F1 * ma.signum(x_F1) - .5);
+ F2(x_F2) = ba.if( (x_F2 <= 1.0) & (x_F2 >= -1.0),
+ (1.0 / 3.0) * x_F2 ^ 3.0,
+ ((.5 * x_F2 ^ 2.0) - 1.0 / 6.0) *
+ ma.signum(x_F2));
+ };
+
+
+//-------`(aa.)cubic1`---------------------
+//
+// First-order ADAA cubic saturator.
+//
+// The domain of this function is ℝ; its theoretical range is
+// [-2.0/3.0; 2.0/3.0].
+//
+// #### Usage
+// ```
+// _ : aa.cubic1 : _
+// ```
+//-------------------------------------------
+declare cubic1 author "Dario Sanfilippo";
+declare cubic1 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare cubic1 license "LGPL v3.0 license";
+cubic1(x) = ADAA1(EPS, f, F1, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = ba.if( (x_f < 1.0) & (x_f > -1.0),
+ x_f - x_f ^ 3.0 / 3.0,
+ (2.0 / 3.0) * ma.signum(x_f));
+ F1(x_F1) = ba.if( x_F1 <= -1.0,
+ x_F1 * -2.0 / 3.0,
+ ba.if( x_F1 >= 1.0,
+ x_F1 * 2.0 / 3.0,
+ x_F1 ^ 2.0 / 2.0 - x_F1 ^ 4.0 / 12.0));
+ };
+
+
+//-------`(aa.)parabolic`---------------------
+//
+// First-order ADAA parabolic saturator.
+//
+// The domain of this function is ℝ; its theoretical range is [-1.0; 1.0].
+//
+// #### Usage
+// ```
+// _ : aa.parabolic : _
+// ```
+//--------------------------------------------
+declare parabolic author "Dario Sanfilippo";
+declare parabolic copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare parabolic license "LGPL v3.0 license";
+parabolic(x) = ADAA1(EPS, f, F1, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = ba.if( abs(x_f) <= 2.0,
+ x_f * (1.0 - abs(x_f) / 4.0),
+ ma.signum(x_f));
+ F1(x_F1) = ba.if( abs(x_F1) <= 2.0,
+ (-1.0 / 12.0) * x_F1 ^ 2.0 *
+ (x_F1 * ma.signum(x_F1) - 6.0),
+ abs(x_F1));
+ };
+
+
+//-------`(aa.)parabolic2`---------------------
+//
+// Second-order ADAA parabolic saturator.
+//
+// The domain of this function is ℝ; its theoretical range is [-1.0; 1.0].
+//
+// #### Usage
+// ```
+// _ : aa.parabolic : _
+// ```
+//---------------------------------------------
+declare parabolic2 author "Dario Sanfilippo";
+declare parabolic2 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare parabolic2 license "LGPL v3.0 license";
+parabolic2(x) = ADAA2(EPS, f, F1, F2, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = ba.if( abs(x_f) <= 2.0,
+ x_f * (1.0 - abs(x_f) / 4.0),
+ ma.signum(x_f));
+ F1(x_F1) = ba.if( abs(x_F1) <= 2.0,
+ (-1.0 / 12.0) * x_F1 ^ 2.0 *
+ (x_F1 * ma.signum(x_F1) - 6.0),
+ abs(x_F1));
+ F2(x_F2) = ba.if( abs(x_F2) <= 2.0,
+ (1.0 / 48.0) * x_F2 ^ 3.0 *
+ (16.0 - 3.0 * x_F2 * ma.signum(x_F2)),
+ .5 * x_F2 ^ 2.0 * ma.signum(x_F2));
+ };
+
+
+//-------`(aa.)hyperbolic`---------------------
+//
+// First-order ADAA hyperbolic saturator.
+//
+// The domain of this function is ℝ; its theoretical range is ]-1.0; 1.0[.
+//
+// #### Usage
+// ```
+// _ : aa.hyperbolic : _
+// ```
+//---------------------------------------------
+declare hyperbolic author "Dario Sanfilippo";
+declare hyperbolic copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare hyperbolic license "LGPL v3.0 license";
+hyperbolic(x) = ADAA1(EPS, f, F1, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = x_f / (1.0 + abs(x_f));
+ F1(x_F1) = abs(x_F1) - log(1.0 + abs(x_F1));
+ };
+
+
+//-------`(aa.)hyperbolic2`---------------------
+//
+// Second-order ADAA hyperbolic saturator.
+//
+// The domain of this function is ℝ; its theoretical range is ]-1.0; 1.0[.
+//
+// #### Usage
+// ```
+// _ : aa.hyperbolic2 : _
+// ```
+//----------------------------------------------
+declare hyperbolic2 author "Dario Sanfilippo";
+declare hyperbolic2 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare hyperbolic2 license "LGPL v3.0 license";
+hyperbolic2(x) = ADAA2(EPS, f, F1, F2, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = x_f / (1.0 + abs(x_f));
+ F1(x_F1) = abs(x_F1) - log(1.0 + abs(x_F1));
+ F2(x_F2) = ma.signum(x_F2) * (.5 * (3.0 - 2.0 * abs(x_F2) + x_F2 ^ 2.0 +
+ 2.0 * log(1.0 + abs(x_F2))) - 3.0 / 2.0) + 3.0 / 2.0;
+ };
+
+
+//-------`(aa.)sinarctan`---------------------
+//
+// First-order ADAA sin(atan()) saturator.
+//
+// The domain of this function is ℝ; its theoretical range is ]-1.0; 1.0[.
+//
+// #### Usage
+// ```
+// _ : aa.sinatan : _
+// ```
+//----------------------------------------------
+declare sinarctan author "Dario Sanfilippo";
+declare sinarctan copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare sinarctan license "LGPL v3.0 license";
+sinarctan(x) = ADAA1(EPS, f, F1, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = x_f / sqrt(1.0 + x_f ^ 2.0);
+ F1(x_F1) = sqrt(x_F1 ^ 2.0 + 1.0) + const
+ with {
+ const = -1.0; // for F1(0) = 0 to minimise precision loss
+ };
+ };
+
+
+//-------`(aa.)sinarctan2`---------------------
+//
+// Second-order ADAA sin(atan()) saturator.
+//
+// The domain of this function is ℝ; its theoretical range is ]-1.0; 1.0[.
+//
+// #### Usage
+// ```
+// _ : aa.sinarctan2 : _
+// ```
+//----------------------------------------------
+declare sinarctan2 author "Dario Sanfilippo";
+declare sinarctan2 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare sinarctan2 license "LGPL v3.0 license";
+sinarctan2(x) = ADAA2(EPS, f, F1, F2, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = x_f / sqrt(1.0 + x_f ^ 2.0);
+ F1(x_F1) = sqrt(x_F1 ^ 2.0 + 1.0) + const
+ with {
+ const = -1.0; // for F1(0) = 0 to minimise precision loss
+ };
+ F2(x_F2) = .5 * x_F2 * sqrt(x_F2 ^ 2.0 + 1.0) - .5 * ma.asinh(x_F2);
+ };
+
+
+//-------`(aa.)tanh1`---------------------
+//
+// First-order ADAA tanh() saturator.
+//
+// The domain of this function is ℝ; its theoretical range is ]-1.0; 1.0[.
+//
+// #### Usage
+// ```
+// _ : aa.tanh1 : _
+// ```
+//----------------------------------------------
+declare tanh1 author "Dario Sanfilippo";
+declare tanh1 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare tanh1 license "LGPL v3.0 license";
+tanh1(x) = ADAA1(EPS, f, F1, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = ma.tanh(x_f);
+ F1(x_F1) = log(Rcosh(x_F1));
+ };
+
+
+//-------`(aa.)arctan`---------------------
+//
+// First-order ADAA atan().
+//
+// The domain of this function is ℝ; its theoretical range is ]-π/2.0; π/2.0[.
+//
+// #### Usage
+// ```
+// _ : aa.arctan : _
+// ```
+//-------------------------------------------
+declare arctan author "Dario Sanfilippo";
+declare arctan copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare arctan license "LGPL v3.0 license";
+arctan(x) = ADAA1(EPS, f, F1, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = atan(x_f);
+ F1(x_F1) = x_F1 * f(x_F1) - .5 * log(x_F1 ^ 2.0 + 1.0);
+ };
+
+
+//-------`(aa.)arctan2`---------------------
+//
+// Second-order ADAA atan().
+//
+// The domain of this function is ℝ; its theoretical range is ]-π/2.0; π/2.0[.
+//
+// #### Usage
+// ```
+// _ : aa.arctan2 : _
+// ```
+//-------------------------------------------
+declare arctan2 author "Dario Sanfilippo";
+declare arctan2 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare arctan2 license "LGPL v3.0 license";
+arctan2(x) = ADAA2(EPS, f, F1, F2, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = atan(x_f);
+ F1(x_F1) = x_F1 * f(x_F1) - .5 * log(x_F1 ^ 2.0 + 1.0);
+ F2(x_F2) = .5 * x_F2 ^ 2.0 * f(x_F2) - x_F2 / 2.0 + .5 * f(x_F2);
+ };
+
+
+//-------`(aa.)asinh1`---------------------
+//
+// First-order ADAA asinh() saturator (unbounded).
+//
+// The domain of this function is ℝ; its theoretical range is ℝ.
+//
+// #### Usage
+// ```
+// _ : aa.asinh1 : _
+// ```
+//-------------------------------------------
+declare asinh1 author "Dario Sanfilippo";
+declare asinh1 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare asinh1 license "LGPL v3.0 license";
+asinh1(x) = ADAA1(EPS, f, F1, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = ma.asinh(x_f);
+ F1(x_F1) = x_F1 * f(x_F1) - sqrt(1.0 + x_F1 ^ 2.0) + const
+ with {
+ const = 1.0; // for F1(0) = 0 to minimise precision loss
+ };
+ };
+
+
+//-------`(aa.)asinh2`---------------------
+//
+// Second-order ADAA asinh() saturator (unbounded).
+//
+// The domain of this function is ℝ; its theoretical range is ℝ.
+//
+// #### Usage
+// ```
+// _ : aa.asinh2 : _
+// ```
+//-------------------------------------------
+declare asinh2 author "Dario Sanfilippo";
+declare asinh2 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare asinh2 license "LGPL v3.0 license";
+asinh2(x) = ADAA2(EPS, f, F1, F2, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = ma.asinh(x_f);
+ F1(x_F1) = x_F1 * f(x_F1) - sqrt(1.0 + x_F1 ^ 2.0) + const
+ with {
+ const = 1.0; // for F1(0) = 0 to minimise precision loss
+ };
+ F2(x_F2) = .25 * (2.0 * x_F2 ^ 2.0 * f(x_F2) + f(x_F2) -
+ sqrt(x_F2 ^ 2.0 + 1.0) * x_F2);
+ };
+
+
+//================= Trigonometry ===============
+// These functions are reliable if input signals are within their domains.
+//============================================
+
+
+//-------`(aa.)cosine1`---------------------
+//
+// First-order ADAA cos().
+//
+// The domain of this function is ℝ; its theoretical range is [-1.0; 1.0].
+//
+// #### Usage
+// ```
+// _ : aa.cosine1 : _
+// ```
+//-------------------------------------------
+declare cosine1 author "Dario Sanfilippo";
+declare cosine1 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare cosine1 license "LGPL v3.0 license";
+cosine1(x) = ADAA1(EPS, f, F1, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = cos(x_f);
+ F1(x_F1) = sin(x_F1);
+ };
+
+
+//-------`(aa.)cosine2`---------------------
+//
+// Second-order ADAA cos().
+//
+// The domain of this function is ℝ; its theoretical range is [-1.0; 1.0].
+//
+// #### Usage
+// ```
+// _ : aa.cosine2 : _
+// ```
+//-------------------------------------------
+declare cosine2 author "Dario Sanfilippo";
+declare cosine2 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare cosine2 license "LGPL v3.0 license";
+cosine2(x) = ADAA2(EPS, f, F1, F2, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = cos(x_f);
+ F1(x_F1) = sin(x_F1);
+ F2(x_F2) = x_F2 * sin(x_F2) + cos(x_F2);
+ };
+
+
+//-------`(aa.)arccos`---------------------
+//
+// First-order ADAA acos().
+//
+// The domain of this function is [-1.0; 1.0]; its theoretical range is
+// [π; 0.0].
+//
+// #### Usage
+// ```
+// _ : aa.arccos : _
+// ```
+//------------------------------------------
+declare arccos author "Dario Sanfilippo";
+declare arccos copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare arccos license "LGPL v3.0 license";
+arccos(x) = ADAA1(EPS, f, F1, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = Racos(x_f);
+ F1(x_F1) = x_F1 * f(x_F1) - Rsqrt(1.0 - x_F1 ^ 2.0) + const
+ with {
+ const = 1.0; // for F1(0) = 0 to minimise precision loss
+ };
+ };
+
+
+//-------`(aa.)arccos2`---------------------
+//
+// Second-order ADAA acos().
+//
+// The domain of this function is [-1.0; 1.0]; its theoretical range is
+// [π; 0.0].
+//
+// Note that this function is not accurate for low-amplitude or low-frequency
+// input signals. In that case, the first-order ADAA arccos() can be used.
+//
+// #### Usage
+// ```
+// _ : aa.arccos2 : _
+// ```
+//--------------------------------------------
+declare arccos2 author "Dario Sanfilippo";
+declare arccos2 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare arccos2 license "LGPL v3.0 license";
+arccos2(x) = ADAA2(EPS, f, F1, F2, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = Racos(x_f);
+ F1(x_F1) = x_F1 * f(x_F1) - Rsqrt(1.0 - x_F1 ^ 2.0) + const
+ with {
+ const = 1.0; // for F1(0) = 0 to minimise precision loss
+ };
+ F2(x_F2) = .25 * (2.0 * x_F2 ^ 2.0 * f(x_F2) + Rasin(x_F2) -
+ Rsqrt(1.0 - x_F2 ^ 2.0));
+ };
+
+
+//-------`(aa.)acosh1`---------------------
+//
+// First-order ADAA acosh().
+//
+// The domain of this function is ℝ >= 1.0; its theoretical range is ℝ >= 0.0.
+//
+// #### Usage
+// ```
+// _ : aa.acosh1 : _
+// ```
+//------------------------------------------
+declare acosh1 author "Dario Sanfilippo";
+declare acosh1 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare acosh1 license "LGPL v3.0 license";
+acosh1(x) = ADAA1(EPS, f, F1, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = Racosh(x_f);
+ F1(x_F1) = x_F1 * f(x_F1) - Rsqrt(x_F1 - 1.0) * Rsqrt(x_F1 + 1.0);
+ };
+
+
+//-------`(aa.)acosh2`---------------------
+//
+// Second-order ADAA acosh().
+//
+// The domain of this function is ℝ >= 1.0; its theoretical range is ℝ >= 0.0.
+//
+// Note that this function is not accurate for low-frequency input signals.
+// In that case, the first-order ADAA acosh() can be used.
+//
+// #### Usage
+// ```
+// _ : aa.acosh2 : _
+// ```
+//-------------------------------------------
+declare acosh2 author "Dario Sanfilippo";
+declare acosh2 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare acosh2 license "LGPL v3.0 license";
+acosh2(x) = ADAA2(EPS, f, F1, F2, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = Racosh(x_f);
+ F1(x_F1) = x_F1 * f(x_F1) - Rsqrt(x_F1 - 1.0) * Rsqrt(x_F1 + 1.0);
+ F2(x_F2) = .5 * x_F2 ^ 2.0 * f(x_F2) - .25 *
+ Rsqrt(x_F2 - 1.0) * Rsqrt(x_F2 + 1.0) * x_F2 -
+ .25 * Rlog(x_F2 + Rsqrt(x_F2 - 1.0) * Rsqrt(x_F2 + 1.0));
+ };
+
+
+//-------`(aa.)sine`---------------------
+//
+// First-order ADAA sin().
+//
+// The domain of this function is ℝ; its theoretical range is ℝ.
+//
+// #### Usage
+// ```
+// _ : aa.sine : _
+// ```
+//----------------------------------------
+declare sine author "Dario Sanfilippo";
+declare sine copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare sine license "LGPL v3.0 license";
+sine(x) = ADAA1(EPS, f, F1, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = sin(x_f);
+ F1(x_F1) = -1.0 * cos(x_F1);
+ };
+
+
+//-------`(aa.)sine2`---------------------
+//
+// Second-order ADAA sin().
+//
+// The domain of this function is ℝ; its theoretical range is ℝ.
+//
+// #### Usage
+// ```
+// _ : aa.sine2 : _
+// ```
+//----------------------------------------
+declare sine2 author "Dario Sanfilippo";
+declare sine2 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare sine2 license "LGPL v3.0 license";
+sine2(x) = ADAA2(EPS, f, F1, F2, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = sin(x_f);
+ F1(x_F1) = 1.0 - cos(x_F1);
+ F2(x_F2) = sin(x_F2) - x_F2 * cos(x_F2);
+ };
+
+
+//-------`(aa.)arcsin`---------------------
+//
+// First-order ADAA asin().
+//
+// The domain of this function is [-1.0, 1.0]; its theoretical range is
+// [-π/2.0; π/2.0].
+//
+// #### Usage
+// ```
+// _ : aa.arcsin : _
+// ```
+//------------------------------------------
+declare arcsin author "Dario Sanfilippo";
+declare arcsin copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare arcsin license "LGPL v3.0 license";
+arcsin(x) = ADAA1(EPS, f, F1, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = Rasin(x_f);
+ F1(x_F1) = x_F1 * f(x_F1) + Rsqrt(1.0 - x_F1 ^ 2.0) + const
+ with {
+ const = -1.0; // for F1(0) = 0 to minimise precision loss
+ };
+ };
+
+
+//-------`(aa.)arcsin2`---------------------
+//
+// Second-order ADAA asin().
+//
+// The domain of this function is [-1.0, 1.0]; its theoretical range is
+// [-π/2.0; π/2.0].
+//
+// Note that this function is not accurate for low-frequency input signals.
+// In that case, the first-order ADAA asin() can be used.
+//
+// #### Usage
+// ```
+// _ : aa.arcsin2 : _
+// ```
+//------------------------------------------
+declare arcsin2 author "Dario Sanfilippo";
+declare arcsin2 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare arcsin2 license "LGPL v3.0 license";
+arcsin2(x) = ADAA2(EPS, f, F1, F2, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = Rasin(x_f);
+ F1(x_F1) = x_F1 * f(x_F1) + Rsqrt(1.0 - x_F1 ^ 2.0) + const
+ with {
+ const = -1.0; // for F1(0) = 0 to minimise precision loss
+ };
+ F2(x_F2) = .25 * (Rsqrt(1.0 - x_F2 ^ 2.0) * x_F2 +
+ (2.0 * x_F2 ^ 2.0 - 1.0) * f(x_F2));
+ };
+
+
+//-------`(aa.)tangent`---------------------
+//
+// First-order ADAA tan().
+//
+// The domain of this function is [-π/2.0; π/2.0]; its theoretical range is ℝ.
+//
+// #### Usage
+// ```
+// _ : aa.tangent : _
+// ```
+//------------------------------------------
+declare tangent author "Dario Sanfilippo";
+declare tangent copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare tangent license "LGPL v3.0 license";
+tangent(x) = ADAA1(EPS, f, F1, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = Rtan(x_f);
+ F1(x_F1) = -1.0 * Rlog(cos(x_F1));
+ };
+
+
+//-------`(aa.)atanh1`---------------------
+//
+// First-order ADAA atanh().
+//
+// The domain of this function is ]-1.0; 1.0[; its theoretical range is ℝ.
+//
+// #### Usage
+// ```
+// _ : aa.atanh1 : _
+// ```
+//------------------------------------------
+declare atanh1 author "Dario Sanfilippo";
+declare atanh1 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare atanh1 license "LGPL v3.0 license";
+atanh1(x) = ADAA1(EPS, f, F1, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = Ratanh(x_f);
+ F1(x_F1) = .5 * Rlog(1.0 - x_F1 ^ 2.0) + x_F1 * f(x_F1);
+ };
+
+
+//-------`(aa.)atanh2`---------------------
+//
+// Second-order ADAA atanh().
+//
+// The domain of this function is ]-1.0; 1.0[; its theoretical range is ℝ.
+//
+// #### Usage
+// ```
+// _ : aa.atanh2 : _
+// ```
+//------------------------------------------
+declare atanh2 author "Dario Sanfilippo";
+declare atanh2 copyright "Copyright (C) 2021 Dario Sanfilippo
+ ";
+declare atanh2 license "LGPL v3.0 license";
+atanh2(x) = ADAA2(EPS, f, F1, F2, x)
+ with {
+ EPS = 1.0 / ma.SR;
+ f(x_f) = Ratanh(x_f);
+ F1(x_F1) = .5 * Rlog(1.0 - x_F1 ^ 2.0) + x_F1 * f(x_F1);
+ F2(x_F2) = .5 * x_F2 ^ 2.0 * f(x_F2) + x_F2 / 2.0 + .25 *
+ Rlog(1.0 - x_F2) - .25 * Rlog(1.0 + x_F2);
+ };
diff --git a/dist/examples/LIBRARIES/all.lib b/dist/examples/LIBRARIES/all.lib
new file mode 100644
index 00000000..6fb0574d
--- /dev/null
+++ b/dist/examples/LIBRARIES/all.lib
@@ -0,0 +1,36 @@
+//##################################### all.lib ##########################################
+// The purpose of this library is to give access to all the Faust standard libraries
+// from a single point.
+//########################################################################################
+
+import("aanl.lib");
+import("analyzers.lib");
+import("basics.lib");
+import("compressors.lib");
+import("delays.lib");
+import("demos.lib");
+import("dx7.lib");
+import("envelopes.lib");
+import("fds.lib");
+import("filters.lib");
+import("hoa.lib");
+import("interpolators.lib");
+import("maths.lib");
+import("mi.lib");
+import("misceffects.lib");
+import("oscillators.lib");
+import("noises.lib");
+import("phaflangers.lib");
+import("physmodels.lib");
+import("quantizers.lib");
+import("reducemaps.lib");
+import("reverbs.lib");
+import("routes.lib");
+import("signals.lib");
+import("soundfiles.lib");
+import("spats.lib");
+import("synths.lib");
+import("vaeffects.lib");
+import("version.lib");
+import("wdmodels.lib");
+import("webaudio.lib");
diff --git a/dist/examples/LIBRARIES/analyzers.lib b/dist/examples/LIBRARIES/analyzers.lib
new file mode 100644
index 00000000..cb79fd2a
--- /dev/null
+++ b/dist/examples/LIBRARIES/analyzers.lib
@@ -0,0 +1,981 @@
+//################################ analyzers.lib ##########################################
+// Analyzers library. Its official prefix is `an`.
+//
+// #### References
+// *
+//########################################################################################
+
+ma = library("maths.lib");
+ba = library("basics.lib");
+ro = library("routes.lib");
+si = library("signals.lib");
+fi = library("filters.lib");
+an = library("analyzers.lib"); // for compatible copy/paste out of this file
+
+declare name "Faust Analyzer Library";
+declare version "0.2";
+
+/************************************************************************
+FAUST library file, jos section
+
+Except where noted otherwise, The Faust functions below in this
+section are Copyright (C) 2003-2017 by Julius O. Smith III
+([jos](http://ccrma.stanford.edu/~jos/)), and released under the
+(MIT-style) [STK-4.3](#stk-4.3-license) license.
+
+All MarkDown comments in this section is Copyright 2016-2017 by Romain
+Michon and Julius O. Smith III, and is released under the
+[CCA4I](https://creativecommons.org/licenses/by/4.0/) license (TODO: if/when Romain agrees)
+
+************************************************************************/
+
+//==============================Amplitude Tracking========================================
+//========================================================================================
+
+//------------------`(an.)abs_envelope_rect`-----------------------------------
+// Absolute value average with moving-average algorithm.
+//
+// #### Usage
+//
+// ```
+// _ : abs_envelope_rect(period) : _
+// ```
+//
+// Where:
+//
+// * `period`: sets the averaging frame in seconds
+//-----------------------------------------------------------------------------
+declare abs_envelope_rect author "Dario Sanfilippo and Julius O. Smith III";
+declare abs_envelope_rect copyright "Copyright (C) 2020 Dario Sanfilippo
+ and
+ 2003-2020 by Julius O. Smith III ";
+declare abs_envelope_rect license "MIT-style STK-4.3 license";
+abs_envelope_rect(period, x) = abs(x) : fi.avg_rect(period);
+
+
+//------------------`(an.)abs_envelope_tau`------------------------------------
+// Absolute value average with one-pole lowpass and tau response.
+// (See filters.lib.)
+//
+// #### Usage
+//
+// ```
+// _ : abs_envelope_tau(period) : _
+// ```
+//
+// Where:
+//
+// * `period`: (time to decay by 1/e) sets the averaging frame in secs
+//-----------------------------------------------------------------------------
+declare abs_envelope_tau author "Dario Sanfilippo and Julius O. Smith III";
+declare abs_envelope_tau copyright "Copyright (C) 2020 Dario Sanfilippo
+ and
+ 2003-2020 by Julius O. Smith III ";
+declare abs_envelope_tau license "MIT-style STK-4.3 license";
+abs_envelope_tau(period, x) = abs(x) : fi.avg_tau(period);
+
+
+//------------------`(an.)abs_envelope_t60`------------------------------------
+// Absolute value average with one-pole lowpass and t60 response.
+// (See filters.lib.)
+//
+// #### Usage
+//
+// ```
+// _ : abs_envelope_t60(period) : _
+// ```
+//
+// Where:
+//
+// * `period`: (time to decay by 60 dB) sets the averaging frame in secs
+//-----------------------------------------------------------------------------
+declare abs_envelope_t60 author "Dario Sanfilippo and Julius O. Smith III";
+declare abs_envelope_t60 copyright "Copyright (C) 2020 Dario Sanfilippo
+ and
+ 2003-2020 by Julius O. Smith III ";
+declare abs_envelope_t60 license "MIT-style STK-4.3 license";
+abs_envelope_t60(period, x) = abs(x) : fi.avg_t60(period);
+
+
+//------------------`(an.)abs_envelope_t19`------------------------------------
+// Absolute value average with one-pole lowpass and t19 response.
+// (See filters.lib.)
+//
+// #### Usage
+//
+// ```
+// _ : abs_envelope_t19(period) : _
+// ```
+//
+// Where:
+//
+// * `period`: (time to decay by 1/e^2.2) sets the averaging frame in secs
+//-----------------------------------------------------------------------------
+declare abs_envelope_t19 author "Dario Sanfilippo and Julius O. Smith III";
+declare abs_envelope_t19 copyright "Copyright (C) 2020 Dario Sanfilippo
+ and
+ 2003-2020 by Julius O. Smith III ";
+declare abs_envelope_t19 license "MIT-style STK-4.3 license";
+abs_envelope_t19(period, x) = abs(x) : fi.avg_t19(period);
+
+
+//---------------------------`(an.)amp_follower`---------------------------
+// Classic analog audio envelope follower with infinitely fast rise and
+// exponential decay. The amplitude envelope instantaneously follows
+// the absolute value going up, but then floats down exponentially.
+//
+// `amp_follower` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : amp_follower(rel) : _
+// ```
+//
+// Where:
+//
+// * `rel`: release time = amplitude-envelope time-constant (sec) going down
+//
+// #### References
+//
+// * Musical Engineer's Handbook, Bernie Hutchins, Ithaca NY
+// * 1975 Electronotes Newsletter, Bernie Hutchins
+//------------------------------------------------------------
+amp_follower(rel) = abs : env with {
+ p = ba.tau2pole(rel);
+ env(x) = x * (1.0 - p) : (+ : max(x,_)) ~ *(p);
+};
+
+peak_envelope = amp_follower; // Synonym for more standard naming
+
+
+//---------------------------`(an.)amp_follower_ud`---------------------------
+// Envelope follower with different up and down time-constants
+// (also called a "peak detector").
+//
+// #### Usage
+//
+// ```
+// _ : amp_follower_ud(att,rel) : _
+// ```
+//
+// Where:
+//
+// * `att`: attack time = amplitude-envelope time constant (sec) going up
+// * `rel`: release time = amplitude-envelope time constant (sec) going down
+//
+// #### Note
+//
+// We assume rel >> att. Otherwise, consider rel ~ max(rel,att).
+// For audio, att is normally faster (smaller) than rel (e.g., 0.001 and 0.01).
+// Use `amp_follower_ar` below to remove this restriction.
+//
+// #### Reference
+//
+// * "Digital Dynamic Range Compressor Design --- A Tutorial and Analysis", by
+// Dimitrios Giannoulis, Michael Massberg, and Joshua D. Reiss
+//
+//------------------------------------------------------------
+amp_follower_ud(att,rel) = amp_follower(rel) : si.smooth(ba.tau2pole(att));
+
+
+//---------------`(an.)amp_follower_ar`----------------
+// Envelope follower with independent attack and release times. The
+// release can be shorter than the attack (unlike in `amp_follower_ud`
+// above).
+//
+// #### Usage
+//
+// ```
+// _ : amp_follower_ar(att,rel) : _
+// ```
+//
+// Where:
+//
+// * `att`: attack time = amplitude-envelope time constant (sec) going up
+// * `rel`: release time = amplitude-envelope time constant (sec) going down
+//
+//---------------------------------------------------------
+declare amp_follower_ar author "Jonatan Liljedahl, revised by Romain Michon";
+amp_follower_ar(att,rel) = abs : si.onePoleSwitching(att,rel);
+
+
+//------------------`(an.)ms_envelope_rect`------------------------------------
+// Mean square with moving-average algorithm.
+//
+// #### Usage
+//
+// ```
+// _ : ms_envelope_rect(period) : _
+// ```
+//
+// Where:
+//
+// * `period`: sets the averaging frame in secs
+//-----------------------------------------------------------------------------
+declare ms_envelope_rect author "Dario Sanfilippo and Julius O. Smith III";
+declare ms_envelope_rect copyright "Copyright (C) 2020 Dario Sanfilippo
+ and
+ 2003-2020 by Julius O. Smith III ";
+declare ms_envelope_rect license "MIT-style STK-4.3 license";
+ms_envelope_rect(period, x) = x * x : fi.avg_rect(period);
+
+
+//------------------`(an.)ms_envelope_tau`-------------------------------------
+// Mean square average with one-pole lowpass and tau response.
+// (see `filters.lib`)
+//
+// #### Usage
+//
+// ```
+// _ : ms_envelope_tau(period) : _
+// ```
+//
+// Where:
+//
+// * `period`: (time to decay by 1/e) sets the averaging frame in secs
+//-----------------------------------------------------------------------------
+declare ms_envelope_tau author "Dario Sanfilippo and Julius O. Smith III";
+declare ms_envelope_tau copyright "Copyright (C) 2020 Dario Sanfilippo
+ and
+ 2003-2020 by Julius O. Smith III ";
+declare ms_envelope_tau license "MIT-style STK-4.3 license";
+ms_envelope_tau(period, x) = x * x : fi.avg_tau(period);
+
+
+//------------------`(an.)ms_envelope_t60`-------------------------------------
+// Mean square with one-pole lowpass and t60 response.
+// (see `filters.lib`)
+//
+// #### Usage
+//
+// ```
+// _ : ms_envelope_t60(period) : _
+// ```
+//
+// Where:
+//
+// * `period`: (time to decay by 60 dB) sets the averaging frame in secs
+//-----------------------------------------------------------------------------
+declare ms_envelope_t60 author "Dario Sanfilippo and Julius O. Smith III";
+declare ms_envelope_t60 copyright "Copyright (C) 2020 Dario Sanfilippo
+ and
+ 2003-2020 by Julius O. Smith III ";
+declare ms_envelope_t60 license "MIT-style STK-4.3 license";
+ms_envelope_t60(period, x) = x * x : fi.avg_t60(period);
+
+
+//------------------`(an.)ms_envelope_t19`-------------------------------------
+// Mean square with one-pole lowpass and t19 response.
+// (see `filters.lib`)
+//
+// #### Usage
+//
+// ```
+// _ : ms_envelope_t19(period) : _
+// ```
+//
+// Where:
+//
+// * `period`: (time to decay by 1/e^2.2) sets the averaging frame in secs
+//-----------------------------------------------------------------------------
+declare ms_envelope_t19 author "Dario Sanfilippo and Julius O. Smith III";
+declare ms_envelope_t19 copyright "Copyright (C) 2020 Dario Sanfilippo
+ and
+ 2003-2020 by Julius O. Smith III ";
+declare ms_envelope_t19 license "MIT-style STK-4.3 license";
+ms_envelope_t19(period, x) = x * x : fi.avg_t19(period);
+
+
+//------------------`(an.)rms_envelope_rect`-----------------------------------
+// Root mean square with moving-average algorithm.
+//
+// #### Usage
+//
+// ```
+// _ : rms_envelope_rect(period) : _
+// ```
+//
+// Where:
+//
+// * `period`: sets the averaging frame in secs
+//-----------------------------------------------------------------------------
+declare rms_envelope_rect author "Dario Sanfilippo and Julius O. Smith III";
+declare rms_envelope_rect copyright "Copyright (C) 2020 Dario Sanfilippo
+ and
+ 2003-2020 by Julius O. Smith III ";
+declare rms_envelope_rect license "MIT-style STK-4.3 license";
+rms_envelope_rect(period, x) = ms_envelope_rect(period, x) : sqrt;
+
+
+//------------------`(an.)rms_envelope_tau`------------------------------------
+// Root mean square with one-pole lowpass and tau response.
+// (see `filters.lib`)
+//
+// #### Usage
+//
+// ```
+// _ : rms_envelope_tau(period) : _
+// ```
+//
+// Where:
+//
+// * `period`: (time to decay by 1/e) sets the averaging frame in secs
+//-----------------------------------------------------------------------------
+declare rms_envelope_tau author "Dario Sanfilippo and Julius O. Smith III";
+declare rms_envelope_tau copyright "Copyright (C) 2020 Dario Sanfilippo
+ and
+ 2003-2020 by Julius O. Smith III ";
+declare rms_envelope_tau license "MIT-style STK-4.3 license";
+rms_envelope_tau(period, x) = ms_envelope_tau(period, x) : sqrt;
+
+
+//------------------`(an.)rms_envelope_t60`------------------------------------
+// Root mean square with one-pole lowpass and t60 response.
+// (see `filters.lib`)
+//
+// #### Usage
+//
+// ```
+// _ : rms_envelope_t60(period) : _
+// ```
+//
+// Where:
+//
+// * `period`: (time to decay by 60 dB) sets the averaging frame in secs
+//-----------------------------------------------------------------------------
+declare rms_envelope_t60 author "Dario Sanfilippo and Julius O. Smith III";
+declare rms_envelope_t60 copyright "Copyright (C) 2020 Dario Sanfilippo
+ and
+ 2003-2020 by Julius O. Smith III ";
+declare rms_envelope_t60 license "MIT-style STK-4.3 license";
+rms_envelope_t60(period, x) = ms_envelope_t60(period, x) : sqrt;
+
+
+//------------------`(an.)rms_envelope_t19`------------------------------------
+// Root mean square with one-pole lowpass and t19 response.
+// (see `filters.lib`)
+//
+// #### Usage
+//
+// ```
+// _ : rms_envelope_t19(period) : _
+// ```
+//
+// Where:
+//
+// * `period`: (time to decay by 1/e^2.2) sets the averaging frame in secs
+//-----------------------------------------------------------------------------
+declare rms_envelope_t19 author "Dario Sanfilippo and Julius O. Smith III";
+declare rms_envelope_t19 copyright "Copyright (C) 2020 Dario Sanfilippo
+ and
+ 2003-2020 by Julius O. Smith III ";
+declare rms_envelope_t19 license "MIT-style STK-4.3 license";
+rms_envelope_t19(period, x) = ms_envelope_t19(period, x) : sqrt;
+
+
+//-----------------------`(an.)zcr`--------------------------------------------
+// Zero-crossing rate (ZCR) with one-pole lowpass averaging based on the tau
+// constant. It outputs an index between 0 and 1 at a desired analysis frame.
+// The ZCR of a signal correlates with the noisiness [Gouyon et al. 2000] and
+// the spectral centroid [Herrera-Boyer et al. 2006] of a signal.
+// For sinusoidal signals, the ZCR can be multiplied by ma.SR/2 and used
+// as a frequency detector. For example, it can be deployed as a
+// computationally efficient adaptive mechanism for automatic Larsen
+// suppression.
+//
+// #### Usage
+//
+// ```
+// _ : zcr(tau) : _
+// ```
+//
+// Where:
+//
+// * `tau`: (time to decay by e^-1) sets the averaging frame in seconds.
+declare zcr author "Dario Sanfilippo";
+declare zcr copyright "Copyright (C) 2020 Dario Sanfilippo
+ ";
+declare zcr license "MIT-style STK-4.3 license";
+zcr(period, x) = ma.zc(x) : fi.lptau(period);
+
+
+//==============================================================================
+// Adaptive Frequency Analysis
+//==============================================================================
+
+//--------------------`(an.)pitchTracker`---------------------------------------
+//
+// This function implements a pitch-tracking algorithm by means of
+// zero-crossing rate analysis and adaptive low-pass filtering. The design
+// is based on the algorithm described in [this tutorial (section 2.2)](https://pdfslide.net/documents/faust-tutorial2.html).
+//
+// #### Usage
+//
+// ```
+// _ : pitchTracker(N, tau) : _
+// ```
+//
+// Where:
+//
+// * `N`: compile-time constant, sets the order of the low-pass filter, which
+// determines the sensitivity of the algorithm for signals where partials are
+// stronger than the fundamental frequency.
+// * `tau`: response time in seconds based on exponentially-weighted averaging with tau time-constant. See .
+declare pitchTracker author "Dario Sanfilippo";
+declare pitchTracker copyright "Copyright (C) 2022 Dario Sanfilippo
+ ";
+declare pitchTracker license "MIT License";
+pitchTracker(N, t, x) = loop ~ _
+ with {
+ xHighpassed = fi.highpass(1, 20.0, x);
+ loop(y) = an.zcr(t, fi.lowpass(N, max(20.0, y), xHighpassed)) * ma.SR * .5;
+ };
+
+
+//--------------------`(an.)spectralCentroid`-----------------------------------
+//
+// This function implements a time-domain spectral centroid by means of RMS
+// measurements and adaptive crossover filtering. The weight difference of the
+// upper and lower spectral powers are used to recursively adjust the crossover
+// cutoff so that the system (minimally) oscillates around a balancing point.
+//
+// Unlike block processing techniques such as FFT, this algorithm provides
+// continuous measurements and fast response times. Furthermore, when providing
+// input signals that are spectrally sparse, the algorithm will output a
+// logarithmic measure of the centroid, which is perceptually desirable for
+// musical applications. For example, if the input signal is the combination
+// of three tones at 1000, 2000, and 4000 Hz, the centroid will be the middle
+// octave.
+//
+// #### Usage
+//
+// ```
+// _ : spectralCentroid(nonlinearity, tau) : _
+// ```
+//
+// Where:
+//
+// * `nonlinearity`: a boolean to activate or deactivate nonlinear integration. The
+// nonlinear function is useful to improve stability with very short response times
+// such as .001 <= tau <= .005 , otherwise, the nonlinearity may reduce precision.
+// * `tau`: response time in seconds based on exponentially-weighted averaging with tau time-constant. See .
+//
+// #### Reference:
+// Sanfilippo, D. (2021). Time-Domain Adaptive Algorithms for Low- and High-Level
+// Audio Information Processing. Computer Music Journal, 45(1), 24-38.
+//
+// #### Example:
+//
+// `process = os.osc(500) + os.osc(1000) + os.osc(2000) + os.osc(4000) + os.osc(8000) : an.spectralCentroid(1, .001);`
+//
+declare spectralCentroid author "Dario Sanfilippo";
+declare spectralCentroid copyright "Copyright (C) 2022 Dario Sanfilippo
+ ";
+declare spectralCentroid license "MIT License";
+spectralCentroid(nonlinearity, t, x) = loop ~ _
+ with {
+ loop(fb) = centroid
+ with {
+ w(cf) = 2.0 * ma.PI * cf * ma.T;
+ integrator(t, x) = fi.pole(1.0, x * (1.0 / max(ma.EPSILON, t)) * ma.T);
+ lowpass(cf, x) = y
+ letrec {
+ 'y = (x - s) * G + s;
+ 's = 2 * (x - s) * G + s;
+ }
+ with {
+ G = tan(w(cf) / 2.0) / (1.0 + tan(w(cf) / 2.0));
+ };
+ highpass(cf, x) = x - lowpass(cf, x);
+ xRMS = an.rms_envelope_tau(t, x);
+ xLRMS = an.rms_envelope_tau(t, lowpass(fb, x));
+ xHRMS = an.rms_envelope_tau(t, highpass(fb, x));
+ diffRMS = (xHRMS - xLRMS) / max(ma.EPSILON, xRMS);
+ nonlinearIntegration = ba.if(nonlinearity, pow(diffRMS, 3), diffRMS);
+ diffInt = max(.0, min(1.0, integrator(t, nonlinearIntegration)));
+ centroid = max(20.0, diffInt * ma.SR * .5);
+ };
+ };
+
+
+//=============================Spectrum-Analyzers=========================================
+// Spectrum-analyzers split the input signal into a bank of parallel signals, one for
+// each spectral band. They are related to the Mth-Octave Filter-Banks in `filters.lib`.
+// The documentation of this library contains more details about the implementation.
+// The parameters are:
+//
+// * `M`: number of band-slices per octave (>1)
+// * `N`: total number of bands (>2)
+// * `ftop` = upper bandlimit of the Mth-octave bands (
+//========================================================================================
+
+
+//-------------------------`(an.)mth_octave_analyzer`----------------------------
+// Octave analyzer.
+// `mth_octave_analyzer[N]` are standard Faust functions.
+//
+// #### Usage
+// ```
+// _ : mth_octave_analyzer(O,M,ftop,N) : par(i,N,_) // Oth-order Butterworth
+// _ : mth_octave_analyzer6e(M,ftop,N) : par(i,N,_) // 6th-order elliptic
+// ```
+//
+// Also for convenience:
+//
+// ```
+// _ : mth_octave_analyzer3(M,ftop,N) : par(i,N,_) // 3d-order Butterworth
+// _ : mth_octave_analyzer5(M,ftop,N) : par(i,N,_) // 5th-order Butterworth
+// mth_octave_analyzer_default = mth_octave_analyzer6e;
+// ```
+//
+// Where:
+//
+// * `O`: order of filter used to split each frequency band into two
+// * `M`: number of band-slices per octave
+// * `ftop`: highest band-split crossover frequency (e.g., 20 kHz)
+// * `N`: total number of bands (including dc and Nyquist)
+//------------------------------------------------------------
+mth_octave_analyzer6e(M,ftop,N) = _ <: bsplit(N-1) with {
+ fc(n) = ftop * 2^(float(n-N+1)/float(M)); // -3dB crossover frequencies
+ lp(n) = fi.lowpass6e(fc(n)); // 6th-order elliptic - see other choices above
+ hp(n) = fi.highpass6e(fc(n)); // (search for lowpass* and highpass*)
+ bsplit(0) = _;
+ bsplit(i) = hp(i), (lp(i) <: bsplit(i-1));
+};
+
+// Butterworth analyzers may be cascaded with allpass
+// delay-equalizers to make (allpass-complementary) filter banks:
+
+mth_octave_analyzer(O,M,ftop,N) = _ <: bsplit(N-1) with {
+ fc(n) = ftop * 2^(float(n-N+1)/float(M));
+ lp(n) = fi.lowpass(O,fc(n)); // Order O Butterworth
+ hp(n) = fi.highpass(O,fc(n));
+ bsplit(0) = _;
+ bsplit(i) = hp(i), (lp(i) <: bsplit(i-1));
+};
+
+mth_octave_analyzer3(M,ftop,N) = mth_octave_analyzer(3,M,ftop,N);
+mth_octave_analyzer5(M,ftop,N) = mth_octave_analyzer(5,M,ftop,N);
+mth_octave_analyzer_default = mth_octave_analyzer6e; // default analyzer
+
+
+//============================Mth-Octave Spectral Level===================================
+// Spectral Level: Display (in bar graphs) the average signal level in each spectral band.
+//========================================================================================
+
+
+//------------------------`(an.)mth_octave_spectral_level6e`-------------------------
+// Spectral level display.
+//
+// #### Usage:
+//
+// ```
+// _ : mth_octave_spectral_level6e(M,ftop,NBands,tau,dB_offset) : _
+// ```
+//
+// Where:
+//
+// * `M`: bands per octave
+// * `ftop`: lower edge frequency of top band
+// * `NBands`: number of passbands (including highpass and dc bands),
+// * `tau`: spectral display averaging-time (time constant) in seconds,
+// * `dB_offset`: constant dB offset in all band level meters.
+//
+// Also for convenience:
+//
+// ```
+// mth_octave_spectral_level_default = mth_octave_spectral_level6e;
+// spectral_level = mth_octave_spectral_level(2,10000,20);
+// ```
+//------------------------------------------------------------
+mth_octave_spectral_level6e(M,ftop,N,tau,dB_offset) = _<:
+ _,mth_octave_analyzer6e(M,ftop,N) :
+ _,(display:>_):attach with {
+ display = par(i,N,dbmeter(i));
+ dbmeter(i) = abs : si.smooth(ba.tau2pole(tau)) : max(ma.EPSILON) : ba.linear2db : +(dB_offset) :
+ meter(N-i-1);
+ meter(i) = speclevel_group(vbargraph("[%2i] [unit:dB]
+ [tooltip: Spectral Band Level in dB]", -50, 10));
+ O = int(((N-2)/M)+0.4999);
+ speclevel_group(x) = hgroup("[0] CONSTANT-Q SPECTRUM ANALYZER (6E), %N bands spanning
+ LP, %O octaves below %ftop Hz, HP
+ [tooltip: See Faust's filters.lib for documentation and references]", x);
+};
+
+mth_octave_spectral_level_default = mth_octave_spectral_level6e;
+spectral_level = mth_octave_spectral_level(2,10000,20); // simple default
+
+
+//---------------`(an.)[third|half]_octave_[analyzer|filterbank]`----------------
+// A bunch of special cases based on the different analyzer functions described above:
+//
+// ```
+// third_octave_analyzer(N) = mth_octave_analyzer_default(3,10000,N);
+// third_octave_filterbank(N) = mth_octave_filterbank_default(3,10000,N);
+// half_octave_analyzer(N) = mth_octave_analyzer_default(2,10000,N);
+// half_octave_filterbank(N) = mth_octave_filterbank_default(2,10000,N);
+// octave_filterbank(N) = mth_octave_filterbank_default(1,10000,N);
+// octave_analyzer(N) = mth_octave_analyzer_default(1,10000,N);
+// ```
+//
+// #### Usage
+//
+// See `mth_octave_spectral_level_demo` in `demos.lib`.
+//------------------------------------------------------------
+third_octave_analyzer(N) = mth_octave_analyzer_default(3,10000,N);
+third_octave_filterbank(N) = mth_octave_filterbank_default(3,10000,N);
+// Third-Octave Filter-Banks have been used in audio for over a century.
+// See, e.g.,
+// Acoustics [the book], by L. L. Beranek
+// Amer. Inst. Physics for the Acoustical Soc. America,
+//
+
+// Third-octave bands across the audio spectrum are too wide for current
+// typical computer screens, so half-octave bands are the default:
+half_octave_analyzer(N) = mth_octave_analyzer_default(2,10000,N);
+half_octave_filterbank(N) = mth_octave_filterbank_default(2,10000,N);
+
+octave_filterbank(N) = mth_octave_filterbank_default(1,10000,N);
+octave_analyzer(N) = mth_octave_analyzer_default(1,10000,N);
+
+
+//===============Arbritary-Crossover Filter-Banks and Spectrum Analyzers==================
+// These are similar to the Mth-octave analyzers above, except that the
+// band-split frequencies are passed explicitly as arguments.
+//========================================================================================
+
+// ACKNOWLEDGMENT
+// Technique for processing a variable number of signal arguments due
+// to Yann Orlarey (as is the entire Faust framework!)
+
+//---------------`(an.)analyzer`--------------------------
+// Analyzer.
+//
+// #### Usage
+//
+// ```
+// _ : analyzer(O,freqs) : par(i,N,_) // No delay equalizer
+// ```
+//
+// Where:
+//
+// * `O`: band-split filter order (ODD integer required for filterbank[i])
+// * `freqs`: (fc1,fc2,...,fcNs) [in numerically ascending order], where
+// Ns=N-1 is the number of octave band-splits
+// (total number of bands N=Ns+1).
+//
+// If frequencies are listed explicitly as arguments, enclose them in parens:
+//
+// ```
+// _ : analyzer(3,(fc1,fc2)) : _,_,_
+// ```
+//---------------------------------------------------
+analyzer(O,lfreqs) = _ <: bsplit(nb)
+with {
+ nb = ba.count(lfreqs);
+ fc(n) = ba.take(n, lfreqs);
+ lp(n) = fi.lowpass(O,fc(n));
+ hp(n) = fi.highpass(O,fc(n));
+ bsplit(0) = _;
+ bsplit(i) = hp(i), (lp(i) <: bsplit(i-1));
+};
+
+//================ Fast Fourier Transform (fft) and its Inverse (ifft) ===================
+// Sliding FFTs that compute a rectangularly windowed FFT each sample.
+//========================================================================================
+
+//---------------`(an.)goertzelOpt` --------------------------
+// Optimized Goertzel filter.
+//
+// #### Usage
+//
+// ```
+// _ : goertzelOpt(freq,n) : _
+// ```
+//
+// Where:
+//
+// * `freq`: frequency to be analyzed
+// * `n`: the Goertzel block size
+//
+// #### Reference
+//
+// *
+//---------------------------------------------------
+goertzelOpt(freq,n,x) = mg
+with {
+ mg = sqrt(eq^2 + eq'^2-eq*eq'*c) : ba.sAndH(reset0); // magnitude
+ cnt = ba.time%n; // counter for windowing
+ reset0 = cnt == (n-1); // reset when end of window
+ reset1 = 1-(cnt == 0); // reset when beginning of window
+ k = 0.5 + n*freq/ma.SR;
+ w = (2*ma.PI/n)*k;
+ c = 2*cos(w);
+ eq = s // equation
+ letrec{
+ 's = c*s*reset1 - s'*reset1*reset1' + x;
+ };
+};
+
+//---------------`(an.)goertzelComp` --------------------------
+// Complex Goertzel filter.
+//
+// #### Usage
+//
+// ```
+// _ : goertzelComp(freq,n) : _
+// ```
+//
+// Where:
+//
+// * `freq`: frequency to be analyzed
+// * `n`: the Goertzel block size
+//
+// #### Reference
+//
+// *
+//---------------------------------------------------
+goertzelComp(freq,n,x) = mg
+with {
+ mg = sqrt(real^2 + imag^2); // magnitude
+ cnt = ba.time%n; // counter for windowing
+ reset0 = cnt == (n-1); // reset when end of window
+ reset1 = 1-(cnt == 0); // reset when beginning of window
+ k = 0.5 + n*freq/ma.SR;
+ w = (2*ma.PI/n)*k;
+ sine = sin(w);
+ cosine = cos(w);
+ c = 2*cosine;
+ eq = s
+ letrec{
+ 's = c*s*reset1 - s'*reset1*reset1' + x;
+ };
+ real = eq - eq'*cosine;
+ imag = eq'*sine;
+};
+
+//---------------`(an.)goertzel` --------------------------
+// Same as [`goertzelOpt`](#goertzelopt).
+//
+// #### Usage
+//
+// ```
+// _ : goertzel(freq,n) : _
+// ```
+//
+// Where:
+//
+// * `freq`: frequency to be analyzed
+// * `n`: the Goertzel block size
+//
+// #### Reference
+//
+// *
+//---------------------------------------------------
+goertzel = goertzelOpt;
+
+// Undocumented utility functions used by fft and ifft:
+c_magsq(N) = si.cbus(N) : par(i,N,(par(j,2,abs<:_*_):>_)) :> si.bus(N);
+c_magdb(N) = si.cbus(N) : an.c_magsq(N) : par(i,N,(max(ma.EPSILON):log10:*(10.0)));
+c_select_pos_freqs(2) = (_,_), (_,_); // both dc and SR/2 included with "positive frequencies"
+c_select_pos_freqs(N) = si.cbus(N) : par(i,N/2+1,(_,_)),par(i,N/2-1,(!,!)) : si.cbus(N/2+1); // for complex spectra
+ select_pos_freqs(2) = _,_; // both dc and SR/2 included
+ select_pos_freqs(N) = si.bus(N) : par(i,N/2+1, _), par(i,N/2-1, !) : si. bus(N/2+1); // real power spectra etc.
+
+rtorv(N,x) = par(i,N,x@i); // convert real scalar signal to length N real vector
+rtocv(N,x) = par(i,N,(x@i,0)); // convert real scalar signal to length N complex vector with 0 imag part
+rvtocv(N) = si.bus(N), par(i,N,0) : ro.interleave(N,2); // convert real N-vector to complex with 0 imag part
+
+bit_reverse_selector(N,0) = 0;
+bit_reverse_selector(N,i) = int(int(N)>>1)*(i&1) + bit_reverse_selector(int(N)>>1,(i>>1));
+
+// decimation in time does this to the input:
+bit_reverse_shuffle(N) = si.bus(N) <: par(i,N,bit_reverse_permuter(N,i)) with {
+ bit_reverse_permuter(N,k) = ba.selector(bit_reverse_selector(N,k),N);
+};
+
+c_bit_reverse_shuffle(N) = si.cbus(N) <: par(i,N,c_bit_reverse_permuter(N,i)) with {
+ c_bit_reverse_permuter(N,k) = ba.cselector(bit_reverse_selector(N,k),N);
+};
+
+
+//---------------`(an.)fft` --------------------------
+// Fast Fourier Transform (FFT).
+//
+// #### Usage
+//
+// ```
+// si.cbus(N) : fft(N) : si.cbus(N)
+// ```
+//
+// Where:
+//
+// * `si.cbus(N)` is a bus of N complex signals, each specified by real and imaginary parts:
+// (r0,i0), (r1,i1), (r2,i2), ...
+// * `N` is the FFT size (must be a power of 2: 2,4,8,16,... known at compile time)
+// * `fft(N)` performs a length `N` FFT for complex signals (radix 2)
+// * The output is a bank of N complex signals containing the complex spectrum over time:
+// (R0, I0), (R1,I1), ...
+// - The dc component is (R0,I0), where I0=0 for real input signals.
+//
+// FFTs of Real Signals:
+//
+// * To perform a sliding FFT over a real input signal, you can say
+// ```
+// process = signal : an.rtocv(N) : an.fft(N);
+// ```
+// where `an.rtocv` converts a real (scalar) signal to a complex vector signal having a zero imaginary part.
+//
+// * See `an.rfft_analyzer_c` (in `analyzers.lib`) and related functions for more detailed usage examples.
+//
+// * Use `an.rfft_spectral_level(N,tau,dB_offset)` to display the power spectrum of a real signal.
+//
+// * See `dm.fft_spectral_level_demo(N)` in `demos.lib` for an example GUI driving `an.rfft_spectral_level()`.
+//
+// #### Reference
+//
+// * [Decimation-in-time (DIT) Radix-2 FFT](https://cnx.org/contents/zmcmahhR@7/Decimation-in-time-DIT-Radix-2)
+//
+//---------------------------------------------------
+fft(N) = si.cbus(N) : an.c_bit_reverse_shuffle(N) : an.fftb(N); // shuffle off to the butterflies:
+fftb(1) = _,_; // each complex number is represented as (real,imag)
+fftb(N) = si.cbus(N) : (fftb(No2) <: (si.cbus(No2), si.cbus(No2))), (fftb(No2)
+ <: (si.cbus(N):twiddleOdd(N))) :> si.cbus(N)
+with {
+ No2 = int(N)>>1;
+ // Half of these multiplies can go away since w(k) = - w(k+N/2), and others as well (1,j,-j,-1,...)
+ twiddleOdd(N) = par(k,N,si.cmul(cos(w(k)),0-sin(w(k))))
+ with {
+ w(k) = 2.0*ma.PI*float(k)/float(N);
+ };
+};
+
+// `rfft`
+// Slow to compile: rfft(N) = si.bus(N) : an.bit_reverse_shuffle(N) : an.rvtocv(N) : an.fftb(N);
+// Order of magnitude faster to compile but takes a scalar input, so too different from fft:
+// rfft(N) = an.rtocv(N) : an.fft(N);
+
+//---------------`(an.)ifft`--------------------------
+// Inverse Fast Fourier Transform (IFFT).
+//
+// #### Usage
+//
+// ```
+// si.cbus(N) : ifft(N) : si.cbus(N)
+// ```
+//
+// Where:
+//
+// * N is the IFFT size (power of 2)
+// * Input is a complex spectrum represented as interleaved real and imaginary parts:
+// (R0, I0), (R1,I1), (R2,I2), ...
+// * Output is a bank of N complex signals giving the complex signal in the time domain:
+// (r0, i0), (r1,i1), (r2,i2), ...
+//---------------------------------------------------
+ifft(N) = si.cbus(N) : an.c_bit_reverse_shuffle(N) : an.ifftb(N); // input is shuffled off to the butterflies:
+ifftb(1) = _,_;
+ifftb(N) = si.cbus(N) : (ifftb(No2) <: (si.cbus(No2), si.cbus(No2))), (ifftb(No2)
+ <: (si.cbus(N):twiddleOddConj(N))) :> si.cbus(N) : par(i,2*N,/(2.0))
+with {
+ No2 = int(N)>>1;
+ // Half of these multiplies can go away since w(k) = - w(k+N/2), and others as well (1,j,-j,-1,...)
+ twiddleOddConj(N) = par(k,N,si.cmul(cos(w(k)),sin(w(k))))
+ with {
+ w(k) = 2.0*ma.PI*float(k)/float(N);
+ };
+};
+
+
+// ========== FFT Analyzers ==========
+rfft_analyzer_c(N) = an.rtocv(N) : an.fft(N) : an.c_select_pos_freqs(N); // complex spectral bins 0 to N/2
+rfft_analyzer_db(N) = an.rfft_analyzer_c(N) : an.c_magdb(N/2+1); // assumes real input
+rfft_analyzer_magsq(N) = an.rfft_analyzer_c(N) : an.c_magsq(N/2+1); // assumes real input
+
+rfft_spectral_level(N,tau,dB_offset) = _<: _, an.rfft_analyzer_db(N) : _,(display:>_):attach with {
+ display = par(i,N/2+1,dbmeter(i));
+ dbmeter(i) = si.smooth(ba.tau2pole(tau)) : +(dB_offset) : meter(i);
+ meter(i) = speclevel_group(vbargraph("[%2i] [unit:dB]
+ [tooltip: FFT Spectral Band Level in dB]", -50, 10));
+ speclevel_group(x) = hgroup("[0] FFT SPECTRUM ANALYZER, %N bands
+ [tooltip: fft_spectral_level in Faust's analyzers.lib]", x);
+};
+
+// end jos section
+/************************************************************************
+************************************************************************
+FAUST library file, GRAME section
+
+Except where noted otherwise, Copyright (C) 2003-2017 by GRAME,
+Centre National de Creation Musicale.
+----------------------------------------------------------------------
+GRAME LICENSE
+
+This program is free software; you can redistribute it and/or modify
+it under the terms of the GNU Lesser General Public License as
+published by the Free Software Foundation; either version 2.1 of the
+License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+GNU Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with the GNU C Library; if not, write to the Free
+Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
+02111-1307 USA.
+
+EXCEPTION TO THE LGPL LICENSE : As a special exception, you may create a
+larger FAUST program which directly or indirectly imports this library
+file and still distribute the compiled code generated by the FAUST
+compiler, or a modified version of this compiled code, under your own
+copyright and license. This EXCEPTION TO THE LGPL LICENSE explicitly
+grants you the right to freely choose the license for the resulting
+compiled code. In particular the resulting compiled code has no obligation
+to be LGPL or GPL. For example you are free to choose a commercial or
+closed source license or any other license if you decide so.
+************************************************************************
+************************************************************************/
+
+// TODO: Add GRAME functions here
+
+//########################################################################################
+/************************************************************************
+FAUST library file, further contributions section
+
+All contributions below should indicate both the contributor and terms
+of license. If no such indication is found, "git blame" will say who
+last edited each line, and that person can be emailed to inquire about
+license disposition, if their license choice is not already indicated
+elsewhere among the libraries. It is expected that all software will be
+released under LGPL, STK-4.3, MIT, BSD, or a similar FOSS license.
+************************************************************************/
diff --git a/dist/examples/LIBRARIES/basics.lib b/dist/examples/LIBRARIES/basics.lib
new file mode 100644
index 00000000..1a964637
--- /dev/null
+++ b/dist/examples/LIBRARIES/basics.lib
@@ -0,0 +1,2061 @@
+//#################################### basics.lib ########################################
+// A library of basic elements. Its official prefix is `ba`.
+//
+// #### References
+// *
+//########################################################################################
+// A library of basic elements for Faust organized in 5 sections:
+//
+// * Conversion Tools
+// * Counters and Time/Tempo Tools
+// * Array Processing/Pattern Matching
+// * Selectors (Conditions)
+// * Other Tools (Misc)
+
+//########################################################################################
+
+/************************************************************************
+************************************************************************
+FAUST library file, GRAME section
+
+Except where noted otherwise, Copyright (C) 2003-2017 by GRAME,
+Centre National de Creation Musicale.
+----------------------------------------------------------------------
+GRAME LICENSE
+
+This program is free software; you can redistribute it and/or modify
+it under the terms of the GNU Lesser General Public License as
+published by the Free Software Foundation; either version 2.1 of the
+License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+GNU Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with the GNU C Library; if not, write to the Free
+Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
+02111-1307 USA.
+
+EXCEPTION TO THE LGPL LICENSE : As a special exception, you may create a
+larger FAUST program which directly or indirectly imports this library
+file and still distribute the compiled code generated by the FAUST
+compiler, or a modified version of this compiled code, under your own
+copyright and license. This EXCEPTION TO THE LGPL LICENSE explicitly
+grants you the right to freely choose the license for the resulting
+compiled code. In particular the resulting compiled code has no obligation
+to be LGPL or GPL. For example you are free to choose a commercial or
+closed source license or any other license if you decide so.
+************************************************************************
+************************************************************************/
+
+ma = library("maths.lib");
+ro = library("routes.lib");
+ba = library("basics.lib"); // for compatible copy/paste out of this file
+fi = library("filters.lib");
+it = library("interpolators.lib");
+si = library("signals.lib");
+
+declare name "Faust Basic Element Library";
+declare version "0.9";
+
+//=============================Conversion Tools===========================================
+//========================================================================================
+
+//-------`(ba.)samp2sec`----------
+// Converts a number of samples to a duration in seconds at the current sampling rate (see `ma.SR`).
+// `samp2sec` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// samp2sec(n) : _
+// ```
+//
+// Where:
+//
+// * `n`: number of samples
+//----------------------------
+samp2sec(n) = n/ma.SR;
+
+
+//-------`(ba.)sec2samp`----------
+// Converts a duration in seconds to a number of samples at the current sampling rate (see `ma.SR`).
+// `samp2sec` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// sec2samp(d) : _
+// ```
+//
+// Where:
+//
+// * `d`: duration in seconds
+//----------------------------
+sec2samp(d) = d*ma.SR;
+
+
+//-------`(ba.)db2linear`----------
+// Converts a loudness in dB to a linear gain (0-1).
+// `db2linear` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// db2linear(l) : _
+// ```
+//
+// Where:
+//
+// * `l`: loudness in dB
+//-----------------------------
+db2linear(l) = pow(10.0, l/20.0);
+
+
+//-------`(ba.)linear2db`----------
+// Converts a linear gain (0-1) to a loudness in dB.
+// `linear2db` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// linear2db(g) : _
+// ```
+//
+// Where:
+//
+// * `g`: a linear gain
+//-----------------------------
+linear2db(g) = 20.0*log10(max(ma.MIN, g));
+
+
+//----------`(ba.)lin2LogGain`------------------
+// Converts a linear gain (0-1) to a log gain (0-1).
+//
+// #### Usage
+//
+// ```
+// lin2LogGain(n) : _
+// ```
+//
+// Where:
+//
+// * `n`: the linear gain
+//---------------------------------------------
+lin2LogGain(n) = n*n;
+
+
+//----------`(ba.)log2LinGain`------------------
+// Converts a log gain (0-1) to a linear gain (0-1).
+//
+// #### Usage
+//
+// ```
+// log2LinGain(n) : _
+// ```
+//
+// Where:
+//
+// * `n`: the log gain
+//---------------------------------------------
+log2LinGain(n) = sqrt(n);
+
+
+// end GRAME section
+//########################################################################################
+/************************************************************************
+FAUST library file, jos section
+
+Except where noted otherwise, The Faust functions below in this
+section are Copyright (C) 2003-2017 by Julius O. Smith III
+([jos](http://ccrma.stanford.edu/~jos/)), and released under the
+(MIT-style) [STK-4.3](#stk-4.3-license) license.
+
+The MarkDown comments in this section are Copyright 2016-2017 by Romain
+Michon and Julius O. Smith III, and are released under the
+[CCA4I](https://creativecommons.org/licenses/by/4.0/) license (TODO: if/when Romain agrees)
+
+************************************************************************/
+
+//-------`(ba.)tau2pole`----------
+// Returns a real pole giving exponential decay.
+// Note that t60 (time to decay 60 dB) is ~6.91 time constants.
+// `tau2pole` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : smooth(tau2pole(tau)) : _
+// ```
+//
+// Where:
+//
+// * `tau`: time-constant in seconds
+//-----------------------------
+// tau2pole(tau) = exp(-1.0/(tau*ma.SR));
+
+tau2pole(tau) = ba.if(clipCond, 0.0, exp(-1.0/(tauCenterClipped*float(ma.SR))))
+with {
+ clipCond = abs(tau) x'; };
+
+
+//----------------------------`(ba.)countdown`------------------------------
+// Starts counting down from n included to 0. While trig is 1 the output is n.
+// The countdown starts with the transition of trig from 1 to 0. At the end
+// of the countdown the output value will remain at 0 until the next trig.
+// `countdown` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// countdown(n,trig) : _
+// ```
+//
+// Where:
+//
+// * `n`: the starting point of the countdown
+// * `trig`: the trigger signal (1: start at `n`; 0: decrease until 0)
+//-----------------------------------------------------------------------------
+countdown(n, trig) = \(c).(if(trig>0, n, max(0, c-1))) ~ _;
+
+
+//----------------------------`(ba.)countup`--------------------------------
+// Starts counting up from 0 to n included. While trig is 1 the output is 0.
+// The countup starts with the transition of trig from 1 to 0. At the end
+// of the countup the output value will remain at n until the next trig.
+// `countup` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// countup(n,trig) : _
+// ```
+//
+// Where:
+//
+// * `n`: the maximum count value
+// * `trig`: the trigger signal (1: start at 0; 0: increase until `n`)
+//-----------------------------------------------------------------------------
+countup(n, trig) = \(c).(if(trig>0, 0, min(n, c+1))) ~ _;
+
+
+//--------------------`(ba.)sweep`--------------------------
+// Counts from 0 to `period-1` repeatedly, generating a
+// sawtooth waveform, like `os.lf_rawsaw`,
+// starting at 1 when `run` transitions from 0 to 1.
+// Outputs zero while `run` is 0.
+//
+// #### Usage
+//
+// ```
+// sweep(period,run) : _
+// ```
+//-----------------------------------------------------------------
+declare sweep author "Jonatan Liljedahl";
+
+sweep = %(int(*:max(1)))~+(1);
+
+
+//-------`(ba.)time`----------
+// A simple timer that counts every samples from the beginning of the process.
+// `time` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// time : _
+// ```
+//------------------------
+time = (+(1)~_) - 1;
+
+
+//-------`(ba.)ramp`----------
+// A linear ramp with a slope of '(+/-)1/n' samples to reach the next value.
+//
+// #### Usage
+//
+// ```
+// _ : ramp(n) : _
+// ```
+// Where:
+//
+// * `n`: number of samples to increment/decrement the value by one
+//------------------------
+ramp = case {
+ (0) => _;
+ (n) => \(y,x).(if(y+1.0/n < x, y+1.0/n, if(y-1.0/n > x, y-1.0/n, x))) ~ _;
+};
+
+
+//-------`(ba.)line`----------
+// A linear ramp to reach a next value in 'n' samples.
+// Note that the interpolation process is restarted every time
+// the desired output value changes, the interpolation time is sampled only then.
+//
+// #### Usage
+//
+// ```
+// _ : line(n) : _
+// ```
+// Where:
+//
+// * `n`: number of samples to reach the next value
+//------------------------
+line(n, x) = state ~ (_,_) : !,_
+with {
+ state(t, c) = nt,nc
+ with {
+ nt = ba.if(x != x', n, t-1);
+ nc = ba.if(nt > 0, c + (x - c)/nt, x);
+ };
+};
+
+
+//-------`(ba.)tempo`----------
+// Converts a tempo in BPM into a number of samples.
+//
+// #### Usage
+//
+// ```
+// tempo(t) : _
+// ```
+//
+// Where:
+//
+// * `t`: tempo in BPM
+//------------------------
+tempo(t) = (60*ma.SR)/t;
+
+
+//-------`(ba.)period`----------
+// Basic sawtooth wave of period `p`.
+//
+// #### Usage
+//
+// ```
+// period(p) : _
+// ```
+//
+// Where:
+//
+// * `p`: period as a number of samples
+//------------------------
+// NOTE: may be this should go in oscillators.lib
+period(p) = %(int(p))~+(1');
+
+
+//-------`(ba.)pulse`----------
+// Pulses (like 10000) generated at period `p`.
+//
+// #### Usage
+//
+// ```
+// pulse(p) : _
+// ```
+//
+// Where:
+//
+// * `p`: period as a number of samples
+//------------------------
+// NOTE: may be this should go in oscillators.lib
+pulse(p) = period(p) : \(x).(x <= x');
+
+
+//-------`(ba.)pulsen`----------
+// Pulses (like 11110000) of length `n` generated at period `p`.
+//
+// #### Usage
+//
+// ```
+// pulsen(n,p) : _
+// ```
+//
+// Where:
+//
+// * `n`: pulse length as a number of samples
+// * `p`: period as a number of samples
+//------------------------
+// NOTE: may be this should go in oscillators.lib
+pulsen(n,p) = period(p)= n);
+};
+
+
+//-----------------------`(ba.)resetCtr`------------------------
+// Function that lets through the mth impulse out of
+// each consecutive group of `n` impulses.
+//
+// #### Usage
+//
+// ```
+// _ : resetCtr(n,m) : _
+// ```
+//
+// Where:
+//
+// * `n`: the total number of impulses being split
+// * `m`: index of impulse to allow to be output
+//---------------------------------------------------------
+declare resetCtr author "Mike Olsen";
+
+resetCtr(n,m) = _ <: (_,pulse_countup_loop(n-1,1)) : (_,(_==m)) : *;
+
+
+//===============================Array Processing/Pattern Matching========================
+//========================================================================================
+
+//---------------------------------`(ba.)count`---------------------------------
+// Count the number of elements of list l.
+// `count` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// count(l)
+// count((10,20,30,40)) -> 4
+// ```
+//
+// Where:
+//
+// * `l`: list of elements
+//-----------------------------------------------------------------------------
+count((xs, xxs)) = 1 + count(xxs);
+count(xx) = 1;
+
+
+//-------------------------------`(ba.)take`-----------------------------------
+// Take an element from a list.
+// `take` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// take(P,l)
+// take(3,(10,20,30,40)) -> 30
+// ```
+//
+// Where:
+//
+// * `P`: position (int, known at compile time, P > 0)
+// * `l`: list of elements
+//-----------------------------------------------------------------------------
+take(1, (xs, xxs)) = xs;
+take(1, xs) = xs;
+take(N, (xs, xxs)) = take(N-1, xxs);
+
+
+//----------------------------`(ba.)subseq`--------------------------------
+// Extract a part of a list.
+//
+// #### Usage
+//
+// ```
+// subseq(l, P, N)
+// subseq((10,20,30,40,50,60), 1, 3) -> (20,30,40)
+// subseq((10,20,30,40,50,60), 4, 1) -> 50
+// ```
+//
+// Where:
+//
+// * `l`: list
+// * `P`: start point (int, known at compile time, 0: begin of list)
+// * `N`: number of elements (int, known at compile time)
+//
+// #### Note:
+//
+// Faust doesn't have proper lists. Lists are simulated with parallel
+// compositions and there is no empty list.
+//-----------------------------------------------------------------------------
+subseq((head, tail), 0, 1) = head;
+subseq((head, tail), 0, N) = head, subseq(tail, 0, N-1);
+subseq((head, tail), P, N) = subseq(tail, P-1, N);
+subseq(head, 0, N) = head;
+
+
+//============================Function tabulation=========================================
+// The purpose of function tabulation is to speed up the computation of heavy functions over an interval,
+// so that the computation at runtime can be faster than directly using the function.
+// Two techniques are implemented:
+//
+// * `tabulate` computes the function in a table and read the points using interpolation
+//
+// * `tabulate_chebychev` uses Chebyshev polynomial approximation
+//
+// #### Comparison program example
+// ```
+///* Both tabulate() and tabulate_chebychev() create rdtable of size = 200, both use */
+///* cubic polynomials, so this comparison is more or less fair. */
+// process = line(50000, r0, r1) <: FX-tb,FX-ch : par(i, 2, maxerr)
+// with {
+// C = 0;
+// FX = sin;
+// NX = 50;
+// CD = 3;
+// r0 = 0;
+// r1 = ma.PI;
+// tb(x) = ba.tabulate(C, FX, NX*(CD+1), r0, r1, x).cub;
+// ch(x) = ba.tabulate_chebychev(C, FX, NX, CD, r0, r1, x);
+// maxerr = abs : max ~ _;
+// line(n, x0, x1) = x0 + (ba.time%n)/n * (x1-x0);
+// };
+// ```
+//
+//-------`(ba.)tabulate`----------
+// Tabulate a 1D function over the range [r0, r1] for access via nearest-value, linear, cubic interpolation.
+// In other words, the uniformly tabulated function can be evaluated using interpolation of order 0 (none), 1 (linear), or 3 (cubic).
+//
+// #### Usage
+//
+// ```
+// tabulate(C, FX, S, r0, r1, x).(val|lin|cub) : _
+// ```
+//
+// * `C`: whether to dynamically force the `x` value to the range [r0, r1]: 1 forces the check, 0 deactivates it (constant numerical expression)
+// * `FX`: unary function Y=F(X) with one output (scalar function of one variable)
+// * `S`: size of the table in samples (constant numerical expression)
+// * `r0`: minimum value of argument x
+// * `r1`: maximum value of argument x
+//
+// ```
+// tabulate(C, FX, S, r0, r1, x).val uses the value in the table closest to x
+// ```
+//
+// ```
+// tabulate(C, FX, S, r0, r1, x).lin evaluates at x using linear interpolation between the closest stored values
+// ```
+//
+// ```
+// tabulate(C, FX, S, r0, r1, x).cub evaluates at x using cubic interpolation between the closest stored values
+// ```
+//
+// #### Example test program
+//
+// ```
+// midikey2hz(mk) = ba.tabulate(1, ba.midikey2hz, 512, 0, 127, mk).lin;
+// process = midikey2hz(ba.time), ba.midikey2hz(ba.time);
+// ```
+//
+//--------------------------------------------
+tabulate(C, FX, S, r0, r1, x) = environment {
+
+ // Maximum index to access
+ mid = S-1;
+
+ // Create the table
+ wf = r0 + float(ba.time)*(r1-r0)/float(mid) : FX;
+
+ // Prepare the 'float' table read index
+ id = (x-r0)/(r1-r0)*mid;
+
+ // Limit the table read index in [0, mid] if C = 1
+ rid(x, 0) = x;
+ rid(x, 1) = max(0, min(x, mid));
+
+ // Tabulate an unary 'FX' function on a range [r0, r1]
+ val = y0 with { y0 = rdtable(S, wf, rid(int(id), C)); };
+
+ // Tabulate an unary 'FX' function over the range [r0, r1] with linear interpolation
+ lin = it.interpolate_linear(d,y0,y1)
+ with {
+ x0 = int(id);
+ x1 = x0+1;
+ d = id-x0;
+ y0 = rdtable(S, wf, rid(x0, C));
+ y1 = rdtable(S, wf, rid(x1, C));
+ };
+
+ // Tabulate an unary 'FX' function over the range [r0, r1] with cubic interpolation
+ cub = it.interpolate_cubic(d,y0,y1,y2,y3)
+ with {
+ x0 = x1-1;
+ x1 = int(id);
+ x2 = x1+1;
+ x3 = x2+1;
+ d = id-x1;
+ y0 = rdtable(S, wf, rid(x0, C));
+ y1 = rdtable(S, wf, rid(x1, C));
+ y2 = rdtable(S, wf, rid(x2, C));
+ y3 = rdtable(S, wf, rid(x3, C));
+ };
+};
+
+declare tabulate author "Stephane Letz";
+
+
+//-------`(ba.)tabulate_chebychev`----------
+// Tabulate a 1D function over the range [r0, r1] for access via Chebyshev polynomial approximation.
+// In contrast to `(ba.)tabulate`, which interpolates only between tabulated samples, `(ba.)tabulate_chebychev`
+// stores coefficients of Chebyshev polynomials that are evaluated to provide better approximations in many cases.
+// Two new arguments controlling this are NX, the number of segments into which [r0, r1] is divided, and CD,
+// the maximum Chebyshev polynomial degree to use for each segment. A `rdtable` of size NX*(CD+1) is internally used.
+//
+// Note that processing `r1` the last point in the interval is not safe. So either be sure the input stays in [r0, r1[
+// or use `C = 1`.
+//
+// #### Usage
+//
+// ```
+// _ : tabulate_chebychev(C, FX, NX, CD, r0, r1) : _
+// ```
+//
+// * `C`: whether to dynamically force the value to the range [r0, r1]: 1 forces the check, 0 deactivates it (constant numerical expression)
+// * `FX`: unary function Y=F(X) with one output (scalar function of one variable)
+// * `NX`: number of segments for uniformly partitioning [r0, r1] (constant numerical expression)
+// * `CD`: maximum polynomial degree for each Chebyshev polynomial (constant numerical expression)
+// * `r0`: minimum value of argument x
+// * `r1`: maximum value of argument x
+//
+// #### Example test program
+//
+// ```
+// midikey2hz_chebychev(mk) = ba.tabulate_chebychev(1, ba.midikey2hz, 100, 4, 0, 127, mk);
+// process = midikey2hz_chebychev(ba.time), ba.midikey2hz(ba.time);
+// ```
+//
+//--------------------------------------------
+tabulate_chebychev(C, FX, NX, CD, r0, r1, x) = y with {
+ ck(0) = _;
+ ck(1) = max(0) : min(NX-1);
+
+ // number of chebyshev coefficients
+ NC = CD + 1;
+ // length of the segments
+ DX = (r1 - r0) / NX;
+ // number of segment 'x' falls in
+ nx = (x - r0) / DX : int : ck(C);
+ // center of n's segment
+ xc(n) = r0 + DX * (n + 1/2);
+ // so ch(0) .. ch(NC) are the coeffs we use for approximation
+ // on nx's segment
+ ch(i) = chtab(NC * nx + i);
+
+ // map the input in segment [nx*DX, (nx+1)*DX] to [-1,1]
+ y = (x - xc(nx)) * 2/DX <: sum(i, NC, ch(i) * ma.chebychev(i));
+
+ // map [-1,1] to the segment [nx*DX, (nx+1)*DX] so mapfx(nx)
+ // is simply the "renormalized" FX defined on [-1,1]
+ mapfx(nx, x) = FX(xc(nx) + DX/2 * x);
+
+ // calculate the nc's chebyshev coefficient we use on nx's segment
+ gench(nx, nc) = (1+(nc!=0))/NC * sum(k,NC,
+ mapfx(nx, cos(ma.PI*(k+1/2)/NC)) * cos(ma.PI*nc*(k+1/2)/NC));
+
+ // record gench(nx, nc) in rdtable() to avoid the run-time calculations
+ chtab = rdtable(NX*NC, (ba.time <: int(/(NC)), %(NC) : gench));
+};
+
+declare tabulate_chebychev author "Oleg Nesterov";
+declare tabulate_chebychev copyright "Copyright (C) 2022 Oleg Nesterov ";
+declare tabulate_chebychev license "MIT-style STK-4.3 license";
+
+
+//============================Selectors (Conditions)======================================
+//========================================================================================
+
+//-----------------------------`(ba.)if`-----------------------------------
+// if-then-else implemented with a select2. WARNING: since `select2` is strict (always evaluating both branches),
+// the resulting if does not have the usual "lazy" semantic of the C if form, and thus cannot be used to
+// protect against forbidden computations like division-by-zero for instance.
+//
+// #### Usage
+//
+// * `if(cond, then, else) : _`
+//
+// Where:
+//
+// * `cond`: condition
+// * `then`: signal selected while cond is true
+// * `else`: signal selected while cond is false
+//-----------------------------------------------------------------------------
+if(cond,then,else) = select2(cond,else,then);
+// TODO: perhaps it would make more sense to have an if(a,b) and an ifelse(a,b,c)?
+
+
+//-----------------------------`(ba.)selector`---------------------------------
+// Selects the ith input among n at compile time.
+//
+// #### Usage
+//
+// ```
+// selector(I,N)
+// _,_,_,_ : selector(2,4) : _ // selects the 3rd input among 4
+// ```
+//
+// Where:
+//
+// * `I`: input to select (int, numbered from 0, known at compile time)
+// * `N`: number of inputs (int, known at compile time, N > I)
+//
+// There is also cselector for selecting among complex input signals of the form (real,imag).
+//
+//-----------------------------------------------------------------------------
+selector(i,n) = par(j, n, S(i, j)) with { S(i,i) = _; S(i,j) = !; };
+cselector(i,n) = par(j, n, S(i, j)) with { S(i,i) = (_,_); S(i,j) = (!,!); }; // for complex numbers
+
+
+//--------------------`(ba.)select2stereo`--------------------
+// Select between 2 stereo signals.
+//
+// #### Usage
+//
+// ```
+// _,_,_,_ : select2stereo(bpc) : _,_
+// ```
+//
+// Where:
+//
+// * `bpc`: the selector switch (0/1)
+//------------------------------------------------------------
+select2stereo(bpc) = ro.cross2 : select2(bpc), select2(bpc) : _,_;
+
+
+//-----------------------------`(ba.)selectn`---------------------------------
+// Selects the ith input among N at run time.
+//
+// #### Usage
+//
+// ```
+// selectn(N,i)
+// _,_,_,_ : selectn(4,2) : _ // selects the 3rd input among 4
+// ```
+//
+// Where:
+//
+// * `N`: number of inputs (int, known at compile time, N > 0)
+// * `i`: input to select (int, numbered from 0)
+//
+// #### Example test program
+//
+// ```
+// N = 64;
+// process = par(n, N, (par(i,N,i) : selectn(N,n)));
+// ```
+//-----------------------------------------------------------------------------
+selectn(N,i) = selectnX(N,i,selector)
+with {
+ selector(i,j,x,y) = select2((i >= j), x, y);
+};
+
+
+// The generic version with a 'sel' function to be applied on:
+// - the channel index as a (possibly) fractional value
+// - the next channel index as an integer value
+// - the 2 signals to be selected between
+
+selectnX(N,i,sel) = S(N,0)
+with {
+ S(1,offset) = _;
+ S(n,offset) = S(left, offset), S(right, offset+left) : sel(i, offset+left)
+ with {
+ right = int(n/2);
+ left = n-right;
+ };
+};
+
+
+//-----------------------------`(ba.)selectmulti`---------------------------------
+// Selects the ith circuit among N at run time (all should have the same number of inputs and outputs)
+// with a crossfade.
+//
+// #### Usage
+//
+// ```
+// selectmulti(n,lgen,id)
+// ```
+//
+// Where:
+//
+// * `n`: crossfade in samples
+// * `lgen`: list of circuits
+// * `id`: circuit to select (int, numbered from 0)
+//
+// #### Example test program
+//
+// ```
+// process = selectmulti(ma.SR/10, ((3,9),(2,8),(5,7)), nentry("choice", 0, 0, 2, 1));
+// process = selectmulti(ma.SR/10, ((_*3,_*9),(_*2,_*8),(_*5,_*7)), nentry("choice", 0, 0, 2, 1));
+// ```
+//-----------------------------------------------------------------------------
+selectmulti(n, lgen, id) = selectmultiX(ins, lgen, id)
+with {
+ selectmultiX(0, lgen, id) = selector; // No inputs
+ selectmultiX(N, lgen, id) = par(i, ins, _) <: selector; // General case
+
+ selector = lgen : ro.interleave(outs, N) : par(i, outs, selectnX(N, id, xfade))
+ with {
+ // crossfade of 'n' samples between 'x' and 'y' channels when the channel index changes
+ xfade(i, j, x, y) = x*(1-xb) + y*xb with { xb = ramp(n, (i >= j)); };
+ };
+
+ outs = outputs(take(1, lgen)); // Number of outputs of the first circuit (all should have the same value)
+ ins = inputs(take(1, lgen)); // Number of inputs of the first circuit (all should have the same value)
+ N = outputs(lgen)/outs; // Number of items in the list
+};
+
+
+//-----------------------------`(ba.)selectoutn`---------------------------------
+// Route input to the output among N at run time.
+//
+// #### Usage
+//
+// ```
+// _ : selectoutn(N, i) : si.bus(N)
+// ```
+//
+// Where:
+//
+// * `N`: number of outputs (int, known at compile time, N > 0)
+// * `i`: output number to route to (int, numbered from 0) (i.e. slider)
+//
+// #### Example test program
+//
+// ```
+// process = 1 : selectoutn(3, sel) : par(i, 3, vbargraph("v.bargraph %i", 0, 1));
+// sel = hslider("volume", 0, 0, 2, 1) : int;
+// ```
+//--------------------------------------------------------------------------
+declare selectoutn author "Vince";
+
+selectoutn(N, s) = _ <: par(i, N, *(s==i));
+
+
+//=====================================Other==============================================
+//========================================================================================
+
+//----------------------------`(ba.)latch`--------------------------------
+// Latch input on positive-going transition of trig:"records" the input when trig
+// switches from 0 to 1, outputs a frozen values everytime else.
+//
+// #### Usage
+//
+// ```
+// _ : latch(trig) : _
+// ```
+//
+// Where:
+//
+// * `trig`: hold trigger (0 for hold, 1 for bypass)
+//------------------------------------------------------------
+latch(trig, x) = x * s : + ~ *(1-s) with { s = (trig' <= 0) & (trig > 0); };
+
+
+//--------------------------`(ba.)sAndH`-------------------------------
+// Sample And Hold: "records" the input when trig is 1, outputs a frozen value when trig is 0.
+// `sAndH` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : sAndH(trig) : _
+// ```
+//
+// Where:
+//
+// * `trig`: hold trigger (0 for hold, 1 for bypass)
+//----------------------------------------------------------------
+declare sAndH author "Romain Michon";
+
+sAndH(trig) = select2(trig,_,_) ~ _;
+
+
+//--------------------------`(ba.)downSample`-------------------------------
+// Down sample a signal. WARNING: this function doesn't change the
+// rate of a signal, it just holds samples...
+// `downSample` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : downSample(freq) : _
+// ```
+//
+// Where:
+//
+// * `freq`: new rate in Hz
+//----------------------------------------------------------------
+declare downSample author "Romain Michon";
+
+downSample(freq) = sAndH(hold)
+with {
+ hold = time%int(ma.SR/freq) == 0;
+};
+
+
+//------------------`(ba.)peakhold`---------------------------
+// Outputs current max value above zero.
+//
+// #### Usage
+//
+// ```
+// _ : peakhold(mode) : _
+// ```
+//
+// Where:
+//
+// `mode` means:
+// 0 - Pass through. A single sample 0 trigger will work as a reset.
+// 1 - Track and hold max value.
+//----------------------------------------------------------------
+declare peakhold author "Jonatan Liljedahl, revised by Romain Michon";
+
+peakhold = (*,_ : max) ~ _;
+
+//------------------`(ba.)peakholder`-------------------------------------------
+//
+// While peak-holder functions are scarcely discussed in the literature
+// (please do send me an email if you know otherwise), common sense
+// tells that the expected behaviour should be as follows: the absolute
+// value of the input signal is compared with the output of the peak-holder;
+// if the input is greater or equal to the output, a new peak is detected
+// and sent to the output; otherwise, a timer starts and the current peak
+// is held for N samples; once the timer is out and no new peaks have been
+// detected, the absolute value of the current input becomes the new peak.
+//
+// #### Usage
+//
+// ```
+// _ : peakholder(holdTime) : _
+// ```
+//
+// Where:
+//
+// * `holdTime`: hold time in samples
+//------------------------------------------------------------------------------
+declare peakholder author "Dario Sanfilippo";
+declare peakholder copyright
+ "Copyright (C) 2022 Dario Sanfilippo ";
+declare peakholder license "MIT-style STK-4.3 license";
+peakholder(holdTime, x) = loop ~ si.bus(2) : ! , _
+ with {
+ loop(timerState, outState) = timer , output
+ with {
+ isNewPeak = abs(x) >= outState;
+ isTimeOut = timerState >= holdTime;
+ bypass = isNewPeak | isTimeOut;
+ timer = ba.if(bypass, 0, timerState + 1);
+ output = ba.if(bypass, abs(x), outState);
+ };
+ };
+
+
+/*
+// Alternate version with branchless code
+//----------------------------------------
+peakholder(holdTime, x) = loop ~ si.bus(2) : ! , _
+ with {
+ loop(timerState, outState) = timer , output
+ with {
+ isNewPeak = abs(x) >= outState;
+ isTimeOut = timerState >= holdTime;
+ bypass = isNewPeak | isTimeOut;
+ timer = (1 - bypass) * (timerState + 1);
+ output = bypass * (abs(x) - outState) + outState;
+ };
+ };
+*/
+
+/*
+// The function below is kept for back-compatibility in case any user relies
+// on it for their software. However, the function behaves differently than
+// expected: currently, the timer is not reset when a new peak is detected.
+//------------------------------------------------------------------------------
+declare peakholder author "Jonatan Liljedahl";
+peakholder(n) = peakhold2 ~ reset : (!,_) with {
+ reset = sweep(n) > 0;
+ // first out is gate that is 1 while holding last peak
+ peakhold2 = _,abs <: peakhold,!,_ <: >=,_,!;
+};
+*/
+
+
+//--------------------------`(ba.)impulsify`---------------------------
+// Turns a signal into an impulse with the value of the current sample
+// (0.3,0.2,0.1 becomes 0.3,0.0,0.0). This function is typically used with a
+// `button` to turn its output into an impulse. `impulsify` is a standard Faust
+// function.
+//
+// #### Usage
+//
+// ```
+// button("gate") : impulsify;
+// ```
+//----------------------------------------------------------------
+impulsify = _ <: _,mem : - <: >(0)*_;
+
+
+//-----------------------`(ba.)automat`------------------------------
+// Record and replay in a loop the successives values of the input signal.
+//
+// #### Usage
+//
+// ```
+// hslider(...) : automat(t, size, init) : _
+// ```
+//
+// Where:
+//
+// * `t`: tempo in BPM
+// * `size`: number of items in the loop
+// * `init`: init value in the loop
+//-----------------------------------------------------------------------
+automat(t, size, init, input) = rwtable(size+1, init, windex, input, rindex)
+with {
+ clock = beat(t);
+ rindex = int(clock) : (+ : %(size)) ~ _; // each clock read the next entry of the table
+ windex = if(timeToRenew, rindex, size); // we ignore input unless it is time to renew
+ timeToRenew = int(clock) & (inputHasMoved | (input <= init));
+ inputHasMoved = abs(input-input') : countfrom(int(clock)') : >(0);
+ countfrom(reset) = (+ : if(reset, 0, _)) ~ _;
+};
+
+
+//-----------------`(ba.)bpf`-------------------
+// bpf is an environment (a group of related definitions) that can be used to
+// create break-point functions. It contains three functions:
+//
+// * `start(x,y)` to start a break-point function
+// * `end(x,y)` to end a break-point function
+// * `point(x,y)` to add intermediate points to a break-point function
+//
+// A minimal break-point function must contain at least a start and an end point:
+//
+// ```
+// f = bpf.start(x0,y0) : bpf.end(x1,y1);
+// ```
+//
+// A more involved break-point function can contains any number of intermediate
+// points:
+//
+// ```
+// f = bpf.start(x0,y0) : bpf.point(x1,y1) : bpf.point(x2,y2) : bpf.end(x3,y3);
+// ```
+//
+// In any case the `x_{i}` must be in increasing order (for all `i`, `x_{i} < x_{i+1}`).
+// For example the following definition:
+//
+// ```
+// f = bpf.start(x0,y0) : ... : bpf.point(xi,yi) : ... : bpf.end(xn,yn);
+// ```
+//
+// implements a break-point function f such that:
+//
+// * `f(x) = y_{0}` when `x < x_{0}`
+// * `f(x) = y_{n}` when `x > x_{n}`
+// * `f(x) = y_{i} + (y_{i+1}-y_{i})*(x-x_{i})/(x_{i+1}-x_{i})` when `x_{i} <= x`
+// and `x < x_{i+1}`
+//
+// `bpf` is a standard Faust function.
+//--------------------------------------------------------
+bpf = environment
+{
+ // Start a break-point function
+ start(x0,y0) = \(x).(x0,y0,x,y0);
+ // Add a break-point
+ point(x1,y1) = \(x0,y0,x,y).(x1, y1, x, if(x < x0, y, if(x < x1, y0 + (x-x0)*(y1-y0)/(x1-x0), y1)));
+ // End a break-point function
+ end(x1,y1) = \(x0,y0,x,y).(if(x < x0, y, if(x < x1, y0 + (x-x0)*(y1-y0)/(x1-x0), y1)));
+};
+
+
+//-------------------`(ba.)listInterp`-------------------------
+// Linearly interpolates between the elements of a list.
+//
+// #### Usage
+//
+// ```
+// index = 1.69; // range is 0-4
+// process = listInterp((800,400,350,450,325),index);
+// ```
+//
+// Where:
+//
+// * `index`: the index (float) to interpolate between the different values.
+// The range of `index` depends on the size of the list.
+//------------------------------------------------------------
+declare listInterp author "Romain Michon";
+
+listInterp(v) =
+ bpf.start(0,take(1,v)) :
+ seq(i,count(v)-2,bpf.point(i+1,take(i+2,v))) :
+ bpf.end(count(v)-1,take(count(v),v));
+
+
+//-------------------`(ba.)bypass1`-------------------------
+// Takes a mono input signal, route it to `e` and bypass it if `bpc = 1`.
+// When bypassed, `e` is feed with zeros so that its state is cleanup up.
+// `bypass1` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : bypass1(bpc,e) : _
+// ```
+//
+// Where:
+//
+// * `bpc`: bypass switch (0/1)
+// * `e`: a mono effect
+//------------------------------------------------------------
+declare bypass1 author "Julius Smith";
+// License: STK-4.3
+
+bypass1(bpc,e) = _ <: select2(bpc,(inswitch:e),_)
+with {
+ inswitch = select2(bpc,_,0);
+};
+
+
+//-------------------`(ba.)bypass2`-------------------------
+// Takes a stereo input signal, route it to `e` and bypass it if `bpc = 1`.
+// When bypassed, `e` is feed with zeros so that its state is cleanup up.
+// `bypass2` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _,_ : bypass2(bpc,e) : _,_
+// ```
+//
+// Where:
+//
+// * `bpc`: bypass switch (0/1)
+// * `e`: a stereo effect
+//------------------------------------------------------------
+declare bypass2 author "Julius Smith";
+// License: STK-4.3
+
+bypass2(bpc,e) = _,_ <: ((inswitch:e),_,_) : select2stereo(bpc)
+with {
+ inswitch = _,_ : (select2(bpc,_,0), select2(bpc,_,0)) : _,_;
+};
+
+
+//-------------------`(ba.)bypass1to2`-------------------------
+// Bypass switch for effect `e` having mono input signal and stereo output.
+// Effect `e` is bypassed if `bpc = 1`.When bypassed, `e` is feed with zeros
+// so that its state is cleanup up.
+// `bypass1to2` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : bypass1to2(bpc,e) : _,_
+// ```
+//
+// Where:
+//
+// * `bpc`: bypass switch (0/1)
+// * `e`: a mono-to-stereo effect
+//------------------------------------------------------------
+declare bypass1to2 author "Julius Smith";
+// License: STK-4.3
+
+bypass1to2(bpc,e) = _ <: ((inswitch:e),_,_) : select2stereo(bpc)
+with {
+ inswitch = select2(bpc,_,0);
+};
+
+
+//-------------------`(ba.)bypass_fade`-------------------------
+// Bypass an arbitrary (N x N) circuit with 'n' samples crossfade.
+// Inputs and outputs signals are faded out when 'e' is bypassed,
+// so that 'e' state is cleanup up.
+// Once bypassed the effect is replaced by `par(i,N,_)`.
+// Bypassed circuits can be chained.
+//
+// #### Usage
+//
+// ```
+// _ : bypass_fade(n,b,e) : _
+// or
+// _,_ : bypass_fade(n,b,e) : _,_
+// ```
+// * `n`: number of samples for the crossfade
+// * `b`: bypass switch (0/1)
+// * `e`: N x N circuit
+//
+// #### Example test program
+//
+// ```
+// process = bypass_fade(ma.SR/10, checkbox("bypass echo"), echo);
+// process = bypass_fade(ma.SR/10, checkbox("bypass reverb"), freeverb);
+// ```
+//---------------------------------------------------------------
+bypass_fade(n, b, e) = par(i, ins, _)
+ <: (par(i, ins, *(1-xb)) : e : par(i, outs, *(1-xb))), par(i, ins, *(xb))
+ :> par(i, outs, _)
+with {
+ ins = inputs(e);
+ outs = outputs(e);
+ xb = ramp(n, b);
+};
+
+
+//----------------------------`(ba.)toggle`------------------------------------------
+// Triggered by the change of 0 to 1, it toggles the output value
+// between 0 and 1.
+//
+// #### Usage
+//
+// ```
+// _ : toggle : _
+// ```
+// #### Example test program
+//
+// ```
+// button("toggle") : toggle : vbargraph("output", 0, 1)
+// (an.amp_follower(0.1) > 0.01) : toggle : vbargraph("output", 0, 1) // takes audio input
+// ```
+//
+//------------------------------------------------------------------------------
+declare toggle author "Vince";
+
+toggle = trig : loop
+with {
+ trig(x) = (x-x') == 1;
+ loop = != ~ _;
+};
+
+
+//----------------------------`(ba.)on_and_off`------------------------------------------
+// The first channel set the output to 1, the second channel to 0.
+//
+// #### Usage
+//
+// ```
+// _,_ : on_and_off : _
+// ```
+//
+// #### Example test program
+//
+// ```
+// button("on"), button("off") : on_and_off : vbargraph("output", 0, 1)
+// ```
+//
+//------------------------------------------------------------------------------
+declare on_and_off author "Vince";
+
+on_and_off(a, b) = (a : trig) : loop(b)
+with {
+ trig(x) = (x-x') == 1;
+ loop(b) = + ~ (_ >= 1) * ((b : trig) == 0);
+};
+
+
+//----------------------------`(ba.)bitcrusher`------------------------------------------
+// Produce distortion by reduction of the signal resolution.
+//
+// #### Usage
+//
+// ```
+// _ : bitcrusher(nbits) : _
+// ```
+//
+// Where:
+//
+// * `nbits`: the number of bits of the wanted resolution
+//
+//------------------------------------------------------------------------------
+declare bitcrusher author "Julius O. Smith III, revised by Stephane Letz";
+
+bitcrusher(nbits,x) = round(x * scaler) / scaler
+with {
+ scaler = float(2^nbits - 1);
+ round(x) = floor(x + 0.5);
+};
+
+
+//=================================Sliding Reduce=========================================
+// Provides various operations on the last n samples using a high order
+// `slidingReduce(op,n,maxN,disabledVal,x)` fold-like function:
+//
+// * `slidingSum(n)`: the sliding sum of the last n input samples, CPU-light
+// * `slidingSump(n,maxN)`: the sliding sum of the last n input samples, numerically stable "forever"
+// * `slidingMax(n,maxN)`: the sliding max of the last n input samples
+// * `slidingMin(n,maxN)`: the sliding min of the last n input samples
+// * `slidingMean(n)`: the sliding mean of the last n input samples, CPU-light
+// * `slidingMeanp(n,maxN)`: the sliding mean of the last n input samples, numerically stable "forever"
+// * `slidingRMS(n)`: the sliding RMS of the last n input samples, CPU-light
+// * `slidingRMSp(n,maxN)`: the sliding RMS of the last n input samples, numerically stable "forever"
+//
+// #### Working Principle
+//
+// If we want the maximum of the last 8 values, we can do that as:
+//
+// ```
+// simpleMax(x) =
+// (
+// (
+// max(x@0,x@1),
+// max(x@2,x@3)
+// ) :max
+// ),
+// (
+// (
+// max(x@4,x@5),
+// max(x@6,x@7)
+// ) :max
+// )
+// :max;
+// ```
+//
+// `max(x@2,x@3)` is the same as `max(x@0,x@1)@2` but the latter re-uses a
+// value we already computed,so is more efficient. Using the same trick for
+// values 4 trough 7, we can write:
+//
+// ```
+// efficientMax(x)=
+// (
+// (
+// max(x@0,x@1),
+// max(x@0,x@1)@2
+// ) :max
+// ),
+// (
+// (
+// max(x@0,x@1),
+// max(x@0,x@1)@2
+// ) :max@4
+// )
+// :max;
+// ```
+//
+// We can rewrite it recursively, so it becomes possible to get the maximum at
+// have any number of values, as long as it's a power of 2.
+//
+// ```
+// recursiveMax =
+// case {
+// (1,x) => x;
+// (N,x) => max(recursiveMax(N/2,x), recursiveMax(N/2,x)@(N/2));
+// };
+// ```
+//
+// What if we want to look at a number of values that's not a power of 2?
+// For each value, we will have to decide whether to use it or not.
+// If n is bigger than the index of the value, we use it, otherwise we replace
+// it with (`0-(ma.MAX)`):
+//
+// ```
+// variableMax(n,x) =
+// max(
+// max(
+// (
+// (x@0 : useVal(0)),
+// (x@1 : useVal(1))
+// ):max,
+// (
+// (x@2 : useVal(2)),
+// (x@3 : useVal(3))
+// ):max
+// ),
+// max(
+// (
+// (x@4 : useVal(4)),
+// (x@5 : useVal(5))
+// ):max,
+// (
+// (x@6 : useVal(6)),
+// (x@7 : useVal(7))
+// ):max
+// )
+// )
+// with {
+// useVal(i) = select2((n>=i) , (0-(ma.MAX)),_);
+// };
+// ```
+//
+// Now it becomes impossible to re-use any values. To fix that let's first look
+// at how we'd implement it using recursiveMax, but with a fixed n that is not
+// a power of 2. For example, this is how you'd do it with `n=3`:
+//
+// ```
+// binaryMaxThree(x) =
+// (
+// recursiveMax(1,x)@0, // the first x
+// recursiveMax(2,x)@1 // the second and third x
+// ):max;
+// ```
+//
+// `n=6`
+//
+// ```
+// binaryMaxSix(x) =
+// (
+// recursiveMax(2,x)@0, // first two
+// recursiveMax(4,x)@2 // third trough sixth
+// ):max;
+// ```
+//
+// Note that `recursiveMax(2,x)` is used at a different delay then in
+// `binaryMaxThree`, since it represents 1 and 2, not 2 and 3. Each block is
+// delayed the combined size of the previous blocks.
+//
+// `n=7`
+//
+// ```
+// binaryMaxSeven(x) =
+// (
+// (
+// recursiveMax(1,x)@0, // first x
+// recursiveMax(2,x)@1 // second and third
+// ):max,
+// (
+// recursiveMax(4,x)@3 // fourth trough seventh
+// )
+// ):max;
+// ```
+//
+// To make a variable version, we need to know which powers of two are used,
+// and at which delay time.
+//
+// Then it becomes a matter of:
+//
+// * lining up all the different block sizes in parallel: `sequentialOperatorParOut()`
+// * delaying each the appropriate amount: `sumOfPrevBlockSizes()`
+// * turning it on or off: `useVal()`
+// * getting the maximum of all of them: `parallelOp()`
+//
+// In Faust, we can only do that for a fixed maximum number of values: `maxN`, known at compile time.
+
+//========================================================================================
+// Section contributed by Bart Brouns (bart@magnetophon.nl).
+// SPDX-License-Identifier: GPL-3.0
+// Copyright (C) 2018 Bart Brouns
+
+
+//-----------------------------`(ba.)slidingReduce`-----------------------------
+// Fold-like high order function. Apply a commutative binary operation `op` to
+// the last `n` consecutive samples of a signal `x`. For example :
+// `slidingReduce(max,128,128,0-(ma.MAX))` will compute the maximum of the last
+// 128 samples. The output is updated each sample, unlike reduce, where the
+// output is constant for the duration of a block.
+//
+// #### Usage
+//
+// ```
+// _ : slidingReduce(op,n,maxN,disabledVal) : _
+// ```
+//
+// Where:
+//
+// * `n`: the number of values to process
+// * `maxN`: the maximum number of values to process (int, known at compile time, maxN > 0)
+// * `op`: the operator. Needs to be a commutative one.
+// * `disabledVal`: the value to use when we want to ignore a value.
+//
+// In other words, `op(x,disabledVal)` should equal to `x`. For example,
+// `+(x,0)` equals `x` and `min(x,ma.MAX)` equals `x`. So if we want to
+// calculate the sum, we need to give 0 as `disabledVal`, and if we want the
+// minimum, we need to give `ma.MAX` as `disabledVal`.
+//------------------------------------------------------------------------------
+slidingReduce(op,n,0,disabledVal) = 0:!;
+slidingReduce(op,n,1,disabledVal) = _;
+slidingReduce(op,n,maxN,disabledVal) =
+ sequentialOperatorParOut(maxNrBits(maxN)-1,op) : par(i, maxNrBits(maxN), _@sumOfPrevBlockSizes(i) : useVal(i)) : parallelOp(op, maxNrBits(maxN))
+ with {
+ sequentialOperatorParOut(N,op) = seq(i, N, operator(i));
+ operator(i) = si.bus(i), (_<: _ , op(_,_@(pow2(i))));
+
+ // The sum of all the sizes of the previous blocks
+ sumOfPrevBlockSizes(0) = 0;
+ sumOfPrevBlockSizes(i) = (ba.subseq((allBlockSizes),0,i):>_);
+
+ allBlockSizes = par(i, maxNrBits(maxN-1), (pow2(i)) * isUsed(i));
+ maxNrBits(n) = int2nrOfBits(n);
+
+ // Decide wether or not to use a certain value, based on n
+ useVal(i) = select2(isUsed(i), disabledVal, _);
+
+ isUsed(i) = ba.take(i+1, (int2bin(n,(maxN-1)*2+1)));
+ pow2(i) = 1< -;
+
+
+//------------------------------`(ba.)slidingSump`------------------------------
+// The sliding sum of the last n input samples.
+//
+// It uses a lot more CPU than `ba.slidingSum`, but is numerically stable "forever" in return.
+//
+// #### Usage
+//
+// ```
+// _ : slidingSump(n,maxN) : _
+// ```
+//
+// Where:
+//
+// * `n`: the number of values to process
+// * `maxN`: the maximum number of values to process (int, known at compile time, maxN > 0)
+//------------------------------------------------------------------------------
+slidingSump(n,maxN) = slidingReduce(+,n,maxN,0);
+
+
+//----------------------------`(ba.)slidingMax`--------------------------------
+// The sliding maximum of the last n input samples.
+//
+// #### Usage
+//
+// ```
+// _ : slidingMax(n,maxN) : _
+// ```
+//
+// Where:
+//
+// * `n`: the number of values to process
+// * `maxN`: the maximum number of values to process (int, known at compile time, maxN > 0)
+//------------------------------------------------------------------------------
+slidingMax(n,maxN) = slidingReduce(max,n,maxN,0-(ma.MAX));
+
+//----------------------------`(ba.)slidingMin`--------------------------------
+// The sliding minimum of the last n input samples.
+//
+// #### Usage
+//
+// ```
+// _ : slidingMin(n,maxN) : _
+// ```
+//
+// Where:
+//
+// * `n`: the number of values to process
+// * `maxN`: the maximum number of values to process (int, known at compile time, maxN > 0)
+//------------------------------------------------------------------------------
+slidingMin(n,maxN) = slidingReduce(min,n,maxN,ma.MAX);
+
+
+//----------------------------`(ba.)slidingMean`-------------------------------
+// The sliding mean of the last n input samples.
+//
+// It will eventually run into numerical trouble when there is a persistent dc component.
+// If that matters in your application, use the more CPU-intensive `ba.slidingMeanp`.
+//
+// #### Usage
+//
+// ```
+// _ : slidingMean(n) : _
+// ```
+//
+// Where:
+//
+// * `n`: the number of values to process
+//------------------------------------------------------------------------------
+slidingMean(n) = slidingSum(n)/n;
+
+
+//----------------------------`(ba.)slidingMeanp`-------------------------------
+// The sliding mean of the last n input samples.
+//
+// It uses a lot more CPU than `ba.slidingMean`, but is numerically stable "forever" in return.
+//
+// #### Usage
+//
+// ```
+// _ : slidingMeanp(n,maxN) : _
+// ```
+//
+// Where:
+//
+// * `n`: the number of values to process
+// * `maxN`: the maximum number of values to process (int, known at compile time, maxN > 0)
+//------------------------------------------------------------------------------
+slidingMeanp(n,maxN) = slidingSump(n,maxN)/n;
+
+
+//---------------------------`(ba.)slidingRMS`---------------------------------
+// The root mean square of the last n input samples.
+//
+// It will eventually run into numerical trouble when there is a persistent dc component.
+// If that matters in your application, use the more CPU-intensive `ba.slidingRMSp`.
+
+//
+// #### Usage
+//
+// ```
+// _ : slidingRMS(n) : _
+// ```
+//
+// Where:
+//
+// * `n`: the number of values to process
+//------------------------------------------------------------------------------
+slidingRMS(n) = pow(2) : slidingMean(n) : sqrt;
+
+
+//---------------------------`(ba.)slidingRMSp`---------------------------------
+// The root mean square of the last n input samples.
+//
+// It uses a lot more CPU than `ba.slidingRMS`, but is numerically stable "forever" in return.
+//
+// #### Usage
+//
+// ```
+// _ : slidingRMSp(n,maxN) : _
+// ```
+//
+// Where:
+//
+// * `n`: the number of values to process
+// * `maxN`: the maximum number of values to process (int, known at compile time, maxN > 0)
+//------------------------------------------------------------------------------
+slidingRMSp(n,maxn) = pow(2) : slidingMeanp(n,maxn) : sqrt;
+
+
+//========================================================================================
+// section contributed by Bart Brouns (bart@magnetophon.nl).
+// spdx-license-identifier: gpl-3.0
+// copyright (c) 2020 Bart Brouns
+
+//=================================Parallel Operators=========================================
+// Provides various operations on N parallel inputs using a high order
+// `parallelOp(op,N,x)` function:
+//
+// * `parallelMax(N)`: the max of n parallel inputs
+// * `parallelMin(N)`: the min of n parallel inputs
+// * `parallelMean(N)`: the mean of n parallel inputs
+// * `parallelRMS(N)`: the RMS of n parallel inputs
+
+//-----------------------------`(ba.)parallelOp`-----------------------------
+// Apply a commutative binary operation `op` to N parallel inputs.
+//
+// #### usage
+//
+// ```
+// si.bus(N) : parallelOp(op,N) : _
+// ```
+//
+// where:
+//
+// * `N`: the number of parallel inputs known at compile time
+// * `op`: the operator which needs to be commutative
+//
+//------------------------------------------------------------------------------
+
+parallelOp(op,1) = _;
+parallelOp(op,2) = op;
+parallelOp(op,n) = op(parallelOp(op,n-1));
+
+declare parallelOp author "Bart Brouns";
+declare parallelOp licence "GPL-3.0";
+declare parallelOp copyright "Copyright (c) 2020 Bart Brouns ";
+
+
+//---------------------------`(ba.)parallelMax`---------------------------------
+// The maximum of N parallel inputs.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : parallelMax(N) : _
+// ```
+//
+// Where:
+//
+// * `N`: the number of parallel inputs known at compile time
+//------------------------------------------------------------------------------
+parallelMax(n) = parallelOp(max,n);
+
+declare parallelMax author "Bart Brouns";
+declare parallelMax licence "GPL-3.0";
+declare parallelMax copyright "Copyright (c) 2020 Bart Brouns ";
+
+
+//---------------------------`(ba.)parallelMin`---------------------------------
+// The minimum of N parallel inputs.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : parallelMin(N) : _
+// ```
+//
+// Where:
+//
+// * `N`: the number of parallel inputs known at compile time
+//------------------------------------------------------------------------------
+parallelMin(n) = parallelOp(min,n);
+
+declare parallelMin author "Bart Brouns";
+declare parallelMin licence "GPL-3.0";
+declare parallelMin copyright "Copyright (c) 2020 Bart Brouns ";
+
+
+//---------------------------`(ba.)parallelMean`---------------------------------
+// The mean of N parallel inputs.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : parallelMean(N) : _
+// ```
+//
+// Where:
+//
+// * `N`: the number of parallel inputs known at compile time
+//------------------------------------------------------------------------------
+parallelMean(n) = si.bus(n):>_/n;
+
+declare parallelMean author "Bart Brouns";
+declare parallelMean licence "GPL-3.0";
+declare parallelMean copyright "Copyright (c) 2020 Bart Brouns ";
+
+//---------------------------`(ba.)parallelRMS`---------------------------------
+// The RMS of N parallel inputs.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : parallelRMS(N) : _
+// ```
+//
+// Where:
+//
+// * `N`: the number of parallel inputs known at compile time
+//------------------------------------------------------------------------------
+parallelRMS(n) = par(i, n, pow(2)) : parallelMean(n) : sqrt;
+
+declare parallelRMS author "Bart Brouns";
+declare parallelRMS licence "GPL-3.0";
+declare parallelRMS copyright "Copyright (c) 2020 Bart Brouns ";
+
+//////////////////////////////////Deprecated Functions////////////////////////////////////
+// This section implements functions that used to be in music.lib but that are now
+// considered as "deprecated".
+//////////////////////////////////////////////////////////////////////////////////////////
+
+millisec = ma.SR/1000.0;
+
+time1s = hslider("time", 0, 0, 1000, 0.1)*millisec;
+time2s = hslider("time", 0, 0, 2000, 0.1)*millisec;
+time5s = hslider("time", 0, 0, 5000, 0.1)*millisec;
+time10s = hslider("time", 0, 0, 10000, 0.1)*millisec;
+time21s = hslider("time", 0, 0, 21000, 0.1)*millisec;
+time43s = hslider("time", 0, 0, 43000, 0.1)*millisec;
diff --git a/dist/examples/LIBRARIES/compressors.lib b/dist/examples/LIBRARIES/compressors.lib
new file mode 100644
index 00000000..571647fb
--- /dev/null
+++ b/dist/examples/LIBRARIES/compressors.lib
@@ -0,0 +1,1340 @@
+//#################################### compressors.lib ###################################
+// A library of compressor effects. Its official prefix is `co`.
+//
+// #### References
+// *
+//########################################################################################
+
+/************************************************************************
+************************************************************************
+FAUST library file
+Copyright (C) 2003-2016 GRAME, Centre National de Creation Musicale
+----------------------------------------------------------------------
+This program is free software; you can redistribute it and/or modify
+it under the terms of the GNU Lesser General Public License as
+published by the Free Software Foundation; either version 2.1 of the
+License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+GNU Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with the GNU C Library; if not, write to the Free
+Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
+02111-1307 USA.
+
+EXCEPTION TO THE LGPL LICENSE : As a special exception, you may create a
+larger FAUST program which directly or indirectly imports this library
+file and still distribute the compiled code generated by the FAUST
+compiler, or a modified version of this compiled code, under your own
+copyright and license. This EXCEPTION TO THE LGPL LICENSE explicitly
+grants you the right to freely choose the license for the resulting
+compiled code. In particular the resulting compiled code has no obligation
+to be LGPL or GPL. For example you are free to choose a commercial or
+closed source license or any other license if you decide so.
+************************************************************************
+************************************************************************/
+
+ba = library("basics.lib");
+si = library("signals.lib");
+an = library("analyzers.lib");
+ro = library("routes.lib");
+ma = library("maths.lib");
+it = library("interpolators.lib");
+
+declare name "Faust Compressor Effect Library";
+declare version "0.4";
+
+//=============================Functions Reference========================================
+//========================================================================================
+
+//--------------------`(co.)peak_compression_gain_mono_db`-------------------
+// Mono dynamic range compressor gain computer with dB output.
+// `peak_compression_gain_mono_db` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : peak_compression_gain_mono_db(strength,thresh,att,rel,knee,prePost) : _
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the compression (0 = no compression, 1 means hard limiting, >1 means over-compression)
+// * `thresh`: dB level threshold above which compression kicks in
+// * `att`: attack time = time constant (sec) when level & compression going up
+// * `rel`: release time = time constant (sec) coming out of compression
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// below thresh-(knee/2) there is no gain reduction,
+// above thresh+(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// * `prePost`: places the level detector either at the input or after the gain computer;
+// this turns it from a linear return-to-zero detector into a log domain return-to-threshold detector
+//
+// It uses a strength parameter instead of the traditional ratio, in order to be able to
+// function as a hard limiter.
+// For that you'd need a ratio of infinity:1, and you cannot express that in Faust.
+//
+// Sometimes even bigger ratios are useful:
+// for example a group recording where one instrument is recorded with both a close microphone and a room microphone,
+// and the instrument is loud enough in the room mic when playing loud, but you want to boost it when it is playing soft.
+//
+// #### References
+//
+// *
+// * Digital Dynamic Range Compressor Design,
+// A Tutorial and Analysis,
+// Dimitrios GIANNOULIS (),
+// Michael MASSBERG (),
+// and Josuah D.REISS ()
+//------------------------------------------------------------
+
+declare peak_compression_gain_mono_db author "Bart Brouns";
+declare peak_compression_gain_mono_db license "GPLv3";
+
+peak_compression_gain_mono_db(strength,thresh,att,rel,knee,prePost) =
+ abs : ba.bypass1(prePost,si.onePoleSwitching(att,rel)) : ba.linear2db : gain_computer(strength,thresh,knee) : ba.bypass1((prePost !=1),si.onePoleSwitching(rel,att))
+with {
+ gain_computer(strength,thresh,knee,level) =
+ select3((level>(thresh-(knee/2)))+(level>(thresh+(knee/2))),
+ 0,
+ ((level-thresh+(knee/2)) : pow(2)/(2*max(ma.EPSILON,knee))),
+ (level-thresh))
+ : max(0)*-strength;
+};
+
+
+//--------------------`(co.)peak_compression_gain_N_chan_db`-------------------
+// N channels dynamic range compressor gain computer with dB output.
+// `peak_compression_gain_N_chan_db` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : peak_compression_gain_N_chan_db(strength,thresh,att,rel,knee,prePost,link,N) : si.bus(N)
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the compression (0 = no compression, 1 means hard limiting, >1 means over-compression)
+// * `thresh`: dB level threshold above which compression kicks in
+// * `att`: attack time = time constant (sec) when level & compression going up
+// * `rel`: release time = time constant (sec) coming out of compression
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// below thresh-(knee/2) there is no gain reduction,
+// above thresh+(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// * `prePost`: places the level detector either at the input or after the gain computer;
+// this turns it from a linear return-to-zero detector into a log domain return-to-threshold detector
+// * `link`: the amount of linkage between the channels. 0 = each channel is independent, 1 = all channels have the same amount of gain reduction
+// * `N`: the number of channels of the compressor, known at compile time
+//
+// It uses a strength parameter instead of the traditional ratio, in order to be able to
+// function as a hard limiter.
+// For that you'd need a ratio of infinity:1, and you cannot express that in Faust.
+//
+// Sometimes even bigger ratios are useful:
+// for example a group recording where one instrument is recorded with both a close microphone and a room microphone,
+// and the instrument is loud enough in the room mic when playing loud, but you want to boost it when it is playing soft.
+//
+// #### References
+//
+// *
+// * Digital Dynamic Range Compressor Design,
+// A Tutorial and Analysis,
+// Dimitrios GIANNOULIS (),
+// Michael MASSBERG (),
+// and Josuah D.REISS ()
+//------------------------------------------------------------
+
+declare peak_compression_gain_N_chan_db author "Bart Brouns";
+declare peak_compression_gain_N_chan_db license "GPLv3";
+
+// generalise compression gains for N channels.
+// first we define a mono version:
+peak_compression_gain_N_chan_db(strength,thresh,att,rel,knee,prePost,link,1) =
+ peak_compression_gain_mono_db(strength,thresh,att,rel,knee,prePost);
+
+// The actual N-channels version:
+// Calculate the maximum gain reduction of N channels,
+// and then crossfade between that and each channel's own gain reduction,
+// to link/unlink channels
+peak_compression_gain_N_chan_db(strength,thresh,att,rel,knee,prePost,link,N) =
+ par(i, N, peak_compression_gain_mono_db(strength,thresh,att,rel,knee,prePost))
+ <: (si.bus(N),(ba.parallelMin(N) <: si.bus(N))) : ro.interleave(N,2) : par(i,N,(it.interpolate_linear(link)));
+
+
+//--------------------`(co.)FFcompressor_N_chan`-------------------
+// Feed forward N channels dynamic range compressor.
+// `FFcompressor_N_chan` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : FFcompressor_N_chan(strength,thresh,att,rel,knee,prePost,link,meter,N) : si.bus(N)
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the compression (0 = no compression, 1 means hard limiting, >1 means over-compression)
+// * `thresh`: dB level threshold above which compression kicks in
+// * `att`: attack time = time constant (sec) when level & compression going up
+// * `rel`: release time = time constant (sec) coming out of compression
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// below thresh-(knee/2) there is no gain reduction,
+// above thresh+(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// * `prePost`: places the level detector either at the input or after the gain computer;
+// this turns it from a linear return-to-zero detector into a log domain return-to-threshold detector
+// * `link`: the amount of linkage between the channels. 0 = each channel is independent, 1 = all channels have the same amount of gain reduction
+// * `meter`: a gain reduction meter. It can be implemented like so:
+// `meter = _<:(_, (ba.linear2db:max(maxGR):meter_group((hbargraph("[1][unit:dB][tooltip: gain reduction in dB]", maxGR, 0))))):attach;`
+// * `N`: the number of channels of the compressor, known at compile time
+//
+// It uses a strength parameter instead of the traditional ratio, in order to be able to
+// function as a hard limiter.
+// For that you'd need a ratio of infinity:1, and you cannot express that in Faust.
+//
+// Sometimes even bigger ratios are useful:
+// for example a group recording where one instrument is recorded with both a close microphone and a room microphone,
+// and the instrument is loud enough in the room mic when playing loud, but you want to boost it when it is playing soft.
+//
+// #### References
+//
+// *
+// * Digital Dynamic Range Compressor Design,
+// A Tutorial and Analysis,
+// Dimitrios GIANNOULIS (),
+// Michael MASSBERG (),
+// and Josuah D.REISS ()
+//------------------------------------------------------------
+
+declare FFcompressor_N_chan author "Bart Brouns";
+declare FFcompressor_N_chan license "GPLv3";
+
+// feed forward compressor
+FFcompressor_N_chan(strength,thresh,att,rel,knee,prePost,link,meter,N) =
+ si.bus(N) <: (peak_compression_gain_N_chan_db(strength,thresh,att,rel,knee,prePost,link,N),si.bus(N)) : ro.interleave(N,2) : par(i,N,(meter: ba.db2linear)*_);
+
+
+//--------------------`(co.)FBcompressor_N_chan`-------------------
+// Feed back N channels dynamic range compressor.
+// `FBcompressor_N_chan` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : FBcompressor_N_chan(strength,thresh,att,rel,knee,prePost,link,meter,N) : si.bus(N)
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the compression (0 = no compression, 1 means hard limiting, >1 means over-compression)
+// * `thresh`: dB level threshold above which compression kicks in
+// * `att`: attack time = time constant (sec) when level & compression going up
+// * `rel`: release time = time constant (sec) coming out of compression
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// below thresh-(knee/2) there is no gain reduction,
+// above thresh+(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// * `prePost`: places the level detector either at the input or after the gain computer;
+// this turns it from a linear return-to-zero detector into a log domain return-to-threshold detector
+// * `link`: the amount of linkage between the channels. 0 = each channel is independent, 1 = all channels have the same amount of gain reduction
+// * `meter`: a gain reduction meter. It can be implemented like so:
+// `meter = _ <: (_,(ba.linear2db:max(maxGR):meter_group((hbargraph("[1][unit:dB][tooltip: gain reduction in dB]", maxGR, 0))))):attach;`
+// or it can be omitted by defining `meter = _;`.
+// * `N`: the number of channels of the compressor, known at compile time
+//
+// It uses a strength parameter instead of the traditional ratio, in order to be able to
+// function as a hard limiter.
+// For that you'd need a ratio of infinity:1, and you cannot express that in Faust.
+//
+// Sometimes even bigger ratios are useful:
+// for example a group recording where one instrument is recorded with both a close microphone and a room microphone,
+// and the instrument is loud enough in the room mic when playing loud, but you want to boost it when it is playing soft.
+//
+// #### References
+//
+// *
+// * Digital Dynamic Range Compressor Design,
+// A Tutorial and Analysis,
+// Dimitrios GIANNOULIS (),
+// Michael MASSBERG (),
+// and Josuah D.REISS ()
+//------------------------------------------------------------
+
+declare FBcompressor_N_chan author "Bart Brouns";
+declare FBcompressor_N_chan license "GPLv3";
+
+FBcompressor_N_chan(strength,thresh,att,rel,knee,prePost,link,meter,N) =
+ (peak_compression_gain_N_chan_db(strength,thresh,att,rel,knee,prePost,link,N),si.bus(N) : (ro.interleave(N,2) : par(i,N,(meter : ba.db2linear)*_))) ~ si.bus(N);
+
+
+//--------------------`(co.)FBFFcompressor_N_chan`-------------------
+// Feed forward / feed back N channels dynamic range compressor.
+// The feedback part has a much higher strength, so they end up sounding similar.
+// `FBFFcompressor_N_chan` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : FBFFcompressor_N_chan(strength,thresh,att,rel,knee,prePost,link,FBFF,meter,N) : si.bus(N)
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the compression (0 = no compression, 1 means hard limiting, >1 means over-compression)
+// * `thresh`: dB level threshold above which compression kicks in
+// * `att`: attack time = time constant (sec) when level & compression going up
+// * `rel`: release time = time constant (sec) coming out of compression
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// below thresh-(knee/2) there is no gain reduction,
+// above thresh+(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// * `prePost`: places the level detector either at the input or after the gain computer;
+// this turns it from a linear return-to-zero detector into a log domain return-to-threshold detector
+// * `link`: the amount of linkage between the channels. 0 = each channel is independent, 1 = all channels have the same amount of gain reduction
+// * `FBFF`: fade between feed forward (0) and feed back (1) compression.
+// * `meter`: a gain reduction meter. It can be implemented like so:
+// `meter = _<:(_,(max(maxGR):meter_group((hbargraph("[1][unit:dB][tooltip: gain reduction in dB]", maxGR, 0))))):attach;`
+// * `N`: the number of channels of the compressor, known at compile time
+//
+// It uses a strength parameter instead of the traditional ratio, in order to be able to
+// function as a hard limiter.
+// For that you'd need a ratio of infinity:1, and you cannot express that in Faust.
+//
+// Sometimes even bigger ratios are useful:
+// for example a group recording where one instrument is recorded with both a close microphone and a room microphone,
+// and the instrument is loud enough in the room mic when playing loud, but you want to boost it when it is playing soft.
+//
+// #### References
+//
+// *
+// * Digital Dynamic Range Compressor Design,
+// A Tutorial and Analysis,
+// Dimitrios GIANNOULIS (),
+// Michael MASSBERG (),
+// and Josuah D.REISS ()
+//------------------------------------------------------------
+
+declare FBFFcompressor_N_chan author "Bart Brouns";
+declare FBFFcompressor_N_chan license "GPLv3";
+
+FBFFcompressor_N_chan(strength,thresh,att,rel,knee,prePost,link,FBFF,meter,N) =
+ si.bus(N) <: si.bus(N*2) :
+ (
+ ((par(i,2,peak_compression_gain_N_chan_db(strength*(1+((i==0)*2)),thresh,att,rel,knee,prePost,link,N)) : ro.interleave(N,2) : par(i,N,it.interpolate_linear(FBFF))),si.bus(N))
+ : (ro.interleave(N,2) : par(i,N,(meter : ba.db2linear)*_))
+ )
+ ~ si.bus(N);
+
+
+//--------------------`(co.)RMS_compression_gain_mono_db`-------------------
+// Mono RMS dynamic range compressor gain computer with dB output.
+// `RMS_compression_gain_mono_db` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : RMS_compression_gain_mono_db(strength,thresh,att,rel,knee,prePost) : _
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the compression (0 = no compression, 1 means hard limiting, >1 means over-compression)
+// * `thresh`: dB level threshold above which compression kicks in
+// * `att`: attack time = time constant (sec) when level & compression going up
+// * `rel`: release time = time constant (sec) coming out of compression
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// below thresh-(knee/2) there is no gain reduction,
+// above thresh+(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// * `prePost`: places the level detector either at the input or after the gain computer;
+// this turns it from a linear return-to-zero detector into a log domain return-to-threshold detector
+//
+// It uses a strength parameter instead of the traditional ratio, in order to be able to
+// function as a hard limiter.
+// For that you'd need a ratio of infinity:1, and you cannot express that in Faust.
+//
+// Sometimes even bigger ratios are useful:
+// for example a group recording where one instrument is recorded with both a close microphone and a room microphone,
+// and the instrument is loud enough in the room mic when playing loud, but you want to boost it when it is playing soft.
+//
+// #### References
+//
+// *
+// * Digital Dynamic Range Compressor Design,
+// A Tutorial and Analysis,
+// Dimitrios GIANNOULIS (),
+// Michael MASSBERG (),
+// and Josuah D.REISS ()
+//------------------------------------------------------------
+
+declare RMS_compression_gain_mono_db author "Bart Brouns";
+declare RMS_compression_gain_mono_db license "GPLv3";
+
+RMS_compression_gain_mono_db(strength,thresh,att,rel,knee,prePost) =
+ RMS(rel) : ba.bypass1(prePost,si.onePoleSwitching(att,0)) : ba.linear2db : gain_computer(strength,thresh,knee) : ba.bypass1((prePost!=1),si.onePoleSwitching(0,att))
+ with {
+ gain_computer(strength,thresh,knee,level) =
+ select3((level>(thresh-(knee/2)))+(level>(thresh+(knee/2))),
+ 0,
+ ((level-thresh+(knee/2)) : pow(2)/(2*max(ma.EPSILON,knee))),
+ (level-thresh))
+ : max(0)*-strength;
+ RMS(time) = ba.slidingRMS(s) with {
+ s = ba.sec2samp(time):int:max(1);
+ };
+ };
+
+//--------------------`(co.)RMS_compression_gain_N_chan_db`-------------------
+// RMS N channels dynamic range compressor gain computer with dB output.
+// `RMS_compression_gain_N_chan_db` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : RMS_compression_gain_N_chan_db(strength,thresh,att,rel,knee,prePost,link,N) : si.bus(N)
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the compression (0 = no compression, 1 means hard limiting, >1 means over-compression)
+// * `thresh`: dB level threshold above which compression kicks in
+// * `att`: attack time = time constant (sec) when level & compression going up
+// * `rel`: release time = time constant (sec) coming out of compression
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// below thresh-(knee/2) there is no gain reduction,
+// above thresh+(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// * `prePost`: places the level detector either at the input or after the gain computer;
+// this turns it from a linear return-to-zero detector into a log domain return-to-threshold detector
+// * `link`: the amount of linkage between the channels. 0 = each channel is independent, 1 = all channels have the same amount of gain reduction
+// * `N`: the number of channels of the compressor
+//
+// It uses a strength parameter instead of the traditional ratio, in order to be able to
+// function as a hard limiter.
+// For that you'd need a ratio of infinity:1, and you cannot express that in Faust.
+//
+// Sometimes even bigger ratios are useful:
+// for example a group recording where one instrument is recorded with both a close microphone and a room microphone,
+// and the instrument is loud enough in the room mic when playing loud, but you want to boost it when it is playing soft.
+//
+// #### References
+//
+// *
+// * Digital Dynamic Range Compressor Design,
+// A Tutorial and Analysis,
+// Dimitrios GIANNOULIS (),
+// Michael MASSBERG (),
+// and Josuah D.REISS ()
+//------------------------------------------------------------
+
+declare RMS_compression_gain_N_chan_db author "Bart Brouns";
+declare RMS_compression_gain_N_chan_db license "GPLv3";
+
+RMS_compression_gain_N_chan_db(strength,thresh,att,rel,knee,prePost,link,1) =
+ RMS_compression_gain_mono_db(strength,thresh,att,rel,knee,prePost);
+
+RMS_compression_gain_N_chan_db(strength,thresh,att,rel,knee,prePost,link,N) =
+ par(i,N,RMS_compression_gain_mono_db(strength,thresh,att,rel,knee,prePost))
+ <: (si.bus(N),(ba.parallelMin(N) <: si.bus(N))) : ro.interleave(N,2) : par(i,N,(it.interpolate_linear(link)));
+
+
+//--------------------`(co.)RMS_FBFFcompressor_N_chan`-------------------
+// RMS feed forward / feed back N channels dynamic range compressor.
+// the feedback part has a much higher strength, so they end up sounding similar
+// `RMS_FBFFcompressor_N_chan` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : RMS_FBFFcompressor_N_chan(strength,thresh,att,rel,knee,prePost,link,FBFF,meter,N) : si.bus(N)
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the compression (0 = no compression, 1 means hard limiting, >1 means over-compression)
+// * `thresh`: dB level threshold above which compression kicks in
+// * `att`: attack time = time constant (sec) when level & compression going up
+// * `rel`: release time = time constant (sec) coming out of compression
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// below thresh-(knee/2) there is no gain reduction,
+// above thresh+(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// * `prePost`: places the level detector either at the input or after the gain computer;
+// this turns it from a linear return-to-zero detector into a log domain return-to-threshold detector
+// * `link`: the amount of linkage between the channels. 0 = each channel is independent, 1 = all channels have the same amount of gain reduction
+// * `FBFF`: fade between feed forward (0) and feed back (1) compression.
+// * `meter`: a gain reduction meter. It can be implemented like so:
+// `meter = _<:(_,(max(maxGR):meter_group((hbargraph("[1][unit:dB][tooltip: gain reduction in dB]", maxGR, 0))))):attach;`
+// * `N`: the number of channels of the compressor, known at compile time
+//
+// It uses a strength parameter instead of the traditional ratio, in order to be able to
+// function as a hard limiter.
+// For that you'd need a ratio of infinity:1, and you cannot express that in Faust.
+//
+// Sometimes even bigger ratios are useful:
+// for example a group recording where one instrument is recorded with both a close microphone and a room microphone,
+// and the instrument is loud enough in the room mic when playing loud, but you want to boost it when it is playing soft.
+//
+// To save CPU we cheat a bit, in a similar way as in the original libs:
+// instead of crosfading between two sets of gain calculators as above,
+// we take the abs of the audio from both the FF and FB, and crossfade between those,
+// and feed that into one set of gain calculators
+// again the strength is much higher when in FB mode, but implemented differently.
+//
+// #### References
+//
+// *
+// * Digital Dynamic Range Compressor Design,
+// A Tutorial and Analysis,
+// Dimitrios GIANNOULIS (),
+// Michael MASSBERG (),
+// and Josuah D.REISS ()
+//------------------------------------------------------------
+
+declare RMS_FBFFcompressor_N_chan author "Bart Brouns";
+declare RMS_FBFFcompressor_N_chan license "GPLv3";
+
+RMS_FBFFcompressor_N_chan(strength,thresh,att,rel,knee,prePost,link,FBFF,meter,N) =
+ si.bus(N) <: si.bus(N*2):
+ (
+ ((ro.interleave(N,2) : par(i,N*2,abs) :par(i,N,it.interpolate_linear(FBFF)) : RMS_compression_gain_N_chan_db(strength*(1+((FBFF*-1)+1)),thresh,att,rel,knee,prePost,link,N)),si.bus(N))
+ : (ro.interleave(N,2) : par(i,N,(meter: ba.db2linear)*_))
+ )
+ ~ si.bus(N);
+
+
+//--------------------`(co.)RMS_FBcompressor_peak_limiter_N_chan`-------------------
+// N channel RMS feed back compressor into peak limiter feeding back into the FB compressor.
+// By combining them this way, they complement each other optimally:
+// the RMS compressor doesn't have to deal with the peaks,
+// and the peak limiter get's spared from the steady state signal.
+// The feedback part has a much higher strength, so they end up sounding similar.
+// `RMS_FBcompressor_peak_limiter_N_chan` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : RMS_FBcompressor_peak_limiter_N_chan(strength,thresh,threshLim,att,rel,knee,link,meter,meterLim,N) : si.bus(N)
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the compression (0 = no compression, 1 means hard limiting, >1 means over-compression)
+// * `thresh`: dB level threshold above which compression kicks in
+// * `threshLim`: dB level threshold above which the brickwall limiter kicks in
+// * `att`: attack time = time constant (sec) when level & compression going up
+// this is also used as the release time of the limiter
+// * `rel`: release time = time constant (sec) coming out of compression
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// below thresh-(knee/2) there is no gain reduction,
+// above thresh+(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// the limiter uses a knee half this size
+// * `link`: the amount of linkage between the channels. 0 = each channel is independent, 1 = all channels have the same amount of gain reduction
+// * `meter`: compressor gain reduction meter. It can be implemented like so:
+// `meter = _<:(_,(max(maxGR):meter_group((hbargraph("[1][unit:dB][tooltip: gain reduction in dB]", maxGR, 0))))):attach;`
+// * `meterLim`: brickwall limiter gain reduction meter. It can be implemented like so:
+// `meterLim = _<:(_,(max(maxGR):meter_group((hbargraph("[1][unit:dB][tooltip: gain reduction in dB]", maxGR, 0))))):attach;`
+// * `N`: the number of channels of the compressor, known at compile time
+//
+// It uses a strength parameter instead of the traditional ratio, in order to be able to
+// function as a hard limiter.
+// For that you'd need a ratio of infinity:1, and you cannot express that in Faust.
+//
+// Sometimes even bigger ratios are useful:
+// for example a group recording where one instrument is recorded with both a close microphone and a room microphone,
+// and the instrument is loud enough in the room mic when playing loud, but you want to boost it when it is playing soft.
+//
+// #### References
+//
+// *
+// * Digital Dynamic Range Compressor Design,
+// A Tutorial and Analysis,
+// Dimitrios GIANNOULIS (),
+// Michael MASSBERG (),
+// and Josuah D.REISS ()
+//------------------------------------------------------------
+
+declare RMS_FBcompressor_peak_limiter_N_chan author "Bart Brouns";
+declare RMS_FBcompressor_peak_limiter_N_chan license "GPLv3";
+
+RMS_FBcompressor_peak_limiter_N_chan(strength,thresh,threshLim,att,rel,knee,link,meter,meterLim,N) =
+ (((RMS_compression_gain_N_chan_db(strength,thresh,att,rel,knee,0,link,N)),si.bus(N)) : ro.interleave(N,2) : par(i,N,(meter : ba.db2linear)*_) : FFcompressor_N_chan(1,threshLim,0,att:min(rel),knee*0.5,0,link,meterLim : ba.db2linear,N))
+ ~ si.bus(N);
+
+
+//===========================Linear gain computer section=================================
+// The gain computer functions in this section have been replaced by a version that outputs dBs,
+// but we retain the linear output version for backward compatibility.
+//========================================================================================
+//
+//--------------------`(co.)peak_compression_gain_mono`-------------------
+// Mono dynamic range compressor gain computer with linear output.
+// `peak_compression_gain_mono` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : peak_compression_gain_mono(strength,thresh,att,rel,knee,prePost) : _
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the compression (0 = no compression, 1 means hard limiting, >1 means over-compression)
+// * `thresh`: dB level threshold above which compression kicks in
+// * `att`: attack time = time constant (sec) when level & compression going up
+// * `rel`: release time = time constant (sec) coming out of compression
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// below thresh-(knee/2) there is no gain reduction,
+// above thresh+(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// * `prePost`: places the level detector either at the input or after the gain computer;
+// this turns it from a linear return-to-zero detector into a log domain return-to-threshold detector
+//
+// It uses a strength parameter instead of the traditional ratio, in order to be able to
+// function as a hard limiter.
+// For that you'd need a ratio of infinity:1, and you cannot express that in Faust.
+//
+// Sometimes even bigger ratios are useful:
+// for example a group recording where one instrument is recorded with both a close microphone and a room microphone,
+// and the instrument is loud enough in the room mic when playing loud, but you want to boost it when it is playing soft.
+//
+// #### References
+//
+// *
+// * Digital Dynamic Range Compressor Design,
+// A Tutorial and Analysis,
+// Dimitrios GIANNOULIS (),
+// Michael MASSBERG (),
+// and Josuah D.REISS ()
+//------------------------------------------------------------
+
+declare peak_compression_gain_mono author "Bart Brouns";
+declare peak_compression_gain_mono license "GPLv3";
+
+peak_compression_gain_mono(strength,thresh,att,rel,knee,prePost) =
+ peak_compression_gain_mono_db(strength,thresh,att,rel,knee,prePost):ba.db2linear;
+
+
+//--------------------`(co.)peak_compression_gain_N_chan`-------------------
+// N channels dynamic range compressor gain computer with linear output.
+// `peak_compression_gain_N_chan` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : peak_compression_gain_N_chan(strength,thresh,att,rel,knee,prePost,link,N) : si.bus(N)
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the compression (0 = no compression, 1 means hard limiting, >1 means over-compression)
+// * `thresh`: dB level threshold above which compression kicks in
+// * `att`: attack time = time constant (sec) when level & compression going up
+// * `rel`: release time = time constant (sec) coming out of compression
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// below thresh-(knee/2) there is no gain reduction,
+// above thresh+(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// * `prePost`: places the level detector either at the input or after the gain computer;
+// this turns it from a linear return-to-zero detector into a log domain return-to-threshold detector
+// * `link`: the amount of linkage between the channels. 0 = each channel is independent, 1 = all channels have the same amount of gain reduction
+// * `N`: the number of channels of the compressor, known at compile time
+//
+// It uses a strength parameter instead of the traditional ratio, in order to be able to
+// function as a hard limiter.
+// For that you'd need a ratio of infinity:1, and you cannot express that in Faust.
+//
+// Sometimes even bigger ratios are useful:
+// for example a group recording where one instrument is recorded with both a close microphone and a room microphone,
+// and the instrument is loud enough in the room mic when playing loud, but you want to boost it when it is playing soft.
+//
+// #### References
+//
+// *
+// * Digital Dynamic Range Compressor Design,
+// A Tutorial and Analysis,
+// Dimitrios GIANNOULIS (),
+// Michael MASSBERG (),
+// and Josuah D.REISS ()
+//------------------------------------------------------------
+
+declare peak_compression_gain_N_chan author "Bart Brouns";
+declare peak_compression_gain_N_chan license "GPLv3";
+
+// generalise compression gains for N channels.
+// first we define a mono version:
+peak_compression_gain_N_chan(strength,thresh,att,rel,knee,prePost,link,N) =
+ peak_compression_gain_N_chan_db(strength,thresh,att,rel,knee,prePost,link,N)
+ : par(i, N, ba.db2linear);
+
+//--------------------`(co.)RMS_compression_gain_mono`-------------------
+// Mono RMS dynamic range compressor gain computer with linear output.
+// `RMS_compression_gain_mono` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : RMS_compression_gain_mono(strength,thresh,att,rel,knee,prePost) : _
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the compression (0 = no compression, 1 means hard limiting, >1 means over-compression)
+// * `thresh`: dB level threshold above which compression kicks in
+// * `att`: attack time = time constant (sec) when level & compression going up
+// * `rel`: release time = time constant (sec) coming out of compression
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// below thresh-(knee/2) there is no gain reduction,
+// above thresh+(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// * `prePost`: places the level detector either at the input or after the gain computer;
+// this turns it from a linear return-to-zero detector into a log domain return-to-threshold detector
+//
+// It uses a strength parameter instead of the traditional ratio, in order to be able to
+// function as a hard limiter.
+// For that you'd need a ratio of infinity:1, and you cannot express that in Faust.
+//
+// Sometimes even bigger ratios are useful:
+// for example a group recording where one instrument is recorded with both a close microphone and a room microphone,
+// and the instrument is loud enough in the room mic when playing loud, but you want to boost it when it is playing soft.
+//
+// #### References
+//
+// *
+// * Digital Dynamic Range Compressor Design,
+// A Tutorial and Analysis,
+// Dimitrios GIANNOULIS (),
+// Michael MASSBERG (),
+// and Josuah D.REISS ()
+//------------------------------------------------------------
+
+declare RMS_compression_gain_mono author "Bart Brouns";
+declare RMS_compression_gain_mono license "GPLv3";
+
+RMS_compression_gain_mono(strength,thresh,att,rel,knee,prePost) =
+ RMS_compression_gain_mono_db(strength,thresh,att,rel,knee,prePost):ba.db2linear;
+
+
+//--------------------`(co.)RMS_compression_gain_N_chan`-------------------
+// RMS N channels dynamic range compressor gain computer with linear output.
+// `RMS_compression_gain_N_chan` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : RMS_compression_gain_N_chan(strength,thresh,att,rel,knee,prePost,link,N) : si.bus(N)
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the compression (0 = no compression, 1 means hard limiting, >1 means over-compression)
+// * `thresh`: dB level threshold above which compression kicks in
+// * `att`: attack time = time constant (sec) when level & compression going up
+// * `rel`: release time = time constant (sec) coming out of compression
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// below thresh-(knee/2) there is no gain reduction,
+// above thresh+(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// * `prePost`: places the level detector either at the input or after the gain computer;
+// this turns it from a linear return-to-zero detector into a log domain return-to-threshold detector
+// * `link`: the amount of linkage between the channels. 0 = each channel is independent, 1 = all channels have the same amount of gain reduction
+// * `N`: the number of channels of the compressor, known at compile time
+//
+// It uses a strength parameter instead of the traditional ratio, in order to be able to
+// function as a hard limiter.
+// For that you'd need a ratio of infinity:1, and you cannot express that in Faust.
+//
+// Sometimes even bigger ratios are useful:
+// for example a group recording where one instrument is recorded with both a close microphone and a room microphone,
+// and the instrument is loud enough in the room mic when playing loud, but you want to boost it when it is playing soft.
+//
+// #### References
+//
+// *
+// * Digital Dynamic Range Compressor Design,
+// A Tutorial and Analysis,
+// Dimitrios GIANNOULIS (),
+// Michael MASSBERG (),
+// and Josuah D.REISS ()
+//------------------------------------------------------------
+
+declare RMS_compression_gain_N_chan author "Bart Brouns";
+declare RMS_compression_gain_N_chan license "GPLv3";
+
+RMS_compression_gain_N_chan(strength,thresh,att,rel,knee,prePost,link,N) =
+ RMS_compression_gain_N_chan_db(strength,thresh,att,rel,knee,prePost,link,N)
+ : par(i, N, ba.db2linear);
+
+
+//=============================Original versions section=============================
+// The functions in this section are largely superseded by the limiters above, but we
+// retain them for backward compatibility and for situations in which a more permissive,
+// MIT-style license is required.
+//========================================================================================
+
+//--------------------`(co.)compressor_lad_mono`-------------------
+// Mono dynamic range compressor with lookahead delay.
+// `compressor_lad_mono` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : compressor_lad_mono(lad,ratio,thresh,att,rel) : _
+// ```
+//
+// Where:
+//
+// * `lad`: lookahead delay in seconds (nonnegative) - gets rounded to nearest sample.
+// The effective attack time is a good setting.
+// * `ratio`: compression ratio (1 = no compression, >1 means compression)
+// Ratios: 4 is moderate compression, 8 is strong compression,
+// 12 is mild limiting, and 20 is pretty hard limiting at the threshold.
+// * `thresh`: dB level threshold above which compression kicks in (0 dB = max level)
+// * `att`: attack time = time constant (sec) when level & compression are going up
+// * `rel`: release time = time constant (sec) coming out of compression
+//
+// #### References
+//
+// *
+// *
+// * Albert Graef's "faust2pd"/examples/synth/compressor_.dsp
+// * More features:
+//------------------------------------------------------------
+declare compressor_lad_mono author "Julius O. Smith III";
+declare compressor_lad_mono copyright
+ "Copyright (C) 2014-2020 by Julius O. Smith III ";
+declare compressor_lad_mono license "MIT-style STK-4.3 license";
+compressor_lad_mono(lad,ratio,thresh,att,rel,x)
+ = x@max(0,floor(0.5+ma.SR*lad)) * compression_gain_mono(ratio,thresh,att,rel,x);
+
+//--------------------`(co.)compressor_mono`-------------------
+// Mono dynamic range compressors.
+// `compressor_mono` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : compressor_mono(ratio,thresh,att,rel) : _
+// ```
+//
+// Where:
+//
+// * `ratio`: compression ratio (1 = no compression, >1 means compression)
+// Ratios: 4 is moderate compression, 8 is strong compression,
+// 12 is mild limiting, and 20 is pretty hard limiting at the threshold.
+// * `thresh`: dB level threshold above which compression kicks in (0 dB = max level)
+// * `att`: attack time = time constant (sec) when level & compression are going up
+// * `rel`: release time = time constant (sec) coming out of compression
+//
+// #### References
+//
+// *
+// *
+// * Albert Graef's "faust2pd"/examples/synth/compressor_.dsp
+// * More features:
+//------------------------------------------------------------
+declare compressor_mono author "Julius O. Smith III";
+declare compressor_mono copyright
+ "Copyright (C) 2014-2020 by Julius O. Smith III ";
+declare compressor_mono license "MIT-style STK-4.3 license";
+compressor_mono = compressor_lad_mono(0);
+
+//--------------------`(co.)compressor_stereo`-------------------
+// Stereo dynamic range compressors.
+//
+// #### Usage
+//
+// ```
+// _,_ : compressor_stereo(ratio,thresh,att,rel) : _,_
+// ```
+//
+// Where:
+//
+// * `ratio`: compression ratio (1 = no compression, >1 means compression)
+// * `thresh`: dB level threshold above which compression kicks in (0 dB = max level)
+// * `att`: attack time = time constant (sec) when level & compression going up
+// * `rel`: release time = time constant (sec) coming out of compression
+//
+// #### References
+//
+// *
+// *
+// * Albert Graef's "faust2pd"/examples/synth/compressor_.dsp
+// * More features:
+//------------------------------------------------------------
+declare compressor_stereo author "Julius O. Smith III";
+declare compressor_stereo copyright
+ "Copyright (C) 2014-2020 by Julius O. Smith III ";
+declare compressor_stereo license "MIT-style STK-4.3 license";
+compressor_stereo(ratio,thresh,att,rel,x,y) = cgm*x, cgm*y with {
+ cgm = compression_gain_mono(ratio,thresh,att,rel,abs(x)+abs(y));
+};
+
+//--------------------`(co.)compression_gain_mono`-------------------
+// Compression-gain calculation for dynamic range compressors.
+//
+// #### Usage
+//
+// ```
+// _ : compression_gain_mono(ratio,thresh,att,rel) : _
+// ```
+//
+// Where:
+//
+// * `ratio`: compression ratio (1 = no compression, >1 means compression)
+// * `thresh`: dB level threshold above which compression kicks in (0 dB = max level)
+// * `att`: attack time = time constant (sec) when level & compression going up
+// * `rel`: release time = time constant (sec) coming out of compression
+//
+// #### References
+//
+// *
+// *
+// * Albert Graef's "faust2pd"/examples/synth/compressor_.dsp
+// * More features:
+//------------------------------------------------------------
+declare compression_gain_mono author "Julius O. Smith III";
+declare compression_gain_mono copyright
+ "Copyright (C) 2014-2020 by Julius O. Smith III ";
+declare compression_gain_mono license "MIT-style STK-4.3 license";
+compression_gain_mono(ratio,thresh,att,rel) =
+ an.amp_follower_ar(att,rel) : ba.linear2db : outminusindb(ratio,thresh) :
+ kneesmooth(att) : ba.db2linear
+with {
+ // kneesmooth(att) installs a "knee" in the dynamic-range compression,
+ // where knee smoothness is set equal to half that of the compression-attack.
+ // A general 'knee' parameter could be used instead of tying it to att/2:
+ kneesmooth(att) = si.smooth(ba.tau2pole(att/2.0));
+ // compression gain in dB:
+ outminusindb(ratio,thresh,level) = max(level-thresh,0.0) * (1.0/max(ma.EPSILON,float(ratio))-1.0);
+ // Note: "float(ratio)" REQUIRED when ratio is an integer > 1!
+};
+
+//----------------`(co.)limiter_1176_R4_mono`----------------------
+// A limiter guards against hard-clipping. It can be
+// implemented as a compressor having a high threshold (near the
+// clipping level), fast attack, and high ratio. Since
+// the compression ratio is so high, some knee smoothing is
+// desirable (for softer limiting). This example is intended
+// to get you started using compressors as limiters, so all
+// parameters are hardwired here to nominal values.
+//
+// Ratio: 4 (moderate compression)
+// See `compressor_mono` comments for a guide to other choices.
+// Mike Shipley likes this (lowest) setting on the 1176.
+// (Grammy award-winning mixer for Queen, Tom Petty, etc.).
+//
+// Thresh: -6 dB, meaning 4:1 compression begins at amplitude 1/2.
+//
+// Att: 800 MICROseconds (Note: scaled by ratio in the 1176)
+// The 1176 range is said to be 20-800 microseconds.
+// Faster attack gives "more bite" (e.g. on vocals),
+// and makes hard-clipping less likely on fast overloads.
+//
+// Rel: 0.5 s (Note: scaled by ratio in the 1176)
+// The 1176 range is said to be 50-1100 ms.
+//
+// The 1176 also has a "bright, clear eq effect" (use filters.lib if desired).
+// `limiter_1176_R4_mono` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : limiter_1176_R4_mono : _
+// ```
+//
+// #### Reference:
+//
+//
+//------------------------------------------------------------
+declare limiter_1176_R4_mono author "Julius O. Smith III";
+declare limiter_1176_R4_mono copyright
+ "Copyright (C) 2014-2020 by Julius O. Smith III ";
+declare limiter_1176_R4_mono license "MIT-style STK-4.3 license";
+limiter_1176_R4_mono = compressor_mono(4,-6,0.0008,0.5);
+
+//-------------------`(co.)limiter_1176_R4_stereo`---------------------
+// A limiter guards against hard-clipping. It can be
+// implemented as a compressor having a high threshold (near the
+// clipping level), fast attack and release, and high ratio. Since
+// the ratio is so high, some knee smoothing is
+// desirable ("soft limiting"). This example is intended
+// to get you started using compressor_* as a limiter, so all
+// parameters are hardwired to nominal values here.
+//
+// Ratios: 4 (moderate compression), 8 (severe compression),
+// 12 (mild limiting), or 20 to 1 (hard limiting).
+//
+// Att: 20-800 MICROseconds (Note: scaled by ratio in the 1176).
+//
+// Rel: 50-1100 ms (Note: scaled by ratio in the 1176).
+//
+// Mike Shipley likes 4:1 (Grammy-winning mixer for Queen, Tom Petty, etc.)
+// Faster attack gives "more bite" (e.g. on vocals).
+// He hears a bright, clear eq effect as well (not implemented here).
+//
+// #### Usage
+//
+// ```
+// _,_ : limiter_1176_R4_stereo : _,_
+// ```
+//
+// #### Reference:
+//
+//
+//------------------------------------------------------------
+declare limiter_1176_R4_stereo author "Julius O. Smith III";
+declare limiter_1176_R4_stereo copyright
+ "Copyright (C) 2014-2020 by Julius O. Smith III ";
+declare limiter_1176_R4_stereo license "MIT-style STK-4.3 license";
+limiter_1176_R4_stereo = compressor_stereo(4,-6,0.0008,0.5);
+
+
+//==================================Expanders=============================================
+//========================================================================================
+
+//--------------------`(co.)peak_expansion_gain_N_chan_db`-------------------
+// N channels dynamic range expander gain computer.
+// `peak_expansion_gain_N_chan_db` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : peak_expansion_gain_N_chan_db(strength,thresh,range,att,hold,rel,knee,prePost,link,maxHold,N) : si.bus(N)
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the expansion (0 = no expansion, 100 means gating, <1 means upward compression)
+// * `thresh`: dB level threshold below which expansion kicks in
+// * `range`: maximum amount of expansion in dB
+// * `att`: attack time = time constant (sec) coming out of expansion
+// * `hold` : hold time (sec)
+// * `rel`: release time = time constant (sec) going into expansion
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// above thresh+(knee/2) there is no gain reduction,
+// below thresh-(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// * `prePost`: places the level detector either at the input or after the gain computer;
+// this turns it from a linear return-to-zero detector into a log domain return-to-range detector
+// * `link`: the amount of linkage between the channels. 0 = each channel is independent, 1 = all channels have the same amount of gain reduction
+// * `maxHold`: the maximum hold time in samples, known at compile time
+// * `N`: the number of channels of the gain computer, known at compile time
+//
+//------------------------------------------------------------
+
+declare peak_expansion_gain_N_chan_db author "Bart Brouns";
+declare peak_expansion_gain_N_chan_db license "GPLv3";
+
+// generalise expansion gains for N channels.
+// first we define a mono version:
+peak_expansion_gain_N_chan_db(strength,thresh,range,att,hold,rel,knee,prePost,link,maxHold,1) =
+ peak_expansion_gain_mono_db(maxHold,strength,thresh,range,att,hold,rel,knee,prePost);
+
+// The actual N-channels version:
+// Calculate the maximum gain reduction of N channels,
+// and then crossfade between that and each channel's own gain reduction,
+// to link/unlink channels
+peak_expansion_gain_N_chan_db(strength,thresh,range,att,hold,rel,knee,prePost,link,maxHold,N) =
+ par(i, N, peak_expansion_gain_mono_db(maxHold,strength,thresh,range,att,hold,rel,knee,prePost))
+
+ <: (si.bus(N),(ba.parallelMax(N) <: si.bus(N))) : ro.interleave(N,2) : par(i,N,(it.interpolate_linear(link)));
+
+
+peak_expansion_gain_mono_db(maxHold,strength,thresh,range,attack,hold,release,knee,prePost) =
+ level(hold,maxHold):ba.bypass1(prePost,si.lag_ud(attack,release)) :ba.linear2db : gain_computer(strength,thresh,range,knee) : ba.bypass1((prePost !=1),si.lag_ud(att,rel))
+with {
+ gain_computer(strength,thresh,range,knee,level) =
+ (select3((level>(thresh-(knee/2)))+(level>(thresh+(knee/2)))
+ , (level-thresh)
+ , ((level-thresh-(knee/2)):pow(2) /(min(ma.EPSILON,knee*-2)))
+ , 0
+ ) *abs(strength):max(range) * (-1+(2*(strength>0)))
+ );
+ att = select2((strength>0),release,attack);
+ rel = select2((strength>0),attack,release);
+ level(hold,maxHold,x) = x : abs : ba.slidingMax(hold*ma.SR,maxHold);
+};
+
+
+//--------------------`(co.)expander_N_chan`-------------------
+// Feed forward N channels dynamic range expander.
+// `expander_N_chan` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : expander_N_chan(strength,thresh,range,att,hold,rel,knee,prePost,link,meter,maxHold,N) : si.bus(N)
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the expansion (0 = no expansion, 100 means gating, <1 means upward compression)
+// * `thresh`: dB level threshold below which expansion kicks in
+// * `range`: maximum amount of expansion in dB
+// * `att`: attack time = time constant (sec) coming out of expansion
+// * `hold` : hold time
+// * `rel`: release time = time constant (sec) going into expansion
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// above thresh+(knee/2) there is no gain reduction,
+// below thresh-(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// * `prePost`: places the level detector either at the input or after the gain computer;
+// this turns it from a linear return-to-zero detector into a log domain return-to-range detector
+// * `link`: the amount of linkage between the channels. 0 = each channel is independent, 1 = all channels have the same amount of gain reduction
+// * `meter`: a gain reduction meter. It can be implemented like so:
+// `meter = _<:(_, (ba.linear2db:max(maxGR):meter_group((hbargraph("[1][unit:dB][tooltip: gain reduction in dB]", maxGR, 0))))):attach;`
+// * `maxHold`: the maximum hold time in samples, known at compile time
+// * `N`: the number of channels of the expander, known at compile time
+//
+//------------------------------------------------------------
+
+declare expander_N_chan author "Bart Brouns";
+declare expander_N_chan license "GPLv3";
+
+// Feed forward expander
+expander_N_chan(strength,thresh,range,att,hold,rel,knee,prePost,link,meter,maxHold,N) =
+ expanderSC_N_chan(strength,thresh,range,att,hold,rel,knee,prePost,link,meter,maxHold,N,_,0,0);
+
+//--------------------`(co.)expanderSC_N_chan`-------------------
+// Feed forward N channels dynamic range expander with sidechain.
+// `expanderSC_N_chan` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : expanderSC_N_chan(strength,thresh,range,att,hold,rel,knee,prePost,link,meter,maxHold,N,SCfunction,SCswitch,SCsignal) : si.bus(N)
+// ```
+//
+// Where:
+//
+// * `strength`: strength of the expansion (0 = no expansion, 100 means gating, <1 means upward compression)
+// * `thresh`: dB level threshold below which expansion kicks in
+// * `range`: maximum amount of expansion in dB
+// * `att`: attack time = time constant (sec) coming out of expansion
+// * `hold` : hold time
+// * `rel`: release time = time constant (sec) going into expansion
+// * `knee`: a gradual increase in gain reduction around the threshold:
+// above thresh+(knee/2) there is no gain reduction,
+// below thresh-(knee/2) there is the same gain reduction as without a knee,
+// and in between there is a gradual increase in gain reduction.
+// * `prePost`: places the level detector either at the input or after the gain computer;
+// this turns it from a linear return-to-zero detector into a log domain return-to-range detector
+// * `link`: the amount of linkage between the channels. 0 = each channel is independent, 1 = all channels have the same amount of gain reduction
+// * `meter`: a gain reduction meter. It can be implemented like so:
+// `meter = _<:(_, (ba.linear2db:max(maxGR):meter_group((hbargraph("[1][unit:dB][tooltip: gain reduction in dB]", maxGR, 0))))):attach;`
+// * `maxHold`: the maximum hold time in samples, known at compile time
+// * `N`: the number of channels of the expander, known at compile time
+// * `SCfunction` : a function that get's placed before the level-detector, needs to have a single input and output
+// * `SCswitch` : use either the regular audio input or the SCsignal as the input for the level detector
+// * `SCsignal` : an audio signal, to be used as the input for the level detector when SCswitch is 1
+//
+//------------------------------------------------------------
+
+declare expanderSC_N_chan author "Bart Brouns";
+declare expanderSC_N_chan license "GPLv3";
+
+// Feed forward expander with sidechain
+expanderSC_N_chan(strength,thresh,range,att,hold,rel,knee,prePost,link,meter,maxHold,N,SCfunction,SCswitch,SCsignal) =
+ si.bus(N) <:
+ ((par(i, N, select2(SCswitch,_,SCsignal):SCfunction)
+ : peak_expansion_gain_N_chan_db(strength,thresh,range,att,hold,rel,knee,prePost,link,maxHold,N))
+ ,si.bus(N))
+ : ro.interleave(N,2)
+ : par(i,N,(meter:ba.db2linear)*_);
+
+
+//=============================Lookahead Limiters========================================
+//========================================================================================
+
+//-----------------------`(co.)limiter_lad_N`---------------------------------
+// N-channels lookahead limiter inspired by IOhannes Zmölnig's post, which is
+// in turn based on the thesis by Peter Falkner "Entwicklung eines digitalen
+// Stereo-Limiters mit Hilfe des Signalprozessors DSP56001".
+// This version of the limiter uses a peak-holder with smoothed
+// attack and release based on tau time constant filters.
+//
+// It is also possible to use a time constant that is 2PI*tau by dividing
+// the attack and release times by 2PI. This time constant allows for
+// the amplitude profile to reach 1 - e^(-2PI) of the final
+// peak after the attack time. The input path can be delayed by the same
+// amount as the attack time to synchronise input and amplitude profile,
+// realising a system that is particularly effective as a colourless
+// (ideally) brickwall limiter.
+//
+// Note that the effectiveness of the ceiling settings are dependent on
+// the other parameters, especially the time constant used for the
+// smoothing filters and the lookahead delay.
+//
+// Similarly, the colourless characteristics are also dependent on attack,
+// hold, and release times. Since fluctuations above ~15 Hz are
+// perceived as timbral effects, [Vassilakis and Kendall 2010] it is
+// reasonable to set the attack time to 1/15 seconds for a smooth amplitude
+// modulation. On the other hand, the hold time can be set to the
+// peak-to-peak period of the expected lowest frequency in the signal,
+// which allows for minimal distortion of the low frequencies. The
+// release time can then provide a perceptually linear and gradual gain
+// increase determined by the user for any specific application.
+//
+// The scaling factor for all the channels is determined by the loudest peak
+// between them all, so that amplitude ratios between the signals are kept.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : limiter_lad_N(N, LD, ceiling, attack, hold, release) : si.bus(N)
+// ```
+//
+// Where:
+//
+// * `N` is the number of channels, known at compile-time
+// * `LD` is the lookahead delay in seconds, known at compile-time
+// * `ceiling` is the linear amplitude output limit
+// * `attack` is the attack time in seconds
+// * `hold` is the hold time in seconds
+// * `release` is the release time in seconds
+//
+// Example for a stereo limiter: `limiter_lad_N(2, .01, 1, .01, .1, 1);`
+//
+// #### Reference:
+//
+//
+//------------------------------------------------------------------------------
+declare limiter_lad_N author "Dario Sanfilippo";
+declare limiter_lad_N copyright "Copyright (C) 2020 Dario Sanfilippo
+ ";
+declare limiter_lad_N license "GPLv3 license";
+limiter_lad_N(N, LD, ceiling, attack, hold, release) =
+ si.bus(N) <: par(i, N, @(LD * ma.SR)),
+ (scaling <: si.bus(N)) : ro.interleave(N, 2) : par(i, N, *)
+ with {
+ scaling = ceiling / max(amp_profile, ma.EPSILON) : min(1);
+ amp_profile = par(i, N, abs) : maxN(N) : ba.peakholder(hold * ma.SR) :
+ att_smooth(attack) : rel_smooth(release);
+ att_smooth(time, in) = si.smooth(ba.tau2pole(time), in);
+ rel_smooth(time, in) = an.peak_envelope(time, in);
+ maxN(1) = _;
+ maxN(2) = max;
+ maxN(N) = max(maxN(N - 1));
+ };
+
+//-------------`(co.)limiter_lad_mono`----------------------------------------
+//
+// Specialised case of `limiter_lad_N` mono limiter.
+//
+// #### Usage
+//
+// ```
+// _ : limiter_lad_mono(LD, ceiling, attack, hold, release) : _
+// ```
+//
+// Where:
+//
+// * `LD` is the lookahead delay in seconds, known at compile-time
+// * `ceiling` is the linear amplitude output limit
+// * `attack` is the attack time in seconds
+// * `hold` is the hold time in seconds
+// * `release` is the release time in seconds
+//
+// #### Reference:
+//
+//
+//------------------------------------------------------------------------------
+declare limiter_lad_mono author "Dario Sanfilippo";
+declare limiter_lad_mono copyright "Copyright (C) 2020 Dario Sanfilippo
+ ";
+declare limiter_lad_mono license "GPLv3 license";
+limiter_lad_mono(LD) = limiter_lad_N(1, LD);
+
+//-------------`(co.)limiter_lad_stereo`--------------------------------------
+//
+// Specialised case of `limiter_lad_N` stereo limiter.
+//
+// #### Usage
+//
+// ```
+// _,_ : limiter_lad_stereo(LD, ceiling, attack, hold, release) : _,_
+// ```
+//
+// Where:
+//
+// * `LD` is the lookahead delay in seconds, known at compile-time
+// * `ceiling` is the linear amplitude output limit
+// * `attack` is the attack time in seconds
+// * `hold` is the hold time in seconds
+// * `release` is the release time in seconds
+//
+// #### Reference:
+//
+//
+//------------------------------------------------------------------------------
+declare limiter_lad_stereo author "Dario Sanfilippo";
+declare limiter_lad_stereo copyright "Copyright (C) 2020 Dario Sanfilippo
+ ";
+declare limiter_lad_stereo license "GPLv3 license";
+limiter_lad_stereo(LD) = limiter_lad_N(2, LD);
+
+//-------------`(co.)limiter_lad_quad`----------------------------------------
+//
+// Specialised case of `limiter_lad_N` quadraphonic limiter.
+//
+// #### Usage
+//
+// ```
+// si.bus(4) : limiter_lad_quad(LD, ceiling, attack, hold, release) : si.bus(4)
+// ```
+//
+// Where:
+//
+// * `LD` is the lookahead delay in seconds, known at compile-time
+// * `ceiling` is the linear amplitude output limit
+// * `attack` is the attack time in seconds
+// * `hold` is the hold time in seconds
+// * `release` is the release time in seconds
+//
+// #### Reference:
+//
+//
+//------------------------------------------------------------------------------
+declare limiter_lad_quad author "Dario Sanfilippo";
+declare limiter_lad_quad copyright "Copyright (C) 2020 Dario Sanfilippo
+ ";
+declare limiter_lad_quad license "GPLv3 license";
+limiter_lad_quad(LD) = limiter_lad_N(4, LD);
+
+//-------------`(co.)limiter_lad_bw`-----------------------------------------
+//
+// Specialised case of `limiter_lad_N` and ready-to-use unit-amplitude mono
+// limiting function. This implementation, in particular, uses `2PI*tau`
+// time constant filters for attack and release smoothing with
+// synchronised input and gain signals.
+//
+// This function's best application is to be used as a brickwall limiter with
+// the least colouring artefacts while keeping a not-so-slow release curve.
+// Tests have shown that, given a pop song with 60 dB of amplification
+// and a 0-dB-ceiling, the loudest peak recorded was ~0.38 dB.
+//
+// #### Usage
+//
+// ```
+// _ : limiter_lad_bw : _
+// ```
+//
+// #### Reference:
+//
+//
+//------------------------------------------------------------------------------
+declare limiter_lad_bw author "Dario Sanfilippo";
+declare limiter_lad_bw copyright "Copyright (C) 2020 Dario Sanfilippo
+ ";
+declare limiter_lad_bw license "GPLv3 license";
+limiter_lad_bw = limiter_lad_mono(.01, 1, 0.01/twopi, .1, 1/twopi)
+with {
+ twopi = 2 * ma.PI;
+};
diff --git a/dist/examples/LIBRARIES/delays.lib b/dist/examples/LIBRARIES/delays.lib
new file mode 100644
index 00000000..49a1a235
--- /dev/null
+++ b/dist/examples/LIBRARIES/delays.lib
@@ -0,0 +1,401 @@
+
+//#################################### delays.lib #########################################
+// This library contains a collection of delay functions. Its official prefix is `de`.
+//
+// #### References
+// *
+//########################################################################################
+
+/************************************************************************
+************************************************************************
+FAUST library file
+Copyright (C) 2003-2016 GRAME, Centre National de Creation Musicale
+----------------------------------------------------------------------
+This program is free software; you can redistribute it and/or modify
+it under the terms of the GNU Lesser General Public License as
+published by the Free Software Foundation; either version 2.1 of the
+License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+GNU Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with the GNU C Library; if not, write to the Free
+Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
+02111-1307 USA.
+
+EXCEPTION TO THE LGPL LICENSE : As a special exception, you may create a
+larger FAUST program which directly or indirectly imports this library
+file and still distribute the compiled code generated by the FAUST
+compiler, or a modified version of this compiled code, under your own
+copyright and license. This EXCEPTION TO THE LGPL LICENSE explicitly
+grants you the right to freely choose the license for the resulting
+compiled code. In particular the resulting compiled code has no obligation
+to be LGPL or GPL. For example you are free to choose a commercial or
+closed source license or any other license if you decide so.
+************************************************************************
+************************************************************************/
+
+ma = library("maths.lib");
+ba = library("basics.lib");
+si = library("signals.lib");
+fi = library("filters.lib");
+
+declare name "Faust Delay Library";
+declare version "0.1";
+
+//==================================Basic Delay Functions=================================
+//========================================================================================
+
+//-------`(de.)delay`----------
+// Simple `d` samples delay where `n` is the maximum delay length as a number of
+// samples. Unlike the `@` delay operator, here the delay signal `d` is explicitly
+// bounded to the interval [0..n]. The consequence is that delay will compile even
+// if the interval of d can't be computed by the compiler.
+// `delay` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : delay(n,d) : _
+// ```
+//
+// Where:
+//
+// * `n`: the max delay length in samples
+// * `d`: the delay length in samples (integer)
+//-----------------------------
+// TODO: add MBH np2
+delay(n,d,x) = x @ min(n, max(0,d));
+
+
+//-------`(de.)fdelay`----------
+// Simple `d` samples fractional delay based on 2 interpolated delay lines where `n` is
+// the maximum delay length as a number of samples.
+
+// `fdelay` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : fdelay(n,d) : _
+// ```
+//
+// Where:
+//
+// * `n`: the max delay length in samples
+// * `d`: the delay length in samples (float)
+//-----------------------------
+fdelay(n,d,x) = delay(n+1,int(d),x)*(1 - ma.frac(d)) + delay(n+1,int(d)+1,x)*ma.frac(d);
+
+
+//--------------------------`(de.)sdelay`----------------------------
+// s(mooth)delay: a mono delay that doesn't click and doesn't
+// transpose when the delay time is changed.
+//
+// #### Usage
+//
+// ```
+// _ : sdelay(n,it,d) : _
+// ```
+//
+// Where :
+//
+// * `n`: the max delay length in samples
+// * `it`: interpolation time (in samples), for example 1024
+// * `d`: the delay length in samples (float)
+//--------------------------------------------------------------------------
+sdelay(n, it, d) = ctrl(it,d),_ : ddi(n)
+with {
+ // ddi(n,i,d0,d1)
+ // DDI (Double Delay with Interpolation) : the input signal is sent to two
+ // delay lines. The outputs of these delay lines are crossfaded with
+ // an interpolation stage. By acting on this interpolation value one
+ // can move smoothly from one delay to another. When is 0 we can
+ // freely change the delay time of line 1, when it is 1 we can freely change
+ // the delay time of line 0.
+ //
+ // = maximal delay in samples
+ // = interpolation value between 0 and 1 used to crossfade the outputs of the
+ // two delay lines (0.0: first delay line, 1.0: second delay line)
+ // = delay time of delay line 0 in samples between 0 and -1
+ // = delay time of delay line 1 in samples between 0 and -1
+ // < > = the input signal we want to delay
+ ddi(n, i, d0, d1) = _ <: delay(n,d0), delay(n,d1) : si.interpolate(i);
+
+ // ctrl(it,d)
+ // Control logic for a Double Delay with Interpolation according to two
+ //
+ // USAGE : ctrl(it,d)
+ // where :
+ // an interpolation time (in samples, for example 256)
+ // a delay time (in samples)
+ //
+ // ctrl produces 3 outputs : an interpolation value and two delay
+ // times and . These signals are used to control a ddi (Double Delay with Interpolation).
+ // The principle is to detect changes in the input delay time d, then to
+ // change the delay time of the delay line currently unused and then by a
+ // smooth crossfade to remove the first delay line and activate the second one.
+ //
+ // The control logic has an internal state controlled by 4 elements
+ // : the interpolation variation (0, 1/it, -1/it)
+ // : the interpolation value (between 0 and 1)
+ // : the delay time of line 0
+ // : the delay time of line 1
+ //
+ // Please note that the last stage (!,_,_,_) cut because it is only
+ // used internally.
+ ctrl(it, d) = \(v,ip,d0,d1).((nv, nip, nd0, nd1)
+ with {
+ // interpolation variation
+ nv = ba.if (v!=0.0, // if variation we are interpolating
+ ba.if ((ip>0.0) & (ip<1.0), v, 0), // should we continue or not ?
+ ba.if ((ip==0.0) & (d!=d0), 1.0/it, // if true xfade from dl0 to dl1
+ ba.if ((ip==1.0) & (d!=d1), -1.0/it, // if true xfade from dl1 to dl0
+ 0))); // nothing to change
+ // interpolation value
+ nip = ip+nv : min(1.0) : max(0.0);
+
+ // update delay time of line 0 if needed
+ nd0 = ba.if ((ip >= 1.0) & (d1!=d), d, d0);
+
+ // update delay time of line 0 if needed
+ nd1 = ba.if ((ip <= 0.0) & (d0!=d), d, d1);
+ }) ~ (_,_,_,_) : (!,_,_,_);
+};
+
+
+// ----------`(de.)prime_power_delays`-----------
+// Prime Power Delay Line Lengths.
+//
+// #### Usage
+//
+// ```
+// si.bus(N) : prime_power_delays(N,pathmin,pathmax) : si.bus(N);
+// ```
+//
+// Where:
+//
+// * `N`: positive integer up to 16 (for higher powers of 2, extend 'primes' array below)
+// * `pathmin`: minimum acoustic ray length in the reverberator (in meters)
+// * `pathmax`: maximum acoustic ray length (meters) - think "room size"
+//
+// #### Reference
+//
+//
+//------------------------------------------------------------
+declare prime_power_delays author "Julius O. Smith III";
+
+prime_power_delays(N,pathmin,pathmax) = par(i,N,delayvals(i)) with {
+ Np = 16;
+ primes = 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53;
+ prime(n) = primes : ba.selector(n,Np); // math.lib
+
+ // Prime Power Bounds [matlab: floor(log(maxdel)./log(primes(53)))]
+ maxdel = 8192; // more than 63 meters at 44100 samples/sec & 343 m/s
+ ppbs = 13,8,5,4, 3,3,3,3, 2,2,2,2, 2,2,2,2; // 8192 is enough for all
+ ppb(i) = ba.take(i+1,ppbs);
+
+ // Approximate desired delay-line lengths using powers of distinct primes:
+ c = 343; // soundspeed in m/s at 20 degrees C for dry air
+ dmin = ma.SR*pathmin/c;
+ dmax = ma.SR*pathmax/c;
+ dl(i) = dmin * (dmax/dmin)^(i/float(N-1)); // desired delay in samples
+ ppwr(i) = floor(0.5+log(dl(i))/log(prime(i))); // best prime power
+ delayvals(i) = prime(i)^ppwr(i); // each delay a power of a distinct prime
+};
+
+
+//===============================Lagrange Interpolation===================================
+//========================================================================================
+
+//----------------------`(de.)fdelaylti` and `(de.)fdelayltv`-------------------------
+// Fractional delay line using Lagrange interpolation.
+//
+// #### Usage
+//
+// ```
+// _ : fdelaylt[i|v](N, n, d) : _
+// ```
+//
+// Where:
+//
+// * `N=1,2,3,...` is the order of the Lagrange interpolation polynomial (constant numerical expression)
+// * `n`: the max delay length in samples
+// * `d`: the delay length in samples
+//
+// `fdelaylti` is most efficient, but designed for constant/slowly-varying delay.
+// `fdelayltv` is more expensive and more robust when the delay varies rapidly.
+//
+// Note: the requested delay should not be less than `(N-1)/2`.
+//
+// #### References
+//
+// *
+// - [fixed-delay case](https://ccrma.stanford.edu/~jos/Interpolation/Efficient_Time_Invariant_Lagrange_Interpolation.html)
+// - [variable-delay case](https://ccrma.stanford.edu/~jos/Interpolation/Time_Varying_Lagrange_Interpolation.html)
+// * Timo I. Laakso et al., "Splitting the Unit Delay - Tools for Fractional
+// Delay Filter Design", IEEE Signal Processing Magazine,
+// vol. 13, no. 1, pp. 30-60, Jan 1996.
+// * Philippe Depalle and Stephan Tassart, "Fractional Delay Lines using
+// Lagrange Interpolators", ICMC Proceedings, pp. 341-343, 1996.
+//------------------------------------------------------------
+declare fdelaylti author "Julius O. Smith III";
+
+fdelaylti(N,n,d,x) = delay(n,id,x) <: seq(i,N,section(i)) : !,_
+with {
+ o = (N-1.00001)/2; // offset to ~center FIR interpolator
+ dmo = d - o; // assumed nonnegative [d > (N-1)/2]
+ id = int(dmo);
+ fd = o + ma.frac(dmo);
+ section(i,x,y) = (x-x') * c(i) <: _,+(y);
+ c(i) = (i - fd)/(i+1);
+};
+
+declare fdelayltv author "Julius O. Smith III";
+
+fdelayltv(N,n,d,x) = sum(i, N+1, delay(n,id+i,x) * h(N,fd,i))
+with {
+ o = (N-1.00001)/2; // ~center FIR interpolator
+ dmo = d - o; // assumed nonnegative [d > (N-1)/2]
+ id = int(dmo);
+ fd = o + ma.frac(dmo);
+ h(N,d,n) = facs1(N,d,n) * facs2(N,d,n);
+ facs1(N,d,n) = select2(n,1,prod(k,max(1,n),select2(k
+//========================================================================================
+
+//----------------`(de.)fdelay[N]a`-------------
+// Delay lines interpolated using Thiran allpass interpolation.
+//
+// #### Usage
+//
+// ```
+// _ : fdelay[N]a(n, d) : _
+// ```
+//
+// (exactly like `fdelay`)
+//
+// Where:
+//
+// * `N=1,2,3, or 4` is the order of the Thiran interpolation filter (constant numerical expression),
+// and the delay argument is at least `N-1/2`. First-order: `d` at least 0.5, second-order: `d` at least 1.5,
+// third-order: `d` at least 2.5, fourth-order: `d` at least 3.5.
+// * `n`: the max delay length in samples
+// * `d`: the delay length in samples
+//
+// #### Note
+//
+// The interpolated delay should not be less than `N-1/2`.
+// (The allpass delay ranges from `N-1/2` to `N+1/2`).
+// This constraint can be alleviated by altering the code,
+// but be aware that allpass filters approach zero delay
+// by means of pole-zero cancellations.
+//
+// Delay arguments too small will produce an UNSTABLE allpass!
+//
+// Because allpass interpolation is recursive, it is not as robust
+// as Lagrange interpolation under time-varying conditions
+// (you may hear clicks when changing the delay rapidly).
+//
+//------------------------------------------------------------
+declare fdelay1a author "Julius O. Smith III";
+
+fdelay1a(n,d,x) = delay(n,id,x) : fi.tf1(eta,1,eta)
+with {
+ o = 0.49999; // offset to make life easy for allpass
+ dmo = d - o; // assumed nonnegative
+ id = int(dmo);
+ fd = o + ma.frac(dmo);
+ eta = (1-fd)/(1+fd); // allpass coefficient
+};
+
+declare fdelay2a author "Julius O. Smith III";
+fdelay2a(n,d,x) = delay(n,id,x) : fi.tf2(a2,a1,1,a1,a2)
+with {
+ o = 1.49999;
+ dmo = d - o; // delay range is [order-1/2, order+1/2]
+ id = int(dmo);
+ fd = o + ma.frac(dmo);
+ a1o2 = (2-fd)/(1+fd); // share some terms (the compiler does this anyway)
+ a1 = 2*a1o2;
+ a2 = a1o2*(1-fd)/(2+fd);
+};
+
+declare fdelay3a author "Julius O. Smith III";
+fdelay3a(n,d,x) = delay(n,id,x) : fi.iir((a3,a2,a1,1),(a1,a2,a3))
+with {
+ o = 2.49999;
+ dmo = d - o;
+ id = int(dmo);
+ fd = o + ma.frac(dmo);
+ a1o3 = (3-fd)/(1+fd);
+ a2o3 = a1o3*(2-fd)/(2+fd);
+ a1 = 3*a1o3;
+ a2 = 3*a2o3;
+ a3 = a2o3*(1-fd)/(3+fd);
+};
+
+declare fdelay4a author "Julius O. Smith III";
+fdelay4a(n,d,x) = delay(n,id,x) : fi.iir((a4,a3,a2,a1,1),(a1,a2,a3,a4))
+with {
+ o = 3.49999;
+ dmo = d - o;
+ id = int(dmo);
+ fd = o + ma.frac(dmo);
+ a1o4 = (4-fd)/(1+fd);
+ a2o6 = a1o4*(3-fd)/(2+fd);
+ a3o4 = a2o6*(2-fd)/(3+fd);
+ a1 = 4*a1o4;
+ a2 = 6*a2o6;
+ a3 = 4*a3o4;
+ a4 = a3o4*(1-fd)/(4+fd);
+};
+
+//////////////////////////////////Deprecated Functions////////////////////////////////////
+// This section implements functions that used to be in music.lib but that are now
+// considered as "deprecated".
+//////////////////////////////////////////////////////////////////////////////////////////
+
+delay1s(d) = delay(65536,d);
+delay2s(d) = delay(131072,d);
+delay5s(d) = delay(262144,d);
+delay10s(d) = delay(524288,d);
+delay21s(d) = delay(1048576,d);
+delay43s(d) = delay(2097152,d);
+
+fdelay1s(d) = fdelay(65536,d);
+fdelay2s(d) = fdelay(131072,d);
+fdelay5s(d) = fdelay(262144,d);
+fdelay10s(d) = fdelay(524288,d);
+fdelay21s(d) = fdelay(1048576,d);
+fdelay43s(d) = fdelay(2097152,d);
diff --git a/dist/examples/LIBRARIES/demos.lib b/dist/examples/LIBRARIES/demos.lib
new file mode 100644
index 00000000..a3b481db
--- /dev/null
+++ b/dist/examples/LIBRARIES/demos.lib
@@ -0,0 +1,1556 @@
+//#################################### demos.lib ##########################################
+// This library contains a set of demo functions based on examples located in the
+// `/examples` folder. Its official prefix is `dm`.
+//
+// #### References
+// *
+//########################################################################################
+
+/************************************************************************
+************************************************************************
+FAUST library file, GRAME section
+
+Except where noted otherwise, Copyright (C) 2003-2017 by GRAME,
+Centre National de Creation Musicale.
+----------------------------------------------------------------------
+GRAME LICENSE
+
+This program is free software; you can redistribute it and/or modify
+it under the terms of the GNU Lesser General Public License as
+published by the Free Software Foundation; either version 2.1 of the
+License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+GNU Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with the GNU C Library; if not, write to the Free
+Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
+02111-1307 USA.
+
+EXCEPTION TO THE LGPL LICENSE : As a special exception, you may create a
+larger FAUST program which directly or indirectly imports this library
+file and still distribute the compiled code generated by the FAUST
+compiler, or a modified version of this compiled code, under your own
+copyright and license. This EXCEPTION TO THE LGPL LICENSE explicitly
+grants you the right to freely choose the license for the resulting
+compiled code. In particular the resulting compiled code has no obligation
+to be LGPL or GPL. For example you are free to choose a commercial or
+closed source license or any other license if you decide so.
+************************************************************************
+************************************************************************/
+
+ma = library("maths.lib");
+ba = library("basics.lib");
+de = library("delays.lib");
+si = library("signals.lib");
+an = library("analyzers.lib");
+fi = library("filters.lib");
+os = library("oscillators.lib");
+no = library("noises.lib");
+ef = library("misceffects.lib");
+co = library("compressors.lib");
+ve = library("vaeffects.lib");
+pf = library("phaflangers.lib");
+re = library("reverbs.lib");
+en = library("envelopes.lib");
+
+declare name "Faust Demos Library";
+declare version "0.1";
+
+//########################################################################################
+/************************************************************************
+FAUST library file, jos section
+
+Except where noted otherwise, The Faust functions below in this
+section are Copyright (C) 2003-2019 by Julius O. Smith III
+([jos](http://ccrma.stanford.edu/~jos/)), and released under the
+(MIT-style) [STK-4.3](#stk-4.3-license) license.
+
+MarkDown comments in this section are Copyright 2016-2019 by Romain
+Michon and Julius O. Smith III, and are released under the
+[CCA4I](https://creativecommons.org/licenses/by/4.0/) license (TODO: if/when Romain agrees!)
+
+************************************************************************/
+
+//====================================Analyzers===========================================
+//========================================================================================
+
+//----------------------`(dm.)mth_octave_spectral_level_demo`----------------------
+// Demonstrate mth_octave_spectral_level in a standalone GUI.
+//
+// #### Usage
+// ```
+// _ : mth_octave_spectral_level_demo(BandsPerOctave) : _
+// _ : spectral_level_demo : _ // 2/3 octave
+// ```
+//------------------------------------------------------------
+declare mth_octave_spectral_level_demo author "Julius O. Smith III and Yann Orlarey";
+declare mth_octave_spectral_level_demo licence "MIT";
+
+mth_octave_spectral_level_demo(BPO) = an.mth_octave_spectral_level_default(M,ftop,N,tau,dB_offset)
+with{
+ M = BPO;
+ ftop = 16000;
+ Noct = 10; // number of octaves down from ftop
+ // Lowest band-edge is at ftop*2^(-Noct+2) = 62.5 Hz when ftop=16 kHz:
+ N = int(Noct*M); // without 'int()', segmentation fault observed for M=1.67
+ ctl_group(x) = hgroup("[1] SPECTRUM ANALYZER CONTROLS", x);
+ tau = ctl_group(hslider("[0] Level Averaging Time [unit:ms] [scale:log]
+ [tooltip: band-level averaging time in milliseconds]",
+ 100,1,10000,1)) * 0.001;
+ dB_offset = ctl_group(hslider("[1] Level dB Offset [unit:dB]
+ [tooltip: Level offset in decibels]",
+ 50,-50,100,1));
+};
+
+spectral_level_demo = mth_octave_spectral_level_demo(1.5); // 2/3 octave
+
+
+//======================================Filters===========================================
+//========================================================================================
+
+//--------------------------`(dm.)parametric_eq_demo`------------------------------
+// A parametric equalizer application.
+//
+// #### Usage:
+//
+// ```
+// _ : parametric_eq_demo : _
+// ```
+//------------------------------------------------------------
+declare parametric_eq_demo author "Julius O. Smith III";
+declare parametric_eq_demo licence "MIT";
+
+parametric_eq_demo = fi.low_shelf(LL,FL) : fi.peak_eq(LP,FP,BP) : fi.high_shelf(LH,FH)
+with{
+ eq_group(x) = hgroup("[0] PARAMETRIC EQ SECTIONS [tooltip: See Faust's filters.lib
+ for info and pointers]",x);
+ ls_group(x) = eq_group(vgroup("[1] Low Shelf",x));
+
+ LL = ls_group(hslider("[0] Low Boost|Cut [unit:dB] [style:knob]
+ [tooltip: Amount of low-frequency boost or cut in decibels]",0,-40,40,0.1));
+ FL = ls_group(hslider("[1] Transition Frequency [unit:Hz] [style:knob] [scale:log]
+ [tooltip: Transition-frequency from boost (cut) to unity gain]",200,1,5000,1));
+
+ pq_group(x) = eq_group(vgroup("[2] Peaking Equalizer[tooltip: Parametric Equalizer
+ sections from filters.lib]",x));
+ LP = pq_group(hslider("[0] Peak Boost|Cut [unit:dB] [style:knob][tooltip: Amount of
+ local boost or cut in decibels]",0,-40,40,0.1));
+ FP = pq_group(hslider("[1] Peak Frequency [unit:PK] [style:knob] [tooltip: Peak
+ Frequency in Piano Key (PK) units (A440 = 49PK)]",49,1,100,1)) : si.smooth(0.999)
+ : ba.pianokey2hz;
+ Q = pq_group(hslider("[2] Peak Q [style:knob] [scale:log] [tooltip: Quality factor
+ (Q) of the peak = center-frequency/bandwidth]",40,1,1000,0.1));
+
+ BP = FP/Q;
+
+ hs_group(x) = eq_group(vgroup("[3] High Shelf [tooltip: A high shelf provides a boost
+ or cut above some frequency]",x));
+ LH = hs_group(hslider("[0] High Boost|Cut [unit:dB] [style:knob] [tooltip: Amount of
+ high-frequency boost or cut in decibels]",0,-40,40,.1));
+ FH = hs_group(hslider("[1] Transition Frequency [unit:Hz] [style:knob] [scale:log]
+ [tooltip: Transition-frequency from boost (cut) to unity gain]",8000,20,10000,1));
+};
+
+
+//-------------------`(dm.)spectral_tilt_demo`-----------------------
+// A spectral tilt application.
+//
+// #### Usage
+//
+// ```
+// _ : spectral_tilt_demo(N) : _
+// ```
+//
+// Where:
+//
+// * `N`: filter order (integer)
+//
+// All other parameters interactive
+//------------------------------------------------------------
+declare spectral_tilt_demo author "Julius O. Smith III";
+declare spectral_tilt_demo licence "MIT";
+
+spectral_tilt_demo(N) = fi.spectral_tilt(O,f0,bw,alpha)
+with{
+ O = N;
+ alpha = hslider("[1] Slope of Spectral Tilt across Band",-1/2,-1,1,0.001);
+ f0 = hslider("[2] Band Start Frequency [unit:Hz]",100,20,10000,1);
+ bw = hslider("[3] Band Width [unit:Hz]",5000,100,10000,1);
+};
+
+
+//---------`(dm.)mth_octave_filterbank_demo` and `(dm.)filterbank_demo`-------------
+// Graphic Equalizer: each filter-bank output signal routes through a fader.
+//
+// #### Usage
+//
+// ```
+// _ : mth_octave_filterbank_demo(M) : _
+// _ : filterbank_demo : _
+// ```
+//
+// Where:
+//
+// * `M`: number of bands per octave
+//--------------------------------------------------------------
+declare mth_octave_filterbank_demo author "Julius O. Smith III";
+declare mth_octave_filterbank_demo licence "MIT";
+
+mth_octave_filterbank_demo(O) = bp1(bp,mthoctavefilterbankdemo)
+with{
+ M = O;
+ bp1 = ba.bypass1;
+ mofb_group(x) = vgroup("CONSTANT-Q FILTER BANK (Butterworth dyadic tree)
+ [tooltip: See Faust's filters.lib for documentation and references]", x);
+ bypass_group(x) = mofb_group(hgroup("[0]", x));
+ slider_group(x) = mofb_group(hgroup("[1]", x));
+
+ N = 10*M; // total number of bands (highpass band, octave-bands, dc band)
+ ftop = 10000;
+ mthoctavefilterbankdemo = chan;
+ chan = fi.mth_octave_filterbank_default(M,ftop,N) : sum(i,N,(*(ba.db2linear(fader(N-i)))));
+ fader(i) = slider_group(vslider("Band%2i [unit:dB] [tooltip: Bandpass filter
+ gain in dB]", -10, -70, 10, 0.1)) : si.smoo;
+ bp = bypass_group(checkbox("[0] Bypass
+ [tooltip: When this is checked, the filter-bank has no effect]"));
+};
+
+filterbank_demo = mth_octave_filterbank_demo(1); // octave-bands = default
+
+
+//======================================Effects===========================================
+//========================================================================================
+
+//---------------------------`(dm.)cubicnl_demo`--------------------------
+// Distortion demo application.
+//
+// #### Usage:
+//
+// ```
+// _ : cubicnl_demo : _
+// ```
+//------------------------------------------------------------
+declare cubicnl_demo author "Julius O. Smith III";
+declare cubicnl_demo licence "MIT";
+
+cubicnl_demo = ba.bypass1(bp, ef.cubicnl_nodc(drive:si.smoo,offset:si.smoo))
+with{
+ cnl_group(x) = vgroup("CUBIC NONLINEARITY cubicnl [tooltip: Reference:
+ https://ccrma.stanford.edu/~jos/pasp/Cubic_Soft_Clipper.html]", x);
+ bp = cnl_group(checkbox("[0] Bypass [tooltip: When this is checked, the
+ nonlinearity has no effect]"));
+ drive = cnl_group(hslider("[1] Drive [tooltip: Amount of distortion]",
+ 0, 0, 1, 0.01));
+ offset = cnl_group(hslider("[2] Offset [tooltip: Brings in even harmonics]",
+ 0, 0, 1, 0.01));
+};
+
+
+//----------------------------`(dm.)gate_demo`-------------------------
+// Gate demo application.
+//
+// #### Usage
+//
+// ```
+// _,_ : gate_demo : _,_
+// ```
+//------------------------------------------------------------
+declare gate_demo author "Julius O. Smith III";
+declare gate_demo licence "MIT";
+
+gate_demo = ba.bypass2(gbp,gate_stereo_demo)
+with{
+ gate_group(x) = vgroup("GATE [tooltip: Reference:
+ http://en.wikipedia.org/wiki/Noise_gate]", x);
+ meter_group(x) = gate_group(hgroup("[0]", x));
+ knob_group(x) = gate_group(hgroup("[1]", x));
+
+ gbp = meter_group(checkbox("[0] Bypass [tooltip: When this is checked,
+ the gate has no effect]"));
+
+ gateview = ef.gate_gain_mono(gatethr,gateatt,gatehold,gaterel) : ba.linear2db :
+ meter_group(hbargraph("[1] Gate Gain [unit:dB] [tooltip: Current gain of the
+ gate in dB]", -50,+10)); // [style:led]
+
+ gate_stereo_demo(x,y) = attach(x,gateview(abs(x)+abs(y))),y :
+ ef.gate_stereo(gatethr,gateatt,gatehold,gaterel);
+
+ gatethr = knob_group(hslider("[1] Threshold [unit:dB] [style:knob] [tooltip: When
+ the signal level falls below the Threshold (expressed in dB), the signal is
+ muted]", -30, -120, 0, 0.1));
+
+ gateatt = knob_group(hslider("[2] Attack [unit:us] [style:knob] [scale:log]
+ [tooltip: Time constant in MICROseconds (1/e smoothing time) for the gate
+ gain to go (exponentially) from 0 (muted) to 1 (unmuted)]",
+ 10, 10, 10000, 1)) : *(0.000001) : max(1.0/float(ma.SR));
+
+ gatehold = knob_group(hslider("[3] Hold [unit:ms] [style:knob] [scale:log]
+ [tooltip: Time in ms to keep the gate open (no muting) after the signal
+ level falls below the Threshold]", 200, 1, 1000, 1)) : *(0.001) :
+ max(1.0/float(ma.SR));
+
+ gaterel = knob_group(hslider("[4] Release [unit:ms] [style:knob] [scale:log]
+ [tooltip: Time constant in ms (1/e smoothing time) for the gain to go
+ (exponentially) from 1 (unmuted) to 0 (muted)]",
+ 100, 1, 1000, 1)) : *(0.001) : max(1.0/float(ma.SR));
+};
+
+
+//----------------------------`(dm.)compressor_demo`-------------------------
+// Compressor demo application.
+//
+// #### Usage
+//
+// ```
+// _,_ : compressor_demo : _,_
+// ```
+//------------------------------------------------------------
+declare compressor_demo author "Julius O. Smith III";
+declare compressor_demo licence "MIT";
+
+compressor_demo = ba.bypass2(cbp,compressor_stereo_demo)
+with{
+ comp_group(x) = vgroup("COMPRESSOR [tooltip: Reference:
+ http://en.wikipedia.org/wiki/Dynamic_range_compression]", x);
+
+ meter_group(x) = comp_group(hgroup("[0]", x));
+ knob_group(x) = comp_group(hgroup("[1]", x));
+
+ cbp = meter_group(checkbox("[0] Bypass [tooltip: When this is checked, the compressor
+ has no effect]"));
+ gainview = co.compression_gain_mono(ratio,threshold,attack,release) : ba.linear2db :
+ meter_group(hbargraph("[1] Compressor Gain [unit:dB] [tooltip: Current gain of
+ the compressor in dB]",-50,+10));
+
+ displaygain = _,_ <: _,_,(abs,abs:+) : _,_,gainview : _,attach;
+
+ compressor_stereo_demo =
+ displaygain(co.compressor_stereo(ratio,threshold,attack,release)) :
+ *(makeupgain), *(makeupgain);
+
+ ctl_group(x) = knob_group(hgroup("[3] Compression Control", x));
+
+ ratio = ctl_group(hslider("[0] Ratio [style:knob]
+ [tooltip: A compression Ratio of N means that for each N dB increase in input
+ signal level above Threshold, the output level goes up 1 dB]",
+ 5, 1, 20, 0.1));
+
+ threshold = ctl_group(hslider("[1] Threshold [unit:dB] [style:knob]
+ [tooltip: When the signal level exceeds the Threshold (in dB), its level
+ is compressed according to the Ratio]",
+ -30, -100, 10, 0.1));
+
+ env_group(x) = knob_group(hgroup("[4] Compression Response", x));
+
+ attack = env_group(hslider("[1] Attack [unit:ms] [style:knob] [scale:log]
+ [tooltip: Time constant in ms (1/e smoothing time) for the compression gain
+ to approach (exponentially) a new lower target level (the compression
+ `kicking in')]", 50, 1, 1000, 0.1)) : *(0.001) : max(1/ma.SR);
+
+ release = env_group(hslider("[2] Release [unit:ms] [style: knob] [scale:log]
+ [tooltip: Time constant in ms (1/e smoothing time) for the compression gain
+ to approach (exponentially) a new higher target level (the compression
+ 'releasing')]", 500, 1, 1000, 0.1)) : *(0.001) : max(1/ma.SR);
+
+ makeupgain = comp_group(hslider("[5] Makeup Gain [unit:dB]
+ [tooltip: The compressed-signal output level is increased by this amount
+ (in dB) to make up for the level lost due to compression]",
+ 40, -96, 96, 0.1)) : ba.db2linear;
+};
+
+
+//-------------------------`(dm.)moog_vcf_demo`---------------------------
+// Illustrate and compare all three Moog VCF implementations above.
+//
+// #### Usage
+//
+// ```
+// _ : moog_vcf_demo : _
+// ```
+//------------------------------------------------------------
+declare moog_vcf_demo author "Julius O. Smith III";
+declare moog_vcf_demo licence "MIT";
+
+moog_vcf_demo = ba.bypass1(bp,vcf)
+with{
+ mvcf_group(x) = hgroup("MOOG VCF (Voltage Controlled Filter) [tooltip: See Faust's
+ vaeffects.lib for info and references]",x);
+ cb_group(x) = mvcf_group(hgroup("[0]",x));
+
+ bp = cb_group(checkbox("[0] Bypass [tooltip: When this is checked, the Moog VCF
+ has no effect]"));
+ archsw = cb_group(checkbox("[1] Use Biquads [tooltip: Select moog_vcf_2b (two-biquad)
+ implementation, instead of the default moog_vcf (analog style) implementation]"));
+ bqsw = cb_group(checkbox("[2] Normalized Ladders [tooltip: If using biquads, make
+ them normalized ladders (moog_vcf_2bn)]"));
+
+ freq = mvcf_group(hslider("[1] Corner Frequency [unit:PK] [tooltip: The VCF resonates
+ at the corner frequency (specified in PianoKey (PK) units, with A440 = 49 PK).
+ The VCF response is flat below the corner frequency, and rolls off -24 dB per
+ octave above.]",
+ 25, 1, 88, 0.01) : ba.pianokey2hz) : si.smoo;
+
+ res = mvcf_group(hslider("[2] Corner Resonance [style:knob] [tooltip: Amount of
+ resonance near VCF corner frequency (specified between 0 and 1)]", 0.9, 0, 1, 0.01));
+
+ outgain = mvcf_group(hslider("[3] VCF Output Level [unit:dB] [style:knob] [tooltip:
+ output level in decibels]", 5, -60, 20, 0.1)) : ba.db2linear : si.smoo;
+
+ vcfbq = _ <: select2(bqsw, ve.moog_vcf_2b(res,freq), ve.moog_vcf_2bn(res,freq));
+ vcfarch = _ <: select2(archsw, ve.moog_vcf(res^4,freq), vcfbq);
+ vcf = vcfarch : *(outgain);
+};
+
+
+//-------------------------`(dm.)wah4_demo`---------------------------
+// Wah pedal application.
+//
+// #### Usage
+//
+// ```
+// _ : wah4_demo : _
+// ```
+//------------------------------------------------------------
+declare wah4_demo author "Julius O. Smith III";
+declare wah4_demo licence "MIT";
+
+wah4_demo = ba.bypass1(bp, ve.wah4(fr))
+with{
+ wah4_group(x) = hgroup("WAH4 [tooltip: Fourth-order wah effect made using moog_vcf]", x);
+ bp = wah4_group(checkbox("[0] Bypass [tooltip: When this is checked, the wah pedal has
+ no effect]"));
+ fr = wah4_group(hslider("[1] Resonance Frequency [scale:log] [tooltip: wah resonance
+ frequency in Hz]", 200,100,2000,1));
+ // Avoid dc with the moog_vcf (amplitude too high when freq comes up from dc)
+ // Also, avoid very high resonance frequencies (e.g., 5kHz or above).
+};
+
+//-------------------------`(dm.)crybaby_demo`---------------------------
+// Crybaby effect application.
+//
+// #### Usage
+//
+// ```
+// _ : crybaby_demo : _
+// ```
+//------------------------------------------------------------
+declare crybaby_demo author "Julius O. Smith III";
+declare crybaby_demo licence "MIT";
+
+crybaby_demo = ba.bypass1(bp, ve.crybaby(wah))
+with{
+ crybaby_group(x) = hgroup("CRYBABY [tooltip: Reference:
+ https://ccrma.stanford.edu/~jos/pasp/vegf.html]", x);
+ bp = crybaby_group(checkbox("[0] Bypass [tooltip: When this is checked, the wah
+ pedal has no effect]"));
+ wah = crybaby_group(hslider("[1] Wah parameter [tooltip: wah pedal angle between
+ 0 (rocked back) and 1 (rocked forward)]",0.8,0,1,0.01));
+};
+
+//-------------------------`(dm.)flanger_demo`---------------------------
+// Flanger effect application.
+//
+// #### Usage
+//
+// ```
+// _,_ : flanger_demo : _,_
+// ```
+//------------------------------------------------------------
+declare flanger_demo author "Julius O. Smith III";
+declare flanger_demo licence "MIT";
+
+flanger_demo = ba.bypass2(fbp,flanger_stereo_demo)
+with{
+ flanger_group(x) = vgroup("FLANGER
+ [tooltip: Reference: https://ccrma.stanford.edu/~jos/pasp/Flanging.html]", x);
+ meter_group(x) = flanger_group(hgroup("[0]", x));
+ ctl_group(x) = flanger_group(hgroup("[1]", x));
+ del_group(x) = flanger_group(hgroup("[2] Delay Controls", x));
+ lvl_group(x) = flanger_group(hgroup("[3]", x));
+
+ fbp = meter_group(checkbox("[0] Bypass [tooltip: When this is checked, the flanger
+ has no effect]"));
+ invert = meter_group(checkbox("[1] Invert Flange Sum"));
+
+ // FIXME: This should be an amplitude-response display:
+ flangeview = lfor(freq) + lfol(freq) : meter_group(hbargraph("[2] Flange LFO
+ [style: led] [tooltip: Display sum of flange delays]", -1.5,+1.5));
+
+ flanger_stereo_demo(x,y) = attach(x,flangeview),y :
+ *(level),*(level) : pf.flanger_stereo(dmax,curdel1,curdel2,depth,fb,invert);
+
+ lfol = os.oscrs;
+ lfor = os.oscrc;
+
+ dmax = 2048;
+ dflange = 0.001 * ma.SR *
+ del_group(hslider("[1] Flange Delay [unit:ms] [style:knob]", 10, 0, 20, 0.001));
+ odflange = 0.001 * ma.SR *
+ del_group(hslider("[2] Delay Offset [unit:ms] [style:knob]", 1, 0, 20, 0.001));
+ freq = ctl_group(hslider("[1] Speed [unit:Hz] [style:knob]", 0.5, 0, 10, 0.01));
+ depth = ctl_group(hslider("[2] Depth [style:knob]", 1, 0, 1, 0.001));
+ fb = ctl_group(hslider("[3] Feedback [style:knob]", 0, -0.999, 0.999, 0.001));
+ level = lvl_group(hslider("Flanger Output Level [unit:dB]", 0, -60, 10, 0.1)) :
+ ba.db2linear;
+ curdel1 = odflange+dflange*(1 + lfol(freq))/2;
+ curdel2 = odflange+dflange*(1 + lfor(freq))/2;
+};
+
+
+//-------------------------`(dm.)phaser2_demo`---------------------------
+// Phaser effect demo application.
+//
+// #### Usage
+//
+// ```
+// _,_ : phaser2_demo : _,_
+// ```
+//------------------------------------------------------------
+declare phaser2_demo author "Julius O. Smith III";
+declare phaser2_demo licence "MIT";
+
+phaser2_demo = ba.bypass2(pbp,phaser2_stereo_demo)
+with{
+ phaser2_group(x) = vgroup("PHASER2 [tooltip: Reference:
+ https://ccrma.stanford.edu/~jos/pasp/Flanging.html]", x);
+ meter_group(x) = phaser2_group(hgroup("[0]", x));
+ ctl_group(x) = phaser2_group(hgroup("[1]", x));
+ nch_group(x) = phaser2_group(hgroup("[2]", x));
+ lvl_group(x) = phaser2_group(hgroup("[3]", x));
+
+ pbp = meter_group(checkbox("[0] Bypass [tooltip: When this is checked, the phaser
+ has no effect]"));
+ invert = meter_group(checkbox("[1] Invert Internal Phaser Sum"));
+ vibr = meter_group(checkbox("[2] Vibrato Mode")); // In this mode you can hear any "Doppler"
+
+ // FIXME: This should be an amplitude-response display:
+ // flangeview = phaser2_amp_resp : meter_group(hspectrumview("[2] Phaser Amplitude Response", 0,1));
+ // phaser2_stereo_demo(x,y) = attach(x,flangeview),y : ...
+
+ phaser2_stereo_demo = *(level),*(level) :
+ pf.phaser2_stereo(Notches,width,frqmin,fratio,frqmax,speed,mdepth,fb,invert);
+
+ Notches = 4; // Compile-time parameter: 2 is typical for analog phaser stomp-boxes
+
+ // FIXME: Add tooltips
+ speed = ctl_group(hslider("[1] Speed [unit:Hz] [style:knob]", 0.5, 0, 10, 0.001));
+ depth = ctl_group(hslider("[2] Notch Depth (Intensity) [style:knob]", 1, 0, 1, 0.001));
+ fb = ctl_group(hslider("[3] Feedback Gain [style:knob]", 0, -0.999, 0.999, 0.001));
+
+ width = nch_group(hslider("[1] Notch width [unit:Hz] [style:knob] [scale:log]",
+ 1000, 10, 5000, 1));
+ frqmin = nch_group(hslider("[2] Min Notch1 Freq [unit:Hz] [style:knob] [scale:log]",
+ 100, 20, 5000, 1));
+ frqmax = nch_group(hslider("[3] Max Notch1 Freq [unit:Hz] [style:knob] [scale:log]",
+ 800, 20, 10000, 1)) : max(frqmin);
+ fratio = nch_group(hslider("[4] Notch Freq Ratio: NotchFreq(n+1)/NotchFreq(n) [style:knob]",
+ 1.5, 1.1, 4, 0.001));
+
+ level = lvl_group(hslider("Phaser Output Level [unit:dB]", 0, -60, 10, 0.1)) :
+ ba.db2linear;
+
+ mdepth = select2(vibr,depth,2); // Improve "ease of use"
+};
+
+//======================================Reverbs===========================================
+//========================================================================================
+
+//----------------------------`(dm.)freeverb_demo`-------------------------
+// Freeverb demo application.
+//
+// #### Usage
+//
+// ```
+// _,_ : freeverb_demo : _,_
+// ```
+//------------------------------------------------------------
+declare freeverb_demo author " Romain Michon";
+declare freeverb_demo licence "LGPL";
+
+freeverb_demo = _,_ <: (*(g)*fixedgain,*(g)*fixedgain :
+ re.stereo_freeverb(combfeed, allpassfeed, damping, spatSpread)),
+ *(1-g), *(1-g) :> _,_
+with{
+ scaleroom = 0.28;
+ offsetroom = 0.7;
+ allpassfeed = 0.5;
+ scaledamp = 0.4;
+ fixedgain = 0.1;
+ origSR = 44100;
+
+ parameters(x) = hgroup("Freeverb",x);
+ knobGroup(x) = parameters(vgroup("[0]",x));
+ damping = knobGroup(vslider("[0] Damp [style: knob] [tooltip: Somehow control the
+ density of the reverb.]",0.5, 0, 1, 0.025)*scaledamp*origSR/ma.SR);
+ combfeed = knobGroup(vslider("[1] RoomSize [style: knob] [tooltip: The room size
+ between 0 and 1 with 1 for the largest room.]", 0.5, 0, 1, 0.025)*scaleroom*
+ origSR/ma.SR + offsetroom);
+ spatSpread = knobGroup(vslider("[2] Stereo Spread [style: knob] [tooltip: Spatial
+ spread between 0 and 1 with 1 for maximum spread.]",0.5,0,1,0.01)*46*ma.SR/origSR
+ : int);
+ g = parameters(vslider("[1] Wet [tooltip: The amount of reverb applied to the signal
+ between 0 and 1 with 1 for the maximum amount of reverb.]", 0.3333, 0, 1, 0.025));
+};
+
+//---------------------`(dm.)stereo_reverb_tester`--------------------
+// Handy test inputs for reverberator demos below.
+//
+// #### Usage
+//
+// ```
+// _ : stereo_reverb_tester : _
+// ```
+//------------------------------------------------------------
+declare stereo_reverb_tester author "Julius O. Smith III";
+declare stereo_reverb_tester licence "MIT";
+
+stereo_reverb_tester(revin_group,x,y) = reverb_tester(_)
+with {
+ reverb_tester(revin_group,x,y) = inx,iny with {
+ ck_group(x) = revin_group(vgroup("[1] Input Config",x));
+ mutegain = 1 - ck_group(checkbox("[1] Mute Ext Inputs
+ [tooltip: When this is checked, the stereo external audio inputs are
+ disabled (good for hearing the impulse response or pink-noise response alone)]"));
+ pinkin = ck_group(checkbox("[2] Pink Noise
+ [tooltip: Pink Noise (or 1/f noise) is Constant-Q Noise (useful for adjusting
+ the EQ sections)]"));
+
+ imp_group(x) = revin_group(hgroup("[2] Impulse Selection",x));
+ pulseL = imp_group(button("[1] Left
+ [tooltip: Send impulse into LEFT channel]")) : ba.impulsify;
+ pulseC = imp_group(button("[2] Center
+ [tooltip: Send impulse into LEFT and RIGHT channels]")) : ba.impulsify;
+ pulseR = imp_group(button("[3] Right
+ [tooltip: Send impulse into RIGHT channel]")) : ba.impulsify;
+
+ inx = x*mutegain + (pulseL+pulseC) + pn;
+ iny = y*mutegain + (pulseR+pulseC) + pn;
+ pn = 0.1*pinkin*no.pink_noise;
+ };
+};
+
+
+//-------------------------`(dm.)fdnrev0_demo`---------------------------
+// A reverb application using `fdnrev0`.
+//
+// #### Usage
+//
+// ```
+// _,_,_,_ : fdnrev0_demo(N,NB,BBSO) : _,_
+// ```
+//
+// Where:
+//
+// * `N`: feedback Delay Network (FDN) order / number of delay lines used =
+// order of feedback matrix / 2, 4, 8, or 16 [extend primes array below for
+// 32, 64, ...]
+// * `NB`: number of frequency bands / Number of (nearly) independent T60 controls
+// / Integer 3 or greater
+// * `BBSO` : butterworth band-split order / order of lowpass/highpass bandsplit
+// used at each crossover freq / odd positive integer
+//------------------------------------------------------------
+declare fdnrev0_demo author "Julius O. Smith III";
+declare fdnrev0_demo licence "MIT";
+
+fdnrev0_demo(N,NB,BBSO) = stereo_reverb_tester(revin_group)
+ <: re.fdnrev0(MAXDELAY,delays,BBSO,freqs,durs,loopgainmax,nonl)
+ :> *(gain),*(gain)
+with{
+ MAXDELAY = 8192; // sync w delays and prime_power_delays above
+ defdurs = (8.4,6.5,5.0,3.8,2.7); // NB default durations (sec)
+ deffreqs = (500,1000,2000,4000); // NB-1 default crossover frequencies (Hz)
+ deflens = (56.3,63.0); // 2 default min and max path lengths
+
+ fdn_group(x) = vgroup("FEEDBACK DELAY NETWORK (FDN) REVERBERATOR, ORDER 16
+ [tooltip: See Faust's reverbs.lib for documentation and references]", x);
+
+ freq_group(x) = fdn_group(vgroup("[1] Band Crossover Frequencies", x));
+ t60_group(x) = fdn_group(hgroup("[2] Band Decay Times (T60)", x));
+ path_group(x) = fdn_group(vgroup("[3] Room Dimensions", x));
+ revin_group(x) = fdn_group(hgroup("[4] Input Controls", x));
+ nonl_group(x) = revin_group(vgroup("[4] Nonlinearity",x));
+ quench_group(x) = revin_group(vgroup("[3] Reverb State",x));
+
+ nonl = nonl_group(hslider("[style:knob] [tooltip: nonlinear mode coupling]",
+ 0, -0.999, 0.999, 0.001));
+ loopgainmax = 1.0-0.5*quench_group(button("[1] Quench
+ [tooltip: Hold down 'Quench' to clear the reverberator]"));
+
+ pathmin = path_group(hslider("[1] min acoustic ray length [unit:m] [scale:log]
+ [tooltip: This length (in meters) determines the shortest delay-line used in the FDN
+ reverberator. Think of it as the shortest wall-to-wall separation in the room.]",
+ 46, 0.1, 63, 0.1));
+ pathmax = path_group(hslider("[2] max acoustic ray length [unit:m] [scale:log]
+ [tooltip: This length (in meters) determines the longest delay-line used in the
+ FDN reverberator. Think of it as the largest wall-to-wall separation in the room.]",
+ 63, 0.1, 63, 0.1));
+
+ durvals(i) = t60_group(vslider("[%i] %i [unit:s] [scale:log][tooltip: T60 is the 60dB
+ decay-time in seconds. For concert halls, an overall reverberation time (T60) near
+ 1.9 seconds is typical [Beranek 2004]. Here we may set T60 independently in each
+ frequency band. In real rooms, higher frequency bands generally decay faster due
+ to absorption and scattering.]",ba.take(i+1,defdurs), 0.1, 100, 0.1));
+ durs = par(i,NB,durvals(NB-1-i));
+
+ freqvals(i) = freq_group(hslider("[%i] Band %i upper edge in Hz [unit:Hz] [scale:log]
+ [tooltip: Each delay-line signal is split into frequency-bands for separate
+ decay-time control in each band]",ba.take(i+1,deffreqs), 100, 10000, 1));
+ freqs = par(i,NB-1,freqvals(i));
+
+ delays = de.prime_power_delays(N,pathmin,pathmax);
+
+ gain = hslider("[3] Output Level (dB) [unit:dB][tooltip: Output scale factor]",
+ -40, -70, 20, 0.1) : ba.db2linear;
+ // (can cause infinite loop:) with { db2linear(x) = pow(10, x/20.0); };
+};
+
+//---------------------------`(dm.)zita_rev_fdn_demo`------------------------------
+// Reverb demo application based on `zita_rev_fdn`.
+//
+// #### Usage
+//
+// ```
+// si.bus(8) : zita_rev_fdn_demo : si.bus(8)
+// ```
+//------------------------------------------------------------
+declare zita_rev_fdn_demo author "Julius O. Smith III";
+declare zita_rev_fdn_demo licence "MIT";
+
+zita_rev_fdn_demo = re.zita_rev_fdn(f1,f2,t60dc,t60m,fsmax)
+with{
+ fsmax = 48000.0;
+ fdn_group(x) = hgroup("Zita_Rev Internal FDN Reverb [tooltip: ~ Zita_Rev's internal
+ 8x8 Feedback Delay Network (FDN) & Schroeder allpass-comb reverberator. See
+ Faust's reverbs.lib for documentation and references]",x);
+ t60dc = fdn_group(vslider("[1] Low RT60 [unit:s] [style:knob][style:knob]
+ [tooltip: T60 = time (in seconds) to decay 60dB in low-frequency band]",
+ 3, 1, 8, 0.1));
+ f1 = fdn_group(vslider("[2] LF X [unit:Hz] [style:knob] [scale:log]
+ [tooltip: Crossover frequency (Hz) separating low and middle frequencies]",
+ 200, 50, 1000, 1));
+ t60m = fdn_group(vslider("[3] Mid RT60 [unit:s] [style:knob] [scale:log]
+ [tooltip: T60 = time (in seconds) to decay 60dB in middle band]",
+ 2, 1, 8, 0.1));
+ f2 = fdn_group(vslider("[4] HF Damping [unit:Hz] [style:knob] [scale:log]
+ [tooltip: Frequency (Hz) at which the high-frequency T60 is half the middle-band's T60]",
+ 6000, 1500, 0.49*fsmax, 1));
+};
+
+//---------------------------`(dm.)zita_light`------------------------------
+// Light version of `dm.zita_rev1` with only 2 UI elements.
+//
+// #### Usage
+//
+// ```
+// _,_ : zita_light : _,_
+// ```
+//------------------------------------------------------------
+declare zita_light author "Julius O. Smith III";
+declare zita_light licence "MIT";
+
+zita_light = hgroup("Zita Light",(_,_ <: re.zita_rev1_stereo(rdel,f1,f2,t60dc,t60m,fsmax),_,_ :
+ out_eq,_,_ : dry_wet : out_level))
+with{
+ fsmax = 48000.0; // highest sampling rate that will be used
+ rdel = 60;
+ f1 = 200;
+ t60dc = 3;
+ t60m = 2;
+ f2 = 6000;
+ out_eq = pareq_stereo(eq1f,eq1l,eq1q) : pareq_stereo(eq2f,eq2l,eq2q);
+ pareq_stereo(eqf,eql,Q) = fi.peak_eq_rm(eql,eqf,tpbt), fi.peak_eq_rm(eql,eqf,tpbt)
+ with {
+ tpbt = wcT/sqrt(max(0,g)); // tan(PI*B/SR), B bw in Hz (Q^2 ~ g/4)
+ wcT = 2*ma.PI*eqf/ma.SR; // peak frequency in rad/sample
+ g = ba.db2linear(eql); // peak gain
+ };
+ eq1f = 315;
+ eq1l = 0;
+ eq1q = 3;
+ eq2f = 1500;
+ eq2l = 0;
+ eq2q = 3;
+ dry_wet(x,y) = *(wet) + dry*x, *(wet) + dry*y
+ with {
+ wet = 0.5*(drywet+1.0);
+ dry = 1.0-wet;
+ };
+ drywet = vslider("[1] Dry/Wet Mix [style:knob] [tooltip: -1 = dry, 1 = wet]",
+ 0,-1.0,1.0,0.01) : si.smoo;
+ gain = vslider("[2] Level [unit:dB] [style:knob] [tooltip: Output scale
+ factor]", -6, -70, 40, 0.1) : ba.db2linear : si.smoo;
+ out_level = *(gain),*(gain);
+};
+
+//----------------------------------`(dm.)zita_rev1`------------------------------
+// Example GUI for `zita_rev1_stereo` (mostly following the Linux `zita-rev1` GUI).
+//
+// Only the dry/wet and output level parameters are "dezippered" here. If
+// parameters are to be varied in real time, use `smooth(0.999)` or the like
+// in the same way.
+//
+// #### Usage
+//
+// ```
+// _,_ : zita_rev1 : _,_
+// ```
+//
+// #### Reference
+//
+//
+//------------------------------------------------------------
+declare zita_rev1 author "Julius O. Smith III";
+declare zita_rev1 licence "MIT";
+
+zita_rev1 = _,_ <: re.zita_rev1_stereo(rdel,f1,f2,t60dc,t60m,fsmax),_,_ : out_eq,_,_ :
+ dry_wet : out_level
+with{
+ fsmax = 48000.0; // highest sampling rate that will be used
+
+ fdn_group(x) = hgroup(
+ "[0] Zita_Rev1 [tooltip: ~ ZITA REV1 FEEDBACK DELAY NETWORK (FDN) & SCHROEDER
+ ALLPASS-COMB REVERBERATOR (8x8). See Faust's reverbs.lib for documentation and
+ references]", x);
+
+ in_group(x) = fdn_group(hgroup("[1] Input", x));
+
+ rdel = in_group(vslider("[1] In Delay [unit:ms] [style:knob] [tooltip: Delay in ms
+ before reverberation begins]",60,20,100,1));
+
+ freq_group(x) = fdn_group(hgroup("[2] Decay Times in Bands (see tooltips)", x));
+
+ f1 = freq_group(vslider("[1] LF X [unit:Hz] [style:knob] [scale:log] [tooltip:
+ Crossover frequency (Hz) separating low and middle frequencies]", 200, 50, 1000, 1));
+
+ t60dc = freq_group(vslider("[2] Low RT60 [unit:s] [style:knob] [scale:log]
+ [style:knob] [tooltip: T60 = time (in seconds) to decay 60dB in low-frequency band]",
+ 3, 1, 8, 0.1));
+
+ t60m = freq_group(vslider("[3] Mid RT60 [unit:s] [style:knob] [scale:log] [tooltip:
+ T60 = time (in seconds) to decay 60dB in middle band]",2, 1, 8, 0.1));
+
+ f2 = freq_group(vslider("[4] HF Damping [unit:Hz] [style:knob] [scale:log]
+ [tooltip: Frequency (Hz) at which the high-frequency T60 is half the middle-band's T60]",
+ 6000, 1500, 0.49*fsmax, 1));
+
+ out_eq = pareq_stereo(eq1f,eq1l,eq1q) : pareq_stereo(eq2f,eq2l,eq2q);
+ // Zolzer style peaking eq (not used in zita-rev1) (filters.lib):
+ // pareq_stereo(eqf,eql,Q) = peak_eq(eql,eqf,eqf/Q), peak_eq(eql,eqf,eqf/Q);
+ // Regalia-Mitra peaking eq with "Q" hard-wired near sqrt(g)/2 (filters.lib):
+ pareq_stereo(eqf,eql,Q) = fi.peak_eq_rm(eql,eqf,tpbt), fi.peak_eq_rm(eql,eqf,tpbt)
+ with {
+ tpbt = wcT/sqrt(max(0,g)); // tan(PI*B/SR), B bw in Hz (Q^2 ~ g/4)
+ wcT = 2*ma.PI*eqf/ma.SR; // peak frequency in rad/sample
+ g = ba.db2linear(eql); // peak gain
+ };
+
+ eq1_group(x) = fdn_group(hgroup("[3] RM Peaking Equalizer 1", x));
+
+ eq1f = eq1_group(vslider("[1] Eq1 Freq [unit:Hz] [style:knob] [scale:log] [tooltip:
+ Center-frequency of second-order Regalia-Mitra peaking equalizer section 1]",
+ 315, 40, 2500, 1));
+
+ eq1l = eq1_group(vslider("[2] Eq1 Level [unit:dB] [style:knob] [tooltip: Peak level
+ in dB of second-order Regalia-Mitra peaking equalizer section 1]", 0, -15, 15, 0.1));
+
+ eq1q = eq1_group(vslider("[3] Eq1 Q [style:knob] [tooltip: Q = centerFrequency/bandwidth
+ of second-order peaking equalizer section 1]", 3, 0.1, 10, 0.1));
+
+ eq2_group(x) = fdn_group(hgroup("[4] RM Peaking Equalizer 2", x));
+
+ eq2f = eq2_group(vslider("[1] Eq2 Freq [unit:Hz] [style:knob] [scale:log] [tooltip:
+ Center-frequency of second-order Regalia-Mitra peaking equalizer section 2]",
+ 1500, 160, 10000, 1));
+
+ eq2l = eq2_group(vslider("[2] Eq2 Level [unit:dB] [style:knob] [tooltip: Peak level
+ in dB of second-order Regalia-Mitra peaking equalizer section 2]", 0, -15, 15, 0.1));
+
+ eq2q = eq2_group(vslider("[3] Eq2 Q [style:knob] [tooltip: Q = centerFrequency/bandwidth
+ of second-order peaking equalizer section 2]", 3, 0.1, 10, 0.1));
+
+ out_group(x) = fdn_group(hgroup("[5] Output", x));
+
+ dry_wet(x,y) = *(wet) + dry*x, *(wet) + dry*y with {
+ wet = 0.5*(drywet+1.0);
+ dry = 1.0-wet;
+ };
+
+ drywet = out_group(vslider("[1] Dry/Wet Mix [style:knob] [tooltip: -1 = dry, 1 = wet]",
+ 0, -1.0, 1.0, 0.01)) : si.smoo;
+
+ out_level = *(gain),*(gain);
+
+ gain = out_group(vslider("[2] Level [unit:dB] [style:knob] [tooltip: Output scale
+ factor]", -20, -70, 40, 0.1)) : ba.db2linear : si.smoo;
+};
+
+//----------------------------------`(dm.)dattorro_rev_demo`------------------------------
+// Example GUI for `dattorro_rev` with all parameters exposed. With additional
+// dry/wet and output gain control.
+//
+// #### Usage
+//
+// ```
+// _,_ : dattorro_rev_demo : _,_
+// ```
+//
+//------------------------------------------------------------
+declare dattorro_rev_demo author "Jakob Zerbian";
+declare dattorro_rev_demo license "MIT-style STK-4.3 license";
+
+dattorro_rev_demo = _,_ <: re.dattorro_rev(pre_delay, bw, i_diff1, i_diff2, decay, d_diff1, d_diff2, damping),_,_:
+ dry_wet : out_level
+with {
+ rev_group(x) = hgroup("[0] Dattorro Reverb",x);
+
+ in_group(x) = rev_group(hgroup("[0] Input",x));
+ pre_delay = 0;
+ bw = in_group(vslider("[1] Prefilter [style:knob] [tooltip: lowpass-like filter, 0 = no signal, 1 = no filtering]",0.7,0.0,1.0,0.001) : si.smoo);
+ i_diff1 = in_group(vslider("[2] Diffusion 1 [style:knob] [tooltip: diffusion factor, influences reverb color and density]",0.625,0.0,1.0,0.001) : si.smoo);
+ i_diff2 = in_group(vslider("[3] Diffusion 2 [style:knob] [tooltip: diffusion factor, influences reverb color and density]",0.625,0.0,1.0,0.001) : si.smoo);
+
+ fdb_group(x) = rev_group(hgroup("[1] Feedback",x));
+ d_diff1 = fdb_group(vslider("[1] Diffusion 1 [style:knob] [tooltip: diffusion factor, influences reverb color and density]",0.625,0.0,1.0,0.001) : si.smoo);
+ d_diff2 = fdb_group(vslider("[2] Diffusion 2 [style:knob] [tooltip: diffusion factor, influences reverb color and density]",0.625,0.0,1.0,0.001) : si.smoo);
+ decay = fdb_group(vslider("[3] Decay Rate [style:knob] [tooltip: decay length, 1 = infinite]",0.7,0.0,1.0,0.001) : si.smoo);
+ damping = fdb_group(vslider("[4] Damping [style:knob] [tooltip: dampening in feedback network]",0.625,0.0,1.0,0.001) : si.smoo);
+
+ out_group(x) = rev_group(hgroup("[2] Output",x));
+ dry_wet(x,y) = *(dry) + wet*x, *(dry) + wet*y
+ with {
+ wet = 0.5*(drywet+1.0);
+ dry = 1.0-wet;
+ };
+ drywet = out_group(vslider("[1] Dry/Wet Mix [style:knob] [tooltip: -1 = dry, 1 = wet]",0,-1.0,1.0,0.01) : si.smoo);
+ gain = out_group(vslider("[2] Level [unit:dB] [style:knob] [tooltip: Output Gain]", -6, -70, 40, 0.1) : ba.db2linear : si.smoo);
+ out_level = *(gain),*(gain);
+};
+
+//----------------------------------`(dm.)jprev_demo`------------------------------
+// Example GUI for `jprev` with all parameters exposed.
+//
+// #### Usage
+//
+// ```
+// _,_ : jprev_demo : _,_
+// ```
+//
+//------------------------------------------------------------
+declare jprev_demo author "Till Bovermann";
+declare jprev_demo license "GPL2+";
+
+jprev_demo = re.jpverb(t60, damp, size, early_diff, mod_depth, mod_freq, low, mid, high, low_cutoff, high_cutoff)
+with {
+ rev_group(x) = vgroup("[0] JPrev",x);
+
+ mix_group(x) = rev_group(hgroup("[0] Mix",x));
+ early_diff = mix_group(hslider("[1]earlyDiff [style:knob]", 0.707, 0, 0.990, 0.001));
+ size = mix_group(hslider("[2]size [style:knob]", 1, 0.5, 3, 0.01));
+ t60 = mix_group(hslider("[3]t60 [style:knob]", 1, 0.1, 60, 0.1));
+ damp = mix_group(hslider("[4]damp [style:knob]", 0, 0, 0.999, 0.0001));
+
+ eq_group(x) = rev_group(hgroup("[1] EQ",x));
+ low = eq_group(hslider("[07]lowX [style:knob]", 1, 0, 1, 0.01));
+ mid = eq_group(hslider("[08]midX [style:knob]", 1, 0, 1, 0.01));
+ high = eq_group(hslider("[09]highX [style:knob]", 1, 0, 1, 0.01));
+ low_cutoff = eq_group(hslider("[10]lowBand [style:knob]", 500, 100, 6000, 0.1));
+ high_cutoff = eq_group(hslider("[11]highBand [style:knob]", 2000, 1000, 10000, 0.1));
+
+ mod_group(x) = rev_group(hgroup("[2] Mod",x));
+ mod_depth = mod_group(hslider("[1]mDepth [style:knob]", 0.1, 0, 1, 0.001));
+ mod_freq = mod_group(hslider("[2]mFreq [style:knob]", 2, 0, 10, 0.010));
+};
+
+
+//----------------------------------`(dm.)greyhole_demo`------------------------------
+// Example GUI for `greyhole` with all parameters exposed.
+//
+// #### Usage
+//
+// ```
+// _,_ : greyhole_demo : _,_
+// ```
+//
+//------------------------------------------------------------
+declare greyhole_demo author "Till Bovermann";
+declare greyhole_demo license "GPL2+";
+
+greyhole_demo = re.greyhole(dt, damp, size, early_diff, feedback, mod_depth, mod_freq)
+with {
+
+ rev_group(x) = vgroup("[0] Greyhole",x);
+
+ mix_group(x) = rev_group(hgroup("[0] Mix",x));
+ dt = mix_group(hslider("[01]delayTime [style:knob]", 0.2, 0.001, 1.45, 0.0001));
+ damp = mix_group(hslider("[02]damping [style:knob]", 0, 0, 0.99, 0.001));
+ size = mix_group(hslider("[03]size [style:knob]", 1, 0.5, 3, 0.0001));
+ early_diff = mix_group(hslider("[04]diffusion [style:knob]", 0.5, 0, 0.99, 0.0001));
+ feedback = mix_group(hslider("[05]feedback [style:knob]", 0.9, 0, 1, 0.01));
+
+ mod_group(x) = rev_group(hgroup("[1] Mod",x));
+ mod_depth = mod_group(hslider("[06]modDepth [style:knob]", 0.1, 0, 1, 0.001));
+ mod_freq = mod_group(hslider("[07]modFreq [style:knob]", 2, 0, 10, 0.01));
+};
+
+//====================================Generators==========================================
+//========================================================================================
+
+//--------------------------`(dm.)sawtooth_demo`---------------------------
+// An application demonstrating the different sawtooth oscillators of Faust.
+//
+// #### Usage
+//
+// ```
+// sawtooth_demo : _
+// ```
+//------------------------------------------------------------
+declare sawtooth_demo author "Julius O. Smith III";
+declare sawtooth_demo licence "MIT";
+
+sawtooth_demo = signal
+with{
+ osc_group(x) = vgroup("[0] SAWTOOTH OSCILLATOR [tooltip: See Faust's oscillators.lib
+ for documentation and references]",x);
+ knob_group(x) = osc_group(hgroup("[1]", x));
+ ampdb = knob_group(vslider("[1] Amplitude [unit:dB] [style:knob] [tooltip: Sawtooth
+ waveform amplitude]",-20,-120,10,0.1));
+ amp = ampdb : ba.db2linear : si.smoo;
+ freq = knob_group(vslider("[2] Frequency [unit:PK] [style:knob] [tooltip: Sawtooth
+ frequency as a Piano Key (PK) number (A440 = key 49)]",49,1,88,0.01) : ba.pianokey2hz);
+ detune1 = 1 + 0.01 * knob_group(
+ vslider("[3] Detuning 1 [unit:%%] [style:knob] [tooltip: Percentage frequency-shift
+ up or down for second oscillator]",-0.1,-10,10,0.01));
+ detune2 = 1 + 0.01 * knob_group(vslider("[4] Detuning 2 [unit:%%] [style:knob] [tooltip:
+ Percentage frequency-shift up or down for third detuned oscillator]",+0.1,-10,10,0.01));
+ portamento = knob_group(vslider("[5] Portamento [unit:sec] [style:knob] [scale:log]
+ [tooltip: Portamento (frequency-glide) time-constant in seconds]",0.1,0.001,10,0.001));
+ sfreq = freq : si.smooth(ba.tau2pole(portamento));
+ saworder = knob_group(nentry("[6] Saw Order [tooltip: Order of sawtootn aliasing
+ suppression]",2,1,os.MAX_SAW_ORDER,1));
+ sawchoice = _ <: par(i,os.MAX_SAW_ORDER,os.sawN(i+1)) :
+ ba.selectn(int(os.MAX_SAW_ORDER), int(saworder-1)); // when max is pwr of 2
+ tone = (amp/3) * (sawchoice(sfreq) + sawchoice(sfreq*detune1) + sawchoice(sfreq*detune2));
+ signal = amp * select2(ei, select2(ss, tone, white_or_pink_noise), _);
+ white_or_pink_noise = select2(wp,no.noise,no.pink_noise);
+ checkbox_group(x) = knob_group(vgroup("[7] Alternate Signals",x));
+ ss = checkbox_group(checkbox("[0] Noise (White or Pink - uses only Amplitude control on
+ the left)"));
+ wp = checkbox_group(checkbox("[1] Pink instead of White Noise (also called 1/f Noise)
+ [tooltip: Pink Noise (or 1/f noise) is Constant-Q Noise, meaning that it has the
+ same total power in every octave]"));
+ ei = checkbox_group(checkbox("[2] External Signal Input (overrides Sawtooth/Noise
+ selection above)"));
+};
+
+
+//----------------------`(dm.)virtual_analog_oscillator_demo`----------------------
+// Virtual analog oscillator demo application.
+//
+// #### Usage
+//
+// ```
+// virtual_analog_oscillator_demo : _
+// ```
+//------------------------------------------------------------
+declare virtual_analog_oscillator_demo author "Julius O. Smith III";
+declare virtual_analog_oscillator_demo licence "MIT";
+
+virtual_analog_oscillator_demo = signal
+with{
+ osc_group(x) = vgroup("[0] VIRTUAL ANALOG OSCILLATORS
+ [tooltip: See Faust's oscillators.lib for documentation and references]",x);
+
+ // Signals
+ sawchoice = _ <:
+ // When MAX_SAW_ORDER is a power of 2:
+ par(i,os.MAX_SAW_ORDER,os.sawN(i+1)) : ba.selectn(int(os.MAX_SAW_ORDER), int(saworder-1));
+ // When MAX_SAW_ORDER is NOT a power of 2:
+ // (par(i,MAX_SAW_ORDER,sawN(i+1)), par(j,MAX_SAW_ORDER_NEXTPOW2-MAX_SAW_ORDER,_))
+ // : selectn(MAX_SAW_ORDER_NEXTPOW2, saworder-1);
+ saw = (amp/3) *
+ (sawchoice(sfreq) + sawchoice(sfreq*detune1) + sawchoice(sfreq*detune2));
+ sq = (amp/3) *
+ (os.square(sfreq) + os.square(sfreq*detune1) + os.square(sfreq*detune2));
+ tri = (amp/3) *
+ (os.triangle(sfreq) + os.triangle(sfreq*detune1) + os.triangle(sfreq*detune2));
+ pt = (amp/3) * (os.pulsetrain(sfreq,ptd)
+ + os.pulsetrain(sfreq*detune1,ptd)
+ + os.pulsetrain(sfreq*detune2,ptd));
+ ptN = (amp/3) * (os.pulsetrainN(N,sfreq,ptd)
+ + os.pulsetrainN(N,sfreq*detune1,ptd)
+ + os.pulsetrainN(N,sfreq*detune2,ptd)) with { N=3; };
+ pn = amp * no.pink_noise;
+
+ signal = ssaw*saw + ssq*sq + stri*tri
+ + spt*((ssptN*ptN)+(1-ssptN)*pt)
+ + spn*pn + sei*_;
+
+ // Signal controls:
+ signal_group(x) = osc_group(hgroup("[0] Signal Levels",x));
+ ssaw = signal_group(vslider("[0] Sawtooth [style:vslider]",1,0,1,0.01));
+
+ pt_group(x) = signal_group(vgroup("[1] Pulse Train",x));
+ ssptN = pt_group(checkbox("[0] Order 3
+ [tooltip: When checked, use 3rd-order aliasing suppression (up from 2)
+ See if you can hear a difference with the freq high and swept]"));
+ spt = pt_group(vslider("[1] [style:vslider]",0,0,1,0.01));
+ ptd = pt_group(vslider("[2] Duty Cycle [style:knob]",0.5,0,1,0.01))
+ : si.smooth(0.99);
+
+ ssq = signal_group(vslider("[2] Square [style:vslider]",0,0,1,0.01));
+ stri = signal_group(vslider("[3] Triangle [style:vslider]",0,0,1,0.01));
+ spn = signal_group(vslider(
+ "[4] Pink Noise [style:vslider][tooltip: Pink Noise (or 1/f noise) is
+ Constant-Q Noise, meaning that it has the same total power in every octave
+ (uses only amplitude controls)]",0,0,1,0.01));
+ sei = signal_group(vslider("[5] Ext Input [style:vslider]",0,0,1,0.01));
+
+ // Signal Parameters
+ knob_group(x) = osc_group(hgroup("[1] Signal Parameters", x));
+ af_group(x) = knob_group(vgroup("[0]", x));
+ ampdb = af_group(hslider("[1] Mix Amplitude [unit:dB] [style:hslider]
+ [tooltip: Sawtooth waveform amplitude]",-20,-120,10,0.1));
+ amp = ampdb : ba.db2linear : si.smoo;
+ freq = af_group(hslider("[2] Frequency [unit:PK] [style:hslider] [tooltip: Sawtooth
+ frequency as a Piano Key (PK) number (A440 = key 49)]",49,1,88,0.01) : ba.pianokey2hz);
+
+ detune1 = 1 - 0.01 * knob_group(
+ vslider("[3] Detuning 1 [unit:%%] [style:knob]
+ [tooltip: Percentage frequency-shift up or down for second oscillator]",
+ -0.1,-10,10,0.01));
+ detune2 = 1 + 0.01 * knob_group(
+ vslider("[4] Detuning 2 [unit:%%] [style:knob]
+ [tooltip: Percentage frequency-shift up or down for third detuned oscillator]",
+ +0.1,-10,10,0.01));
+ portamento = knob_group(
+ vslider("[5] Portamento [unit:sec] [style:knob] [scale:log]
+ [tooltip: Portamento (frequency-glide) time-constant in seconds]",
+ 0.1,0.001,10,0.001));
+ saworder = knob_group(nentry("[6] Saw Order [tooltip: Order of sawtooth aliasing
+ suppression]",2,1,os.MAX_SAW_ORDER,1));
+ sfreq = freq : si.smooth(ba.tau2pole(portamento));
+};
+
+
+//--------------------------`(dm.)oscrs_demo` ---------------------------
+// Simple application demoing filter based oscillators.
+//
+// #### Usage
+//
+// ```
+// oscrs_demo : _
+// ```
+//-------------------------------------------------------------------
+declare oscrs_demo author "Julius O. Smith III";
+declare oscrs_demo licence "MIT";
+
+oscrs_demo = signal
+with{
+ osc_group(x) = vgroup("[0] SINE WAVE OSCILLATOR oscrs [tooltip: Sine oscillator based
+ on 2D vector rotation]",x);
+ ampdb = osc_group(hslider("[1] Amplitude [unit:dB] [tooltip: Sawtooth waveform
+ amplitude]",-20,-120,10,0.1));
+ amp = ampdb : ba.db2linear : si.smoo;
+ freq = osc_group(
+ hslider("[2] Frequency [unit:PK]
+ [tooltip: Sine wave frequency as a Piano Key (PK) number (A440 = 49 PK)]",
+ 49,1,88,0.01) : ba.pianokey2hz);
+ portamento = osc_group(
+ hslider("[3] Portamento [unit:sec] [scale:log]
+ [tooltip: Portamento (frequency-glide) time-constant in seconds]",
+ 0.1,0.001,10,0.001));
+ sfreq = freq : si.smooth(ba.tau2pole(portamento));
+ signal = amp * os.oscrs(sfreq);
+};
+
+oscr_demo = oscrs_demo; // synonym
+
+
+//--------------------------`(dm.)velvet_noise_demo`---------------------------
+// Listen to velvet_noise!
+//
+// #### Usage
+//
+// ```
+// velvet_noise_demo : _
+// ```
+//-------------------------------------------------------------------
+declare velvet_noise_demo author "Julius O. Smith III";
+declare velvet_noise_demo licence "MIT";
+
+velvet_noise_demo = vn
+with{
+ amp = hslider("Amp [unit:dB]",-10,-70,10,0.1) : ba.db2linear;
+ f0 = 10.0, hslider("Freq [unit:log10(Hz)]",3,0,4,0.001) : pow;
+ vn = no.velvet_noise(amp,f0);
+};
+
+
+//--------------------------`(dm.)latch_demo`---------------------------
+// Illustrate latch operation.
+//
+// #### Usage
+//
+// ```
+// echo 'import("stdfaust.lib");' > latch_demo.dsp
+// echo 'process = dm.latch_demo;' >> latch_demo.dsp
+// faust2octave latch_demo.dsp
+// Octave:1> plot(faustout);
+// ```
+//-------------------------------------------------------------------
+declare latch_demo author "Julius O. Smith III";
+declare latch_demo licence "MIT";
+
+latch_demo = x, c, ba.latch(c,x) // plot(faustout) after faust2octave
+with{
+ f = float(ma.SR)/1000.0;
+ x = os.oscr(f);
+ c = 0.5 * os.oscrs(5*f); // sample 5 times per period
+};
+
+
+//--------------------------`(dm.)envelopes_demo`---------------------------
+// Illustrate various envelopes overlaid, including their gate * 1.1.
+//
+// #### Usage
+//
+// ```
+// echo 'import("stdfaust.lib");' > envelopes_demo.dsp
+// echo 'process = dm.envelopes_demo;' >> envelopes_demo.dsp
+// faust2octave envelopes_demo.dsp
+// Octave:1> plot(faustout);
+// ```
+//-------------------------------------------------------------------
+declare envelopes_demo author "Julius O. Smith III";
+declare envelopes_demo licence "MIT";
+
+envelopes_demo = gate <: _*1.1,envSE,envAR,envARFE,envARE,envASR,envADSR,envADSRE
+with{
+ gate = (1-(1@500)) + 0.5*(1@750-(1@1700)); // retrigger at 1/2 amp
+ envSE = en.smoothEnvelope(attSec/6.91); // uses time-constant not t60
+ envAR = en.ar(attSec,relT60);
+ envARFE = en.arfe(attSec,relT60,0.25);
+ envARE = en.are(attSec,relT60);
+ envASR = en.asr(attSec,susLvl,relT60);
+ envADSR = en.adsr(attSec,decT60,susLvl,relT60);
+ envADSRE = en.adsre(attSec,decT60,susLvl,relT60);
+ attSec=0.002; // 2 ms attack time
+ decT60=0.010; // 10 ms decay-to-sustain time
+ susLvl=0.80; // Sustain level = 0.8
+ relT60=0.010; // 10 ms release (decay-to-zero) time
+};
+
+//-------------------`(dm.)fft_spectral_level_demo`------------------
+// Make a real-time spectrum analyzer using FFT from analyzers.lib.
+//
+// #### Usage
+//
+// ```
+// echo 'import("stdfaust.lib");' > fft_spectral_level_demo.dsp
+// echo 'process = dm.fft_spectral_level_demo;' >> fft_spectral_level_demo.dsp
+// Mac:
+// faust2caqt fft_spectral_level_demo.dsp
+// open fft_spectral_level_demo.app
+// Linux GTK:
+// faust2jack fft_spectral_level_demo.dsp
+// ./fft_spectral_level_demo
+// Linux QT:
+// faust2jaqt fft_spectral_level_demo.dsp
+// ./fft_spectral_level_demo
+// ```
+//-------------------------------------------------------------------
+declare fft_spectral_level_demo author "Julius O. Smith III";
+declare fft_spectral_level_demo licence "MIT";
+
+fft_spectral_level_demo(N) = an.rfft_spectral_level(N,tau,dB_offset)
+with{
+ ctl_group(x) = hgroup("[1] FFT SPECTRUM ANALYZER CONTROLS", x);
+ tau = ctl_group(hslider("[0] Level Averaging Time [unit:ms] [scale:log]
+ [tooltip: band-level averaging time in milliseconds]",
+ 100,1,10000,1)) * 0.001;
+ dB_offset = ctl_group(hslider("[1] Level dB Offset [unit:dB]
+ [tooltip: Level offset in decibels]",
+ 50,-50,100,1));
+};
+
+//-----------------`(dm.)reverse_echo_demo(nChans)`----------------
+// Multichannel echo effect with reverse delays.
+//
+// #### Usage
+//
+// ```
+// echo 'import("stdfaust.lib");' > reverse_echo_demo.dsp
+// echo 'nChans = 3; // Any integer > 1 should work here' >> reverse_echo_demo.dsp
+// echo 'process = dm.reverse_echo_demo(nChans);' >> reverse_echo_demo.dsp
+// Mac:
+// faust2caqt reverse_echo_demo.dsp
+// open reverse_echo_demo.app
+// Linux GTK:
+// faust2jack reverse_echo_demo.dsp
+// ./reverse_echo_demo
+// Linux QT:
+// faust2jaqt reverse_echo_demo.dsp
+// ./reverse_echo_demo
+// Etc.
+// ```
+//-------------------------------------------------------------------
+declare reverse_echo_demo author "Julius O. Smith III";
+declare reverse_echo_demo licence "MIT";
+
+reverse_echo_demo(nChans) = ef.reverseEchoN(nChans,delMax) : ef.uniformPanToStereo(nChans)
+with {
+ delMax = 2^int(nentry("Log2(Delay)",15,5,16,1)); // delay line length
+};
+
+//------------------------`(dm.)pospass_demo`------------------------
+// Use Positive-Pass Filter pospass() to frequency-shift a sine tone.
+// First, a real sinusoid is converted to its analytic-signal form
+// using pospass() to filter out its negative frequency component.
+// Next, it is multiplied by a modulating complex sinusoid at the
+// shifting frequency to create the frequency-shifted result.
+// The real and imaginary parts are output to channels 1 & 2.
+// For a more interesting frequency-shifting example, check the
+// "Use Mic" checkbox to replace the input sinusoid by mic input.
+// Note that frequency shifting is not the same as frequency scaling.
+// A frequency-shifted harmonic signal is usually not harmonic.
+// Very small frequency shifts give interesting chirp effects when
+// there is feedback around the frequency shifter.
+//
+// #### Usage
+//
+// ```
+// echo 'import("stdfaust.lib");' > pospass_demo.dsp
+// echo 'process = dm.pospass_demo;' >> pospass_demo.dsp
+// Mac:
+// faust2caqt pospass_demo.dsp
+// open pospass_demo.app
+// Linux GTK:
+// faust2jack pospass_demo.dsp
+// ./pospass_demo
+// Linux QT:
+// faust2jaqt pospass_demo.dsp
+// ./pospass_demo
+// Etc.
+// ```
+//-------------------------------------------------------------------
+declare pospass_demo author "Julius O. Smith III";
+declare pospass_demo licence "MIT";
+
+pospass_demo(x) = analytic_signal, modulator : si.cmul with {
+ N = 6; // pospass filter order
+ fc = ma.SR/(2*N); // guard-band for filter roll-off
+ octavesShift = hslider("Frequency Shift in octaves away from SR/16",
+ -2,-7,3,0.001) : si.smooth(0.999);
+ in_select = checkbox("Use Mic");
+ sine_tone = os.oscrs(f0);
+ f0 = ma.SR/16.0; // original frequency to be shifted
+ fn = f0 * 2.0^octavesShift; // modulated frequency
+ df = fn - f0; // frequency-shift as a difference
+ input = select2(in_select, sine_tone, x);
+ analytic_signal = input : fi.pospass6e(fc); // filter out neg freqs
+ //analytic_signal = os.oscrs(f0) : fi.pospass(N,fc); // Butterworth case
+ modulator = os.oscrq(df) : si.cconj; // complex modulation sinusoid
+ // modulator(n) = exp(sqrt(-1) * 2 * ma.PI * df * n / ma.SR) // if complex ok
+};
+
+// end jos section
+/************************************************************************
+************************************************************************
+FAUST library file, GRAME section
+
+Except where noted otherwise, Copyright (C) 2003-2017 by GRAME,
+Centre National de Creation Musicale.
+----------------------------------------------------------------------
+GRAME LICENSE
+
+This program is free software; you can redistribute it and/or modify
+it under the terms of the GNU Lesser General Public License as
+published by the Free Software Foundation; either version 2.1 of the
+License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+GNU Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with the GNU C Library; if not, write to the Free
+Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
+02111-1307 USA.
+
+EXCEPTION TO THE LGPL LICENSE : As a special exception, you may create a
+larger FAUST program which directly or indirectly imports this library
+file and still distribute the compiled code generated by the FAUST
+compiler, or a modified version of this compiled code, under your own
+copyright and license. This EXCEPTION TO THE LGPL LICENSE explicitly
+grants you the right to freely choose the license for the resulting
+compiled code. In particular the resulting compiled code has no obligation
+to be LGPL or GPL. For example you are free to choose a commercial or
+closed source license or any other license if you decide so.
+************************************************************************
+************************************************************************/
+
+// TODO: Add GRAME functions here
+
+//########################################################################################
+/************************************************************************
+FAUST library file, further contributions section
+
+All contributions below should indicate both the contributor and terms
+of license. If no such indication is found, "git blame" will say who
+last edited each line, and that person can be emailed to inquire about
+license disposition, if their license choice is not already indicated
+elsewhere among the libraries. It is expected that all software will be
+released under LGPL, STK-4.3, MIT, BSD, or a similar FOSS license.
+************************************************************************/
+
+//-------------------------------`(dm.)exciter`-------------------------------
+// Psychoacoustic harmonic exciter, with GUI.
+//
+// #### Usage
+//
+// ```
+// _ : exciter : _
+// ```
+//
+// #### References
+//
+// *
+// *
+//-------------------------------------------------------------------------------------
+declare exciter author "PPriyanka Shekar and Julius O. Smith III";
+declare exciter licence "STK-4.3";
+
+//-------------------------------------------------------------------------------------
+exciter = _ <: (fi.highpass(2, fc) : compressor : pregain : harmonicCreator :
+ postgain), _ : balance
+with{
+ // TODO: rewrite to use the standard compressor from compressors.lib
+ compressor = ba.bypass1(cbp,compressorMono)
+ with{
+ comp_group(x) = vgroup("COMPRESSOR [tooltip: Reference:
+ http://en.wikipedia.org/wiki/Dynamic_range_compression]", x);
+
+ meter_group(x) = comp_group(hgroup("[0]", x));
+ knob_group(x) = comp_group(hgroup("[1]", x));
+
+ cbp = meter_group(checkbox("[0] Bypass [tooltip: When this is checked,
+ the compressor has no effect]"));
+
+ gainview = co.compression_gain_mono(ratio,threshold,attack,release) : ba.linear2db
+ : meter_group(hbargraph("[1] Compressor Gain [unit:dB] [tooltip: Current gain
+ of the compressor in dB]",-50,+10));
+
+ displaygain = _ <: _,abs : _,gainview : attach;
+
+ compressorMono = displaygain(co.compressor_mono(ratio,threshold,attack,release));
+
+ ctl_group(x) = knob_group(hgroup("[3] Compression Control", x));
+
+ ratio = ctl_group(hslider("[0] Ratio [style:knob] [tooltip: A compression Ratio
+ of N means that for each N dB increase in input signal level above Threshold, the
+ output level goes up 1 dB]", 5, 1, 20, 0.1));
+
+ threshold = ctl_group(hslider("[1] Threshold [unit:dB] [style:knob] [tooltip:
+ When the signal level exceeds the Threshold (in dB), its level is compressed
+ according to the Ratio]", -30, -100, 10, 0.1));
+
+ env_group(x) = knob_group(hgroup("[4] Compression Response", x));
+
+ attack = env_group(hslider("[1] Attack [unit:ms] [style:knob] [tooltip:
+ Time constant in ms (1/e smoothing time) for the compression gain to approach
+ (exponentially) a new lower target level (the compression `kicking in')]",
+ 50, 0, 500, 0.1)) : *(0.001) : max(1/ma.SR);
+
+ release = env_group(hslider("[2] Release [unit:ms] [style: knob] [tooltip:
+ Time constant in ms (1/e smoothing time) for the compression gain to approach
+ (exponentially) a new higher target level (the compression 'releasing')]",
+ 500, 0, 1000, 0.1)) : *(0.001) : max(1/ma.SR);
+ };
+
+ //Exciter GUI controls
+ ex_group(x) = hgroup("EXCITER [tooltip: Reference: Patent US4150253 A]", x);
+
+ //Highpass - selectable cutoff frequency
+ fc = ex_group(hslider("[0] Cutoff Frequency [unit:Hz] [style:knob] [scale:log]
+ [tooltip: Cutoff frequency for highpassed components to be excited]",
+ 5000, 1000, 10000, 100));
+
+ //Pre-distortion gain - selectable percentage of harmonics
+ ph = ex_group(hslider("[1] Harmonics [unit:percent] [style:knob] [tooltip:
+ Percentage of harmonics generated]", 20, ma.EPSILON, 200, 1)) / 100;
+ pregain = * (ph);
+
+ // TODO: same thing: why doesn't this use cubicnl?
+ //Asymmetric cubic soft clipper
+ harmonicCreator(x) = x <: cubDist1, cubDist2, cubDist3 :> _;
+ cubDist1(x) = (x < 0) * x;
+ cubDist2(x) = (x >= 0) * (x <= 1) * (x - x ^ 3 / 3);
+ cubDist3(x) = (x > 1) * 2/3;
+
+ //Post-distortion gain - undoes effect of pre-gain
+ postgain = * (1/ph);
+
+ //Balance - selectable dry/wet mix
+ ml = ex_group(hslider("[2] Mix [style:knob] [tooltip: Dry/Wet mix of original signal
+ to excited signal]", 0.5, 0, 1, 0.01));
+ balance = (_ * ml), (_ * (1.0 - ml)) :> _;
+};
+
+
+//----------------------------`(dm.)vocoder_demo`-------------------------
+// Use example of the vocoder function where an impulse train is used
+// as excitation.
+//
+// #### Usage
+//
+// ```
+// _ : vocoder_demo : _
+// ```
+//------------------------------------------------------------
+declare vocoder_demo author "Romain Michon";
+declare vocoder_demo licence "LGPL";
+
+vocoder_demo = hgroup("My Vocoder",_,os.lf_imptrain(freq)*gain :
+ ve.vocoder(bands,att,rel,BWRatio) <: _,_)
+with{
+ bands = 32;
+ vocoderGroup(x) = vgroup("Vocoder",x);
+ att = vocoderGroup(hslider("[0] Attack [style:knob] [tooltip: Attack time in seconds]",
+ 5,0.1,100,0.1)*0.001);
+ rel = vocoderGroup(hslider("[1] Release [style:knob] [tooltip: Release time in seconds]",
+ 5,0.1,100,0.1)*0.001);
+ BWRatio = vocoderGroup(hslider("[2] BW [style:knob] [tooltip: Coefficient to adjust the
+ bandwidth of each band]",0.5,0.1,2,0.001));
+ excitGroup(x) = vgroup("Excitation",x);
+ freq = excitGroup(hslider("[0] Freq [style:knob]",330,50,2000,0.1));
+ gain = excitGroup(vslider("[1] Gain",0.5,0,1,0.01) : si.smoo);
+};
+
+//-----------------`(no.)colored_noise`--------------------
+// A coloured noise signal generator.
+//
+// #### Usage
+//
+// ```
+// colored_noise_demo : _
+// ```
+//
+//-------------------------------------------------
+declare colored_noise author "Constantinos Odysseas Economou";
+declare colored_noise license "MIT";
+
+colored_noise_demo = no.colored_noise(N,alpha) : *(ampdb) : *(gate)
+with {
+ N = 12;
+
+ alpha = hslider("[0] Alpha [style:knob] [tooltip: Spectral roll-off factor]", 0.0, -1.0, 1.0, 0.001) : si.smoo;
+ ampdb = hslider("[1] Amplitude [unit:dB] [style:knob] [tooltip: Noise amplitude]", -20, -120, 10, 0.1) : ba.db2linear : si.smoo;
+ gate = checkbox("[2] Gate");
+};
+
+// end further contributions section
diff --git a/dist/examples/LIBRARIES/dx7.lib b/dist/examples/LIBRARIES/dx7.lib
new file mode 100644
index 00000000..9f4b6d33
--- /dev/null
+++ b/dist/examples/LIBRARIES/dx7.lib
@@ -0,0 +1,1034 @@
+//#################################### dx7.lib #########################################
+// Yamaha DX7 emulation library. Its official prefix is `dx`.
+//
+// #### References
+// *
+//########################################################################################
+// Yamaha DX7 emulation library. The various functions available in this library
+// are used by the libraries generated from `.syx` DX7 preset files. This
+// toolkit was greatly inspired by the CSOUND DX7 emulation package:
+// .
+//
+// This library and its related tools are under development. Use it at your
+// own risk!
+//##############################################################################
+
+/************************************************************************
+************************************************************************
+FAUST library file, GRAME section
+
+Except where noted otherwise, Copyright (C) 2003-2017 by GRAME,
+Centre National de Creation Musicale.
+----------------------------------------------------------------------
+GRAME LICENSE
+
+This program is free software; you can redistribute it and/or modify
+it under the terms of the GNU Lesser General Public License as
+published by the Free Software Foundation; either version 2.1 of the
+License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+GNU Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with the GNU C Library; if not, write to the Free
+Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
+02111-1307 USA.
+
+EXCEPTION TO THE LGPL LICENSE : As a special exception, you may create a
+larger FAUST program which directly or indirectly imports this library
+file and still distribute the compiled code generated by the FAUST
+compiler, or a modified version of this compiled code, under your own
+copyright and license. This EXCEPTION TO THE LGPL LICENSE explicitly
+grants you the right to freely choose the license for the resulting
+compiled code. In particular the resulting compiled code has no obligation
+to be LGPL or GPL. For example you are free to choose a commercial or
+closed source license or any other license if you decide so.
+************************************************************************
+************************************************************************/
+
+/*
+TODO:
+ * LFO not implemented yet
+ * The whole system needs some tuning
+*/
+
+ba = library("basics.lib");
+en = library("envelopes.lib");
+ma = library("maths.lib");
+os = library("oscillators.lib");
+
+//----------------------`(dx.)dx7_ampf`--------------------------
+// DX7 amplitude conversion function. 3 versions of this function
+// are available:
+//
+// * `dx7_amp_bpf`: BPF version (same as in the CSOUND toolkit)
+// * `dx7_amp_func`: estimated mathematical equivalent of `dx7_amp_bpf`
+// * `dx7_ampf`: default (sugar for `dx7_amp_func`)
+//
+// #### Usage:
+//
+// ```
+// dx7AmpPreset : dx7_ampf_bpf : _
+// ```
+//
+// Where:
+//
+// * `dx7AmpPreset`: DX7 amplitude value (0-99)
+//----------------------------------------------------------
+// CSOUND function implemented as a BPF
+// Corresponds to F2 in the CSOUND implementation.
+dx7_amp_bpf = ba.bpf.start(0,0) : seq(i,14,ba.bpf.point(xPoints(i)+1,yPoints(i))) : ba.bpf.end(127,1)
+with{
+ xPoints(n) = ba.take(n+1,(9,19,29,39,49,59,64,69,74,79,84,89,94,98));
+ yPoints(n) = ba.take(n+1,(0.000227445,0.000985595,0.002350265,0.005989386,0.014253222,0.033813495,0.052312358,0.080970432,0.124260804,0.190447309,0.295223654,0.457088704,0.70227445,1));
+};
+// Function estimated from the CSOUND function (default)
+dx7_amp_func = min(98)/98 : pow(_,8);
+dx7_ampf = dx7_amp_func;
+
+//----------------------`(dx.)dx7_egraterisef`--------------------------
+// DX7 envelope generator rise conversion function. 3 versions of this function
+// are available:
+//
+// * `dx7_egraterise_bpf`: BPF version (same as in the CSOUND toolkit)
+// * `dx7_egraterise_func`: estimated mathematical equivalent of `dx7_egraterise_bpf`
+// * `dx7_egraterisef`: default (sugar for `dx7_egraterise_func`)
+//
+// #### Usage:
+//
+// ```
+// dx7envelopeRise : dx7_egraterisef : _
+// ```
+//
+// Where:
+//
+// * `dx7envelopeRise`: DX7 envelope rise value (0-99)
+//----------------------------------------------------------
+// CSOUND function implemented as a BPF
+// Corresponds to F4 in the CSOUND implementation.
+dx7_egraterise_bpf = ba.bpf.start(0,38) : seq(i,24,ba.bpf.point(xPoints(i)+1,yPoints(i))) : ba.bpf.end(127,0.003)
+with{
+ xPoints(n) = ba.take(n+1,(4,9,14,19,24,29,34,42,45,48,51,54,60,66,68,71,74,77,
+ 80,83,86,89,92,95));
+ yPoints(n) = ba.take(n+1,(22.8,12,7.5,4.8,2.7,1.8,1.3,.737,.615,
+ .505,.409,.321,.080,.055,.032,.024,.018,.014,.011,.008,.008,
+ .007,.005,.003));
+};
+// Function estimated from the CSOUND function (default)
+dx7_egraterise_func = 38*pow((127-_)/127,12) : max(0.003);
+dx7_egraterisef = dx7_egraterise_func;
+
+//----------------------`(dx.)dx7_egraterisepercf`--------------------------
+// DX7 envelope generator percussive rise conversion function. 3 versions of
+// this function are available:
+//
+// * `dx7_egrateriseperc_bpf`: BPF version (same as in the CSOUND toolkit)
+// * `dx7_egrateriseperc_func`: estimated mathematical equivalent of `dx7_egrateriseperc_bpf`
+// * `dx7_egraterisepercf`: default (sugar for `dx7_egrateriseperc_func`)
+//
+// #### Usage:
+//
+// ```
+// dx7envelopePercRise : dx7_egraterisepercf : _
+// ```
+//
+// Where:
+//
+// * `dx7envelopePercRise`: DX7 envelope percussive rise value (0-99)
+//----------------------------------------------------------
+// CSOUND function implemented as a BPF
+// Corresponds to F5 in the CSOUND implementation.
+dx7_egrateriseperc_bpf = ba.bpf.start(0,0.00001) : seq(i,10,ba.bpf.point(xPoints(i)+1,yPoints(i))) : ba.bpf.end(127,1)
+with{
+ xPoints(n) = ba.take(n+1,(30,34,39,49,59,69,79,89,94,98));
+ yPoints(n) = ba.take(n+1,(0.00001,0.02,0.06,0.14,0.24,0.35,0.5,0.7,0.86,1));
+};
+// Function estimated from the CSOUND function (default)
+dx7_egrateriseperc_func = >=(30)*min(_-30,68)/68 : pow(_,1.8);
+dx7_egraterisepercf = dx7_egrateriseperc_func;
+
+//----------------------`(dx.)dx7_egratedecayf`--------------------------
+// DX7 envelope generator decay conversion function. 3 versions of
+// this function are available:
+//
+// * `dx7_egratedecay_bpf`: BPF version (same as in the CSOUND toolkit)
+// * `dx7_egratedecay_func`: estimated mathematical equivalent of `dx7_egratedecay_bpf`
+// * `dx7_egratedecayf`: default (sugar for `dx7_egratedecay_func`)
+//
+// #### Usage:
+//
+// ```
+// dx7envelopeDecay : dx7_egratedecayf : _
+// ```
+//
+// Where:
+//
+// * `dx7envelopeDecay`: DX7 envelope decay value (0-99)
+//----------------------------------------------------------
+// CSOUND function implemented as a BPF
+// Corresponds to F6 in the CSOUND implementation.
+dx7_egratedecay_bpf = ba.bpf.start(0,318) : seq(i,23,ba.bpf.point(xPoints(i)+1,yPoints(i))) : ba.bpf.end(127,.008)
+with{
+ xPoints(n) = ba.take(n+1,(3,7,12,17,22,27,32,40,43,49,52,55,58,63,66,69,72,75,
+ 78,81,84,87,90));
+ yPoints(n) = ba.take(n+1,(181,115,63,39.7,20,11.2,7,5.66,3.98,1.99,
+ 1.34,.99,.71,.41,.15,.081,.068,.047,.037,.025,.02,.013,.008));
+};
+// Function estimated from the CSOUND function (default)
+dx7_egratedecay_func = 318*pow((127-_)/127,12.6) : max(0.008);
+dx7_egratedecayf = dx7_egratedecay_func;
+
+//----------------------`(dx.)dx7_egratedecaypercf`--------------------------
+// DX7 envelope generator percussive decay conversion function. 3 versions of
+// this function are available:
+//
+// * `dx7_egratedecayperc_bpf`: BPF version (same as in the CSOUND toolkit)
+// * `dx7_egratedecayperc_func`: estimated mathematical equivalent of `dx7_egratedecayperc_bpf`
+// * `dx7_egratedecaypercf`: default (sugar for `dx7_egratedecayperc_func`)
+//
+// #### Usage:
+//
+// ```
+// dx7envelopePercDecay : dx7_egratedecaypercf : _
+// ```
+//
+// Where:
+//
+// * `dx7envelopePercDecay`: DX7 envelope decay value (0-99)
+//----------------------------------------------------------
+// CSOUND function implemented as a BPF
+// Corresponds to F7 in the CSOUND implementation.
+dx7_egratedecayperc_bpf = ba.bpf.start(0,0.00001) : seq(i,10,ba.bpf.point(xPoints(i),yPoints(i))) : ba.bpf.end(127,1)
+with{
+ xPoints(n) = ba.take(n+1,(10,20,30,40,50,60,70,80,90,99));
+ yPoints(n) = ba.take(n+1,(0.25,0.35,0.43,0.52,0.59,0.7,0.77,0.84,0.92,1));
+};
+// Function estimated from the CSOUND function (default)
+dx7_egratedecayperc_func = min(99)/99 : pow(_,0.7);
+dx7_egratedecaypercf = dx7_egratedecayperc_func;
+
+//----------------------`(dx.)dx7_eglv2peakf`--------------------------
+// DX7 envelope level to peak conversion function. 3 versions of
+// this function are available:
+//
+// * `dx7_eglv2peak_bpf`: BPF version (same as in the CSOUND toolkit)
+// * `dx7_eglv2peak_func`: estimated mathematical equivalent of `dx7_eglv2peak_bpf`
+// * `dx7_eglv2peakf`: default (sugar for `dx7_eglv2peak_func`)
+//
+// #### Usage:
+//
+// ```
+// dx7Level : dx7_eglv2peakf : _
+// ```
+//
+// Where:
+//
+// * `dx7Level`: DX7 level value (0-99)
+//-----------------------------------------------------------
+// CSOUND function implemented as a BPF
+// Corresponds to F8 in the CSOUND implementation.
+dx7_eglv2peak_bpf = ba.bpf.start(0,0) : seq(i,14,ba.bpf.point(xPoints(i)+1,yPoints(i))) : ba.bpf.end(127,2.08795)
+with{
+ xPoints(n) = ba.take(n+1,(9,19,29,39,49,59,64,59,74,79,84,89,94,98));
+ yPoints(n) = ba.take(n+1,(0.000477,0.002,0.00493,0.01257,0.02992,0.07098,0.10981,0.16997,0.260855,0.39979,0.61974,0.95954,1.47425,2.08795));
+};
+// Function estimated from the CSOUND function (default)
+dx7_eglv2peak_func = min(98)/98 : pow(_,8) : *(2.08795);
+dx7_eglv2peakf = dx7_eglv2peak_func;
+
+//----------------------`(dx.)dx7_velsensf`--------------------------
+// DX7 velocity sensitivity conversion function.
+//
+// #### Usage:
+//
+// ```
+// dx7Velocity : dx7_velsensf : _
+// ```
+//
+// Where:
+//
+// * `dx7Velocity`: DX7 level value (0-8)
+//-----------------------------------------------------------
+// Corresponds to F10 in the CSOUND implementation
+dx7_velsensf = /(8);
+
+//----------------------`(dx.)dx7_fdbkscalef`--------------------------
+// DX7 feedback scaling conversion function.
+//
+// #### Usage:
+//
+// ```
+// dx7Feedback : dx7_fdbkscalef : _
+// ```
+//
+// Where:
+//
+// * `dx7Feedback`: DX7 feedback value
+//-----------------------------------------------------------
+// Corresponds to F11 in the CSOUND implementation
+dx7_fdbkscalef = *(0.875);
+
+//------------------------------`(dx.)dx7_op`---------------------------
+// DX7 Operator. Implements a phase-modulable sine wave oscillator connected
+// to a DX7 envelope generator.
+//
+// #### Usage:
+//
+// ```
+// dx7_op(freq,phaseMod,outLev,R1,R2,R3,R4,L1,L2,L3,L4,keyVel,rateScale,type,gain,gate) : _
+// ```
+//
+// Where:
+//
+// * `freq`: frequency of the oscillator
+// * `phaseMod`: phase deviation (-1 - 1)
+// * `outLev`: preset output level (0-99)
+// * `R1`: preset envelope rate 1 (0-99)
+// * `R2`: preset envelope rate 2 (0-99)
+// * `R3`: preset envelope rate 3 (0-99)
+// * `R4`: preset envelope rate 4 (0-99)
+// * `L1`: preset envelope level 1 (0-99)
+// * `L2`: preset envelope level 2 (0-99)
+// * `L3`: preset envelope level 3 (0-99)
+// * `L4`: preset envelope level 4 (0-99)
+// * `keyVel`: preset key velocity sensitivity (0-99)
+// * `rateScale`: preset envelope rate scale
+// * `type`: preset operator type
+// * `gain`: general gain
+// * `gate`: trigger signal
+//-----------------------------------------------------------------
+dx7_op(freq,phaseMod,outLev,R1,R2,R3,R4,L1,L2,L3,L4,keyVel,rateScale,type,gain,gate) =
+(en.dx7envelope(egr1,egr2,egr3,egr4,egl1,egl2,egl3,egl4,gate) : envTable)*sineWave
+with{
+ tablesize = 1 << 16;
+ // phase modulation, not freq modulation
+ sineWave = rdtable(tablesize, os.sinwaveform(tablesize), ma.modulo(int(os.phasor(tablesize,freq) + phaseMod*tablesize),tablesize));
+ amp = outLev/99; // the corresponding "CSOUND table" has just been hardcoded here
+ // computing levels
+ vFac = keyVel : dx7_velsensf;
+ egl1 = L1*amp <: *(1-vFac) + *(vFac*gain);
+ egl2 = L2*amp <: *(1-vFac) + *(vFac*gain);
+ egl3 = L3*amp <: *(1-vFac) + *(vFac*gain);
+ egl4 = L4*amp <: *(1-vFac) + *(vFac*gain);
+ // computing rates
+ rs = (freq : ba.hz2midikey)-21 : /(105)*6*rateScale;
+ egr1 = R1+rs : min(99) <:
+ select2(egl1>egl4,dx7_egratedecayf,dx7_egraterisef) <:
+ *(egl4 <: select2(egl1>egl4,dx7_egratedecaypercf,dx7_egraterisepercf)),
+ *(egl1 <: select2(egl1>egl4,dx7_egratedecaypercf,dx7_egraterisepercf)) :
+ - : abs : max(0.001);
+ egr2 = R2+rs : min(99) <:
+ select2(egl2>egl1,dx7_egratedecayf,dx7_egraterisef) <:
+ *(egl2 <: select2(egl2>egl1,dx7_egratedecaypercf,dx7_egraterisepercf)),
+ *(egl1 <: select2(egl2>egl1,dx7_egratedecaypercf,dx7_egraterisepercf)) :
+ - : abs : max(0.001);
+ egr3 = R3+rs : min(99) <:
+ select2(egl3>egl2,dx7_egratedecayf,dx7_egraterisef) <:
+ *(egl2 <: select2(egl3>egl2,dx7_egratedecaypercf,dx7_egraterisepercf)),
+ *(egl3 <: select2(egl3>egl2,dx7_egratedecaypercf,dx7_egraterisepercf)) :
+ - : abs : max(0.001);
+ egr4 = R4+rs : min(99) <:
+ select2(egl3<=egl4,dx7_egratedecayf,dx7_egraterisef) <:
+ *(egl3 <: select2(egl3<=egl4,dx7_egratedecaypercf,dx7_egraterisepercf)),
+ *(egl4 <: select2(egl3<=egl4,dx7_egratedecaypercf,dx7_egraterisepercf)) :
+ - : abs : max(0.001);
+ envTable = _ <: select2(type,dx7_eglv2peakf,dx7_ampf);
+};
+
+//------------------------------`(dx.)dx7_algo`---------------------------
+// DX7 algorithms. Implements the 32 DX7 algorithms (a quick Google search
+// should give your more details on this). Each algorithm uses 6 operators.
+//
+// #### Usage:
+//
+// ```
+// dx7_algo(algN,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) : _
+// ```
+//
+// Where:
+//
+// * `algN`: algorithm number (0-31, should be an int...)
+// * `egR1`: preset envelope rates 1 (a list of 6 values between 0-99)
+// * `egR2`: preset envelope rates 2 (a list of 6 values between 0-99)
+// * `egR3`: preset envelope rates 3 (a list of 6 values between 0-99)
+// * `egR4`: preset envelope rates 4 (a list of 6 values between 0-99)
+// * `egL1`: preset envelope levels 1 (a list of 6 values between 0-99)
+// * `egL2`: preset envelope levels 2 (a list of 6 values between 0-99)
+// * `egL3`: preset envelope levels 3 (a list of 6 values between 0-99)
+// * `egL4`: preset envelope levels 4 (a list of 6 values between 0-99)
+// * `outLev`: preset output levels (a list of 6 values between 0-99)
+// * `keyVel`: preset key velocity sensitivities (a list of 6 values between 0-99)
+// * `ampModSens`: preset amplitude sensitivities (a list of 6 values between 0-99)
+// * `opMode`: preset operator mode (a list of 6 values between 0-1)
+// * `opFreq`: preset operator frequencies (a list of 6 values between 0-99)
+// * `opDetune`: preset operator detuning (a list of 6 values between 0-99)
+// * `opRateScale`: preset operator rate scale (a list of 6 values between 0-99)
+// * `feedback`: preset operator feedback (a list of 6 values between 0-99)
+// * `lfoDelay`: preset LFO delay (a list of 6 values between 0-99)
+// * `lfoDepth`: preset LFO depth (a list of 6 values between 0-99)
+// * `lfoSpeed`: preset LFO speed (a list of 6 values between 0-99)
+// * `freq`: fundamental frequency
+// * `gain`: general gain
+// * `gate`: trigger signal
+//-----------------------------------------------------------------
+
+// Alg 1
+// NOTE: the .2 for feedback was hardcoded in the csound orchestra, not sure why
+// we need it
+dx7_algo(0,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op2 : op1),(op6~*(feedback*.2) : op5 : op4 : op3) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 2
+// NOTE: the .2 for feedback was hardcoded in the csound orchestra, not sure why
+// we need it
+dx7_algo(1,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op2~*(feedback*.2) : op1),(op6 : op5 : op4 : op3) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,0,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,_,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 3
+// Note: weird rand and delay implemented in the csound orchestra and not
+// really sure why...
+dx7_algo(2,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op3 : op2 : op1),(op6~*(feedback) : op5 : op4) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),0,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,0,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),1,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,_,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 4
+dx7_algo(3,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op3 : op2 : op1),(op6 : op5 : op4)~*(feedback) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),0,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,0,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),1,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,_,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 5
+// NOTE: the .1 for feedback was hardcoded in the csound orchestra, not sure why
+// we need it
+dx7_algo(4,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op2 : op1),(op4 : op3),(op6~*(feedback*.1) : op5) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),0,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,0,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 6
+dx7_algo(5,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op2 : op1),(op4 : op3),(op6 : op5)~*(feedback) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),0,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,0,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 7
+dx7_algo(6,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op2 : op1),(op4,(op6~*(feedback) : op5) :> op3) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,0,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 8
+// NOTE: the .1 for feedback was hardcoded in the csound orchestra, not sure why
+// we need it
+dx7_algo(7,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op2 : op1),(op4~*(feedback*.1),(op6 : op5) :> op3) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,0,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 9
+// NOTE: the .4 for feedback was hardcoded in the csound orchestra, not sure why
+// we need it
+dx7_algo(8,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op2~*(feedback*.4) : op1),(op4,(op6 : op5) :> op3) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,0,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,0,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,_,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 10
+// NOTE: the .2 for feedback was hardcoded in the csound orchestra, not sure why
+// we need it
+dx7_algo(9,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op5,op6 :> op4),(op3~*(feedback*.2) : op2 : op1) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,0,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,0,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),0,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),1,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,_,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 11
+// NOTE: the .2 for feedback was hardcoded in the csound orchestra, not sure why
+// we need it
+dx7_algo(10,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op5,op6~*(feedback*.2) :> op4),(op3 : op2 : op1) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,0,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),0,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,0,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),1,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,_,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 12
+// NOTE: the .2 for feedback was hardcoded in the csound orchestra, not sure why
+// we need it
+dx7_algo(11,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op4,op5,op6 :> op3),(op2~*(feedback*.2) : op1) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,0,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,0,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,0,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,_,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 13
+dx7_algo(12,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op4,op5,op6~*(feedback) :> op3),(op2 : op1) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,0,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,0,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 14
+dx7_algo(13,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op2 : op1),(op5,op6~*(feedback) :> op4 : op3) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,0,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 15
+// NOTE: the .4 for feedback was hardcoded in the csound orchestra, not sure why
+// we need it
+dx7_algo(14,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op2~*(feedback*.4) : op1),(op5,op6 :> op4 : op3) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,0,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,0,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,_,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 16
+dx7_algo(15,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+op2,(op4 : op3),(op6~*(feedback) : op5) :> op1
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,0,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),1,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 17
+// NOTE: the .5 for feedback was hardcoded in the csound orchestra, not sure why
+// we need it
+dx7_algo(16,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+op2~*(feedback*.5),(op4 : op3),(op6 : op5) :> op1
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,0,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,0,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),1,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,_,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 18
+dx7_algo(17,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+op2,op3~*(feedback),(op6 : op5 : op4) :> op1
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,0,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),1,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 19
+// NOTE: the .4 for feedback was hardcoded in the csound orchestra, not sure why
+// we need it
+dx7_algo(18,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op3 : op2 : op1),(op6~*(feedback*.4) <: op4,op5) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),0,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),0,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,0,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),1,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,_,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 20
+dx7_algo(19,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op3~*(feedback) <: op1,op2),(op5,op6 :> op4) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,0,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,0,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),0,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),1,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,_,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),0,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 21
+dx7_algo(20,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op3~*(feedback) <: op1,op2),(op6 <: op4,op5) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,0,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),0,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),0,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),1,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,_,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),0,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 22
+// NOTE: the .1 for feedback was hardcoded in the csound orchestra, not sure why
+// we need it
+dx7_algo(21,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op2 : op1),(op6~*(feedback*.1) <: op3,op4,op5) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),0,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),0,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),1,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),0,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 23
+dx7_algo(22,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+op1,(op3 : op2),(op6~*(feedback) <: op4,op5) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),0,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),0,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,0,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),1,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,_,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),0,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,0,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 24
+// NOTE: the .6 for feedback was hardcoded in the csound orchestra, not sure why
+// we need it
+dx7_algo(23,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+op1,op2,(op6~*(feedback*.6) <: op3,op4,op5) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),0,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),0,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),0,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,0,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 25
+dx7_algo(24,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+op1,op2,op3,(op6~*(feedback) <: op4,op5) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),0,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),0,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,0,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),0,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,0,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 26
+dx7_algo(25,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+op1,(op3 : op2),(op5,op6~*(feedback) :> op4) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,0,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),0,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,0,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),1,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,_,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),0,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,0,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 27
+dx7_algo(26,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+op1,(op3~*(feedback) : op2),(op5,op6 :> op4) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,0,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,0,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),0,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),1,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,_,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),0,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,0,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 28
+dx7_algo(27,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+(op2 : op1),(op5~*(feedback) : op4 : op3),op6 :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,0,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),0,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),1,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,_,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 29
+dx7_algo(28,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+op1,op2,(op4 : op3),(op6~*(feedback) : op5) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),0,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,0,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),0,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,0,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 30
+dx7_algo(29,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+op1,op2,(op5~*(feedback) : op4 : op3),op6 :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,0,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),0,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),1,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,_,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),1,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,_,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),0,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,0,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 31
+dx7_algo(30,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+op1,op2,op3,op4,(op6~*(feedback) : op5) :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,_,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),1,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,_,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),0,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,0,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),0,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,0,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),0,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,0,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+// Alg 32
+dx7_algo(31,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) =
+op1,op2,op3,op4,op5,op6 :> _
+with{
+ op6Freq = select2(opMode(5),opFreq(5)*freq,opFreq(5)) + opDetune(5)/4;
+ op6 = dx7_op(op6Freq,0,outLevel(5),egR1(5),egR2(5),egR3(5),egR4(5),egL1(5),egL2(5),egL3(5),egL4(5),keyVelSens(5),opRateScale(5),0,gain,gate);
+ op5Freq = select2(opMode(4),opFreq(4)*freq,opFreq(4)) + opDetune(4)/4;
+ op5 = dx7_op(op5Freq,0,outLevel(4),egR1(4),egR2(4),egR3(4),egR4(4),egL1(4),egL2(4),egL3(4),egL4(4),keyVelSens(4),opRateScale(4),0,gain,gate);
+ op4Freq = select2(opMode(3),opFreq(3)*freq,opFreq(3)) + opDetune(3)/4;
+ op4 = dx7_op(op4Freq,0,outLevel(3),egR1(3),egR2(3),egR3(3),egR4(3),egL1(3),egL2(3),egL3(3),egL4(3),keyVelSens(3),opRateScale(3),0,gain,gate);
+ op3Freq = select2(opMode(2),opFreq(2)*freq,opFreq(2)) + opDetune(2)/4;
+ op3 = dx7_op(op3Freq,0,outLevel(2),egR1(2),egR2(2),egR3(2),egR4(2),egL1(2),egL2(2),egL3(2),egL4(2),keyVelSens(2),opRateScale(2),0,gain,gate);
+ op2Freq = select2(opMode(1),opFreq(1)*freq,opFreq(1)) + opDetune(1)/4;
+ op2 = dx7_op(op2Freq,0,outLevel(1),egR1(1),egR2(1),egR3(1),egR4(1),egL1(1),egL2(1),egL3(1),egL4(1),keyVelSens(1),opRateScale(1),0,gain,gate);
+ op1Freq = select2(opMode(0),opFreq(0)*freq,opFreq(0)) + opDetune(0)/4;
+ op1 = dx7_op(op1Freq,0,outLevel(0),egR1(0),egR2(0),egR3(0),egR4(0),egL1(0),egL2(0),egL3(0),egL4(0),keyVelSens(0),opRateScale(0),0,gain,gate);
+};
+
+//------------------------------`(dx.)dx7_ui`---------------------------
+// Generic DX7 function where all parameters are controllable using UI elements.
+// The `master-with-mute` branch must be used for this function to work...
+// This function is MIDI-compatible.
+//
+// #### Usage
+//
+// ```
+// dx7_ui : _
+// ```
+//-----------------------------------------------------------------
+dx7_ui =
+par(i,32,dx7_algo(i,egR1,egR2,egR3,egR4,egL1,egL2,egL3,egL4,outLevel,keyVelSens,ampModSens,opMode,opFreq,opDetune,opRateScale,feedback,lfoDelay,lfoDepth,lfoSpeed,freq,gain,gate) : control(algorithm == i)) :> _
+with{
+ algorithm = nentry("h:dx7/v:global/[0]algorithm",0,0,31,1) : int;
+ feedback = nentry("h:dx7/v:global/[1]feedback",0,0,99,1) : dx7_fdbkscalef/(2*ma.PI);
+ lfoDelay = nentry("h:dx7/v:global/[2]lfoDelay",0,0,99,1);
+ lfoDepth = nentry("h:dx7/v:global/[3]lfoDepth",0,0,99,1);
+ lfoSpeed = nentry("h:dx7/v:global/[4]lfoSpeed",0,0,99,1);
+ freq = hslider("h:dx7/v:global/[5]freq",400,50,1000,0.01);
+ gain = hslider("h:dx7/v:global/[6]gain",0.8,0,1,0.01);
+ gate = button("h:dx7/v:global/[7]gate");
+ egR1UI = par(i,6,nentry("h:dx7/v:[%i]op%i/[0]egR1",90,0,99,1));
+ egR1(n) = ba.take(n+1,egR1UI);
+ egR2UI = par(i,6,nentry("h:dx7/v:[%i]op%i/[1]egR2",90,0,99,1));
+ egR2(n) = ba.take(n+1,egR2UI);
+ egR3UI = par(i,6,nentry("h:dx7/v:[%i]op%i/[2]egR3",90,0,99,1));
+ egR3(n) = ba.take(n+1,egR3UI);
+ egR4UI = par(i,6,nentry("h:dx7/v:[%i]op%i/[3]egR4",90,0,99,1));
+ egR4(n) = ba.take(n+1,egR4UI);
+ egL1UI = par(i,6,nentry("h:dx7/v:[%i]op%i/[4]egL1",0,0,99,1));
+ egL1(n) = ba.take(n+1,egL1UI);
+ egL2UI = par(i,6,nentry("h:dx7/v:[%i]op%i/[5]egL2",90,0,99,1));
+ egL2(n) = ba.take(n+1,egL2UI);
+ egL3UI = par(i,6,nentry("h:dx7/v:[%i]op%i/[6]egL3",90,0,99,1));
+ egL3(n) = ba.take(n+1,egL3UI);
+ egL4UI = par(i,6,nentry("h:dx7/v:[%i]op%i/[7]egL4",0,0,99,1));
+ egL4(n) = ba.take(n+1,egL4UI);
+ outLevelUI = par(i,6,nentry("h:dx7/v:[%i]op%i/[8]level",95,0,99,1));
+ outLevel(n) = ba.take(n+1,outLevelUI);
+ keyVelSensUI = par(i,6,nentry("h:dx7/v:[%i]op%i/[9]keyVelSens",1,0,8,1));
+ keyVelSens(n) = ba.take(n+1,keyVelSensUI);
+ ampModSensUI = par(i,6,nentry("h:dx7/v:[%i]op%i/[10]ampModSens",0,0,99,1));
+ ampModSens(n) = ba.take(n+1,ampModSensUI);
+ opModeUI = par(i,6,nentry("h:dx7/v:[%i]op%i/[11]opMode",0,0,1,1));
+ opMode(n) = ba.take(n+1,opModeUI);
+ opFreqUI = par(i,6,nentry("h:dx7/v:[%i]op%i/[12]opFreq",1.0,0.0,2.0,0.01));
+ opFreq(n) = ba.take(n+1,opFreqUI);
+ opDetuneUI = par(i,6,nentry("h:dx7/v:[%i]op%i/[13]opDetune",1,-10,10,1));
+ opDetune(n) = ba.take(n+1,opDetuneUI);
+ opRateScaleUI = par(i,6,nentry("h:dx7/v:[%i]op%i/[14]opRateScale",0,0,10,1));
+ opRateScale(n) = ba.take(n+1,opRateScaleUI);
+};
diff --git a/dist/examples/LIBRARIES/envelopes.lib b/dist/examples/LIBRARIES/envelopes.lib
new file mode 100644
index 00000000..605be1a1
--- /dev/null
+++ b/dist/examples/LIBRARIES/envelopes.lib
@@ -0,0 +1,413 @@
+//################################ envelopes.lib ##########################################
+// This library contains a collection of envelope generators. Its official prefix is `en`.
+//
+// #### References
+// *
+//########################################################################################
+
+/************************************************************************
+************************************************************************
+FAUST library file, GRAME section
+
+Except where noted otherwise, Copyright (C) 2003-2017 by GRAME,
+Centre National de Creation Musicale.
+----------------------------------------------------------------------
+GRAME LICENSE
+
+This program is free software; you can redistribute it and/or modify
+it under the terms of the GNU Lesser General Public License as
+published by the Free Software Foundation; either version 2.1 of the
+License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+GNU Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with the GNU C Library; if not, write to the Free
+Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
+02111-1307 USA.
+
+EXCEPTION TO THE LGPL LICENSE : As a special exception, you may create a
+larger FAUST program which directly or indirectly imports this library
+file and still distribute the compiled code generated by the FAUST
+compiler, or a modified version of this compiled code, under your own
+copyright and license. This EXCEPTION TO THE LGPL LICENSE explicitly
+grants you the right to freely choose the license for the resulting
+compiled code. In particular the resulting compiled code has no obligation
+to be LGPL or GPL. For example you are free to choose a commercial or
+closed source license or any other license if you decide so.
+************************************************************************
+************************************************************************/
+
+ma = library("maths.lib");
+ba = library("basics.lib");
+si = library("signals.lib");
+
+declare name "Faust Envelope Library";
+declare version "0.2";
+declare author "GRAME";
+declare copyright "GRAME";
+declare license "LGPL with exception";
+
+//=============================Functions Reference========================================
+//========================================================================================
+
+//-----------------------`(en.)ar`--------------------------
+// AR (Attack, Release) envelope generator (useful to create percussion envelopes).
+// `ar` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// ar(at,rt,t) : _
+// ```
+//
+// Where:
+//
+// * `at`: attack (sec)
+// * `rt`: release (sec)
+// * `t`: trigger signal (attack is triggered when `t>0`, release is triggered
+// when `t=0`)
+//-----------------------------------------------------
+declare ar author "Yann Orlarey, Stéphane Letz";
+ar(at,rt,gate) = AR : max(0)
+with {
+
+ // Durations in samples
+ an = max(1, at*ma.SR);
+ rn = max(1, rt*ma.SR);
+
+ // Deltas per samples
+ adelta = 1/an;
+ rdelta = 1/rn;
+
+ // Attack time (starts at gate upfront and raises infinitely)
+ atime = (raise*reset + upfront) ~ _
+ with {
+ upfront = gate > gate';
+ reset = gate <= gate';
+ raise(x) = (x + (x > 0));
+ };
+
+ // Attack curve
+ A = atime * adelta;
+
+ // Release curve
+ D0 = 1 + an * rdelta;
+ D = D0 - atime * rdelta;
+
+ // AR part
+ AR = min(A, D);
+
+};
+
+
+//------------------------`(en.)asr`----------------------
+// ASR (Attack, Sustain, Release) envelope generator.
+// `asr` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// asr(at,sl,rt,t) : _
+// ```
+//
+// Where:
+//
+// * `at`: attack (sec)
+// * `sl`: sustain level (between 0..1)
+// * `rt`: release (sec)
+// * `t`: trigger signal (attack is triggered when `t>0`, release is triggered
+// when `t=0`)
+//-----------------------------------------------------
+declare asr author "Yann Orlarey, Stéphane Letz";
+asr(at,sl,rt,gate) = AS - R : max(0)
+with {
+
+ // Durations in samples
+ an = max(1, at*ma.SR);
+ rn = max(1, rt*ma.SR);
+
+ // Deltas per samples
+ adelta = sl/an;
+ rdelta = sl/rn;
+
+ // Attack time (starts when gate changes and raises until gate == 0)
+ atime = +(gate) ~ *(gate' >= gate);
+
+ // Attack curve
+ A = atime * adelta;
+
+ // AS part
+ AS = min(A, sl);
+
+ // Release time starts when gate is 0
+ rtime = (+(1) : *(gate == 0)) ~ _;
+
+ // Release curve starts when gate is 0 with the current value of the envelope
+ R = rtime * rdelta;
+
+};
+
+
+//------------------------`(en.)adsr`----------------------
+// ADSR (Attack, Decay, Sustain, Release) envelope generator.
+// `adsr` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// adsr(at,dt,sl,rt,t) : _
+// ```
+//
+// Where:
+//
+// * `at`: attack time (sec)
+// * `dt`: decay time (sec)
+// * `sl`: sustain level (between 0..1)
+// * `rt`: release time (sec)
+// * `t`: trigger signal (attack is triggered when `t>0`, release is triggered
+// when `t=0`)
+//-----------------------------------------------------
+declare adsr author "Yann Orlarey and Andrey Bundin";
+adsr(at,dt,sl,rt,gate) = ADS : *(1-R) : max(0)
+with {
+
+ // Durations in samples
+ an = max(1, at*ma.SR);
+ dn = max(1, dt*ma.SR);
+ rn = max(1, rt*ma.SR);
+
+ // Deltas per samples
+ adelta = 1/an;
+ ddelta = (1-sl)/dn;
+
+ // Attack time (starts when gate changes and raises until gate == 0)
+ atime = +(gate) ~ *(gate' >= gate);
+
+ // Attack curve
+ A = atime * adelta;
+
+ // Decay curve
+ D0 = 1 + an * ddelta;
+ D = D0 - atime * ddelta;
+
+ // ADS part
+ ADS = min(A, max(D, sl));
+
+ // Release time starts when gate is 0
+ rtime = (+(1) : *(gate == 0)) ~ _;
+
+ // Release curve starts when gate is 0 with the current value of the envelope
+ R = rtime/rn;
+
+};
+
+
+//------------------------`(en.)smoothEnvelope`------------------------
+// An envelope with an exponential attack and release.
+// `smoothEnvelope` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// smoothEnvelope(ar,t) : _
+// ```
+//
+// * `ar`: attack and release duration (sec)
+// * `t`: trigger signal (attack is triggered when `t>0`, release is triggered
+// when `t=0`)
+//----------------------------------------------------------------
+declare smoothEnvelope author "Romain Michon";
+smoothEnvelope(ar,t) = t : si.smooth(ba.tau2pole(ar));
+
+// Generic form to be specialized
+// Author: JOS, revised by Stephane Letz
+asrfe(attT60,susLvl,relT60,finLvl,gate) = envelope
+with {
+ ugate = gate>0;
+ target = select2(ugate, finLvl, susLvl*float(ugate));
+ t60 = select2(ugate, relT60, attT60);
+ pole = ba.tau2pole(t60/6.91);
+ envelope = target : si.smooth(pole);
+};
+
+
+//------------------------`(en.)arfe`----------------------
+// ARFE (Attack and Release-to-Final-value Exponentially) envelope generator.
+// Approximately equal to `smoothEnvelope(Attack/6.91)` when Attack == Release.
+//
+// #### Usage
+//
+// ```
+// arfe(at,rt,fl,t) : _
+// ```
+//
+// Where:
+//
+// * `at`: attack (sec)
+// * `rt`: release (sec)
+// * `fl`: final level to approach upon release (such as 0)
+// * `t`: trigger signal (attack is triggered when `t>0`, release is triggered
+// when `t=0`)
+//-----------------------------------------------------
+declare arfe author "Julius O. Smith III, revised by Stephane Letz";
+declare arfe licence "STK-4.3";
+
+arfe(attT60,relT60,fv,gate) = asrfe(attT60,1.0,relT60,fv,gate);
+
+
+//------------------------`(en.)are`----------------------
+// ARE (Attack, Release) envelope generator with Exponential segments.
+// Approximately equal to `smoothEnvelope(Attack/6.91)` when Attack == Release.
+//
+// #### Usage
+//
+// ```
+// are(at,rt,t) : _
+// ```
+//
+// Where:
+//
+// * `at`: attack (sec)
+// * `rt`: release (sec)
+// * `t`: trigger signal (attack is triggered when `t>0`, release is triggered
+// when `t=0`)
+//-----------------------------------------------------
+declare are author "Julius O. Smith III, revised by Stephane Letz";
+declare are licence "STK-4.3";
+
+are(attT60,relT60,gate) = asrfe(attT60,1.0,relT60,0.0,gate);
+
+
+//------------------------`(en.)asre`----------------------
+// ASRE (Attack, Sustain, Release) envelope generator with Exponential segments.
+//
+// #### Usage
+//
+// ```
+// asre(at,sl,rt,t) : _
+// ```
+//
+// Where:
+//
+// * `at`: attack (sec)
+// * `sl`: sustain level (between 0..1)
+// * `rt`: release (sec)
+// * `t`: trigger signal (attack is triggered when `t>0`, release is triggered
+// when `t=0`)
+//-----------------------------------------------------
+declare asre author "Julius O. Smith III, revised by Stephane Letz";
+declare asre licence "STK-4.3";
+
+asre(attT60,susLvl,relT60,gate) = asrfe(attT60,susLvl,relT60,0.0,gate);
+
+
+//------------------------`(en.)adsre`----------------------
+// ADSRE (Attack, Decay, Sustain, Release) envelope generator with Exponential
+// segments.
+//
+// #### Usage
+//
+// ```
+// adsre(at,dt,sl,rt,t) : _
+// ```
+//
+// Where:
+//
+// * `at`: attack (sec)
+// * `dt`: decay (sec)
+// * `sl`: sustain level (between 0..1)
+// * `rt`: release (sec)
+// * `t`: trigger signal (attack is triggered when `t>0`, release is triggered
+// when `t=0`)
+//-----------------------------------------------------
+declare adsre author "Julius O. Smith III";
+declare adsre licence "STK-4.3";
+
+adsre(attT60,decT60,susLvl,relT60,gate) = envelope
+with {
+ ugate = gate>0;
+ samps = ugate : +~(*(ugate)); // ramp time in samples
+ attSamps = int(attT60 * ma.SR);
+ // if attSamps==0, go straight into the decay phase
+ attPhase = (samps0`, release is triggered
+// when `t=0`)
+//-----------------------------------------------------
+declare ahdsre author "Julius O. Smith III, David Braun";
+declare ahdsre licence "STK-4.3";
+
+ahdsre(attT60,htT60,decT60,susLvl,relT60,gate) = envelope
+with {
+ ugate = gate>0;
+ samps = ugate : +~(*(ugate)); // ramp time in samples
+ attSamps = int(attT60 * ma.SR);
+ holdSamps = int((attT60+htT60)*ma.SR);
+ attPhase = (samps0;
+ off = t==0;
+ rs1 = R1*ma.SR;
+ rs2 = R2*ma.SR;
+ rs3 = R3*ma.SR;
+ rs4 = R4*ma.SR;
+ up = ba.countup(rs1+rs2+rs3,off) : ba.bpf.start(0,L4) : ba.bpf.point(rs1,L1) :
+ ba.bpf.point(rs1+rs2,L2) : ba.bpf.end(rs1+rs2+rs3,L3);
+ down = _,ba.countup(rs4,on) : ba.bpf.start(0) : ba.bpf.end(rs4,L4);
+};
diff --git a/dist/examples/LIBRARIES/fds.lib b/dist/examples/LIBRARIES/fds.lib
new file mode 100644
index 00000000..cf0ce3a2
--- /dev/null
+++ b/dist/examples/LIBRARIES/fds.lib
@@ -0,0 +1,535 @@
+//############################# fds.lib ######################################
+
+// This library allows to build linear, explicit finite difference schemes
+// physical models in 1 or 2 dimensions using an approach based on the cellular
+// automata formalism. Its official prefix is `fd`.
+//
+// In order to use the library, one needs to discretize the linear partial
+// differential equation of the desired system both at boundaries and in-between
+// them, thus obtaining a set of explicit recursion relations. Each one
+// of these will provide, for each spatial point the scalar coefficients to be
+// multiplied by the states of the current and past neighbour points.
+//
+// Coefficients need to be stacked in parallel in order to form a coefficients
+// matrix for each point in the mesh. It is necessary to provide one matrix for
+// coefficients matrices are defined, they need to be placed in parallel and
+// ordered following the desired mesh structure (i.e., coefficients for the top
+// left boundaries will come first, while bottom right boundaries will come
+// last), to form a *coefficients scheme*, which can be used with the library
+// functions.
+
+// ## Sources
+
+// Here are listed some works on finite difference schemes and cellular
+// automata thet were the basis for the implementation of this library
+//
+// * S. Bilbao, Numerical Sound Synthesis.Chichester, UK: John Wiley Sons,
+// Ltd, 2009
+
+// * P. Narbel, "Qualitative and quantitative cellular automata from
+// differential equations," Lecture Notes in Computer Science, vol. 4173,
+// pp. 112–121, 10 2006
+
+// * X.-S. Yang and Y. Young, Cellular Automata, PDEs, and Pattern Formation.
+// Chapman & Hall/CRC, 092005, ch. 18, pp. 271–282.
+//
+// #### References
+// *
+//#############################################################################
+
+ba = library("basics.lib");
+si = library("signals.lib");
+ma = library("maths.lib");
+
+declare name "Faust Finite Difference Schemes Library";
+declare version "0.0";
+declare author "Riccardo Russo";
+declare author "Romain Michon";
+
+/*
+TODO:
+ - In case of big 2-D meshes the generated c++ code is too long, making the
+ compiler crash. Consider introducing data structures support.
+ - Implement a way to set nonzero initial conditions.
+ - It would be nice to set the length of a mesh directly in meters and not
+ in points.
+ - Cubic interpolators.
+*/
+
+//===============================Model Construction=============================
+// Once the coefficients scheme is defined, the user can simply call one of
+// these functions to obtain a fully working physical model. They expect to
+// receive a force input signal for each mesh point and output the state of each
+// point. Interpolation operators can be used to drive external forces to the
+// desired points, and to get the signal only from a certain area of the mesh.
+//==============================================================================
+
+//--------------------------------`(fd.)model1D`-------------------------------
+// This function can be used to obtain a physical model in 1 dimension.
+// Takes a force input signal for each point and outputs the state of each
+// point.
+//
+// #### Usage
+//
+// ```
+// si.bus(points) : model1D(points,R,T,scheme) : si.bus(points)
+// ```
+//
+// Where:
+//
+// * `points`: size of the mesh in points
+// * `R`: neighbourhood radius, indicates how many side points are needed (i.e.
+// if R=1 the mesh depends on one point on the left and one on the right)
+// * `T`: time coefficient, indicates how much steps back in time are needed (i.
+// e. if T=1 the maximum delay needed for a neighbour state is 1 sample)
+// * `scheme`: coefficients scheme
+//------------------------------------------------------------------------------
+model1D(points,R,T,scheme) =
+ (route1D(points,R,T,scheme) : buildScheme1D(points,R,T)) ~ si.bus(points);
+
+//--------------------------------`(fd.)model2D`-------------------------------
+// This function can be used to obtain a physical model in 2 dimension.
+// Takes a force input signal for each point and outputs the state of each
+// point.
+// IMPORTANT: 2D models with more than 30x20 points might crash the c++
+// compiler. 2D models need to be compiled with the command line compiler,
+// the online one presents some issues.
+//
+// #### Usage
+//
+// ```
+// si.bus(pointsX*pointsY) : model2D(pointsX,pointsY,R,T,scheme) :
+// si.bus(pointsX*pointsY)
+// ```
+//
+// Where:
+//
+// * `pointsX`: horizontal size of the mesh in points
+// * `pointsY`: vertical size of the mesh in points
+// * `R`: neighbourhood radius, indicates how many side points are needed (i.e.
+// if R=1 the mesh depends on one point on the left and one on the right)
+// * `T`: time coefficient, indicates how much steps back in time are needed (i.
+// e. if T=1 the maximum delay needed for a neighbour state is 1 sample)
+// * `scheme`: coefficients scheme
+//------------------------------------------------------------------------------
+model2D(pointsX,pointsY,R,T,scheme) =
+ (route2D(pointsX,pointsY,R,T,scheme) :
+ buildScheme2D(pointsX,pointsY,R,T)) ~ si.bus(pointsX*pointsY);
+
+//===============================Interpolation=================================
+// Interpolation functions can be used to drive the input signals to the
+// correct mesh points, or to get the output signal from the
+// desired points. All the interpolation functions allow to change the
+// input/output points at run time. In general, all these functions get in
+// input a number of connections, and output the same number of connections,
+// where each signal is multiplied by zero except the ones specified by the
+// arguments.
+//==============================================================================
+
+//-----------------------------`(fd.)stairsInterp1D`---------------------------
+// Stairs interpolator in 1 dimension. Takes a number of signals and outputs
+// the same number of signals, where each one is multiplied by zero except the
+// one specified by the argument. This can vary at run time (i.e. a slider),
+// but must be an integer.
+//
+// #### Usage
+//
+// ```
+// si.bus(points) : stairsInterp1D(points,point) : si.bus(points)
+// ```
+//
+// Where:
+//
+// * `points`: total number of points in the mesh
+// * `point`: number of the desired nonzero signal
+//------------------------------------------------------------------------------
+stairsInterp1D(points,point) = par(i,points,_*select2(i==point,0,1));
+
+//-----------------------------`(fd.)stairsInterp2D`---------------------------
+// Stairs interpolator in 2 dimensions. Similar to the 1-D version.
+//
+// #### Usage
+//
+// ```
+// si.bus(pointsX*pointsY) : stairsInterp2D(pointsX,pointsY,pointX,pointY) :
+// si.bus(pointsX*pointsY)
+// ```
+//
+// Where:
+//
+// * `pointsX`: total number of points in the X direction
+// * `pointsY`: total number of points in the Y direction
+// * `pointX`: horizontal index of the desired nonzero signal
+// * `pointY`: vertical index of the desired nonzero signal
+//------------------------------------------------------------------------------
+stairsInterp2D(pointsX,pointsY,pointX,pointY) =
+ par(i,pointsX,
+ par(j,pointsY,_*select2((i==pointX) & (j==pointY),0,1)));
+
+//-----------------------------`(fd.)linInterp1D`---------------------------
+// Linear interpolator in 1 dimension. Takes a number of signals and outputs
+// the same number of signals, where each one is multiplied by zero except two
+// signals around a floating point index. This is essentially a Faust
+// implementation of the $J(x_i)$ operator, not scaled by the spatial step.
+// (see Stefan Bilbao's book, Numerical Sound Synthesis). The index can vary
+// at run time.
+//
+// #### Usage
+//
+// ```
+// si.bus(points) : linInterp1D(points,point) : si.bus(points)
+// ```
+//
+// Where:
+//
+// * `points`: total number of points in the mesh
+// * `point`: floating point index
+//------------------------------------------------------------------------------
+linInterp1D(points,point) = par(i,points,_*select2(
+ i==int(point), select2(i==int(point+1),0,fraction),(1-fraction)))
+with
+{
+ fraction = ma.frac(point);
+};
+
+//-----------------------------`(fd.)linInterp2D`---------------------------
+// Linear interpolator in 2 dimensions. Similar to the 1 D version.
+//
+// #### Usage
+//
+// ```
+// si.bus(pointsX*pointsY) : linInterp2D(pointsX,pointsY,pointX,pointY) :
+// si.bus(pointsX*pointsY)
+// ```
+//
+// Where:
+//
+// * `pointsX`: total number of points in the X direction
+// * `pointsY`: total number of points in the Y direction
+// * `pointX`: horizontal float index
+// * `pointY`: vertical float index
+//------------------------------------------------------------------------------
+linInterp2D(pointsX,pointsY,pointX,pointY) =
+par(i,pointsX,
+ par(j,pointsY,_*
+ select2((i==intX) & (j==intY),
+ select2((i==(intX+1)) & (j==intY),
+ select2((i==intX) & (j==(intY+1)),
+ select2((i==(intX+1)) & (j==(intY+1)),
+ 0,
+ fractionX*fractionY),
+ (1-fractionX)*fractionY),
+ fractionX*(1-fractionY)),
+ (1-fractionX)*(1-fractionY))))
+with
+{
+ fractionX = ma.frac(pointX);
+ fractionY = ma.frac(pointY);
+ intX = int(pointX);
+ intY = int(pointY);
+};
+
+//---------------------------`(fd.)stairsInterp1DOut`--------------------------
+// Stairs interpolator in 1 dimension. Similar to `stairsInterp1D`, except it
+// outputs only the desired signal.
+//
+// #### Usage
+//
+// ```
+// si.bus(points) : stairsInterp1DOut(points,point) : _
+// ```
+//
+// Where:
+//
+// * `points`: total number of points in the mesh
+// * `point`: number of the desired nonzero signal
+//------------------------------------------------------------------------------
+stairsInterp1DOut(points,point) = ba.selectn(points,point);
+
+//---------------------------`(fd.)stairsInterp2DOut`--------------------------
+// Stairs interpolator in 2 dimensions which outputs only one signal.
+//
+// #### Usage
+//
+// ```
+// si.bus(pointsX*pointsY) : stairsInterp2DOut(pointsX,pointsY,pointX,pointY) : _
+// ```
+//
+// Where:
+//
+// * `pointsX`: total number of points in the X direction
+// * `pointsY`: total number of points in the Y direction
+// * `pointX`: horizontal index of the desired nonzero signal
+// * `pointY`: vertical index of the desired nonzero signal
+//------------------------------------------------------------------------------
+stairsInterp2DOut(pointsX,pointsY,pointX,pointY) =
+ ba.selectn(pointsX*pointsY,pointY+pointX*Y);
+
+//---------------------------`(fd.)linInterp1DOut`--------------------------
+// Linear interpolator in 1 dimension. Similar to `stairsInterp1D`, except it
+// sums each output signal and provides only one output value.
+//
+// #### Usage
+//
+// ```
+// si.bus(points) : linInterp1DOut(points,point) : _
+// ```
+//
+// Where:
+//
+// * `points`: total number of points in the mesh
+// * `point`: floating point index
+//------------------------------------------------------------------------------
+linInterp1DOut(points,point) = linInterp1D(points,point):>_;
+
+//---------------------------`(fd.)stairsInterp2DOut`--------------------------
+// Linear interpolator in 2 dimensions which outputs only one signal.
+//
+// #### Usage
+//
+// ```
+// si.bus(pointsX*pointsY) : linInterp2DOut(pointsX,pointsY,pointX,pointY) : _
+// ```
+//
+// Where:
+//
+// * `pointsX`: total number of points in the X direction
+// * `pointsY`: total number of points in the Y direction
+// * `pointX`: horizontal float index
+// * `pointY`: vertical float index
+//------------------------------------------------------------------------------
+linInterp2DOut(pointsX,pointsY,pointX,pointY) =
+ linInterp2D(pointsX,pointsY,pointX,pointY):>_;
+
+//====================================Routing==================================
+// The routing functions are used internally by the model building functions,
+// but can also be taken separately. These functions route the forces, the
+// coefficients scheme and the neighbours’ signals into the correct scheme
+// points and take as input, in this order: the coefficients block, the
+// feedback signals and the forces. In output they provide, in order, for each
+// scheme point: the force signal, the coefficient matrices and the neighbours’
+// signals. These functions are based on the Faust route primitive.
+//==============================================================================
+
+//---------------------------------`(fd.)route1D`------------------------------
+// Routing function for 1 dimensional schemes.
+//
+// #### Usage
+//
+// ```
+// si.bus((2*R+1)*(T+1)*points),si.bus(points*2) : route1D(points, R, T) :
+// si.bus((1 + ((2*R+1)*(T+1)) + (2*R+1))*points)
+// ```
+//
+// Where:
+//
+// * `points`: total number of points in the mesh
+// * `R`: neighbourhood radius
+// * `T`: time coefficient
+//------------------------------------------------------------------------------
+route1D(points, R, T) = route(points*2+points*nCoeffs, points*nInputs,
+ par(x, points, connections(x)))
+with
+{
+ connections(x) = par(k,nCoeffs,x*nCoeffs+k+1,C(x,k+1)),
+ P(x) + points, C(x,0),
+ par(i, nNeighbors, P(x),C(x-R+i,nInputs-1-i));
+
+ P(x) = x+1 + nCoeffs*points;
+ C(x,count) = (1 + count + (x*nInputs)) * (x>=0) * (x=0) * (x=0) * (y_
+with
+{
+ nNeighbors = (2*R+1)^D;
+ routing =
+ route(nNeighbors*(T+1)+nNeighbors+1,2*nNeighbors*(T+1)+1,
+ (1,1),
+ par(t,T+1,
+ par(i,nNeighbors,i+t*nNeighbors+2,2*(i+t*nNeighbors)+3,
+ i+nNeighbors*(T+1)+2,2*(i+t*nNeighbors)+2)));
+ operations = _,par(t,T+1,
+ par(i,nNeighbors,(_@t),_:*));
+};
+
+//------------------------------`(fd.)buildScheme1D`---------------------------
+// This function is used to stack in parallel several schemePoint functions in
+// 1 dimension, according to the number of points.
+//
+// #### Usage
+//
+// ```
+// si.bus((1 + ((2*R+1)*(T+1)) + (2*R+1))*points) : buildScheme1D(points,R,T) :
+// si.bus(points)
+// ```
+//
+// Where:
+//
+// * `points`: total number of points in the mesh
+// * `R`: neighbourhood radius
+// * `T`: time coefficient
+//------------------------------------------------------------------------------
+buildScheme1D(points,R,T) =
+ par (x, points,schemePoint(R,T,1));
+
+//------------------------------`(fd.)buildScheme2D`---------------------------
+// This function is used to stack in parallel several schemePoint functions in
+// 2 dimensions, according to the number of points in the X and Y directions.
+//
+// #### Usage
+//
+// ```
+// si.bus((1 + ((2*R+1)^2*(T+1)) + (2*R+1)^2)*pointsX*pointsY) :
+// buildScheme2D(pointsX,pointsY,R,T) : si.bus(pointsX*pointsY)
+// ```
+//
+// Where:
+//
+// * `pointsX`: total number of points in the X direction
+// * `pointsY`: total number of points in the Y direction
+// * `R`: neighbourhood radius
+// * `T`: time coefficient
+//------------------------------------------------------------------------------
+buildScheme2D(pointsX,pointsY,R,T) =
+ par (x, pointsX,
+ par(y,pointsY, schemePoint(R,T,2)));
+
+//================================Interaction Models============================
+// Here are defined two physically based interaction algorithms: a hammer and
+// a bow. These functions need to be coupled to the mesh pde, in the point
+// where the interaction happens: to do so, the mesh output signals can be fed
+// back and driven into the force block using the interpolation operators.
+// The latters can be also used to drive the single force output signal to the
+// correct scheme points.
+//==============================================================================
+
+//---------------------------------`(fd.)hammer`-------------------------------
+// Implementation of a nonlinear collision model. The hammer is essentially a
+// finite difference scheme of a linear damped oscillator, which is coupled
+// with the mesh through the collision model (see Stefan Bilbao's book,
+// Numerical Sound Synthesis).
+//
+// #### Usage
+//
+// ```
+// _ :hammer(coeff,omega0Sqr,sigma0,kH,alpha,k,offset,fIn) : _
+// ```
+//
+// Where:
+//
+// * `coeff`: output force scaling coefficient
+// * `omega0Sqr`: squared angular frequency of the hammer oscillator
+// * `sigma0`: damping coefficient of the hammer oscillator
+// * `kH`: hammer stiffness coefficient
+// * `alpha`: nonlinearity parameter
+// * `k`: time sampling step (the same as for the mesh)
+// * `offset`: distance between the string and the hammer at rest in meters
+// * `fIn`: hammer excitation signal (i.e. a button)
+//------------------------------------------------------------------------------
+hammer(coeff,omega0Sqr,sigma0,kH,alpha,k,offset,fIn) =
+ (hammerForce<:hammerModel(fIn,k,offset,_),_)~_:!,_*coeff
+with
+{
+ hammerModel(in,k,offset) =
+ (_,_,_*forceCoeff,in :> _) ~ (_ <: A*_,B*_') :_-offset;
+ hammerForce(uh,u)=select2((uh-u)>0,0,((uh-u)^alpha)*(-kH));
+ A = (2-omega0Sqr^2*k^2)/(1+sigma0*k);
+ B = (-1)*(1-sigma0*k)/(1+sigma0*k);
+ forceCoeff = k^2/(1+sigma0*k);
+};
+
+//---------------------------------`(fd.)bow`-------------------------------
+// Implementation of a nonlinear friction based interaction model that induces
+// Helmholtz motion. (see Stefan Bilbao's book, Numerical Sound Synthesis).
+//
+// #### Usage
+//
+// ```
+// _ :bow(coeff,alpha,k,vb) : _
+// ```
+//
+// Where:
+//
+// * `coeff`: output force scaling coefficient
+// * `alpha`: nonlinearity parameter
+// * `k`: time sampling step (the same as for the mesh)
+// * `vb`: bow velocity [m/s]
+//------------------------------------------------------------------------------
+bow(coeff,alpha,k,vb) = _:phi*(-coeff)
+with
+{
+ phi(u) = 1.41*alpha*dVel(u)*exp(-alpha*dVel(u)*dVel(u)+0.5);
+ dVel(x) = select2(vb==0,(x-x')/k - vb,0);
+};
diff --git a/dist/examples/LIBRARIES/filters.lib b/dist/examples/LIBRARIES/filters.lib
new file mode 100644
index 00000000..4726719f
--- /dev/null
+++ b/dist/examples/LIBRARIES/filters.lib
@@ -0,0 +1,3125 @@
+//##################################### filters.lib ########################################
+// Faust Filters library. Its official prefix is `fi`.
+//
+// The Filters library is organized into 22 sections:
+//
+// * [Basic Filters](#basic-filters)
+// * [Comb Filters](#comb-filters)
+// * [Direct-Form Digital Filter Sections](#direct-form-digital-filter-sections)
+// * [Direct-Form Second-Order Biquad Sections](#direct-form-second-order-biquad-sections)
+// * [Ladder/Lattice Digital Filters](#ladderlattice-digital-filters)
+// * [Useful Special Cases](#useful-special-cases)
+// * [Ladder/Lattice Allpass Filters](#ladderlattice-allpass-filters)
+// * [Digital Filter Sections Specified as Analog Filter Sections](#digital-filter-sections-specified-as-analog-filter-sections)
+// * [Simple Resonator Filters](#simple-resonator-filters)
+// * [Butterworth Lowpass/Highpass Filters](#butterworth-lowpasshighpass-filters)
+// * [Special Filter-Bank Delay-Equalizing Allpass Filters](#special-filter-bank-delay-equalizing-allpass-filters)
+// * [Elliptic (Cauer) Lowpass Filters](#elliptic-cauer-lowpass-filters)
+// * [Elliptic Highpass Filters](#elliptic-highpass-filters)
+// * [Butterworth Bandpass/Bandstop Filters](#butterworth-bandpassbandstop-filters)
+// * [Elliptic Bandpass Filters](#elliptic-bandpass-filters)
+// * [Parametric Equalizers (Shelf, Peaking)](#parametric-equalizers-shelf-peaking)
+// * [Mth-Octave Filter-Banks](#mth-octave-filter-banks)
+// * [Arbitrary-Crossover Filter-Banks and Spectrum Analyzers](#arbitrary-crossover-filter-banks-and-spectrum-analyzers)
+// * [State Variable Filters (SVF)](#state-variable-filters)
+// * [Linkwitz-Riley 4th-order 2-way, 3-way, and 4-way crossovers](#linkwitz-riley-4th-order-2-way-3-way-and-4-way-crossovers)
+// * [Standardized Filters](#standardized-filters)
+// * [Averaging Functions](#averaging-functions)
+//
+// #### References
+// *
+//
+//########################################################################################
+
+// NOTE ABOUT LICENSES:
+// Each function in this library has its own license. Licenses are declared
+// before each function. Corresponding license terms can be found at the
+// bottom of this file or in the Faust libraries documentation.
+
+ma = library("maths.lib");
+ba = library("basics.lib");
+ro = library("routes.lib");
+de = library("delays.lib");
+an = library("analyzers.lib");
+ef = library("misceffects.lib");
+si = library("signals.lib");
+fi = library("filters.lib"); // for compatible copy/paste out of this file
+
+declare name "Faust Filters Library";
+declare version "0.3";
+
+//===============================Basic Filters============================================
+//========================================================================================
+
+//----------------------`(fi.)zero`--------------------------
+// One zero filter. Difference equation: \(y(n) = x(n) - zx(n-1)\).
+//
+// #### Usage
+//
+// ```
+// _ : zero(z) : _
+// ```
+//
+// Where:
+//
+// * `z`: location of zero along real axis in z-plane
+//
+// #### Reference
+//
+//----------------------------------------------------------
+declare zero author "Julius O. Smith III";
+declare zero copyright "Copyright (C) 2003-2019 by Julius O. Smith III ";
+declare zero license "MIT-style STK-4.3 license";
+zero(z) = _ <: _,mem : _,*(z) : -;
+
+//------------------------`(fi.)pole`---------------------------
+// One pole filter. Could also be called a "leaky integrator".
+// Difference equation: \(y(n) = x(n) + py(n-1)\).
+//
+// #### Usage
+//
+// ```
+// _ : pole(p) : _
+// ```
+//
+// Where:
+//
+// * `p`: pole location = feedback coefficient
+//
+// #### Reference
+//
+//------------------------------------------------------------
+declare pole author "Julius O. Smith III";
+declare pole copyright "Copyright (C) 2003-2019 by Julius O. Smith III ";
+declare pole license "MIT-style STK-4.3 license";
+pole(p) = + ~ *(p);
+
+//----------------------`(fi.)integrator`--------------------------
+// Same as `pole(1)` [implemented separately for block-diagram clarity].
+//------------------------------------------------------------
+declare integrator author "Julius O. Smith III";
+declare integrator copyright "Copyright (C) 2003-2019 by Julius O. Smith III ";
+declare integrator license "MIT-style STK-4.3 license";
+integrator = + ~ _;
+
+//-------------------`(fi.)dcblockerat`-----------------------
+// DC blocker with configurable break frequency.
+// The amplitude response is substantially flat above \(fb\),
+// and sloped at about +6 dB/octave below \(fb\).
+// Derived from the analog transfer function:
+// $$H(s) = \frac{s}{(s + 2 \pi fb)}$$
+// (which can be seen as a 1st-order Butterworth highpass filter)
+// by the low-frequency-matching bilinear transform method
+// (i.e., the standard frequency-scaling constant 2*SR).
+//
+// #### Usage
+//
+// ```
+// _ : dcblockerat(fb) : _
+// ```
+//
+// Where:
+//
+// * `fb`: "break frequency" in Hz, i.e., -3 dB gain frequency.
+//
+// #### Reference
+//
+//------------------------------------------------------------
+declare dcblockerat author "Julius O. Smith III";
+declare dcblockerat copyright "Copyright (C) 2003-2019 by Julius O. Smith III ";
+declare dcblockerat license "MIT-style STK-4.3 license";
+dcblockerat(fb) = *(b0) : zero(1) : pole(p)
+with {
+ wn = ma.PI*fb/ma.SR;
+ b0 = 1.0 / (1 + wn);
+ p = (1 - wn) * b0;
+};
+
+//----------------------`(fi.)dcblocker`--------------------------
+// DC blocker. Default dc blocker has -3dB point near 35 Hz (at 44.1 kHz)
+// and high-frequency gain near 1.0025 (due to no scaling).
+// `dcblocker` is as standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : dcblocker : _
+// ```
+//------------------------------------------------------------
+declare dcblocker author "Julius O. Smith III";
+declare dcblocker copyright "Copyright (C) 2003-2019 by Julius O. Smith III ";
+declare dcblocker license "MIT-style STK-4.3 license";
+dcblocker = zero(1) : pole(0.995);
+
+//----------------------------`(fi.)lptN`--------------------------------------
+// One-pole lowpass filter with arbitrary dis/charging factors set in dB and
+// times set in seconds.
+//
+// #### Usage
+//
+// ```
+// _ : lptN(N, tN) : _
+// ```
+//
+// Where:
+//
+// * `N`: is the attenuation factor in dB
+// * `tN`: is the filter period in seconds, that is, the time for the
+// impulse response to decay by `N` dB
+//
+// #### Reference
+//
+//----------------------------------------------------------
+declare lptN author "Julius O. Smith III";
+declare lptN copyright "Copyright (C) 2003-2019 by Julius O. Smith III ";
+declare lptN license "MIT-style STK-4.3 license";
+lptN(N, tN, x) = x : si.smooth(ba.tau2pole(tN / log(10.0^(float(N)/20.0))));
+// Special cases of lptN
+lptau(tN, x) = lptN(8.6858896381, tN, x); // Tau time constant, i.e., 1/e atten. after tN secs
+lpt60(tN, x) = lptN(60, tN, x); // T60 constant, i.e., 1/1000 atten. after tN secs
+lpt19(tN, x) = lptN(19, tN, x); // T19 constant, i.e., 1/e^2.2 atten. after tN secs
+
+//=======================================Comb Filters=====================================
+//========================================================================================
+
+//------`(fi.)ff_comb`--------
+// Feed-Forward Comb Filter. Note that `ff_comb` requires integer delays
+// (uses `delay` internally).
+// `ff_comb` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : ff_comb(maxdel,intdel,b0,bM) : _
+// ```
+//
+// Where:
+//
+// * `maxdel`: maximum delay (a power of 2)
+// * `intdel`: current (integer) comb-filter delay between 0 and maxdel
+// * `del`: current (float) comb-filter delay between 0 and maxdel
+// * `b0`: gain applied to delay-line input
+// * `bM`: gain applied to delay-line output and then summed with input
+//
+// #### Reference
+//
+//------------------------------------------------------------
+declare ff_comb author "Julius O. Smith III";
+declare ff_comb copyright "Copyright (C) 2003-2019 by Julius O. Smith III ";
+declare ff_comb license "MIT-style STK-4.3 license";
+ff_comb(maxdel,M,b0,bM) = _ <: *(b0), bM * de.delay(maxdel,M) : +;
+
+//------`(fi.)ff_fcomb`--------
+// Feed-Forward Comb Filter. Note that `ff_fcomb` takes floating-point delays
+// (uses `fdelay` internally).
+// `ff_fcomb` is a standard Faust function.
+//
+// #### Usage
+//
+// ```
+// _ : ff_fcomb(maxdel,del,b0,bM) : _
+// ```
+//
+// Where:
+//
+// * `maxdel`: maximum delay (a power of 2)
+// * `intdel`: current (integer) comb-filter delay between 0 and maxdel
+// * `del`: current (float) comb-filter delay between 0 and maxdel
+// * `b0`: gain applied to delay-line input
+// * `bM`: gain applied to delay-line output and then summed with input
+//
+// #### Reference
+//
+//------------------------------------------------------------
+declare ff_fcomb author "Julius O. Smith III";
+declare ff_fcomb copyright "Copyright (C) 2003-2019 by Julius O. Smith III ";
+declare ff_fcomb license "MIT-style STK-4.3 license";
+ff_fcomb(maxdel,M,b0,bM) = _ <: *(b0), bM * de.fdelay(maxdel,M) : +;
+
+//-----------`(fi.)ffcombfilter`-------------------
+// Typical special case of `ff_comb()` where: `b0 = 1`.
+//------------------------------------------------------------
+declare ff_combfilter author "Julius O. Smith III";
+declare ff_combfilter copyright "Copyright (C) 2003-2019 by Julius O. Smith III ";
+declare ff_combfilter license "MIT-style STK-4.3 license";
+ffcombfilter(maxdel,del,g) = ff_comb(maxdel,del,1,g);
+
+
+//-----------------------`(fi.)fb_comb`-----------------------
+// Feed-Back Comb Filter (integer delay).
+//
+// #### Usage
+//
+// ```
+// _ : fb_comb(maxdel,intdel,b0,aN) : _
+// ```
+//
+// Where:
+//
+// * `maxdel`: maximum delay (a power of 2)
+// * `intdel`: current (integer) comb-filter delay between 0 and maxdel
+// * `del`: current (float) comb-filter delay between 0 and maxdel
+// * `b0`: gain applied to delay-line input and forwarded to output
+// * `aN`: minus the gain applied to delay-line output before summing with the input
+// and feeding to the delay line
+//
+// #### Reference
+//
+//------------------------------------------------------------
+declare fb_comb author "Julius O. Smith III";
+declare fb_comb copyright "Copyright (C) 2003-2019 by Julius O. Smith III ";
+declare fb_comb license "MIT-style STK-4.3 license";
+fb_comb(maxdel,N,b0,aN) = (+ <: de.delay(maxdel,N-1),_) ~ *(-aN) : !,*(b0) : mem;
+
+
+//-----------------------`(fi.)fb_fcomb`-----------------------
+// Feed-Back Comb Filter (floating point delay).
+//
+// #### Usage
+//
+// ```
+// _ : fb_fcomb(maxdel,del,b0,aN) : _
+// ```
+//
+// Where:
+//
+// * `maxdel`: maximum delay (a power of 2)
+// * `intdel`: current (integer) comb-filter delay between 0 and maxdel
+// * `del`: current (float) comb-filter delay between 0 and maxdel
+// * `b0`: gain applied to delay-line input and forwarded to output
+// * `aN`: minus the gain applied to delay-line output before summing with the input
+// and feeding to the delay line
+//
+// #### Reference
+//
+//------------------------------------------------------------
+declare fb_fcomb author "Julius O. Smith III";
+declare fb_fcomb copyright "Copyright (C) 2003-2019 by Julius O. Smith III ";
+declare fb_fcomb license "MIT-style STK-4.3 license";
+fb_fcomb(maxdel,N,b0,aN) = (+ <: de.fdelay(maxdel,float(N)-1.0),_) ~ *(-aN) : !,*(b0) : mem;
+
+//-----------------------`(fi.)rev1`-----------------------
+// Special case of `fb_comb` (`rev1(maxdel,N,g)`).
+// The "rev1 section" dates back to the 1960s in computer-music reverberation.
+// See the `jcrev` and `brassrev` in `reverbs.lib` for usage examples.
+//------------------------------------------------------------
+declare rev1 author "Julius O. Smith III";
+declare rev1 copyright "Copyright (C) 2003-2019 by Julius O. Smith III ";
+declare rev1 license "MIT-style STK-4.3 license";
+rev1(maxdel,N,g) = fb_comb (maxdel,N,1,-g);
+
+//-----`(fi.)fbcombfilter` and `(fi.)ffbcombfilter`------------
+// Other special cases of Feed-Back Comb Filter.
+//
+// #### Usage
+//
+// ```
+// _ : fbcombfilter(maxdel,intdel,g) : _
+// _ : ffbcombfilter(maxdel,del,g) : _
+// ```
+//
+// Where:
+//
+// * `maxdel`: maximum delay (a power of 2)
+// * `intdel`: current (integer) comb-filter delay between 0 and maxdel
+// * `del`: current (float) comb-filter delay between 0 and maxdel
+// * `g`: feedback gain
+//
+// #### Reference
+//
+//------------------------------------------------------------
+declare fbcombfilter author "Julius O. Smith III";
+declare fbcombfilter copyright "Copyright (C) 2003-2019 by Julius O. Smith III ";
+declare fbcombfilter license "MIT-style STK-4.3 license";
+fbcombfilter(maxdel,intdel,g) = (+ : de.delay(maxdel,intdel)) ~ *(g);
+
+declare ffbcombfilter author "Julius O. Smith III";
+declare ffbcombfilter copyright "Copyright (C) 2003-2019 by Julius O. Smith III ";
+declare ffbcombfilter license "MIT-style STK-4.3 license";
+ffbcombfilter(maxdel,del,g) = (+ : de.fdelay(maxdel,del)) ~ *(g);
+
+
+//-------------------`(fi.)allpass_comb`-----------------
+// Schroeder Allpass Comb Filter. Note that:
+//
+// ```
+// allpass_comb(maxlen,len,aN) = ff_comb(maxlen,len,aN,1) : fb_comb(maxlen,len-1,1,aN);
+// ```
+//
+// which is a direct-form-1 implementation, requiring two delay lines.
+// The implementation here is direct-form-2 requiring only one delay line.
+//
+// #### Usage
+//
+// ```
+// _ : allpass_comb(maxdel,intdel,aN) : _
+// ```
+//
+// Where:
+//
+// * `maxdel`: maximum delay (a power of 2)
+// * `intdel`: current (integer) comb-filter delay between 0 and maxdel
+// * `del`: current (float) comb-filter delay between 0 and maxdel
+// * `aN`: minus the feedback gain
+//
+// #### References
+// *
+// *
+// *
+//------------------------------------------------------------
+declare allpass_comb author "Julius O. Smith III";
+declare allpass_comb copyright "Copyright (C) 2003-2019 by Julius O. Smith III ";
+declare allpass_comb license "MIT-style STK-4.3 license";
+allpass_comb(maxdel,N,aN) = (+ <: de.delay(maxdel,N-1),*(aN)) ~ *(-aN) : mem,_ : +;
+
+
+//-------------------`(fi.)allpass_fcomb`-----------------
+// Schroeder Allpass Comb Filter. Note that:
+//
+// ```
+// allpass_comb(maxlen,len,aN) = ff_comb(maxlen,len,aN,1) : fb_comb(maxlen,len-1,1,aN);
+// ```
+//
+// which is a direct-form-1 implementation, requiring two delay lines.
+// The implementation here is direct-form-2 requiring only one delay line.
+//
+// `allpass_fcomb` is a standard Faust library.
+//
+// #### Usage
+//
+// ```
+// _ : allpass_comb(maxdel,intdel,aN) : _
+// _ : allpass_fcomb(maxdel,del,aN) : _
+// ```
+//
+// Where:
+//
+// * `maxdel`: maximum delay (a power of 2)
+// * `intdel`: current (float) comb-filter delay between 0 and maxdel
+// * `del`: current (float) comb-filter delay between 0 and maxdel
+// * `aN`: minus the feedback gain
+//
+// #### References
+// *
+// *
+// *
+//------------------------------------------------------------
+declare allpass_fcomb author "Julius O. Smith III";
+declare allpass_fcomb copyright "Copyright (C) 2003-2019 by Julius O. Smith III