@easyv/biz-components 0.0.52-beta.1 → 0.0.52-beta.2

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/arrays.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"arrays.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/arrays.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    static { this.empty = new CallbackIterable(_callback => { }); }\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}\n/**\n * Represents a re-arrangement of items in an array.\n */\nexport class Permutation {\n    constructor(_indexMap) {\n        this._indexMap = _indexMap;\n    }\n    /**\n     * Returns a permutation that sorts the given array according to the given compare function.\n     */\n    static createSortPermutation(arr, compareFn) {\n        const sortIndices = Array.from(arr.keys()).sort((index1, index2) => compareFn(arr[index1], arr[index2]));\n        return new Permutation(sortIndices);\n    }\n    /**\n     * Returns a new array with the elements of the given array re-arranged according to this permutation.\n     */\n    apply(arr) {\n        return arr.map((_, index) => arr[this._indexMap[index]]);\n    }\n    /**\n     * Returns a new permutation that undoes the re-arrangement of this permutation.\n    */\n    inverse() {\n        const inverseIndexMap = this._indexMap.slice();\n        for (let i = 0; i < this._indexMap.length; i++) {\n            inverseIndexMap[this._indexMap[i]] = i;\n        }\n        return new Permutation(inverseIndexMap);\n    }\n}\n"],"names":["CompareResult"],"mappings":"AAKO,SAAS,KAAK,OAAO,IAAI,GAAG;AAC/B,SAAO,MAAM,MAAM,UAAU,IAAI,EAAE;AACvC;AACO,SAAS,MAAM,KAAK;AACvB,MAAI,IAAI,WAAW,GAAG;AAClB,UAAM,IAAI,MAAM,mBAAmB;AAAA,EAC3C;AACI,SAAO,CAAC,IAAI,MAAM,GAAG,IAAI,SAAS,CAAC,GAAG,IAAI,IAAI,SAAS,CAAC,CAAC;AAC7D;AACO,SAAS,OAAO,KAAK,OAAO,aAAa,CAAC,GAAG,MAAM,MAAM,GAAG;AAC/D,MAAI,QAAQ,OAAO;AACf,WAAO;AAAA,EACf;AACI,MAAI,CAAC,OAAO,CAAC,OAAO;AAChB,WAAO;AAAA,EACf;AACI,MAAI,IAAI,WAAW,MAAM,QAAQ;AAC7B,WAAO;AAAA,EACf;AACI,WAAS,IAAI,GAAG,MAAM,IAAI,QAAQ,IAAI,KAAK,KAAK;AAC5C,QAAI,CAAC,WAAW,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG;AAC/B,aAAO;AAAA,IACnB;AAAA,EACA;AACI,SAAO;AACX;AAKO,SAAS,8BAA8B,OAAO,OAAO;AACxD,QAAM,OAAO,MAAM,SAAS;AAC5B,MAAI,QAAQ,MAAM;AACd,UAAM,KAAK,IAAI,MAAM,IAAI;AAAA,EACjC;AACI,QAAM,IAAK;AACf;AAYO,SAAS,aAAa,OAAO,KAAK,YAAY;AACjD,SAAO,cAAc,MAAM,QAAQ,OAAK,WAAW,MAAM,CAAC,GAAG,GAAG,CAAC;AACrE;AAgBO,SAAS,cAAc,QAAQ,cAAc;AAChD,MAAI,MAAM,GAAG,OAAO,SAAS;AAC7B,SAAO,OAAO,MAAM;AAChB,UAAM,OAAQ,MAAM,QAAQ,IAAK;AACjC,UAAM,OAAO,aAAa,GAAG;AAC7B,QAAI,OAAO,GAAG;AACV,YAAM,MAAM;AAAA,IACxB,WACiB,OAAO,GAAG;AACf,aAAO,MAAM;AAAA,IACzB,OACa;AACD,aAAO;AAAA,IACnB;AAAA,EACA;AACI,SAAO,EAAE,MAAM;AACnB;AACO,SAAS,YAAY,KAAK,MAAM,SAAS;AAC5C,QAAM,MAAM;AACZ,MAAI,OAAO,KAAK,QAAQ;AACpB,UAAM,IAAI,UAAU,eAAe;AAAA,EAC3C;AACI,QAAM,aAAa,KAAK,KAAK,MAAM,KAAK,SAAS,KAAK,OAAM,CAAE,CAAC;AAC/D,QAAM,QAAQ,CAAE;AAChB,QAAM,SAAS,CAAE;AACjB,QAAM,SAAS,CAAE;AACjB,aAAW,SAAS,MAAM;AACtB,UAAM,MAAM,QAAQ,OAAO,UAAU;AACrC,QAAI,MAAM,GAAG;AACT,YAAM,KAAK,KAAK;AAAA,IAC5B,WACiB,MAAM,GAAG;AACd,aAAO,KAAK,KAAK;AAAA,IAC7B,OACa;AACD,aAAO,KAAK,KAAK;AAAA,IAC7B;AAAA,EACA;AACI,MAAI,MAAM,MAAM,QAAQ;AACpB,WAAO,YAAY,KAAK,OAAO,OAAO;AAAA,EAC9C,WACa,MAAM,MAAM,SAAS,OAAO,QAAQ;AACzC,WAAO,OAAO,CAAC;AAAA,EACvB,OACS;AACD,WAAO,YAAY,OAAO,MAAM,SAAS,OAAO,SAAS,QAAQ,OAAO;AAAA,EAChF;AACA;AACO,SAAS,QAAQ,MAAM,SAAS;AACnC,QAAM,SAAS,CAAE;AACjB,MAAI,eAAe;AACnB,aAAW,WAAW,KAAK,MAAM,CAAC,EAAE,KAAK,OAAO,GAAG;AAC/C,QAAI,CAAC,gBAAgB,QAAQ,aAAa,CAAC,GAAG,OAAO,MAAM,GAAG;AAC1D,qBAAe,CAAC,OAAO;AACvB,aAAO,KAAK,YAAY;AAAA,IACpC,OACa;AACD,mBAAa,KAAK,OAAO;AAAA,IACrC;AAAA,EACA;AACI,SAAO;AACX;AAMO,UAAU,gBAAgB,OAAO,iBAAiB;AACrD,MAAI;AACJ,MAAI;AACJ,aAAW,QAAQ,OAAO;AACtB,QAAI,SAAS,UAAa,gBAAgB,MAAM,IAAI,GAAG;AACnD,mBAAa,KAAK,IAAI;AAAA,IAClC,OACa;AACD,UAAI,cAAc;AACd,cAAM;AAAA,MACtB;AACY,qBAAe,CAAC,IAAI;AAAA,IAChC;AACQ,WAAO;AAAA,EACf;AACI,MAAI,cAAc;AACd,UAAM;AAAA,EACd;AACA;AACO,SAAS,gBAAgB,KAAK,GAAG;AACpC,WAAS,IAAI,GAAG,KAAK,IAAI,QAAQ,KAAK;AAClC,MAAE,MAAM,IAAI,SAAY,IAAI,IAAI,CAAC,GAAG,MAAM,IAAI,SAAS,SAAY,IAAI,CAAC,CAAC;AAAA,EACjF;AACA;AACO,SAAS,qBAAqB,KAAK,GAAG;AACzC,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACjC,MAAE,MAAM,IAAI,SAAY,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,MAAM,IAAI,SAAS,SAAY,IAAI,IAAI,CAAC,CAAC;AAAA,EACjG;AACA;AAIO,SAAS,SAAS,OAAO;AAC5B,SAAO,MAAM,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;AAClC;AAIO,SAAS,gBAAgB,OAAO;AACnC,MAAI,KAAK;AACT,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,QAAI,CAAC,CAAC,MAAM,CAAC,GAAG;AACZ,YAAM,EAAE,IAAI,MAAM,CAAC;AACnB,YAAM;AAAA,IAClB;AAAA,EACA;AACI,QAAM,SAAS;AACnB;AAIO,SAAS,eAAe,KAAK;AAChC,SAAO,CAAC,MAAM,QAAQ,GAAG,KAAK,IAAI,WAAW;AACjD;AACO,SAAS,gBAAgB,KAAK;AACjC,SAAO,MAAM,QAAQ,GAAG,KAAK,IAAI,SAAS;AAC9C;AAKO,SAAS,SAAS,OAAO,QAAQ,WAAS,OAAO;AACpD,QAAM,OAAO,oBAAI,IAAK;AACtB,SAAO,MAAM,OAAO,aAAW;AAC3B,UAAM,MAAM,MAAM,OAAO;AACzB,QAAI,KAAK,IAAI,GAAG,GAAG;AACf,aAAO;AAAA,IACnB;AACQ,SAAK,IAAI,GAAG;AACZ,WAAO;AAAA,EACf,CAAK;AACL;AACO,SAAS,eAAe,OAAO,eAAe;AACjD,SAAO,MAAM,SAAS,IAAI,MAAM,CAAC,IAAI;AACzC;AACO,SAAS,MAAM,KAAK,IAAI;AAC3B,MAAI,OAAO,OAAO,OAAO,WAAW,MAAM;AAC1C,MAAI,OAAO,OAAO,UAAU;AACxB,WAAO;AAAA,EACf,OACS;AACD,WAAO;AACP,SAAK;AAAA,EACb;AACI,QAAM,SAAS,CAAE;AACjB,MAAI,QAAQ,IAAI;AACZ,aAAS,IAAI,MAAM,IAAI,IAAI,KAAK;AAC5B,aAAO,KAAK,CAAC;AAAA,IACzB;AAAA,EACA,OACS;AACD,aAAS,IAAI,MAAM,IAAI,IAAI,KAAK;AAC5B,aAAO,KAAK,CAAC;AAAA,IACzB;AAAA,EACA;AACI,SAAO;AACX;AAKO,SAAS,YAAY,QAAQ,aAAa,WAAW;AACxD,QAAM,SAAS,OAAO,MAAM,GAAG,WAAW;AAC1C,QAAM,QAAQ,OAAO,MAAM,WAAW;AACtC,SAAO,OAAO,OAAO,WAAW,KAAK;AACzC;AAIO,SAAS,YAAY,KAAK,OAAO;AACpC,QAAM,QAAQ,IAAI,QAAQ,KAAK;AAC/B,MAAI,QAAQ,IAAI;AACZ,QAAI,OAAO,OAAO,CAAC;AACnB,QAAI,QAAQ,KAAK;AAAA,EACzB;AACA;AAIO,SAAS,UAAU,KAAK,OAAO;AAClC,QAAM,QAAQ,IAAI,QAAQ,KAAK;AAC/B,MAAI,QAAQ,IAAI;AACZ,QAAI,OAAO,OAAO,CAAC;AACnB,QAAI,KAAK,KAAK;AAAA,EACtB;AACA;AACO,SAAS,SAAS,KAAK,OAAO;AACjC,aAAW,QAAQ,OAAO;AACtB,QAAI,KAAK,IAAI;AAAA,EACrB;AACA;AACO,SAAS,QAAQ,GAAG;AACvB,SAAO,MAAM,QAAQ,CAAC,IAAI,IAAI,CAAC,CAAC;AACpC;AAOO,SAAS,WAAW,OAAO,OAAO,UAAU;AAC/C,QAAM,WAAW,oBAAoB,OAAO,KAAK;AACjD,QAAM,iBAAiB,MAAM;AAC7B,QAAM,iBAAiB,SAAS;AAChC,QAAM,SAAS,iBAAiB;AAEhC,WAAS,IAAI,iBAAiB,GAAG,KAAK,UAAU,KAAK;AACjD,UAAM,IAAI,cAAc,IAAI,MAAM,CAAC;AAAA,EAC3C;AACI,WAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACrC,UAAM,IAAI,QAAQ,IAAI,SAAS,CAAC;AAAA,EACxC;AACA;AASO,SAAS,OAAO,OAAO,OAAO,aAAa,UAAU;AACxD,QAAM,QAAQ,oBAAoB,OAAO,KAAK;AAC9C,MAAI,SAAS,MAAM,OAAO,OAAO,WAAW;AAC5C,MAAI,WAAW,QAAW;AAEtB,aAAS,CAAE;AAAA,EACnB;AACI,aAAW,OAAO,OAAO,QAAQ;AACjC,SAAO;AACX;AAQA,SAAS,oBAAoB,OAAO,OAAO;AACvC,SAAO,QAAQ,IAAI,KAAK,IAAI,QAAQ,MAAM,QAAQ,CAAC,IAAI,KAAK,IAAI,OAAO,MAAM,MAAM;AACvF;AACU,IAAC;AAAA,CACV,SAAUA,gBAAe;AACtB,WAAS,WAAW,QAAQ;AACxB,WAAO,SAAS;AAAA,EACxB;AACI,EAAAA,eAAc,aAAa;AAC3B,WAAS,kBAAkB,QAAQ;AAC/B,WAAO,UAAU;AAAA,EACzB;AACI,EAAAA,eAAc,oBAAoB;AAClC,WAAS,cAAc,QAAQ;AAC3B,WAAO,SAAS;AAAA,EACxB;AACI,EAAAA,eAAc,gBAAgB;AAC9B,WAAS,2BAA2B,QAAQ;AACxC,WAAO,WAAW;AAAA,EAC1B;AACI,EAAAA,eAAc,6BAA6B;AAC3C,EAAAA,eAAc,cAAc;AAC5B,EAAAA,eAAc,WAAW;AACzB,EAAAA,eAAc,2BAA2B;AAC7C,GAAG,kBAAkB,gBAAgB,CAAA,EAAG;AACjC,SAAS,UAAU,UAAU,YAAY;AAC5C,SAAO,CAAC,GAAG,MAAM,WAAW,SAAS,CAAC,GAAG,SAAS,CAAC,CAAC;AACxD;AACO,SAAS,uBAAuB,aAAa;AAChD,SAAO,CAAC,OAAO,UAAU;AACrB,eAAW,cAAc,aAAa;AAClC,YAAM,SAAS,WAAW,OAAO,KAAK;AACtC,UAAI,CAAC,cAAc,2BAA2B,MAAM,GAAG;AACnD,eAAO;AAAA,MACvB;AAAA,IACA;AACQ,WAAO,cAAc;AAAA,EACxB;AACL;AAIY,MAAC,mBAAmB,CAAC,GAAG,MAAM,IAAI;AAClC,MAAC,oBAAoB,CAAC,GAAG,MAAM,iBAAiB,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC;AACzE,SAAS,aAAa,YAAY;AACrC,SAAO,CAAC,GAAG,MAAM,CAAC,WAAW,GAAG,CAAC;AACrC;AACO,MAAM,WAAW;AAAA;AAAA;AAAA;AAAA,EAIpB,YAAY,OAAO;AACf,SAAK,QAAQ;AACb,SAAK,WAAW;AAChB,SAAK,UAAU,KAAK,MAAM,SAAS;AAAA,EAC3C;AAAA,EACI,IAAI,SAAS;AACT,WAAO,KAAK,UAAU,KAAK,WAAW;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA,EAKI,UAAU,WAAW;AAGjB,QAAI,WAAW,KAAK;AACpB,WAAO,WAAW,KAAK,MAAM,UAAU,UAAU,KAAK,MAAM,QAAQ,CAAC,GAAG;AACpE;AAAA,IACZ;AACQ,UAAM,SAAS,aAAa,KAAK,WAAW,OAAO,KAAK,MAAM,MAAM,KAAK,UAAU,QAAQ;AAC3F,SAAK,WAAW;AAChB,WAAO;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMI,iBAAiB,WAAW;AAGxB,QAAI,SAAS,KAAK;AAClB,WAAO,UAAU,KAAK,UAAU,KAAK,MAAM,MAAM,CAAC,GAAG;AACjD;AAAA,IACZ;AACQ,UAAM,SAAS,WAAW,KAAK,UAAU,OAAO,KAAK,MAAM,MAAM,SAAS,GAAG,KAAK,UAAU,CAAC;AAC7F,SAAK,UAAU;AACf,WAAO;AAAA,EACf;AAAA,EACI,OAAO;AACH,QAAI,KAAK,WAAW,GAAG;AACnB,aAAO;AAAA,IACnB;AACQ,WAAO,KAAK,MAAM,KAAK,QAAQ;AAAA,EACvC;AAAA,EACI,UAAU;AACN,UAAM,SAAS,KAAK,MAAM,KAAK,QAAQ;AACvC,SAAK;AACL,WAAO;AAAA,EACf;AAAA,EACI,UAAU,OAAO;AACb,UAAM,SAAS,KAAK,MAAM,MAAM,KAAK,UAAU,KAAK,WAAW,KAAK;AACpE,SAAK,YAAY;AACjB,WAAO;AAAA,EACf;AACA;AAIO,MAAM,oBAAN,MAAM,kBAAiB;AAAA,EAE1B,YAKA,SAAS;AACL,SAAK,UAAU;AAAA,EACvB;AAAA,EACI,UAAU;AACN,UAAM,SAAS,CAAE;AACjB,SAAK,QAAQ,UAAQ;AAAE,aAAO,KAAK,IAAI;AAAG,aAAO;AAAA,KAAO;AACxD,WAAO;AAAA,EACf;AAAA,EACI,OAAO,WAAW;AACd,WAAO,IAAI,kBAAiB,QAAM,KAAK,QAAQ,UAAQ,UAAU,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC;AAAA,EACjG;AAAA,EACI,IAAI,OAAO;AACP,WAAO,IAAI,kBAAiB,QAAM,KAAK,QAAQ,UAAQ,GAAG,MAAM,IAAI,CAAC,CAAC,CAAC;AAAA,EAC/E;AAAA,EACI,SAAS,WAAW;AAChB,QAAI;AACJ,SAAK,QAAQ,UAAQ;AACjB,UAAI,UAAU,IAAI,GAAG;AACjB,iBAAS;AAAA,MACzB;AACY,aAAO;AAAA,IACnB,CAAS;AACD,WAAO;AAAA,EACf;AAAA,EACI,cAAc,YAAY;AACtB,QAAI;AACJ,QAAI,QAAQ;AACZ,SAAK,QAAQ,UAAQ;AACjB,UAAI,SAAS,cAAc,cAAc,WAAW,MAAM,MAAM,CAAC,GAAG;AAChE,gBAAQ;AACR,iBAAS;AAAA,MACzB;AACY,aAAO;AAAA,IACnB,CAAS;AACD,WAAO;AAAA,EACf;AACA;AA1Ca,kBAAK,QAAQ,IAAI,kBAAiB,eAAa;AAAG,CAAA;AADxD,IAAM,mBAAN;AA+CA,MAAM,YAAY;AAAA,EACrB,YAAY,WAAW;AACnB,SAAK,YAAY;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA,EAII,OAAO,sBAAsB,KAAK,WAAW;AACzC,UAAM,cAAc,MAAM,KAAK,IAAI,KAAI,CAAE,EAAE,KAAK,CAAC,QAAQ,WAAW,UAAU,IAAI,MAAM,GAAG,IAAI,MAAM,CAAC,CAAC;AACvG,WAAO,IAAI,YAAY,WAAW;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA,EAII,MAAM,KAAK;AACP,WAAO,IAAI,IAAI,CAAC,GAAG,UAAU,IAAI,KAAK,UAAU,KAAK,CAAC,CAAC;AAAA,EAC/D;AAAA;AAAA;AAAA;AAAA,EAII,UAAU;AACN,UAAM,kBAAkB,KAAK,UAAU,MAAO;AAC9C,aAAS,IAAI,GAAG,IAAI,KAAK,UAAU,QAAQ,KAAK;AAC5C,sBAAgB,KAAK,UAAU,CAAC,CAAC,IAAI;AAAA,IACjD;AACQ,WAAO,IAAI,YAAY,eAAe;AAAA,EAC9C;AACA;","x_google_ignoreList":[0]}
+{"version":3,"file":"arrays.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/arrays.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    static { this.empty = new CallbackIterable(_callback => { }); }\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}\n/**\n * Represents a re-arrangement of items in an array.\n */\nexport class Permutation {\n    constructor(_indexMap) {\n        this._indexMap = _indexMap;\n    }\n    /**\n     * Returns a permutation that sorts the given array according to the given compare function.\n     */\n    static createSortPermutation(arr, compareFn) {\n        const sortIndices = Array.from(arr.keys()).sort((index1, index2) => compareFn(arr[index1], arr[index2]));\n        return new Permutation(sortIndices);\n    }\n    /**\n     * Returns a new array with the elements of the given array re-arranged according to this permutation.\n     */\n    apply(arr) {\n        return arr.map((_, index) => arr[this._indexMap[index]]);\n    }\n    /**\n     * Returns a new permutation that undoes the re-arrangement of this permutation.\n    */\n    inverse() {\n        const inverseIndexMap = this._indexMap.slice();\n        for (let i = 0; i < this._indexMap.length; i++) {\n            inverseIndexMap[this._indexMap[i]] = i;\n        }\n        return new Permutation(inverseIndexMap);\n    }\n}\n"],"names":["CompareResult"],"mappings":"AAKO,SAAS,KAAK,OAAO,IAAI,GAAG;AAC/B,SAAO,MAAM,MAAM,UAAU,IAAI,EAAE;AACvC;AACO,SAAS,MAAM,KAAK;AACvB,MAAI,IAAI,WAAW,GAAG;AAClB,UAAM,IAAI,MAAM,mBAAmB;AAAA,EAC3C;AACI,SAAO,CAAC,IAAI,MAAM,GAAG,IAAI,SAAS,CAAC,GAAG,IAAI,IAAI,SAAS,CAAC,CAAC;AAC7D;AACO,SAAS,OAAO,KAAK,OAAO,aAAa,CAAC,GAAG,MAAM,MAAM,GAAG;AAC/D,MAAI,QAAQ,OAAO;AACf,WAAO;AAAA,EACf;AACI,MAAI,CAAC,OAAO,CAAC,OAAO;AAChB,WAAO;AAAA,EACf;AACI,MAAI,IAAI,WAAW,MAAM,QAAQ;AAC7B,WAAO;AAAA,EACf;AACI,WAAS,IAAI,GAAG,MAAM,IAAI,QAAQ,IAAI,KAAK,KAAK;AAC5C,QAAI,CAAC,WAAW,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG;AAC/B,aAAO;AAAA,IACnB;AAAA,EACA;AACI,SAAO;AACX;AAKO,SAAS,8BAA8B,OAAO,OAAO;AACxD,QAAM,OAAO,MAAM,SAAS;AAC5B,MAAI,QAAQ,MAAM;AACd,UAAM,KAAK,IAAI,MAAM,IAAI;AAAA,EACjC;AACI,QAAM,IAAK;AACf;AAYO,SAAS,aAAa,OAAO,KAAK,YAAY;AACjD,SAAO,cAAc,MAAM,QAAQ,OAAK,WAAW,MAAM,CAAC,GAAG,GAAG,CAAC;AACrE;AAgBO,SAAS,cAAc,QAAQ,cAAc;AAChD,MAAI,MAAM,GAAG,OAAO,SAAS;AAC7B,SAAO,OAAO,MAAM;AAChB,UAAM,OAAQ,MAAM,QAAQ,IAAK;AACjC,UAAM,OAAO,aAAa,GAAG;AAC7B,QAAI,OAAO,GAAG;AACV,YAAM,MAAM;AAAA,IACxB,WACiB,OAAO,GAAG;AACf,aAAO,MAAM;AAAA,IACzB,OACa;AACD,aAAO;AAAA,IACnB;AAAA,EACA;AACI,SAAO,EAAE,MAAM;AACnB;AAmDO,UAAU,gBAAgB,OAAO,iBAAiB;AACrD,MAAI;AACJ,MAAI;AACJ,aAAW,QAAQ,OAAO;AACtB,QAAI,SAAS,UAAa,gBAAgB,MAAM,IAAI,GAAG;AACnD,mBAAa,KAAK,IAAI;AAAA,IAClC,OACa;AACD,UAAI,cAAc;AACd,cAAM;AAAA,MACtB;AACY,qBAAe,CAAC,IAAI;AAAA,IAChC;AACQ,WAAO;AAAA,EACf;AACI,MAAI,cAAc;AACd,UAAM;AAAA,EACd;AACA;AACO,SAAS,gBAAgB,KAAK,GAAG;AACpC,WAAS,IAAI,GAAG,KAAK,IAAI,QAAQ,KAAK;AAClC,MAAE,MAAM,IAAI,SAAY,IAAI,IAAI,CAAC,GAAG,MAAM,IAAI,SAAS,SAAY,IAAI,CAAC,CAAC;AAAA,EACjF;AACA;AACO,SAAS,qBAAqB,KAAK,GAAG;AACzC,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACjC,MAAE,MAAM,IAAI,SAAY,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,MAAM,IAAI,SAAS,SAAY,IAAI,IAAI,CAAC,CAAC;AAAA,EACjG;AACA;AAIO,SAAS,SAAS,OAAO;AAC5B,SAAO,MAAM,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;AAClC;AAIO,SAAS,gBAAgB,OAAO;AACnC,MAAI,KAAK;AACT,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,QAAI,CAAC,CAAC,MAAM,CAAC,GAAG;AACZ,YAAM,EAAE,IAAI,MAAM,CAAC;AACnB,YAAM;AAAA,IAClB;AAAA,EACA;AACI,QAAM,SAAS;AACnB;AAIO,SAAS,eAAe,KAAK;AAChC,SAAO,CAAC,MAAM,QAAQ,GAAG,KAAK,IAAI,WAAW;AACjD;AACO,SAAS,gBAAgB,KAAK;AACjC,SAAO,MAAM,QAAQ,GAAG,KAAK,IAAI,SAAS;AAC9C;AAKO,SAAS,SAAS,OAAO,QAAQ,WAAS,OAAO;AACpD,QAAM,OAAO,oBAAI,IAAK;AACtB,SAAO,MAAM,OAAO,aAAW;AAC3B,UAAM,MAAM,MAAM,OAAO;AACzB,QAAI,KAAK,IAAI,GAAG,GAAG;AACf,aAAO;AAAA,IACnB;AACQ,SAAK,IAAI,GAAG;AACZ,WAAO;AAAA,EACf,CAAK;AACL;AACO,SAAS,eAAe,OAAO,eAAe;AACjD,SAAO,MAAM,SAAS,IAAI,MAAM,CAAC,IAAI;AACzC;AACO,SAAS,MAAM,KAAK,IAAI;AAC3B,MAAI,OAAO,OAAO,OAAO,WAAW,MAAM;AAC1C,MAAI,OAAO,OAAO,UAAU;AACxB,WAAO;AAAA,EACf,OACS;AACD,WAAO;AACP,SAAK;AAAA,EACb;AACI,QAAM,SAAS,CAAE;AACjB,MAAI,QAAQ,IAAI;AACZ,aAAS,IAAI,MAAM,IAAI,IAAI,KAAK;AAC5B,aAAO,KAAK,CAAC;AAAA,IACzB;AAAA,EACA,OACS;AACD,aAAS,IAAI,MAAM,IAAI,IAAI,KAAK;AAC5B,aAAO,KAAK,CAAC;AAAA,IACzB;AAAA,EACA;AACI,SAAO;AACX;AAKO,SAAS,YAAY,QAAQ,aAAa,WAAW;AACxD,QAAM,SAAS,OAAO,MAAM,GAAG,WAAW;AAC1C,QAAM,QAAQ,OAAO,MAAM,WAAW;AACtC,SAAO,OAAO,OAAO,WAAW,KAAK;AACzC;AAIO,SAAS,YAAY,KAAK,OAAO;AACpC,QAAM,QAAQ,IAAI,QAAQ,KAAK;AAC/B,MAAI,QAAQ,IAAI;AACZ,QAAI,OAAO,OAAO,CAAC;AACnB,QAAI,QAAQ,KAAK;AAAA,EACzB;AACA;AAIO,SAAS,UAAU,KAAK,OAAO;AAClC,QAAM,QAAQ,IAAI,QAAQ,KAAK;AAC/B,MAAI,QAAQ,IAAI;AACZ,QAAI,OAAO,OAAO,CAAC;AACnB,QAAI,KAAK,KAAK;AAAA,EACtB;AACA;AACO,SAAS,SAAS,KAAK,OAAO;AACjC,aAAW,QAAQ,OAAO;AACtB,QAAI,KAAK,IAAI;AAAA,EACrB;AACA;AAUO,SAAS,WAAW,OAAO,OAAO,UAAU;AAC/C,QAAM,WAAW,oBAAoB,OAAO,KAAK;AACjD,QAAM,iBAAiB,MAAM;AAC7B,QAAM,iBAAiB,SAAS;AAChC,QAAM,SAAS,iBAAiB;AAEhC,WAAS,IAAI,iBAAiB,GAAG,KAAK,UAAU,KAAK;AACjD,UAAM,IAAI,cAAc,IAAI,MAAM,CAAC;AAAA,EAC3C;AACI,WAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACrC,UAAM,IAAI,QAAQ,IAAI,SAAS,CAAC;AAAA,EACxC;AACA;AASO,SAAS,OAAO,OAAO,OAAO,aAAa,UAAU;AACxD,QAAM,QAAQ,oBAAoB,OAAO,KAAK;AAC9C,MAAI,SAAS,MAAM,OAAO,OAAO,WAAW;AAC5C,MAAI,WAAW,QAAW;AAEtB,aAAS,CAAE;AAAA,EACnB;AACI,aAAW,OAAO,OAAO,QAAQ;AACjC,SAAO;AACX;AAQA,SAAS,oBAAoB,OAAO,OAAO;AACvC,SAAO,QAAQ,IAAI,KAAK,IAAI,QAAQ,MAAM,QAAQ,CAAC,IAAI,KAAK,IAAI,OAAO,MAAM,MAAM;AACvF;AACU,IAAC;AAAA,CACV,SAAUA,gBAAe;AACtB,WAAS,WAAW,QAAQ;AACxB,WAAO,SAAS;AAAA,EACxB;AACI,EAAAA,eAAc,aAAa;AAC3B,WAAS,kBAAkB,QAAQ;AAC/B,WAAO,UAAU;AAAA,EACzB;AACI,EAAAA,eAAc,oBAAoB;AAClC,WAAS,cAAc,QAAQ;AAC3B,WAAO,SAAS;AAAA,EACxB;AACI,EAAAA,eAAc,gBAAgB;AAC9B,WAAS,2BAA2B,QAAQ;AACxC,WAAO,WAAW;AAAA,EAC1B;AACI,EAAAA,eAAc,6BAA6B;AAC3C,EAAAA,eAAc,cAAc;AAC5B,EAAAA,eAAc,WAAW;AACzB,EAAAA,eAAc,2BAA2B;AAC7C,GAAG,kBAAkB,gBAAgB,CAAA,EAAG;AACjC,SAAS,UAAU,UAAU,YAAY;AAC5C,SAAO,CAAC,GAAG,MAAM,WAAW,SAAS,CAAC,GAAG,SAAS,CAAC,CAAC;AACxD;AACO,SAAS,uBAAuB,aAAa;AAChD,SAAO,CAAC,OAAO,UAAU;AACrB,eAAW,cAAc,aAAa;AAClC,YAAM,SAAS,WAAW,OAAO,KAAK;AACtC,UAAI,CAAC,cAAc,2BAA2B,MAAM,GAAG;AACnD,eAAO;AAAA,MACvB;AAAA,IACA;AACQ,WAAO,cAAc;AAAA,EACxB;AACL;AAIY,MAAC,mBAAmB,CAAC,GAAG,MAAM,IAAI;AAClC,MAAC,oBAAoB,CAAC,GAAG,MAAM,iBAAiB,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC;AACzE,SAAS,aAAa,YAAY;AACrC,SAAO,CAAC,GAAG,MAAM,CAAC,WAAW,GAAG,CAAC;AACrC;AACO,MAAM,WAAW;AAAA;AAAA;AAAA;AAAA,EAIpB,YAAY,OAAO;AACf,SAAK,QAAQ;AACb,SAAK,WAAW;AAChB,SAAK,UAAU,KAAK,MAAM,SAAS;AAAA,EAC3C;AAAA,EACI,IAAI,SAAS;AACT,WAAO,KAAK,UAAU,KAAK,WAAW;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA,EAKI,UAAU,WAAW;AAGjB,QAAI,WAAW,KAAK;AACpB,WAAO,WAAW,KAAK,MAAM,UAAU,UAAU,KAAK,MAAM,QAAQ,CAAC,GAAG;AACpE;AAAA,IACZ;AACQ,UAAM,SAAS,aAAa,KAAK,WAAW,OAAO,KAAK,MAAM,MAAM,KAAK,UAAU,QAAQ;AAC3F,SAAK,WAAW;AAChB,WAAO;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMI,iBAAiB,WAAW;AAGxB,QAAI,SAAS,KAAK;AAClB,WAAO,UAAU,KAAK,UAAU,KAAK,MAAM,MAAM,CAAC,GAAG;AACjD;AAAA,IACZ;AACQ,UAAM,SAAS,WAAW,KAAK,UAAU,OAAO,KAAK,MAAM,MAAM,SAAS,GAAG,KAAK,UAAU,CAAC;AAC7F,SAAK,UAAU;AACf,WAAO;AAAA,EACf;AAAA,EACI,OAAO;AACH,QAAI,KAAK,WAAW,GAAG;AACnB,aAAO;AAAA,IACnB;AACQ,WAAO,KAAK,MAAM,KAAK,QAAQ;AAAA,EACvC;AAAA,EACI,UAAU;AACN,UAAM,SAAS,KAAK,MAAM,KAAK,QAAQ;AACvC,SAAK;AACL,WAAO;AAAA,EACf;AAAA,EACI,UAAU,OAAO;AACb,UAAM,SAAS,KAAK,MAAM,MAAM,KAAK,UAAU,KAAK,WAAW,KAAK;AACpE,SAAK,YAAY;AACjB,WAAO;AAAA,EACf;AACA;AAIO,MAAM,oBAAN,MAAM,kBAAiB;AAAA,EAE1B,YAKA,SAAS;AACL,SAAK,UAAU;AAAA,EACvB;AAAA,EACI,UAAU;AACN,UAAM,SAAS,CAAE;AACjB,SAAK,QAAQ,UAAQ;AAAE,aAAO,KAAK,IAAI;AAAG,aAAO;AAAA,KAAO;AACxD,WAAO;AAAA,EACf;AAAA,EACI,OAAO,WAAW;AACd,WAAO,IAAI,kBAAiB,QAAM,KAAK,QAAQ,UAAQ,UAAU,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC;AAAA,EACjG;AAAA,EACI,IAAI,OAAO;AACP,WAAO,IAAI,kBAAiB,QAAM,KAAK,QAAQ,UAAQ,GAAG,MAAM,IAAI,CAAC,CAAC,CAAC;AAAA,EAC/E;AAAA,EACI,SAAS,WAAW;AAChB,QAAI;AACJ,SAAK,QAAQ,UAAQ;AACjB,UAAI,UAAU,IAAI,GAAG;AACjB,iBAAS;AAAA,MACzB;AACY,aAAO;AAAA,IACnB,CAAS;AACD,WAAO;AAAA,EACf;AAAA,EACI,cAAc,YAAY;AACtB,QAAI;AACJ,QAAI,QAAQ;AACZ,SAAK,QAAQ,UAAQ;AACjB,UAAI,SAAS,cAAc,cAAc,WAAW,MAAM,MAAM,CAAC,GAAG;AAChE,gBAAQ;AACR,iBAAS;AAAA,MACzB;AACY,aAAO;AAAA,IACnB,CAAS;AACD,WAAO;AAAA,EACf;AACA;AA1Ca,kBAAK,QAAQ,IAAI,kBAAiB,eAAa;AAAG,CAAA;AADxD,IAAM,mBAAN;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/arraysFind.es.js

@@ -117,15 +117,6 @@ function findMaxIdx(array, comparator) {
   }
   return maxIdx;
 }
-function mapFindFirst(items, mapFn) {
-  for (const value of items) {
-    const mapped = mapFn(value);
-    if (mapped !== void 0) {
-      return mapped;
-    }
-  }
-  return void 0;
-}
 export {
   MonotonousArray,
   findFirstIdxMonotonousOrArrLen,
@@ -137,7 +128,6 @@ export {
   findLastIdxMonotonous,
   findLastMax,
   findLastMonotonous,
-  findMaxIdx,
-  mapFindFirst
+  findMaxIdx
 };
 //# sourceMappingURL=arraysFind.es.js.map

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/arraysFind.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"arraysFind.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/arraysFind.js"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\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) {\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    static { this.assertInvariants = false; }\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}\n/**\n * Returns the first item that is equal to or greater than every other item.\n*/\nexport function findFirstMax(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 findLastMax(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 findFirstMin(array, comparator) {\n    return findFirstMax(array, (a, b) => -comparator(a, b));\n}\nexport function findMaxIdx(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"],"names":[],"mappings":"AAIO,SAAS,SAAS,OAAO,WAAW;AACvC,QAAM,MAAM,YAAY,OAAO,SAAS;AACxC,MAAI,QAAQ,IAAI;AACZ,WAAO;AAAA,EACf;AACI,SAAO,MAAM,GAAG;AACpB;AACO,SAAS,YAAY,OAAO,WAAW,YAAY,MAAM,SAAS,GAAG;AACxE,WAAS,IAAI,WAAW,KAAK,GAAG,KAAK;AACjC,UAAM,UAAU,MAAM,CAAC;AACvB,QAAI,UAAU,OAAO,GAAG;AACpB,aAAO;AAAA,IACnB;AAAA,EACA;AACI,SAAO;AACX;AAOO,SAAS,mBAAmB,OAAO,WAAW;AACjD,QAAM,MAAM,sBAAsB,OAAO,SAAS;AAClD,SAAO,QAAQ,KAAK,SAAY,MAAM,GAAG;AAC7C;AAOO,SAAS,sBAAsB,OAAO,WAAW,WAAW,GAAG,WAAW,MAAM,QAAQ;AAC3F,MAAI,IAAI;AACR,MAAI,IAAI;AACR,SAAO,IAAI,GAAG;AACV,UAAM,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC;AAChC,QAAI,UAAU,MAAM,CAAC,CAAC,GAAG;AACrB,UAAI,IAAI;AAAA,IACpB,OACa;AACD,UAAI;AAAA,IAChB;AAAA,EACA;AACI,SAAO,IAAI;AACf;AAOO,SAAS,oBAAoB,OAAO,WAAW;AAClD,QAAM,MAAM,+BAA+B,OAAO,SAAS;AAC3D,SAAO,QAAQ,MAAM,SAAS,SAAY,MAAM,GAAG;AACvD;AAOO,SAAS,+BAA+B,OAAO,WAAW,WAAW,GAAG,WAAW,MAAM,QAAQ;AACpG,MAAI,IAAI;AACR,MAAI,IAAI;AACR,SAAO,IAAI,GAAG;AACV,UAAM,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC;AAChC,QAAI,UAAU,MAAM,CAAC,CAAC,GAAG;AACrB,UAAI;AAAA,IAChB,OACa;AACD,UAAI,IAAI;AAAA,IACpB;AAAA,EACA;AACI,SAAO;AACX;AAOO,MAAM,mBAAN,MAAM,iBAAgB;AAAA,EAEzB,YAAY,QAAQ;AAChB,SAAK,SAAS;AACd,SAAK,6BAA6B;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA,EAKI,mBAAmB,WAAW;AAC1B,QAAI,iBAAgB,kBAAkB;AAClC,UAAI,KAAK,wBAAwB;AAC7B,mBAAW,QAAQ,KAAK,QAAQ;AAC5B,cAAI,KAAK,uBAAuB,IAAI,KAAK,CAAC,UAAU,IAAI,GAAG;AACvD,kBAAM,IAAI,MAAM,8FAA8F;AAAA,UACtI;AAAA,QACA;AAAA,MACA;AACY,WAAK,yBAAyB;AAAA,IAC1C;AACQ,UAAM,MAAM,sBAAsB,KAAK,QAAQ,WAAW,KAAK,0BAA0B;AACzF,SAAK,6BAA6B,MAAM;AACxC,WAAO,QAAQ,KAAK,SAAY,KAAK,OAAO,GAAG;AAAA,EACvD;AACA;AAxBa,iBAAK,mBAAmB;AAD9B,IAAM,kBAAN;AA6BA,SAAS,aAAa,OAAO,YAAY;AAC5C,MAAI,MAAM,WAAW,GAAG;AACpB,WAAO;AAAA,EACf;AACI,MAAI,MAAM,MAAM,CAAC;AACjB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,UAAM,OAAO,MAAM,CAAC;AACpB,QAAI,WAAW,MAAM,GAAG,IAAI,GAAG;AAC3B,YAAM;AAAA,IAClB;AAAA,EACA;AACI,SAAO;AACX;AAIO,SAAS,YAAY,OAAO,YAAY;AAC3C,MAAI,MAAM,WAAW,GAAG;AACpB,WAAO;AAAA,EACf;AACI,MAAI,MAAM,MAAM,CAAC;AACjB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,UAAM,OAAO,MAAM,CAAC;AACpB,QAAI,WAAW,MAAM,GAAG,KAAK,GAAG;AAC5B,YAAM;AAAA,IAClB;AAAA,EACA;AACI,SAAO;AACX;AAIO,SAAS,aAAa,OAAO,YAAY;AAC5C,SAAO,aAAa,OAAO,CAAC,GAAG,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC;AAC1D;AACO,SAAS,WAAW,OAAO,YAAY;AAC1C,MAAI,MAAM,WAAW,GAAG;AACpB,WAAO;AAAA,EACf;AACI,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,UAAM,OAAO,MAAM,CAAC;AACpB,QAAI,WAAW,MAAM,MAAM,MAAM,CAAC,IAAI,GAAG;AACrC,eAAS;AAAA,IACrB;AAAA,EACA;AACI,SAAO;AACX;AAIO,SAAS,aAAa,OAAO,OAAO;AACvC,aAAW,SAAS,OAAO;AACvB,UAAM,SAAS,MAAM,KAAK;AAC1B,QAAI,WAAW,QAAW;AACtB,aAAO;AAAA,IACnB;AAAA,EACA;AACI,SAAO;AACX;","x_google_ignoreList":[0]}
+{"version":3,"file":"arraysFind.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/arraysFind.js"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\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) {\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    static { this.assertInvariants = false; }\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}\n/**\n * Returns the first item that is equal to or greater than every other item.\n*/\nexport function findFirstMax(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 findLastMax(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 findFirstMin(array, comparator) {\n    return findFirstMax(array, (a, b) => -comparator(a, b));\n}\nexport function findMaxIdx(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"],"names":[],"mappings":"AAIO,SAAS,SAAS,OAAO,WAAW;AACvC,QAAM,MAAM,YAAY,OAAO,SAAS;AACxC,MAAI,QAAQ,IAAI;AACZ,WAAO;AAAA,EACf;AACI,SAAO,MAAM,GAAG;AACpB;AACO,SAAS,YAAY,OAAO,WAAW,YAAY,MAAM,SAAS,GAAG;AACxE,WAAS,IAAI,WAAW,KAAK,GAAG,KAAK;AACjC,UAAM,UAAU,MAAM,CAAC;AACvB,QAAI,UAAU,OAAO,GAAG;AACpB,aAAO;AAAA,IACnB;AAAA,EACA;AACI,SAAO;AACX;AAOO,SAAS,mBAAmB,OAAO,WAAW;AACjD,QAAM,MAAM,sBAAsB,OAAO,SAAS;AAClD,SAAO,QAAQ,KAAK,SAAY,MAAM,GAAG;AAC7C;AAOO,SAAS,sBAAsB,OAAO,WAAW,WAAW,GAAG,WAAW,MAAM,QAAQ;AAC3F,MAAI,IAAI;AACR,MAAI,IAAI;AACR,SAAO,IAAI,GAAG;AACV,UAAM,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC;AAChC,QAAI,UAAU,MAAM,CAAC,CAAC,GAAG;AACrB,UAAI,IAAI;AAAA,IACpB,OACa;AACD,UAAI;AAAA,IAChB;AAAA,EACA;AACI,SAAO,IAAI;AACf;AAOO,SAAS,oBAAoB,OAAO,WAAW;AAClD,QAAM,MAAM,+BAA+B,OAAO,SAAS;AAC3D,SAAO,QAAQ,MAAM,SAAS,SAAY,MAAM,GAAG;AACvD;AAOO,SAAS,+BAA+B,OAAO,WAAW,WAAW,GAAG,WAAW,MAAM,QAAQ;AACpG,MAAI,IAAI;AACR,MAAI,IAAI;AACR,SAAO,IAAI,GAAG;AACV,UAAM,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC;AAChC,QAAI,UAAU,MAAM,CAAC,CAAC,GAAG;AACrB,UAAI;AAAA,IAChB,OACa;AACD,UAAI,IAAI;AAAA,IACpB;AAAA,EACA;AACI,SAAO;AACX;AAOO,MAAM,mBAAN,MAAM,iBAAgB;AAAA,EAEzB,YAAY,QAAQ;AAChB,SAAK,SAAS;AACd,SAAK,6BAA6B;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA,EAKI,mBAAmB,WAAW;AAC1B,QAAI,iBAAgB,kBAAkB;AAClC,UAAI,KAAK,wBAAwB;AAC7B,mBAAW,QAAQ,KAAK,QAAQ;AAC5B,cAAI,KAAK,uBAAuB,IAAI,KAAK,CAAC,UAAU,IAAI,GAAG;AACvD,kBAAM,IAAI,MAAM,8FAA8F;AAAA,UACtI;AAAA,QACA;AAAA,MACA;AACY,WAAK,yBAAyB;AAAA,IAC1C;AACQ,UAAM,MAAM,sBAAsB,KAAK,QAAQ,WAAW,KAAK,0BAA0B;AACzF,SAAK,6BAA6B,MAAM;AACxC,WAAO,QAAQ,KAAK,SAAY,KAAK,OAAO,GAAG;AAAA,EACvD;AACA;AAxBa,iBAAK,mBAAmB;AAD9B,IAAM,kBAAN;AA6BA,SAAS,aAAa,OAAO,YAAY;AAC5C,MAAI,MAAM,WAAW,GAAG;AACpB,WAAO;AAAA,EACf;AACI,MAAI,MAAM,MAAM,CAAC;AACjB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,UAAM,OAAO,MAAM,CAAC;AACpB,QAAI,WAAW,MAAM,GAAG,IAAI,GAAG;AAC3B,YAAM;AAAA,IAClB;AAAA,EACA;AACI,SAAO;AACX;AAIO,SAAS,YAAY,OAAO,YAAY;AAC3C,MAAI,MAAM,WAAW,GAAG;AACpB,WAAO;AAAA,EACf;AACI,MAAI,MAAM,MAAM,CAAC;AACjB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,UAAM,OAAO,MAAM,CAAC;AACpB,QAAI,WAAW,MAAM,GAAG,KAAK,GAAG;AAC5B,YAAM;AAAA,IAClB;AAAA,EACA;AACI,SAAO;AACX;AAIO,SAAS,aAAa,OAAO,YAAY;AAC5C,SAAO,aAAa,OAAO,CAAC,GAAG,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC;AAC1D;AACO,SAAS,WAAW,OAAO,YAAY;AAC1C,MAAI,MAAM,WAAW,GAAG;AACpB,WAAO;AAAA,EACf;AACI,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,UAAM,OAAO,MAAM,CAAC;AACpB,QAAI,WAAW,MAAM,MAAM,MAAM,CAAC,IAAI,GAAG;AACrC,eAAS;AAAA,IACrB;AAAA,EACA;AACI,SAAO;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/async.es.js

@@ -41,15 +41,6 @@ function createCancelablePromise(callback) {
     }
   }();
 }
-function raceCancellation(promise, token, defaultValue) {
-  return new Promise((resolve, reject) => {
-    const ref = token.onCancellationRequested(() => {
-      ref.dispose();
-      resolve(defaultValue);
-    });
-    promise.then(resolve, reject).finally(() => ref.dispose());
-  });
-}
 class Throttler {
   constructor() {
     this.isDisposed = false;
@@ -227,24 +218,6 @@ function disposableTimeout(handler, timeout2 = 0, store) {
   store == null ? void 0 : store.add(disposable);
   return disposable;
 }
-function first(promiseFactories, shouldStop = (t) => !!t, defaultValue = null) {
-  let index = 0;
-  const len = promiseFactories.length;
-  const loop = () => {
-    if (index >= len) {
-      return Promise.resolve(defaultValue);
-    }
-    const factory = promiseFactories[index++];
-    const promise = Promise.resolve(factory());
-    return promise.then((result) => {
-      if (shouldStop(result)) {
-        return Promise.resolve(result);
-      }
-      return loop();
-    });
-  };
-  return loop();
-}
 class TimeoutTimer {
   constructor(runner, timeout2) {
     this._isDisposed = false;
@@ -672,44 +645,9 @@ const _AsyncIterableObject = class _AsyncIterableObject {
 };
 _AsyncIterableObject.EMPTY = _AsyncIterableObject.fromArray([]);
 let AsyncIterableObject = _AsyncIterableObject;
-class CancelableAsyncIterableObject extends AsyncIterableObject {
-  constructor(_source, executor) {
-    super(executor);
-    this._source = _source;
-  }
-  cancel() {
-    this._source.cancel();
-  }
-}
-function createCancelableAsyncIterable(callback) {
-  const source = new CancellationTokenSource();
-  const innerIterable = callback(source.token);
-  return new CancelableAsyncIterableObject(source, async (emitter) => {
-    const subscription = source.token.onCancellationRequested(() => {
-      subscription.dispose();
-      source.dispose();
-      emitter.reject(new CancellationError());
-    });
-    try {
-      for await (const item of innerIterable) {
-        if (source.token.isCancellationRequested) {
-          return;
-        }
-        emitter.emitOne(item);
-      }
-      subscription.dispose();
-      source.dispose();
-    } catch (err) {
-      subscription.dispose();
-      source.dispose();
-      emitter.reject(err);
-    }
-  });
-}
 export {
   AbstractIdleValue,
   AsyncIterableObject,
-  CancelableAsyncIterableObject,
   DeferredPromise,
   Delayer,
   GlobalIdleValue,
@@ -720,12 +658,9 @@ export {
   Throttler,
   TimeoutTimer,
   _runWhenIdle,
-  createCancelableAsyncIterable,
   createCancelablePromise,
   disposableTimeout,
-  first,
   isThenable,
-  raceCancellation,
   runWhenGlobalIdle,
   timeout
 };

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/async.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"async.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/async.js"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\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 './cancellation.js';\nimport { BugIndicatingError, CancellationError } from './errors.js';\nimport { Emitter, Event } from './event.js';\nimport { toDisposable } from './lifecycle.js';\nimport { setTimeout0 } from './platform.js';\nimport { MicrotaskDelay } from './symbols.js';\nexport function isThenable(obj) {\n    return !!obj && typeof obj.then === 'function';\n}\nexport function createCancelablePromise(callback) {\n    const source = new CancellationTokenSource();\n    const thenable = callback(source.token);\n    const promise = new Promise((resolve, reject) => {\n        const subscription = source.token.onCancellationRequested(() => {\n            subscription.dispose();\n            reject(new CancellationError());\n        });\n        Promise.resolve(thenable).then(value => {\n            subscription.dispose();\n            source.dispose();\n            resolve(value);\n        }, err => {\n            subscription.dispose();\n            source.dispose();\n            reject(err);\n        });\n    });\n    return new class {\n        cancel() {\n            source.cancel();\n            source.dispose();\n        }\n        then(resolve, reject) {\n            return promise.then(resolve, reject);\n        }\n        catch(reject) {\n            return this.then(undefined, reject);\n        }\n        finally(onfinally) {\n            return promise.finally(onfinally);\n        }\n    };\n}\nexport function raceCancellation(promise, token, defaultValue) {\n    return new Promise((resolve, reject) => {\n        const ref = token.onCancellationRequested(() => {\n            ref.dispose();\n            resolve(defaultValue);\n        });\n        promise.then(resolve, reject).finally(() => ref.dispose());\n    });\n}\n/**\n * A helper to prevent accumulation of sequential async tasks.\n *\n * Imagine a mail man with the sole task of delivering letters. As soon as\n * a letter submitted for delivery, he drives to the destination, delivers it\n * and returns to his base. Imagine that during the trip, N more letters were submitted.\n * When the mail man returns, he picks those N letters and delivers them all in a\n * single trip. Even though N+1 submissions occurred, only 2 deliveries were made.\n *\n * The throttler implements this via the queue() method, by providing it a task\n * factory. Following the example:\n *\n * \t\tconst throttler = new Throttler();\n * \t\tconst letters = [];\n *\n * \t\tfunction deliver() {\n * \t\t\tconst lettersToDeliver = letters;\n * \t\t\tletters = [];\n * \t\t\treturn makeTheTrip(lettersToDeliver);\n * \t\t}\n *\n * \t\tfunction onLetterReceived(l) {\n * \t\t\tletters.push(l);\n * \t\t\tthrottler.queue(deliver);\n * \t\t}\n */\nexport class Throttler {\n    constructor() {\n        this.isDisposed = false;\n        this.activePromise = null;\n        this.queuedPromise = null;\n        this.queuedPromiseFactory = null;\n    }\n    queue(promiseFactory) {\n        if (this.isDisposed) {\n            return Promise.reject(new Error('Throttler is disposed'));\n        }\n        if (this.activePromise) {\n            this.queuedPromiseFactory = promiseFactory;\n            if (!this.queuedPromise) {\n                const onComplete = () => {\n                    this.queuedPromise = null;\n                    if (this.isDisposed) {\n                        return;\n                    }\n                    const result = this.queue(this.queuedPromiseFactory);\n                    this.queuedPromiseFactory = null;\n                    return result;\n                };\n                this.queuedPromise = new Promise(resolve => {\n                    this.activePromise.then(onComplete, onComplete).then(resolve);\n                });\n            }\n            return new Promise((resolve, reject) => {\n                this.queuedPromise.then(resolve, reject);\n            });\n        }\n        this.activePromise = promiseFactory();\n        return new Promise((resolve, reject) => {\n            this.activePromise.then((result) => {\n                this.activePromise = null;\n                resolve(result);\n            }, (err) => {\n                this.activePromise = null;\n                reject(err);\n            });\n        });\n    }\n    dispose() {\n        this.isDisposed = true;\n    }\n}\nconst timeoutDeferred = (timeout, fn) => {\n    let scheduled = true;\n    const handle = setTimeout(() => {\n        scheduled = false;\n        fn();\n    }, timeout);\n    return {\n        isTriggered: () => scheduled,\n        dispose: () => {\n            clearTimeout(handle);\n            scheduled = false;\n        },\n    };\n};\nconst microtaskDeferred = (fn) => {\n    let scheduled = true;\n    queueMicrotask(() => {\n        if (scheduled) {\n            scheduled = false;\n            fn();\n        }\n    });\n    return {\n        isTriggered: () => scheduled,\n        dispose: () => { scheduled = false; },\n    };\n};\n/**\n * A helper to delay (debounce) execution of a task that is being requested often.\n *\n * Following the throttler, now imagine the mail man wants to optimize the number of\n * trips proactively. The trip itself can be long, so he decides not to make the trip\n * as soon as a letter is submitted. Instead he waits a while, in case more\n * letters are submitted. After said waiting period, if no letters were submitted, he\n * decides to make the trip. Imagine that N more letters were submitted after the first\n * one, all within a short period of time between each other. Even though N+1\n * submissions occurred, only 1 delivery was made.\n *\n * The delayer offers this behavior via the trigger() method, into which both the task\n * to be executed and the waiting period (delay) must be passed in as arguments. Following\n * the example:\n *\n * \t\tconst delayer = new Delayer(WAITING_PERIOD);\n * \t\tconst letters = [];\n *\n * \t\tfunction letterReceived(l) {\n * \t\t\tletters.push(l);\n * \t\t\tdelayer.trigger(() => { return makeTheTrip(); });\n * \t\t}\n */\nexport class Delayer {\n    constructor(defaultDelay) {\n        this.defaultDelay = defaultDelay;\n        this.deferred = null;\n        this.completionPromise = null;\n        this.doResolve = null;\n        this.doReject = null;\n        this.task = null;\n    }\n    trigger(task, delay = this.defaultDelay) {\n        this.task = task;\n        this.cancelTimeout();\n        if (!this.completionPromise) {\n            this.completionPromise = new Promise((resolve, reject) => {\n                this.doResolve = resolve;\n                this.doReject = reject;\n            }).then(() => {\n                this.completionPromise = null;\n                this.doResolve = null;\n                if (this.task) {\n                    const task = this.task;\n                    this.task = null;\n                    return task();\n                }\n                return undefined;\n            });\n        }\n        const fn = () => {\n            this.deferred = null;\n            this.doResolve?.(null);\n        };\n        this.deferred = delay === MicrotaskDelay ? microtaskDeferred(fn) : timeoutDeferred(delay, fn);\n        return this.completionPromise;\n    }\n    isTriggered() {\n        return !!this.deferred?.isTriggered();\n    }\n    cancel() {\n        this.cancelTimeout();\n        if (this.completionPromise) {\n            this.doReject?.(new CancellationError());\n            this.completionPromise = null;\n        }\n    }\n    cancelTimeout() {\n        this.deferred?.dispose();\n        this.deferred = null;\n    }\n    dispose() {\n        this.cancel();\n    }\n}\n/**\n * A helper to delay execution of a task that is being requested often, while\n * preventing accumulation of consecutive executions, while the task runs.\n *\n * The mail man is clever and waits for a certain amount of time, before going\n * out to deliver letters. While the mail man is going out, more letters arrive\n * and can only be delivered once he is back. Once he is back the mail man will\n * do one more trip to deliver the letters that have accumulated while he was out.\n */\nexport class ThrottledDelayer {\n    constructor(defaultDelay) {\n        this.delayer = new Delayer(defaultDelay);\n        this.throttler = new Throttler();\n    }\n    trigger(promiseFactory, delay) {\n        return this.delayer.trigger(() => this.throttler.queue(promiseFactory), delay);\n    }\n    cancel() {\n        this.delayer.cancel();\n    }\n    dispose() {\n        this.delayer.dispose();\n        this.throttler.dispose();\n    }\n}\nexport function timeout(millis, token) {\n    if (!token) {\n        return createCancelablePromise(token => timeout(millis, token));\n    }\n    return new Promise((resolve, reject) => {\n        const handle = setTimeout(() => {\n            disposable.dispose();\n            resolve();\n        }, millis);\n        const disposable = token.onCancellationRequested(() => {\n            clearTimeout(handle);\n            disposable.dispose();\n            reject(new CancellationError());\n        });\n    });\n}\n/**\n * Creates a timeout that can be disposed using its returned value.\n * @param handler The timeout handler.\n * @param timeout An optional timeout in milliseconds.\n * @param store An optional {@link DisposableStore} that will have the timeout disposable managed automatically.\n *\n * @example\n * const store = new DisposableStore;\n * // Call the timeout after 1000ms at which point it will be automatically\n * // evicted from the store.\n * const timeoutDisposable = disposableTimeout(() => {}, 1000, store);\n *\n * if (foo) {\n *   // Cancel the timeout and evict it from store.\n *   timeoutDisposable.dispose();\n * }\n */\nexport function disposableTimeout(handler, timeout = 0, store) {\n    const timer = setTimeout(() => {\n        handler();\n        if (store) {\n            disposable.dispose();\n        }\n    }, timeout);\n    const disposable = toDisposable(() => {\n        clearTimeout(timer);\n        store?.deleteAndLeak(disposable);\n    });\n    store?.add(disposable);\n    return disposable;\n}\nexport function first(promiseFactories, shouldStop = t => !!t, defaultValue = null) {\n    let index = 0;\n    const len = promiseFactories.length;\n    const loop = () => {\n        if (index >= len) {\n            return Promise.resolve(defaultValue);\n        }\n        const factory = promiseFactories[index++];\n        const promise = Promise.resolve(factory());\n        return promise.then(result => {\n            if (shouldStop(result)) {\n                return Promise.resolve(result);\n            }\n            return loop();\n        });\n    };\n    return loop();\n}\nexport class TimeoutTimer {\n    constructor(runner, timeout) {\n        this._isDisposed = false;\n        this._token = -1;\n        if (typeof runner === 'function' && typeof timeout === 'number') {\n            this.setIfNotSet(runner, timeout);\n        }\n    }\n    dispose() {\n        this.cancel();\n        this._isDisposed = true;\n    }\n    cancel() {\n        if (this._token !== -1) {\n            clearTimeout(this._token);\n            this._token = -1;\n        }\n    }\n    cancelAndSet(runner, timeout) {\n        if (this._isDisposed) {\n            throw new BugIndicatingError(`Calling 'cancelAndSet' on a disposed TimeoutTimer`);\n        }\n        this.cancel();\n        this._token = setTimeout(() => {\n            this._token = -1;\n            runner();\n        }, timeout);\n    }\n    setIfNotSet(runner, timeout) {\n        if (this._isDisposed) {\n            throw new BugIndicatingError(`Calling 'setIfNotSet' on a disposed TimeoutTimer`);\n        }\n        if (this._token !== -1) {\n            // timer is already set\n            return;\n        }\n        this._token = setTimeout(() => {\n            this._token = -1;\n            runner();\n        }, timeout);\n    }\n}\nexport class IntervalTimer {\n    constructor() {\n        this.disposable = undefined;\n        this.isDisposed = false;\n    }\n    cancel() {\n        this.disposable?.dispose();\n        this.disposable = undefined;\n    }\n    cancelAndSet(runner, interval, context = globalThis) {\n        if (this.isDisposed) {\n            throw new BugIndicatingError(`Calling 'cancelAndSet' on a disposed IntervalTimer`);\n        }\n        this.cancel();\n        const handle = context.setInterval(() => {\n            runner();\n        }, interval);\n        this.disposable = toDisposable(() => {\n            context.clearInterval(handle);\n            this.disposable = undefined;\n        });\n    }\n    dispose() {\n        this.cancel();\n        this.isDisposed = true;\n    }\n}\nexport class RunOnceScheduler {\n    constructor(runner, delay) {\n        this.timeoutToken = -1;\n        this.runner = runner;\n        this.timeout = delay;\n        this.timeoutHandler = this.onTimeout.bind(this);\n    }\n    /**\n     * Dispose RunOnceScheduler\n     */\n    dispose() {\n        this.cancel();\n        this.runner = null;\n    }\n    /**\n     * Cancel current scheduled runner (if any).\n     */\n    cancel() {\n        if (this.isScheduled()) {\n            clearTimeout(this.timeoutToken);\n            this.timeoutToken = -1;\n        }\n    }\n    /**\n     * Cancel previous runner (if any) & schedule a new runner.\n     */\n    schedule(delay = this.timeout) {\n        this.cancel();\n        this.timeoutToken = setTimeout(this.timeoutHandler, delay);\n    }\n    get delay() {\n        return this.timeout;\n    }\n    set delay(value) {\n        this.timeout = value;\n    }\n    /**\n     * Returns true if scheduled.\n     */\n    isScheduled() {\n        return this.timeoutToken !== -1;\n    }\n    onTimeout() {\n        this.timeoutToken = -1;\n        if (this.runner) {\n            this.doRun();\n        }\n    }\n    doRun() {\n        this.runner?.();\n    }\n}\n/**\n * Execute the callback the next time the browser is idle, returning an\n * {@link IDisposable} that will cancel the callback when disposed. This wraps\n * [requestIdleCallback] so it will fallback to [setTimeout] if the environment\n * doesn't support it.\n *\n * @param callback The callback to run when idle, this includes an\n * [IdleDeadline] that provides the time alloted for the idle callback by the\n * browser. Not respecting this deadline will result in a degraded user\n * experience.\n * @param timeout A timeout at which point to queue no longer wait for an idle\n * callback but queue it on the regular event loop (like setTimeout). Typically\n * this should not be used.\n *\n * [IdleDeadline]: https://developer.mozilla.org/en-US/docs/Web/API/IdleDeadline\n * [requestIdleCallback]: https://developer.mozilla.org/en-US/docs/Web/API/Window/requestIdleCallback\n * [setTimeout]: https://developer.mozilla.org/en-US/docs/Web/API/Window/setTimeout\n *\n * **Note** that there is `dom.ts#runWhenWindowIdle` which is better suited when running inside a browser\n * context\n */\nexport let runWhenGlobalIdle;\nexport let _runWhenIdle;\n(function () {\n    if (typeof globalThis.requestIdleCallback !== 'function' || typeof globalThis.cancelIdleCallback !== 'function') {\n        _runWhenIdle = (_targetWindow, runner) => {\n            setTimeout0(() => {\n                if (disposed) {\n                    return;\n                }\n                const end = Date.now() + 15; // one frame at 64fps\n                const deadline = {\n                    didTimeout: true,\n                    timeRemaining() {\n                        return Math.max(0, end - Date.now());\n                    }\n                };\n                runner(Object.freeze(deadline));\n            });\n            let disposed = false;\n            return {\n                dispose() {\n                    if (disposed) {\n                        return;\n                    }\n                    disposed = true;\n                }\n            };\n        };\n    }\n    else {\n        _runWhenIdle = (targetWindow, runner, timeout) => {\n            const handle = targetWindow.requestIdleCallback(runner, typeof timeout === 'number' ? { timeout } : undefined);\n            let disposed = false;\n            return {\n                dispose() {\n                    if (disposed) {\n                        return;\n                    }\n                    disposed = true;\n                    targetWindow.cancelIdleCallback(handle);\n                }\n            };\n        };\n    }\n    runWhenGlobalIdle = (runner) => _runWhenIdle(globalThis, runner);\n})();\nexport class AbstractIdleValue {\n    constructor(targetWindow, executor) {\n        this._didRun = false;\n        this._executor = () => {\n            try {\n                this._value = executor();\n            }\n            catch (err) {\n                this._error = err;\n            }\n            finally {\n                this._didRun = true;\n            }\n        };\n        this._handle = _runWhenIdle(targetWindow, () => this._executor());\n    }\n    dispose() {\n        this._handle.dispose();\n    }\n    get value() {\n        if (!this._didRun) {\n            this._handle.dispose();\n            this._executor();\n        }\n        if (this._error) {\n            throw this._error;\n        }\n        return this._value;\n    }\n    get isInitialized() {\n        return this._didRun;\n    }\n}\n/**\n * An `IdleValue` that always uses the current window (which might be throttled or inactive)\n *\n * **Note** that there is `dom.ts#WindowIdleValue` which is better suited when running inside a browser\n * context\n */\nexport class GlobalIdleValue extends AbstractIdleValue {\n    constructor(executor) {\n        super(globalThis, executor);\n    }\n}\n/**\n * Creates a promise whose resolution or rejection can be controlled imperatively.\n */\nexport class DeferredPromise {\n    get isRejected() {\n        return this.outcome?.outcome === 1 /* DeferredOutcome.Rejected */;\n    }\n    get isSettled() {\n        return !!this.outcome;\n    }\n    constructor() {\n        this.p = new Promise((c, e) => {\n            this.completeCallback = c;\n            this.errorCallback = e;\n        });\n    }\n    complete(value) {\n        return new Promise(resolve => {\n            this.completeCallback(value);\n            this.outcome = { outcome: 0 /* DeferredOutcome.Resolved */, value };\n            resolve();\n        });\n    }\n    error(err) {\n        return new Promise(resolve => {\n            this.errorCallback(err);\n            this.outcome = { outcome: 1 /* DeferredOutcome.Rejected */, value: err };\n            resolve();\n        });\n    }\n    cancel() {\n        return this.error(new CancellationError());\n    }\n}\n//#endregion\n//#region Promises\nexport var Promises;\n(function (Promises) {\n    /**\n     * A drop-in replacement for `Promise.all` with the only difference\n     * that the method awaits every promise to either fulfill or reject.\n     *\n     * Similar to `Promise.all`, only the first error will be returned\n     * if any.\n     */\n    async function settled(promises) {\n        let firstError = undefined;\n        const result = await Promise.all(promises.map(promise => promise.then(value => value, error => {\n            if (!firstError) {\n                firstError = error;\n            }\n            return undefined; // do not rethrow so that other promises can settle\n        })));\n        if (typeof firstError !== 'undefined') {\n            throw firstError;\n        }\n        return result; // cast is needed and protected by the `throw` above\n    }\n    Promises.settled = settled;\n    /**\n     * A helper to create a new `Promise<T>` with a body that is a promise\n     * itself. By default, an error that raises from the async body will\n     * end up as a unhandled rejection, so this utility properly awaits the\n     * body and rejects the promise as a normal promise does without async\n     * body.\n     *\n     * This method should only be used in rare cases where otherwise `async`\n     * cannot be used (e.g. when callbacks are involved that require this).\n     */\n    function withAsyncBody(bodyFn) {\n        // eslint-disable-next-line no-async-promise-executor\n        return new Promise(async (resolve, reject) => {\n            try {\n                await bodyFn(resolve, reject);\n            }\n            catch (error) {\n                reject(error);\n            }\n        });\n    }\n    Promises.withAsyncBody = withAsyncBody;\n})(Promises || (Promises = {}));\n/**\n * A rich implementation for an `AsyncIterable<T>`.\n */\nexport class AsyncIterableObject {\n    static fromArray(items) {\n        return new AsyncIterableObject((writer) => {\n            writer.emitMany(items);\n        });\n    }\n    static fromPromise(promise) {\n        return new AsyncIterableObject(async (emitter) => {\n            emitter.emitMany(await promise);\n        });\n    }\n    static fromPromises(promises) {\n        return new AsyncIterableObject(async (emitter) => {\n            await Promise.all(promises.map(async (p) => emitter.emitOne(await p)));\n        });\n    }\n    static merge(iterables) {\n        return new AsyncIterableObject(async (emitter) => {\n            await Promise.all(iterables.map(async (iterable) => {\n                for await (const item of iterable) {\n                    emitter.emitOne(item);\n                }\n            }));\n        });\n    }\n    static { this.EMPTY = AsyncIterableObject.fromArray([]); }\n    constructor(executor, onReturn) {\n        this._state = 0 /* AsyncIterableSourceState.Initial */;\n        this._results = [];\n        this._error = null;\n        this._onReturn = onReturn;\n        this._onStateChanged = new Emitter();\n        queueMicrotask(async () => {\n            const writer = {\n                emitOne: (item) => this.emitOne(item),\n                emitMany: (items) => this.emitMany(items),\n                reject: (error) => this.reject(error)\n            };\n            try {\n                await Promise.resolve(executor(writer));\n                this.resolve();\n            }\n            catch (err) {\n                this.reject(err);\n            }\n            finally {\n                writer.emitOne = undefined;\n                writer.emitMany = undefined;\n                writer.reject = undefined;\n            }\n        });\n    }\n    [Symbol.asyncIterator]() {\n        let i = 0;\n        return {\n            next: async () => {\n                do {\n                    if (this._state === 2 /* AsyncIterableSourceState.DoneError */) {\n                        throw this._error;\n                    }\n                    if (i < this._results.length) {\n                        return { done: false, value: this._results[i++] };\n                    }\n                    if (this._state === 1 /* AsyncIterableSourceState.DoneOK */) {\n                        return { done: true, value: undefined };\n                    }\n                    await Event.toPromise(this._onStateChanged.event);\n                } while (true);\n            },\n            return: async () => {\n                this._onReturn?.();\n                return { done: true, value: undefined };\n            }\n        };\n    }\n    static map(iterable, mapFn) {\n        return new AsyncIterableObject(async (emitter) => {\n            for await (const item of iterable) {\n                emitter.emitOne(mapFn(item));\n            }\n        });\n    }\n    map(mapFn) {\n        return AsyncIterableObject.map(this, mapFn);\n    }\n    static filter(iterable, filterFn) {\n        return new AsyncIterableObject(async (emitter) => {\n            for await (const item of iterable) {\n                if (filterFn(item)) {\n                    emitter.emitOne(item);\n                }\n            }\n        });\n    }\n    filter(filterFn) {\n        return AsyncIterableObject.filter(this, filterFn);\n    }\n    static coalesce(iterable) {\n        return AsyncIterableObject.filter(iterable, item => !!item);\n    }\n    coalesce() {\n        return AsyncIterableObject.coalesce(this);\n    }\n    static async toPromise(iterable) {\n        const result = [];\n        for await (const item of iterable) {\n            result.push(item);\n        }\n        return result;\n    }\n    toPromise() {\n        return AsyncIterableObject.toPromise(this);\n    }\n    /**\n     * The value will be appended at the end.\n     *\n     * **NOTE** If `resolve()` or `reject()` have already been called, this method has no effect.\n     */\n    emitOne(value) {\n        if (this._state !== 0 /* AsyncIterableSourceState.Initial */) {\n            return;\n        }\n        // it is important to add new values at the end,\n        // as we may have iterators already running on the array\n        this._results.push(value);\n        this._onStateChanged.fire();\n    }\n    /**\n     * The values will be appended at the end.\n     *\n     * **NOTE** If `resolve()` or `reject()` have already been called, this method has no effect.\n     */\n    emitMany(values) {\n        if (this._state !== 0 /* AsyncIterableSourceState.Initial */) {\n            return;\n        }\n        // it is important to add new values at the end,\n        // as we may have iterators already running on the array\n        this._results = this._results.concat(values);\n        this._onStateChanged.fire();\n    }\n    /**\n     * Calling `resolve()` will mark the result array as complete.\n     *\n     * **NOTE** `resolve()` must be called, otherwise all consumers of this iterable will hang indefinitely, similar to a non-resolved promise.\n     * **NOTE** If `resolve()` or `reject()` have already been called, this method has no effect.\n     */\n    resolve() {\n        if (this._state !== 0 /* AsyncIterableSourceState.Initial */) {\n            return;\n        }\n        this._state = 1 /* AsyncIterableSourceState.DoneOK */;\n        this._onStateChanged.fire();\n    }\n    /**\n     * Writing an error will permanently invalidate this iterable.\n     * The current users will receive an error thrown, as will all future users.\n     *\n     * **NOTE** If `resolve()` or `reject()` have already been called, this method has no effect.\n     */\n    reject(error) {\n        if (this._state !== 0 /* AsyncIterableSourceState.Initial */) {\n            return;\n        }\n        this._state = 2 /* AsyncIterableSourceState.DoneError */;\n        this._error = error;\n        this._onStateChanged.fire();\n    }\n}\nexport class CancelableAsyncIterableObject extends AsyncIterableObject {\n    constructor(_source, executor) {\n        super(executor);\n        this._source = _source;\n    }\n    cancel() {\n        this._source.cancel();\n    }\n}\nexport function createCancelableAsyncIterable(callback) {\n    const source = new CancellationTokenSource();\n    const innerIterable = callback(source.token);\n    return new CancelableAsyncIterableObject(source, async (emitter) => {\n        const subscription = source.token.onCancellationRequested(() => {\n            subscription.dispose();\n            source.dispose();\n            emitter.reject(new CancellationError());\n        });\n        try {\n            for await (const item of innerIterable) {\n                if (source.token.isCancellationRequested) {\n                    // canceled in the meantime\n                    return;\n                }\n                emitter.emitOne(item);\n            }\n            subscription.dispose();\n            source.dispose();\n        }\n        catch (err) {\n            subscription.dispose();\n            source.dispose();\n            emitter.reject(err);\n        }\n    });\n}\n//#endregion\n"],"names":["timeout","task","token","Promises"],"mappings":";;;;;;AAUO,SAAS,WAAW,KAAK;AAC5B,SAAO,CAAC,CAAC,OAAO,OAAO,IAAI,SAAS;AACxC;AACO,SAAS,wBAAwB,UAAU;AAC9C,QAAM,SAAS,IAAI,wBAAyB;AAC5C,QAAM,WAAW,SAAS,OAAO,KAAK;AACtC,QAAM,UAAU,IAAI,QAAQ,CAAC,SAAS,WAAW;AAC7C,UAAM,eAAe,OAAO,MAAM,wBAAwB,MAAM;AAC5D,mBAAa,QAAS;AACtB,aAAO,IAAI,mBAAmB;AAAA,IAC1C,CAAS;AACD,YAAQ,QAAQ,QAAQ,EAAE,KAAK,WAAS;AACpC,mBAAa,QAAS;AACtB,aAAO,QAAS;AAChB,cAAQ,KAAK;AAAA,IAChB,GAAE,SAAO;AACN,mBAAa,QAAS;AACtB,aAAO,QAAS;AAChB,aAAO,GAAG;AAAA,IACtB,CAAS;AAAA,EACT,CAAK;AACD,SAAO,IAAI,MAAM;AAAA,IACb,SAAS;AACL,aAAO,OAAQ;AACf,aAAO,QAAS;AAAA,IAC5B;AAAA,IACQ,KAAK,SAAS,QAAQ;AAClB,aAAO,QAAQ,KAAK,SAAS,MAAM;AAAA,IAC/C;AAAA,IACQ,MAAM,QAAQ;AACV,aAAO,KAAK,KAAK,QAAW,MAAM;AAAA,IAC9C;AAAA,IACQ,QAAQ,WAAW;AACf,aAAO,QAAQ,QAAQ,SAAS;AAAA,IAC5C;AAAA,EACK;AACL;AACO,SAAS,iBAAiB,SAAS,OAAO,cAAc;AAC3D,SAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,UAAM,MAAM,MAAM,wBAAwB,MAAM;AAC5C,UAAI,QAAS;AACb,cAAQ,YAAY;AAAA,IAChC,CAAS;AACD,YAAQ,KAAK,SAAS,MAAM,EAAE,QAAQ,MAAM,IAAI,SAAS;AAAA,EACjE,CAAK;AACL;AA2BO,MAAM,UAAU;AAAA,EACnB,cAAc;AACV,SAAK,aAAa;AAClB,SAAK,gBAAgB;AACrB,SAAK,gBAAgB;AACrB,SAAK,uBAAuB;AAAA,EACpC;AAAA,EACI,MAAM,gBAAgB;AAClB,QAAI,KAAK,YAAY;AACjB,aAAO,QAAQ,OAAO,IAAI,MAAM,uBAAuB,CAAC;AAAA,IACpE;AACQ,QAAI,KAAK,eAAe;AACpB,WAAK,uBAAuB;AAC5B,UAAI,CAAC,KAAK,eAAe;AACrB,cAAM,aAAa,MAAM;AACrB,eAAK,gBAAgB;AACrB,cAAI,KAAK,YAAY;AACjB;AAAA,UACxB;AACoB,gBAAM,SAAS,KAAK,MAAM,KAAK,oBAAoB;AACnD,eAAK,uBAAuB;AAC5B,iBAAO;AAAA,QACV;AACD,aAAK,gBAAgB,IAAI,QAAQ,aAAW;AACxC,eAAK,cAAc,KAAK,YAAY,UAAU,EAAE,KAAK,OAAO;AAAA,QAChF,CAAiB;AAAA,MACjB;AACY,aAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,aAAK,cAAc,KAAK,SAAS,MAAM;AAAA,MACvD,CAAa;AAAA,IACb;AACQ,SAAK,gBAAgB,eAAgB;AACrC,WAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,WAAK,cAAc,KAAK,CAAC,WAAW;AAChC,aAAK,gBAAgB;AACrB,gBAAQ,MAAM;AAAA,MACjB,GAAE,CAAC,QAAQ;AACR,aAAK,gBAAgB;AACrB,eAAO,GAAG;AAAA,MAC1B,CAAa;AAAA,IACb,CAAS;AAAA,EACT;AAAA,EACI,UAAU;AACN,SAAK,aAAa;AAAA,EAC1B;AACA;AACA,MAAM,kBAAkB,CAACA,UAAS,OAAO;AACrC,MAAI,YAAY;AAChB,QAAM,SAAS,WAAW,MAAM;AAC5B,gBAAY;AACZ,OAAI;AAAA,EACP,GAAEA,QAAO;AACV,SAAO;AAAA,IACH,aAAa,MAAM;AAAA,IACnB,SAAS,MAAM;AACX,mBAAa,MAAM;AACnB,kBAAY;AAAA,IACf;AAAA,EACJ;AACL;AACA,MAAM,oBAAoB,CAAC,OAAO;AAC9B,MAAI,YAAY;AAChB,iBAAe,MAAM;AACjB,QAAI,WAAW;AACX,kBAAY;AACZ,SAAI;AAAA,IAChB;AAAA,EACA,CAAK;AACD,SAAO;AAAA,IACH,aAAa,MAAM;AAAA,IACnB,SAAS,MAAM;AAAE,kBAAY;AAAA,IAAQ;AAAA,EACxC;AACL;AAwBO,MAAM,QAAQ;AAAA,EACjB,YAAY,cAAc;AACtB,SAAK,eAAe;AACpB,SAAK,WAAW;AAChB,SAAK,oBAAoB;AACzB,SAAK,YAAY;AACjB,SAAK,WAAW;AAChB,SAAK,OAAO;AAAA,EACpB;AAAA,EACI,QAAQ,MAAM,QAAQ,KAAK,cAAc;AACrC,SAAK,OAAO;AACZ,SAAK,cAAe;AACpB,QAAI,CAAC,KAAK,mBAAmB;AACzB,WAAK,oBAAoB,IAAI,QAAQ,CAAC,SAAS,WAAW;AACtD,aAAK,YAAY;AACjB,aAAK,WAAW;AAAA,MAChC,CAAa,EAAE,KAAK,MAAM;AACV,aAAK,oBAAoB;AACzB,aAAK,YAAY;AACjB,YAAI,KAAK,MAAM;AACX,gBAAMC,QAAO,KAAK;AAClB,eAAK,OAAO;AACZ,iBAAOA,MAAM;AAAA,QACjC;AACgB,eAAO;AAAA,MACvB,CAAa;AAAA,IACb;AACQ,UAAM,KAAK,MAAM;;AACb,WAAK,WAAW;AAChB,iBAAK,cAAL,8BAAiB;AAAA,IACpB;AACD,SAAK,WAAW,UAAU,iBAAiB,kBAAkB,EAAE,IAAI,gBAAgB,OAAO,EAAE;AAC5F,WAAO,KAAK;AAAA,EACpB;AAAA,EACI,cAAc;;AACV,WAAO,CAAC,GAAC,UAAK,aAAL,mBAAe;AAAA,EAChC;AAAA,EACI,SAAS;;AACL,SAAK,cAAe;AACpB,QAAI,KAAK,mBAAmB;AACxB,iBAAK,aAAL,8BAAgB,IAAI;AACpB,WAAK,oBAAoB;AAAA,IACrC;AAAA,EACA;AAAA,EACI,gBAAgB;;AACZ,eAAK,aAAL,mBAAe;AACf,SAAK,WAAW;AAAA,EACxB;AAAA,EACI,UAAU;AACN,SAAK,OAAQ;AAAA,EACrB;AACA;AAUO,MAAM,iBAAiB;AAAA,EAC1B,YAAY,cAAc;AACtB,SAAK,UAAU,IAAI,QAAQ,YAAY;AACvC,SAAK,YAAY,IAAI,UAAW;AAAA,EACxC;AAAA,EACI,QAAQ,gBAAgB,OAAO;AAC3B,WAAO,KAAK,QAAQ,QAAQ,MAAM,KAAK,UAAU,MAAM,cAAc,GAAG,KAAK;AAAA,EACrF;AAAA,EACI,SAAS;AACL,SAAK,QAAQ,OAAQ;AAAA,EAC7B;AAAA,EACI,UAAU;AACN,SAAK,QAAQ,QAAS;AACtB,SAAK,UAAU,QAAS;AAAA,EAChC;AACA;AACO,SAAS,QAAQ,QAAQ,OAAO;AACnC,MAAI,CAAC,OAAO;AACR,WAAO,wBAAwB,CAAAC,WAAS,QAAQ,QAAQA,MAAK,CAAC;AAAA,EACtE;AACI,SAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,UAAM,SAAS,WAAW,MAAM;AAC5B,iBAAW,QAAS;AACpB,cAAS;AAAA,IACZ,GAAE,MAAM;AACT,UAAM,aAAa,MAAM,wBAAwB,MAAM;AACnD,mBAAa,MAAM;AACnB,iBAAW,QAAS;AACpB,aAAO,IAAI,mBAAmB;AAAA,IAC1C,CAAS;AAAA,EACT,CAAK;AACL;AAkBO,SAAS,kBAAkB,SAASF,WAAU,GAAG,OAAO;AAC3D,QAAM,QAAQ,WAAW,MAAM;AAC3B,YAAS;AACT,QAAI,OAAO;AACP,iBAAW,QAAS;AAAA,IAChC;AAAA,EACK,GAAEA,QAAO;AACV,QAAM,aAAa,aAAa,MAAM;AAClC,iBAAa,KAAK;AAClB,mCAAO,cAAc;AAAA,EAC7B,CAAK;AACD,iCAAO,IAAI;AACX,SAAO;AACX;AACO,SAAS,MAAM,kBAAkB,aAAa,OAAK,CAAC,CAAC,GAAG,eAAe,MAAM;AAChF,MAAI,QAAQ;AACZ,QAAM,MAAM,iBAAiB;AAC7B,QAAM,OAAO,MAAM;AACf,QAAI,SAAS,KAAK;AACd,aAAO,QAAQ,QAAQ,YAAY;AAAA,IAC/C;AACQ,UAAM,UAAU,iBAAiB,OAAO;AACxC,UAAM,UAAU,QAAQ,QAAQ,QAAO,CAAE;AACzC,WAAO,QAAQ,KAAK,YAAU;AAC1B,UAAI,WAAW,MAAM,GAAG;AACpB,eAAO,QAAQ,QAAQ,MAAM;AAAA,MAC7C;AACY,aAAO,KAAM;AAAA,IACzB,CAAS;AAAA,EACJ;AACD,SAAO,KAAM;AACjB;AACO,MAAM,aAAa;AAAA,EACtB,YAAY,QAAQA,UAAS;AACzB,SAAK,cAAc;AACnB,SAAK,SAAS;AACd,QAAI,OAAO,WAAW,cAAc,OAAOA,aAAY,UAAU;AAC7D,WAAK,YAAY,QAAQA,QAAO;AAAA,IAC5C;AAAA,EACA;AAAA,EACI,UAAU;AACN,SAAK,OAAQ;AACb,SAAK,cAAc;AAAA,EAC3B;AAAA,EACI,SAAS;AACL,QAAI,KAAK,WAAW,IAAI;AACpB,mBAAa,KAAK,MAAM;AACxB,WAAK,SAAS;AAAA,IAC1B;AAAA,EACA;AAAA,EACI,aAAa,QAAQA,UAAS;AAC1B,QAAI,KAAK,aAAa;AAClB,YAAM,IAAI,mBAAmB,mDAAmD;AAAA,IAC5F;AACQ,SAAK,OAAQ;AACb,SAAK,SAAS,WAAW,MAAM;AAC3B,WAAK,SAAS;AACd,aAAQ;AAAA,IACX,GAAEA,QAAO;AAAA,EAClB;AAAA,EACI,YAAY,QAAQA,UAAS;AACzB,QAAI,KAAK,aAAa;AAClB,YAAM,IAAI,mBAAmB,kDAAkD;AAAA,IAC3F;AACQ,QAAI,KAAK,WAAW,IAAI;AAEpB;AAAA,IACZ;AACQ,SAAK,SAAS,WAAW,MAAM;AAC3B,WAAK,SAAS;AACd,aAAQ;AAAA,IACX,GAAEA,QAAO;AAAA,EAClB;AACA;AACO,MAAM,cAAc;AAAA,EACvB,cAAc;AACV,SAAK,aAAa;AAClB,SAAK,aAAa;AAAA,EAC1B;AAAA,EACI,SAAS;;AACL,eAAK,eAAL,mBAAiB;AACjB,SAAK,aAAa;AAAA,EAC1B;AAAA,EACI,aAAa,QAAQ,UAAU,UAAU,YAAY;AACjD,QAAI,KAAK,YAAY;AACjB,YAAM,IAAI,mBAAmB,oDAAoD;AAAA,IAC7F;AACQ,SAAK,OAAQ;AACb,UAAM,SAAS,QAAQ,YAAY,MAAM;AACrC,aAAQ;AAAA,IACX,GAAE,QAAQ;AACX,SAAK,aAAa,aAAa,MAAM;AACjC,cAAQ,cAAc,MAAM;AAC5B,WAAK,aAAa;AAAA,IAC9B,CAAS;AAAA,EACT;AAAA,EACI,UAAU;AACN,SAAK,OAAQ;AACb,SAAK,aAAa;AAAA,EAC1B;AACA;AACO,MAAM,iBAAiB;AAAA,EAC1B,YAAY,QAAQ,OAAO;AACvB,SAAK,eAAe;AACpB,SAAK,SAAS;AACd,SAAK,UAAU;AACf,SAAK,iBAAiB,KAAK,UAAU,KAAK,IAAI;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA,EAII,UAAU;AACN,SAAK,OAAQ;AACb,SAAK,SAAS;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAII,SAAS;AACL,QAAI,KAAK,eAAe;AACpB,mBAAa,KAAK,YAAY;AAC9B,WAAK,eAAe;AAAA,IAChC;AAAA,EACA;AAAA;AAAA;AAAA;AAAA,EAII,SAAS,QAAQ,KAAK,SAAS;AAC3B,SAAK,OAAQ;AACb,SAAK,eAAe,WAAW,KAAK,gBAAgB,KAAK;AAAA,EACjE;AAAA,EACI,IAAI,QAAQ;AACR,WAAO,KAAK;AAAA,EACpB;AAAA,EACI,IAAI,MAAM,OAAO;AACb,SAAK,UAAU;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAII,cAAc;AACV,WAAO,KAAK,iBAAiB;AAAA,EACrC;AAAA,EACI,YAAY;AACR,SAAK,eAAe;AACpB,QAAI,KAAK,QAAQ;AACb,WAAK,MAAO;AAAA,IACxB;AAAA,EACA;AAAA,EACI,QAAQ;;AACJ,eAAK,WAAL;AAAA,EACR;AACA;AAsBU,IAAC;AACD,IAAC;AAAA,CACV,WAAY;AACT,MAAI,OAAO,WAAW,wBAAwB,cAAc,OAAO,WAAW,uBAAuB,YAAY;AAC7G,mBAAe,CAAC,eAAe,WAAW;AACtC,kBAAY,MAAM;AACd,YAAI,UAAU;AACV;AAAA,QACpB;AACgB,cAAM,MAAM,KAAK,IAAG,IAAK;AACzB,cAAM,WAAW;AAAA,UACb,YAAY;AAAA,UACZ,gBAAgB;AACZ,mBAAO,KAAK,IAAI,GAAG,MAAM,KAAK,KAAK;AAAA,UAC3D;AAAA,QACiB;AACD,eAAO,OAAO,OAAO,QAAQ,CAAC;AAAA,MAC9C,CAAa;AACD,UAAI,WAAW;AACf,aAAO;AAAA,QACH,UAAU;AACN,cAAI,UAAU;AACV;AAAA,UACxB;AACoB,qBAAW;AAAA,QAC/B;AAAA,MACa;AAAA,IACJ;AAAA,EACT,OACS;AACD,mBAAe,CAAC,cAAc,QAAQA,aAAY;AAC9C,YAAM,SAAS,aAAa,oBAAoB,QAAQ,OAAOA,aAAY,WAAW,EAAE,SAAAA,SAAS,IAAG,MAAS;AAC7G,UAAI,WAAW;AACf,aAAO;AAAA,QACH,UAAU;AACN,cAAI,UAAU;AACV;AAAA,UACxB;AACoB,qBAAW;AACX,uBAAa,mBAAmB,MAAM;AAAA,QAC1D;AAAA,MACa;AAAA,IACJ;AAAA,EACT;AACI,sBAAoB,CAAC,WAAW,aAAa,YAAY,MAAM;AACnE,GAAI;AACG,MAAM,kBAAkB;AAAA,EAC3B,YAAY,cAAc,UAAU;AAChC,SAAK,UAAU;AACf,SAAK,YAAY,MAAM;AACnB,UAAI;AACA,aAAK,SAAS,SAAU;AAAA,MACxC,SACmB,KAAK;AACR,aAAK,SAAS;AAAA,MAC9B,UACoB;AACJ,aAAK,UAAU;AAAA,MAC/B;AAAA,IACS;AACD,SAAK,UAAU,aAAa,cAAc,MAAM,KAAK,WAAW;AAAA,EACxE;AAAA,EACI,UAAU;AACN,SAAK,QAAQ,QAAS;AAAA,EAC9B;AAAA,EACI,IAAI,QAAQ;AACR,QAAI,CAAC,KAAK,SAAS;AACf,WAAK,QAAQ,QAAS;AACtB,WAAK,UAAW;AAAA,IAC5B;AACQ,QAAI,KAAK,QAAQ;AACb,YAAM,KAAK;AAAA,IACvB;AACQ,WAAO,KAAK;AAAA,EACpB;AAAA,EACI,IAAI,gBAAgB;AAChB,WAAO,KAAK;AAAA,EACpB;AACA;AAOO,MAAM,wBAAwB,kBAAkB;AAAA,EACnD,YAAY,UAAU;AAClB,UAAM,YAAY,QAAQ;AAAA,EAClC;AACA;AAIO,MAAM,gBAAgB;AAAA,EACzB,IAAI,aAAa;;AACb,aAAO,UAAK,YAAL,mBAAc,aAAY;AAAA,EACzC;AAAA,EACI,IAAI,YAAY;AACZ,WAAO,CAAC,CAAC,KAAK;AAAA,EACtB;AAAA,EACI,cAAc;AACV,SAAK,IAAI,IAAI,QAAQ,CAAC,GAAG,MAAM;AAC3B,WAAK,mBAAmB;AACxB,WAAK,gBAAgB;AAAA,IACjC,CAAS;AAAA,EACT;AAAA,EACI,SAAS,OAAO;AACZ,WAAO,IAAI,QAAQ,aAAW;AAC1B,WAAK,iBAAiB,KAAK;AAC3B,WAAK,UAAU,EAAE,SAAS,GAAkC,MAAO;AACnE,cAAS;AAAA,IACrB,CAAS;AAAA,EACT;AAAA,EACI,MAAM,KAAK;AACP,WAAO,IAAI,QAAQ,aAAW;AAC1B,WAAK,cAAc,GAAG;AACtB,WAAK,UAAU,EAAE,SAAS,GAAkC,OAAO,IAAK;AACxE,cAAS;AAAA,IACrB,CAAS;AAAA,EACT;AAAA,EACI,SAAS;AACL,WAAO,KAAK,MAAM,IAAI,mBAAmB;AAAA,EACjD;AACA;AAGU,IAAC;AAAA,CACV,SAAUG,WAAU;AAQjB,iBAAe,QAAQ,UAAU;AAC7B,QAAI,aAAa;AACjB,UAAM,SAAS,MAAM,QAAQ,IAAI,SAAS,IAAI,aAAW,QAAQ,KAAK,WAAS,OAAO,WAAS;AAC3F,UAAI,CAAC,YAAY;AACb,qBAAa;AAAA,MAC7B;AACY,aAAO;AAAA,IACV,CAAA,CAAC,CAAC;AACH,QAAI,OAAO,eAAe,aAAa;AACnC,YAAM;AAAA,IAClB;AACQ,WAAO;AAAA,EACf;AACI,EAAAA,UAAS,UAAU;AAWnB,WAAS,cAAc,QAAQ;AAE3B,WAAO,IAAI,QAAQ,OAAO,SAAS,WAAW;AAC1C,UAAI;AACA,cAAM,OAAO,SAAS,MAAM;AAAA,MAC5C,SACmB,OAAO;AACV,eAAO,KAAK;AAAA,MAC5B;AAAA,IACA,CAAS;AAAA,EACT;AACI,EAAAA,UAAS,gBAAgB;AAC7B,GAAG,aAAa,WAAW,CAAA,EAAG;AAIvB,MAAM,uBAAN,MAAM,qBAAoB;AAAA,EAC7B,OAAO,UAAU,OAAO;AACpB,WAAO,IAAI,qBAAoB,CAAC,WAAW;AACvC,aAAO,SAAS,KAAK;AAAA,IACjC,CAAS;AAAA,EACT;AAAA,EACI,OAAO,YAAY,SAAS;AACxB,WAAO,IAAI,qBAAoB,OAAO,YAAY;AAC9C,cAAQ,SAAS,MAAM,OAAO;AAAA,IAC1C,CAAS;AAAA,EACT;AAAA,EACI,OAAO,aAAa,UAAU;AAC1B,WAAO,IAAI,qBAAoB,OAAO,YAAY;AAC9C,YAAM,QAAQ,IAAI,SAAS,IAAI,OAAO,MAAM,QAAQ,QAAQ,MAAM,CAAC,CAAC,CAAC;AAAA,IACjF,CAAS;AAAA,EACT;AAAA,EACI,OAAO,MAAM,WAAW;AACpB,WAAO,IAAI,qBAAoB,OAAO,YAAY;AAC9C,YAAM,QAAQ,IAAI,UAAU,IAAI,OAAO,aAAa;AAChD,yBAAiB,QAAQ,UAAU;AAC/B,kBAAQ,QAAQ,IAAI;AAAA,QACxC;AAAA,MACA,CAAa,CAAC;AAAA,IACd,CAAS;AAAA,EACT;AAAA,EAEI,YAAY,UAAU,UAAU;AAC5B,SAAK,SAAS;AACd,SAAK,WAAW,CAAE;AAClB,SAAK,SAAS;AACd,SAAK,YAAY;AACjB,SAAK,kBAAkB,IAAI,QAAS;AACpC,mBAAe,YAAY;AACvB,YAAM,SAAS;AAAA,QACX,SAAS,CAAC,SAAS,KAAK,QAAQ,IAAI;AAAA,QACpC,UAAU,CAAC,UAAU,KAAK,SAAS,KAAK;AAAA,QACxC,QAAQ,CAAC,UAAU,KAAK,OAAO,KAAK;AAAA,MACvC;AACD,UAAI;AACA,cAAM,QAAQ,QAAQ,SAAS,MAAM,CAAC;AACtC,aAAK,QAAS;AAAA,MAC9B,SACmB,KAAK;AACR,aAAK,OAAO,GAAG;AAAA,MAC/B,UACoB;AACJ,eAAO,UAAU;AACjB,eAAO,WAAW;AAClB,eAAO,SAAS;AAAA,MAChC;AAAA,IACA,CAAS;AAAA,EACT;AAAA,EACI,CAAC,OAAO,aAAa,IAAI;AACrB,QAAI,IAAI;AACR,WAAO;AAAA,MACH,MAAM,YAAY;AACd,WAAG;AACC,cAAI,KAAK,WAAW,GAA4C;AAC5D,kBAAM,KAAK;AAAA,UACnC;AACoB,cAAI,IAAI,KAAK,SAAS,QAAQ;AAC1B,mBAAO,EAAE,MAAM,OAAO,OAAO,KAAK,SAAS,GAAG,EAAG;AAAA,UACzE;AACoB,cAAI,KAAK,WAAW,GAAyC;AACzD,mBAAO,EAAE,MAAM,MAAM,OAAO,OAAW;AAAA,UAC/D;AACoB,gBAAM,MAAM,UAAU,KAAK,gBAAgB,KAAK;AAAA,QACpE,SAAyB;AAAA,MACZ;AAAA,MACD,QAAQ,YAAY;;AAChB,mBAAK,cAAL;AACA,eAAO,EAAE,MAAM,MAAM,OAAO,OAAW;AAAA,MACvD;AAAA,IACS;AAAA,EACT;AAAA,EACI,OAAO,IAAI,UAAU,OAAO;AACxB,WAAO,IAAI,qBAAoB,OAAO,YAAY;AAC9C,uBAAiB,QAAQ,UAAU;AAC/B,gBAAQ,QAAQ,MAAM,IAAI,CAAC;AAAA,MAC3C;AAAA,IACA,CAAS;AAAA,EACT;AAAA,EACI,IAAI,OAAO;AACP,WAAO,qBAAoB,IAAI,MAAM,KAAK;AAAA,EAClD;AAAA,EACI,OAAO,OAAO,UAAU,UAAU;AAC9B,WAAO,IAAI,qBAAoB,OAAO,YAAY;AAC9C,uBAAiB,QAAQ,UAAU;AAC/B,YAAI,SAAS,IAAI,GAAG;AAChB,kBAAQ,QAAQ,IAAI;AAAA,QACxC;AAAA,MACA;AAAA,IACA,CAAS;AAAA,EACT;AAAA,EACI,OAAO,UAAU;AACb,WAAO,qBAAoB,OAAO,MAAM,QAAQ;AAAA,EACxD;AAAA,EACI,OAAO,SAAS,UAAU;AACtB,WAAO,qBAAoB,OAAO,UAAU,UAAQ,CAAC,CAAC,IAAI;AAAA,EAClE;AAAA,EACI,WAAW;AACP,WAAO,qBAAoB,SAAS,IAAI;AAAA,EAChD;AAAA,EACI,aAAa,UAAU,UAAU;AAC7B,UAAM,SAAS,CAAE;AACjB,qBAAiB,QAAQ,UAAU;AAC/B,aAAO,KAAK,IAAI;AAAA,IAC5B;AACQ,WAAO;AAAA,EACf;AAAA,EACI,YAAY;AACR,WAAO,qBAAoB,UAAU,IAAI;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMI,QAAQ,OAAO;AACX,QAAI,KAAK,WAAW,GAA0C;AAC1D;AAAA,IACZ;AAGQ,SAAK,SAAS,KAAK,KAAK;AACxB,SAAK,gBAAgB,KAAM;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMI,SAAS,QAAQ;AACb,QAAI,KAAK,WAAW,GAA0C;AAC1D;AAAA,IACZ;AAGQ,SAAK,WAAW,KAAK,SAAS,OAAO,MAAM;AAC3C,SAAK,gBAAgB,KAAM;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOI,UAAU;AACN,QAAI,KAAK,WAAW,GAA0C;AAC1D;AAAA,IACZ;AACQ,SAAK,SAAS;AACd,SAAK,gBAAgB,KAAM;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOI,OAAO,OAAO;AACV,QAAI,KAAK,WAAW,GAA0C;AAC1D;AAAA,IACZ;AACQ,SAAK,SAAS;AACd,SAAK,SAAS;AACd,SAAK,gBAAgB,KAAM;AAAA,EACnC;AACA;AA/Ia,qBAAK,QAAQ,qBAAoB,UAAU,CAAE,CAAA;AAzBnD,IAAM,sBAAN;AAyKA,MAAM,sCAAsC,oBAAoB;AAAA,EACnE,YAAY,SAAS,UAAU;AAC3B,UAAM,QAAQ;AACd,SAAK,UAAU;AAAA,EACvB;AAAA,EACI,SAAS;AACL,SAAK,QAAQ,OAAQ;AAAA,EAC7B;AACA;AACO,SAAS,8BAA8B,UAAU;AACpD,QAAM,SAAS,IAAI,wBAAyB;AAC5C,QAAM,gBAAgB,SAAS,OAAO,KAAK;AAC3C,SAAO,IAAI,8BAA8B,QAAQ,OAAO,YAAY;AAChE,UAAM,eAAe,OAAO,MAAM,wBAAwB,MAAM;AAC5D,mBAAa,QAAS;AACtB,aAAO,QAAS;AAChB,cAAQ,OAAO,IAAI,mBAAmB;AAAA,IAClD,CAAS;AACD,QAAI;AACA,uBAAiB,QAAQ,eAAe;AACpC,YAAI,OAAO,MAAM,yBAAyB;AAEtC;AAAA,QACpB;AACgB,gBAAQ,QAAQ,IAAI;AAAA,MACpC;AACY,mBAAa,QAAS;AACtB,aAAO,QAAS;AAAA,IAC5B,SACe,KAAK;AACR,mBAAa,QAAS;AACtB,aAAO,QAAS;AAChB,cAAQ,OAAO,GAAG;AAAA,IAC9B;AAAA,EACA,CAAK;AACL;","x_google_ignoreList":[0]}
+{"version":3,"file":"async.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/async.js"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\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 './cancellation.js';\nimport { BugIndicatingError, CancellationError } from './errors.js';\nimport { Emitter, Event } from './event.js';\nimport { toDisposable } from './lifecycle.js';\nimport { setTimeout0 } from './platform.js';\nimport { MicrotaskDelay } from './symbols.js';\nexport function isThenable(obj) {\n    return !!obj && typeof obj.then === 'function';\n}\nexport function createCancelablePromise(callback) {\n    const source = new CancellationTokenSource();\n    const thenable = callback(source.token);\n    const promise = new Promise((resolve, reject) => {\n        const subscription = source.token.onCancellationRequested(() => {\n            subscription.dispose();\n            reject(new CancellationError());\n        });\n        Promise.resolve(thenable).then(value => {\n            subscription.dispose();\n            source.dispose();\n            resolve(value);\n        }, err => {\n            subscription.dispose();\n            source.dispose();\n            reject(err);\n        });\n    });\n    return new class {\n        cancel() {\n            source.cancel();\n            source.dispose();\n        }\n        then(resolve, reject) {\n            return promise.then(resolve, reject);\n        }\n        catch(reject) {\n            return this.then(undefined, reject);\n        }\n        finally(onfinally) {\n            return promise.finally(onfinally);\n        }\n    };\n}\nexport function raceCancellation(promise, token, defaultValue) {\n    return new Promise((resolve, reject) => {\n        const ref = token.onCancellationRequested(() => {\n            ref.dispose();\n            resolve(defaultValue);\n        });\n        promise.then(resolve, reject).finally(() => ref.dispose());\n    });\n}\n/**\n * A helper to prevent accumulation of sequential async tasks.\n *\n * Imagine a mail man with the sole task of delivering letters. As soon as\n * a letter submitted for delivery, he drives to the destination, delivers it\n * and returns to his base. Imagine that during the trip, N more letters were submitted.\n * When the mail man returns, he picks those N letters and delivers them all in a\n * single trip. Even though N+1 submissions occurred, only 2 deliveries were made.\n *\n * The throttler implements this via the queue() method, by providing it a task\n * factory. Following the example:\n *\n * \t\tconst throttler = new Throttler();\n * \t\tconst letters = [];\n *\n * \t\tfunction deliver() {\n * \t\t\tconst lettersToDeliver = letters;\n * \t\t\tletters = [];\n * \t\t\treturn makeTheTrip(lettersToDeliver);\n * \t\t}\n *\n * \t\tfunction onLetterReceived(l) {\n * \t\t\tletters.push(l);\n * \t\t\tthrottler.queue(deliver);\n * \t\t}\n */\nexport class Throttler {\n    constructor() {\n        this.isDisposed = false;\n        this.activePromise = null;\n        this.queuedPromise = null;\n        this.queuedPromiseFactory = null;\n    }\n    queue(promiseFactory) {\n        if (this.isDisposed) {\n            return Promise.reject(new Error('Throttler is disposed'));\n        }\n        if (this.activePromise) {\n            this.queuedPromiseFactory = promiseFactory;\n            if (!this.queuedPromise) {\n                const onComplete = () => {\n                    this.queuedPromise = null;\n                    if (this.isDisposed) {\n                        return;\n                    }\n                    const result = this.queue(this.queuedPromiseFactory);\n                    this.queuedPromiseFactory = null;\n                    return result;\n                };\n                this.queuedPromise = new Promise(resolve => {\n                    this.activePromise.then(onComplete, onComplete).then(resolve);\n                });\n            }\n            return new Promise((resolve, reject) => {\n                this.queuedPromise.then(resolve, reject);\n            });\n        }\n        this.activePromise = promiseFactory();\n        return new Promise((resolve, reject) => {\n            this.activePromise.then((result) => {\n                this.activePromise = null;\n                resolve(result);\n            }, (err) => {\n                this.activePromise = null;\n                reject(err);\n            });\n        });\n    }\n    dispose() {\n        this.isDisposed = true;\n    }\n}\nconst timeoutDeferred = (timeout, fn) => {\n    let scheduled = true;\n    const handle = setTimeout(() => {\n        scheduled = false;\n        fn();\n    }, timeout);\n    return {\n        isTriggered: () => scheduled,\n        dispose: () => {\n            clearTimeout(handle);\n            scheduled = false;\n        },\n    };\n};\nconst microtaskDeferred = (fn) => {\n    let scheduled = true;\n    queueMicrotask(() => {\n        if (scheduled) {\n            scheduled = false;\n            fn();\n        }\n    });\n    return {\n        isTriggered: () => scheduled,\n        dispose: () => { scheduled = false; },\n    };\n};\n/**\n * A helper to delay (debounce) execution of a task that is being requested often.\n *\n * Following the throttler, now imagine the mail man wants to optimize the number of\n * trips proactively. The trip itself can be long, so he decides not to make the trip\n * as soon as a letter is submitted. Instead he waits a while, in case more\n * letters are submitted. After said waiting period, if no letters were submitted, he\n * decides to make the trip. Imagine that N more letters were submitted after the first\n * one, all within a short period of time between each other. Even though N+1\n * submissions occurred, only 1 delivery was made.\n *\n * The delayer offers this behavior via the trigger() method, into which both the task\n * to be executed and the waiting period (delay) must be passed in as arguments. Following\n * the example:\n *\n * \t\tconst delayer = new Delayer(WAITING_PERIOD);\n * \t\tconst letters = [];\n *\n * \t\tfunction letterReceived(l) {\n * \t\t\tletters.push(l);\n * \t\t\tdelayer.trigger(() => { return makeTheTrip(); });\n * \t\t}\n */\nexport class Delayer {\n    constructor(defaultDelay) {\n        this.defaultDelay = defaultDelay;\n        this.deferred = null;\n        this.completionPromise = null;\n        this.doResolve = null;\n        this.doReject = null;\n        this.task = null;\n    }\n    trigger(task, delay = this.defaultDelay) {\n        this.task = task;\n        this.cancelTimeout();\n        if (!this.completionPromise) {\n            this.completionPromise = new Promise((resolve, reject) => {\n                this.doResolve = resolve;\n                this.doReject = reject;\n            }).then(() => {\n                this.completionPromise = null;\n                this.doResolve = null;\n                if (this.task) {\n                    const task = this.task;\n                    this.task = null;\n                    return task();\n                }\n                return undefined;\n            });\n        }\n        const fn = () => {\n            this.deferred = null;\n            this.doResolve?.(null);\n        };\n        this.deferred = delay === MicrotaskDelay ? microtaskDeferred(fn) : timeoutDeferred(delay, fn);\n        return this.completionPromise;\n    }\n    isTriggered() {\n        return !!this.deferred?.isTriggered();\n    }\n    cancel() {\n        this.cancelTimeout();\n        if (this.completionPromise) {\n            this.doReject?.(new CancellationError());\n            this.completionPromise = null;\n        }\n    }\n    cancelTimeout() {\n        this.deferred?.dispose();\n        this.deferred = null;\n    }\n    dispose() {\n        this.cancel();\n    }\n}\n/**\n * A helper to delay execution of a task that is being requested often, while\n * preventing accumulation of consecutive executions, while the task runs.\n *\n * The mail man is clever and waits for a certain amount of time, before going\n * out to deliver letters. While the mail man is going out, more letters arrive\n * and can only be delivered once he is back. Once he is back the mail man will\n * do one more trip to deliver the letters that have accumulated while he was out.\n */\nexport class ThrottledDelayer {\n    constructor(defaultDelay) {\n        this.delayer = new Delayer(defaultDelay);\n        this.throttler = new Throttler();\n    }\n    trigger(promiseFactory, delay) {\n        return this.delayer.trigger(() => this.throttler.queue(promiseFactory), delay);\n    }\n    cancel() {\n        this.delayer.cancel();\n    }\n    dispose() {\n        this.delayer.dispose();\n        this.throttler.dispose();\n    }\n}\nexport function timeout(millis, token) {\n    if (!token) {\n        return createCancelablePromise(token => timeout(millis, token));\n    }\n    return new Promise((resolve, reject) => {\n        const handle = setTimeout(() => {\n            disposable.dispose();\n            resolve();\n        }, millis);\n        const disposable = token.onCancellationRequested(() => {\n            clearTimeout(handle);\n            disposable.dispose();\n            reject(new CancellationError());\n        });\n    });\n}\n/**\n * Creates a timeout that can be disposed using its returned value.\n * @param handler The timeout handler.\n * @param timeout An optional timeout in milliseconds.\n * @param store An optional {@link DisposableStore} that will have the timeout disposable managed automatically.\n *\n * @example\n * const store = new DisposableStore;\n * // Call the timeout after 1000ms at which point it will be automatically\n * // evicted from the store.\n * const timeoutDisposable = disposableTimeout(() => {}, 1000, store);\n *\n * if (foo) {\n *   // Cancel the timeout and evict it from store.\n *   timeoutDisposable.dispose();\n * }\n */\nexport function disposableTimeout(handler, timeout = 0, store) {\n    const timer = setTimeout(() => {\n        handler();\n        if (store) {\n            disposable.dispose();\n        }\n    }, timeout);\n    const disposable = toDisposable(() => {\n        clearTimeout(timer);\n        store?.deleteAndLeak(disposable);\n    });\n    store?.add(disposable);\n    return disposable;\n}\nexport function first(promiseFactories, shouldStop = t => !!t, defaultValue = null) {\n    let index = 0;\n    const len = promiseFactories.length;\n    const loop = () => {\n        if (index >= len) {\n            return Promise.resolve(defaultValue);\n        }\n        const factory = promiseFactories[index++];\n        const promise = Promise.resolve(factory());\n        return promise.then(result => {\n            if (shouldStop(result)) {\n                return Promise.resolve(result);\n            }\n            return loop();\n        });\n    };\n    return loop();\n}\nexport class TimeoutTimer {\n    constructor(runner, timeout) {\n        this._isDisposed = false;\n        this._token = -1;\n        if (typeof runner === 'function' && typeof timeout === 'number') {\n            this.setIfNotSet(runner, timeout);\n        }\n    }\n    dispose() {\n        this.cancel();\n        this._isDisposed = true;\n    }\n    cancel() {\n        if (this._token !== -1) {\n            clearTimeout(this._token);\n            this._token = -1;\n        }\n    }\n    cancelAndSet(runner, timeout) {\n        if (this._isDisposed) {\n            throw new BugIndicatingError(`Calling 'cancelAndSet' on a disposed TimeoutTimer`);\n        }\n        this.cancel();\n        this._token = setTimeout(() => {\n            this._token = -1;\n            runner();\n        }, timeout);\n    }\n    setIfNotSet(runner, timeout) {\n        if (this._isDisposed) {\n            throw new BugIndicatingError(`Calling 'setIfNotSet' on a disposed TimeoutTimer`);\n        }\n        if (this._token !== -1) {\n            // timer is already set\n            return;\n        }\n        this._token = setTimeout(() => {\n            this._token = -1;\n            runner();\n        }, timeout);\n    }\n}\nexport class IntervalTimer {\n    constructor() {\n        this.disposable = undefined;\n        this.isDisposed = false;\n    }\n    cancel() {\n        this.disposable?.dispose();\n        this.disposable = undefined;\n    }\n    cancelAndSet(runner, interval, context = globalThis) {\n        if (this.isDisposed) {\n            throw new BugIndicatingError(`Calling 'cancelAndSet' on a disposed IntervalTimer`);\n        }\n        this.cancel();\n        const handle = context.setInterval(() => {\n            runner();\n        }, interval);\n        this.disposable = toDisposable(() => {\n            context.clearInterval(handle);\n            this.disposable = undefined;\n        });\n    }\n    dispose() {\n        this.cancel();\n        this.isDisposed = true;\n    }\n}\nexport class RunOnceScheduler {\n    constructor(runner, delay) {\n        this.timeoutToken = -1;\n        this.runner = runner;\n        this.timeout = delay;\n        this.timeoutHandler = this.onTimeout.bind(this);\n    }\n    /**\n     * Dispose RunOnceScheduler\n     */\n    dispose() {\n        this.cancel();\n        this.runner = null;\n    }\n    /**\n     * Cancel current scheduled runner (if any).\n     */\n    cancel() {\n        if (this.isScheduled()) {\n            clearTimeout(this.timeoutToken);\n            this.timeoutToken = -1;\n        }\n    }\n    /**\n     * Cancel previous runner (if any) & schedule a new runner.\n     */\n    schedule(delay = this.timeout) {\n        this.cancel();\n        this.timeoutToken = setTimeout(this.timeoutHandler, delay);\n    }\n    get delay() {\n        return this.timeout;\n    }\n    set delay(value) {\n        this.timeout = value;\n    }\n    /**\n     * Returns true if scheduled.\n     */\n    isScheduled() {\n        return this.timeoutToken !== -1;\n    }\n    onTimeout() {\n        this.timeoutToken = -1;\n        if (this.runner) {\n            this.doRun();\n        }\n    }\n    doRun() {\n        this.runner?.();\n    }\n}\n/**\n * Execute the callback the next time the browser is idle, returning an\n * {@link IDisposable} that will cancel the callback when disposed. This wraps\n * [requestIdleCallback] so it will fallback to [setTimeout] if the environment\n * doesn't support it.\n *\n * @param callback The callback to run when idle, this includes an\n * [IdleDeadline] that provides the time alloted for the idle callback by the\n * browser. Not respecting this deadline will result in a degraded user\n * experience.\n * @param timeout A timeout at which point to queue no longer wait for an idle\n * callback but queue it on the regular event loop (like setTimeout). Typically\n * this should not be used.\n *\n * [IdleDeadline]: https://developer.mozilla.org/en-US/docs/Web/API/IdleDeadline\n * [requestIdleCallback]: https://developer.mozilla.org/en-US/docs/Web/API/Window/requestIdleCallback\n * [setTimeout]: https://developer.mozilla.org/en-US/docs/Web/API/Window/setTimeout\n *\n * **Note** that there is `dom.ts#runWhenWindowIdle` which is better suited when running inside a browser\n * context\n */\nexport let runWhenGlobalIdle;\nexport let _runWhenIdle;\n(function () {\n    if (typeof globalThis.requestIdleCallback !== 'function' || typeof globalThis.cancelIdleCallback !== 'function') {\n        _runWhenIdle = (_targetWindow, runner) => {\n            setTimeout0(() => {\n                if (disposed) {\n                    return;\n                }\n                const end = Date.now() + 15; // one frame at 64fps\n                const deadline = {\n                    didTimeout: true,\n                    timeRemaining() {\n                        return Math.max(0, end - Date.now());\n                    }\n                };\n                runner(Object.freeze(deadline));\n            });\n            let disposed = false;\n            return {\n                dispose() {\n                    if (disposed) {\n                        return;\n                    }\n                    disposed = true;\n                }\n            };\n        };\n    }\n    else {\n        _runWhenIdle = (targetWindow, runner, timeout) => {\n            const handle = targetWindow.requestIdleCallback(runner, typeof timeout === 'number' ? { timeout } : undefined);\n            let disposed = false;\n            return {\n                dispose() {\n                    if (disposed) {\n                        return;\n                    }\n                    disposed = true;\n                    targetWindow.cancelIdleCallback(handle);\n                }\n            };\n        };\n    }\n    runWhenGlobalIdle = (runner) => _runWhenIdle(globalThis, runner);\n})();\nexport class AbstractIdleValue {\n    constructor(targetWindow, executor) {\n        this._didRun = false;\n        this._executor = () => {\n            try {\n                this._value = executor();\n            }\n            catch (err) {\n                this._error = err;\n            }\n            finally {\n                this._didRun = true;\n            }\n        };\n        this._handle = _runWhenIdle(targetWindow, () => this._executor());\n    }\n    dispose() {\n        this._handle.dispose();\n    }\n    get value() {\n        if (!this._didRun) {\n            this._handle.dispose();\n            this._executor();\n        }\n        if (this._error) {\n            throw this._error;\n        }\n        return this._value;\n    }\n    get isInitialized() {\n        return this._didRun;\n    }\n}\n/**\n * An `IdleValue` that always uses the current window (which might be throttled or inactive)\n *\n * **Note** that there is `dom.ts#WindowIdleValue` which is better suited when running inside a browser\n * context\n */\nexport class GlobalIdleValue extends AbstractIdleValue {\n    constructor(executor) {\n        super(globalThis, executor);\n    }\n}\n/**\n * Creates a promise whose resolution or rejection can be controlled imperatively.\n */\nexport class DeferredPromise {\n    get isRejected() {\n        return this.outcome?.outcome === 1 /* DeferredOutcome.Rejected */;\n    }\n    get isSettled() {\n        return !!this.outcome;\n    }\n    constructor() {\n        this.p = new Promise((c, e) => {\n            this.completeCallback = c;\n            this.errorCallback = e;\n        });\n    }\n    complete(value) {\n        return new Promise(resolve => {\n            this.completeCallback(value);\n            this.outcome = { outcome: 0 /* DeferredOutcome.Resolved */, value };\n            resolve();\n        });\n    }\n    error(err) {\n        return new Promise(resolve => {\n            this.errorCallback(err);\n            this.outcome = { outcome: 1 /* DeferredOutcome.Rejected */, value: err };\n            resolve();\n        });\n    }\n    cancel() {\n        return this.error(new CancellationError());\n    }\n}\n//#endregion\n//#region Promises\nexport var Promises;\n(function (Promises) {\n    /**\n     * A drop-in replacement for `Promise.all` with the only difference\n     * that the method awaits every promise to either fulfill or reject.\n     *\n     * Similar to `Promise.all`, only the first error will be returned\n     * if any.\n     */\n    async function settled(promises) {\n        let firstError = undefined;\n        const result = await Promise.all(promises.map(promise => promise.then(value => value, error => {\n            if (!firstError) {\n                firstError = error;\n            }\n            return undefined; // do not rethrow so that other promises can settle\n        })));\n        if (typeof firstError !== 'undefined') {\n            throw firstError;\n        }\n        return result; // cast is needed and protected by the `throw` above\n    }\n    Promises.settled = settled;\n    /**\n     * A helper to create a new `Promise<T>` with a body that is a promise\n     * itself. By default, an error that raises from the async body will\n     * end up as a unhandled rejection, so this utility properly awaits the\n     * body and rejects the promise as a normal promise does without async\n     * body.\n     *\n     * This method should only be used in rare cases where otherwise `async`\n     * cannot be used (e.g. when callbacks are involved that require this).\n     */\n    function withAsyncBody(bodyFn) {\n        // eslint-disable-next-line no-async-promise-executor\n        return new Promise(async (resolve, reject) => {\n            try {\n                await bodyFn(resolve, reject);\n            }\n            catch (error) {\n                reject(error);\n            }\n        });\n    }\n    Promises.withAsyncBody = withAsyncBody;\n})(Promises || (Promises = {}));\n/**\n * A rich implementation for an `AsyncIterable<T>`.\n */\nexport class AsyncIterableObject {\n    static fromArray(items) {\n        return new AsyncIterableObject((writer) => {\n            writer.emitMany(items);\n        });\n    }\n    static fromPromise(promise) {\n        return new AsyncIterableObject(async (emitter) => {\n            emitter.emitMany(await promise);\n        });\n    }\n    static fromPromises(promises) {\n        return new AsyncIterableObject(async (emitter) => {\n            await Promise.all(promises.map(async (p) => emitter.emitOne(await p)));\n        });\n    }\n    static merge(iterables) {\n        return new AsyncIterableObject(async (emitter) => {\n            await Promise.all(iterables.map(async (iterable) => {\n                for await (const item of iterable) {\n                    emitter.emitOne(item);\n                }\n            }));\n        });\n    }\n    static { this.EMPTY = AsyncIterableObject.fromArray([]); }\n    constructor(executor, onReturn) {\n        this._state = 0 /* AsyncIterableSourceState.Initial */;\n        this._results = [];\n        this._error = null;\n        this._onReturn = onReturn;\n        this._onStateChanged = new Emitter();\n        queueMicrotask(async () => {\n            const writer = {\n                emitOne: (item) => this.emitOne(item),\n                emitMany: (items) => this.emitMany(items),\n                reject: (error) => this.reject(error)\n            };\n            try {\n                await Promise.resolve(executor(writer));\n                this.resolve();\n            }\n            catch (err) {\n                this.reject(err);\n            }\n            finally {\n                writer.emitOne = undefined;\n                writer.emitMany = undefined;\n                writer.reject = undefined;\n            }\n        });\n    }\n    [Symbol.asyncIterator]() {\n        let i = 0;\n        return {\n            next: async () => {\n                do {\n                    if (this._state === 2 /* AsyncIterableSourceState.DoneError */) {\n                        throw this._error;\n                    }\n                    if (i < this._results.length) {\n                        return { done: false, value: this._results[i++] };\n                    }\n                    if (this._state === 1 /* AsyncIterableSourceState.DoneOK */) {\n                        return { done: true, value: undefined };\n                    }\n                    await Event.toPromise(this._onStateChanged.event);\n                } while (true);\n            },\n            return: async () => {\n                this._onReturn?.();\n                return { done: true, value: undefined };\n            }\n        };\n    }\n    static map(iterable, mapFn) {\n        return new AsyncIterableObject(async (emitter) => {\n            for await (const item of iterable) {\n                emitter.emitOne(mapFn(item));\n            }\n        });\n    }\n    map(mapFn) {\n        return AsyncIterableObject.map(this, mapFn);\n    }\n    static filter(iterable, filterFn) {\n        return new AsyncIterableObject(async (emitter) => {\n            for await (const item of iterable) {\n                if (filterFn(item)) {\n                    emitter.emitOne(item);\n                }\n            }\n        });\n    }\n    filter(filterFn) {\n        return AsyncIterableObject.filter(this, filterFn);\n    }\n    static coalesce(iterable) {\n        return AsyncIterableObject.filter(iterable, item => !!item);\n    }\n    coalesce() {\n        return AsyncIterableObject.coalesce(this);\n    }\n    static async toPromise(iterable) {\n        const result = [];\n        for await (const item of iterable) {\n            result.push(item);\n        }\n        return result;\n    }\n    toPromise() {\n        return AsyncIterableObject.toPromise(this);\n    }\n    /**\n     * The value will be appended at the end.\n     *\n     * **NOTE** If `resolve()` or `reject()` have already been called, this method has no effect.\n     */\n    emitOne(value) {\n        if (this._state !== 0 /* AsyncIterableSourceState.Initial */) {\n            return;\n        }\n        // it is important to add new values at the end,\n        // as we may have iterators already running on the array\n        this._results.push(value);\n        this._onStateChanged.fire();\n    }\n    /**\n     * The values will be appended at the end.\n     *\n     * **NOTE** If `resolve()` or `reject()` have already been called, this method has no effect.\n     */\n    emitMany(values) {\n        if (this._state !== 0 /* AsyncIterableSourceState.Initial */) {\n            return;\n        }\n        // it is important to add new values at the end,\n        // as we may have iterators already running on the array\n        this._results = this._results.concat(values);\n        this._onStateChanged.fire();\n    }\n    /**\n     * Calling `resolve()` will mark the result array as complete.\n     *\n     * **NOTE** `resolve()` must be called, otherwise all consumers of this iterable will hang indefinitely, similar to a non-resolved promise.\n     * **NOTE** If `resolve()` or `reject()` have already been called, this method has no effect.\n     */\n    resolve() {\n        if (this._state !== 0 /* AsyncIterableSourceState.Initial */) {\n            return;\n        }\n        this._state = 1 /* AsyncIterableSourceState.DoneOK */;\n        this._onStateChanged.fire();\n    }\n    /**\n     * Writing an error will permanently invalidate this iterable.\n     * The current users will receive an error thrown, as will all future users.\n     *\n     * **NOTE** If `resolve()` or `reject()` have already been called, this method has no effect.\n     */\n    reject(error) {\n        if (this._state !== 0 /* AsyncIterableSourceState.Initial */) {\n            return;\n        }\n        this._state = 2 /* AsyncIterableSourceState.DoneError */;\n        this._error = error;\n        this._onStateChanged.fire();\n    }\n}\nexport class CancelableAsyncIterableObject extends AsyncIterableObject {\n    constructor(_source, executor) {\n        super(executor);\n        this._source = _source;\n    }\n    cancel() {\n        this._source.cancel();\n    }\n}\nexport function createCancelableAsyncIterable(callback) {\n    const source = new CancellationTokenSource();\n    const innerIterable = callback(source.token);\n    return new CancelableAsyncIterableObject(source, async (emitter) => {\n        const subscription = source.token.onCancellationRequested(() => {\n            subscription.dispose();\n            source.dispose();\n            emitter.reject(new CancellationError());\n        });\n        try {\n            for await (const item of innerIterable) {\n                if (source.token.isCancellationRequested) {\n                    // canceled in the meantime\n                    return;\n                }\n                emitter.emitOne(item);\n            }\n            subscription.dispose();\n            source.dispose();\n        }\n        catch (err) {\n            subscription.dispose();\n            source.dispose();\n            emitter.reject(err);\n        }\n    });\n}\n//#endregion\n"],"names":["timeout","task","token","Promises"],"mappings":";;;;;;AAUO,SAAS,WAAW,KAAK;AAC5B,SAAO,CAAC,CAAC,OAAO,OAAO,IAAI,SAAS;AACxC;AACO,SAAS,wBAAwB,UAAU;AAC9C,QAAM,SAAS,IAAI,wBAAyB;AAC5C,QAAM,WAAW,SAAS,OAAO,KAAK;AACtC,QAAM,UAAU,IAAI,QAAQ,CAAC,SAAS,WAAW;AAC7C,UAAM,eAAe,OAAO,MAAM,wBAAwB,MAAM;AAC5D,mBAAa,QAAS;AACtB,aAAO,IAAI,mBAAmB;AAAA,IAC1C,CAAS;AACD,YAAQ,QAAQ,QAAQ,EAAE,KAAK,WAAS;AACpC,mBAAa,QAAS;AACtB,aAAO,QAAS;AAChB,cAAQ,KAAK;AAAA,IAChB,GAAE,SAAO;AACN,mBAAa,QAAS;AACtB,aAAO,QAAS;AAChB,aAAO,GAAG;AAAA,IACtB,CAAS;AAAA,EACT,CAAK;AACD,SAAO,IAAI,MAAM;AAAA,IACb,SAAS;AACL,aAAO,OAAQ;AACf,aAAO,QAAS;AAAA,IAC5B;AAAA,IACQ,KAAK,SAAS,QAAQ;AAClB,aAAO,QAAQ,KAAK,SAAS,MAAM;AAAA,IAC/C;AAAA,IACQ,MAAM,QAAQ;AACV,aAAO,KAAK,KAAK,QAAW,MAAM;AAAA,IAC9C;AAAA,IACQ,QAAQ,WAAW;AACf,aAAO,QAAQ,QAAQ,SAAS;AAAA,IAC5C;AAAA,EACK;AACL;AAoCO,MAAM,UAAU;AAAA,EACnB,cAAc;AACV,SAAK,aAAa;AAClB,SAAK,gBAAgB;AACrB,SAAK,gBAAgB;AACrB,SAAK,uBAAuB;AAAA,EACpC;AAAA,EACI,MAAM,gBAAgB;AAClB,QAAI,KAAK,YAAY;AACjB,aAAO,QAAQ,OAAO,IAAI,MAAM,uBAAuB,CAAC;AAAA,IACpE;AACQ,QAAI,KAAK,eAAe;AACpB,WAAK,uBAAuB;AAC5B,UAAI,CAAC,KAAK,eAAe;AACrB,cAAM,aAAa,MAAM;AACrB,eAAK,gBAAgB;AACrB,cAAI,KAAK,YAAY;AACjB;AAAA,UACxB;AACoB,gBAAM,SAAS,KAAK,MAAM,KAAK,oBAAoB;AACnD,eAAK,uBAAuB;AAC5B,iBAAO;AAAA,QACV;AACD,aAAK,gBAAgB,IAAI,QAAQ,aAAW;AACxC,eAAK,cAAc,KAAK,YAAY,UAAU,EAAE,KAAK,OAAO;AAAA,QAChF,CAAiB;AAAA,MACjB;AACY,aAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,aAAK,cAAc,KAAK,SAAS,MAAM;AAAA,MACvD,CAAa;AAAA,IACb;AACQ,SAAK,gBAAgB,eAAgB;AACrC,WAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,WAAK,cAAc,KAAK,CAAC,WAAW;AAChC,aAAK,gBAAgB;AACrB,gBAAQ,MAAM;AAAA,MACjB,GAAE,CAAC,QAAQ;AACR,aAAK,gBAAgB;AACrB,eAAO,GAAG;AAAA,MAC1B,CAAa;AAAA,IACb,CAAS;AAAA,EACT;AAAA,EACI,UAAU;AACN,SAAK,aAAa;AAAA,EAC1B;AACA;AACA,MAAM,kBAAkB,CAACA,UAAS,OAAO;AACrC,MAAI,YAAY;AAChB,QAAM,SAAS,WAAW,MAAM;AAC5B,gBAAY;AACZ,OAAI;AAAA,EACP,GAAEA,QAAO;AACV,SAAO;AAAA,IACH,aAAa,MAAM;AAAA,IACnB,SAAS,MAAM;AACX,mBAAa,MAAM;AACnB,kBAAY;AAAA,IACf;AAAA,EACJ;AACL;AACA,MAAM,oBAAoB,CAAC,OAAO;AAC9B,MAAI,YAAY;AAChB,iBAAe,MAAM;AACjB,QAAI,WAAW;AACX,kBAAY;AACZ,SAAI;AAAA,IAChB;AAAA,EACA,CAAK;AACD,SAAO;AAAA,IACH,aAAa,MAAM;AAAA,IACnB,SAAS,MAAM;AAAE,kBAAY;AAAA,IAAQ;AAAA,EACxC;AACL;AAwBO,MAAM,QAAQ;AAAA,EACjB,YAAY,cAAc;AACtB,SAAK,eAAe;AACpB,SAAK,WAAW;AAChB,SAAK,oBAAoB;AACzB,SAAK,YAAY;AACjB,SAAK,WAAW;AAChB,SAAK,OAAO;AAAA,EACpB;AAAA,EACI,QAAQ,MAAM,QAAQ,KAAK,cAAc;AACrC,SAAK,OAAO;AACZ,SAAK,cAAe;AACpB,QAAI,CAAC,KAAK,mBAAmB;AACzB,WAAK,oBAAoB,IAAI,QAAQ,CAAC,SAAS,WAAW;AACtD,aAAK,YAAY;AACjB,aAAK,WAAW;AAAA,MAChC,CAAa,EAAE,KAAK,MAAM;AACV,aAAK,oBAAoB;AACzB,aAAK,YAAY;AACjB,YAAI,KAAK,MAAM;AACX,gBAAMC,QAAO,KAAK;AAClB,eAAK,OAAO;AACZ,iBAAOA,MAAM;AAAA,QACjC;AACgB,eAAO;AAAA,MACvB,CAAa;AAAA,IACb;AACQ,UAAM,KAAK,MAAM;;AACb,WAAK,WAAW;AAChB,iBAAK,cAAL,8BAAiB;AAAA,IACpB;AACD,SAAK,WAAW,UAAU,iBAAiB,kBAAkB,EAAE,IAAI,gBAAgB,OAAO,EAAE;AAC5F,WAAO,KAAK;AAAA,EACpB;AAAA,EACI,cAAc;;AACV,WAAO,CAAC,GAAC,UAAK,aAAL,mBAAe;AAAA,EAChC;AAAA,EACI,SAAS;;AACL,SAAK,cAAe;AACpB,QAAI,KAAK,mBAAmB;AACxB,iBAAK,aAAL,8BAAgB,IAAI;AACpB,WAAK,oBAAoB;AAAA,IACrC;AAAA,EACA;AAAA,EACI,gBAAgB;;AACZ,eAAK,aAAL,mBAAe;AACf,SAAK,WAAW;AAAA,EACxB;AAAA,EACI,UAAU;AACN,SAAK,OAAQ;AAAA,EACrB;AACA;AAUO,MAAM,iBAAiB;AAAA,EAC1B,YAAY,cAAc;AACtB,SAAK,UAAU,IAAI,QAAQ,YAAY;AACvC,SAAK,YAAY,IAAI,UAAW;AAAA,EACxC;AAAA,EACI,QAAQ,gBAAgB,OAAO;AAC3B,WAAO,KAAK,QAAQ,QAAQ,MAAM,KAAK,UAAU,MAAM,cAAc,GAAG,KAAK;AAAA,EACrF;AAAA,EACI,SAAS;AACL,SAAK,QAAQ,OAAQ;AAAA,EAC7B;AAAA,EACI,UAAU;AACN,SAAK,QAAQ,QAAS;AACtB,SAAK,UAAU,QAAS;AAAA,EAChC;AACA;AACO,SAAS,QAAQ,QAAQ,OAAO;AACnC,MAAI,CAAC,OAAO;AACR,WAAO,wBAAwB,CAAAC,WAAS,QAAQ,QAAQA,MAAK,CAAC;AAAA,EACtE;AACI,SAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,UAAM,SAAS,WAAW,MAAM;AAC5B,iBAAW,QAAS;AACpB,cAAS;AAAA,IACZ,GAAE,MAAM;AACT,UAAM,aAAa,MAAM,wBAAwB,MAAM;AACnD,mBAAa,MAAM;AACnB,iBAAW,QAAS;AACpB,aAAO,IAAI,mBAAmB;AAAA,IAC1C,CAAS;AAAA,EACT,CAAK;AACL;AAkBO,SAAS,kBAAkB,SAASF,WAAU,GAAG,OAAO;AAC3D,QAAM,QAAQ,WAAW,MAAM;AAC3B,YAAS;AACT,QAAI,OAAO;AACP,iBAAW,QAAS;AAAA,IAChC;AAAA,EACK,GAAEA,QAAO;AACV,QAAM,aAAa,aAAa,MAAM;AAClC,iBAAa,KAAK;AAClB,mCAAO,cAAc;AAAA,EAC7B,CAAK;AACD,iCAAO,IAAI;AACX,SAAO;AACX;AAmBO,MAAM,aAAa;AAAA,EACtB,YAAY,QAAQA,UAAS;AACzB,SAAK,cAAc;AACnB,SAAK,SAAS;AACd,QAAI,OAAO,WAAW,cAAc,OAAOA,aAAY,UAAU;AAC7D,WAAK,YAAY,QAAQA,QAAO;AAAA,IAC5C;AAAA,EACA;AAAA,EACI,UAAU;AACN,SAAK,OAAQ;AACb,SAAK,cAAc;AAAA,EAC3B;AAAA,EACI,SAAS;AACL,QAAI,KAAK,WAAW,IAAI;AACpB,mBAAa,KAAK,MAAM;AACxB,WAAK,SAAS;AAAA,IAC1B;AAAA,EACA;AAAA,EACI,aAAa,QAAQA,UAAS;AAC1B,QAAI,KAAK,aAAa;AAClB,YAAM,IAAI,mBAAmB,mDAAmD;AAAA,IAC5F;AACQ,SAAK,OAAQ;AACb,SAAK,SAAS,WAAW,MAAM;AAC3B,WAAK,SAAS;AACd,aAAQ;AAAA,IACX,GAAEA,QAAO;AAAA,EAClB;AAAA,EACI,YAAY,QAAQA,UAAS;AACzB,QAAI,KAAK,aAAa;AAClB,YAAM,IAAI,mBAAmB,kDAAkD;AAAA,IAC3F;AACQ,QAAI,KAAK,WAAW,IAAI;AAEpB;AAAA,IACZ;AACQ,SAAK,SAAS,WAAW,MAAM;AAC3B,WAAK,SAAS;AACd,aAAQ;AAAA,IACX,GAAEA,QAAO;AAAA,EAClB;AACA;AACO,MAAM,cAAc;AAAA,EACvB,cAAc;AACV,SAAK,aAAa;AAClB,SAAK,aAAa;AAAA,EAC1B;AAAA,EACI,SAAS;;AACL,eAAK,eAAL,mBAAiB;AACjB,SAAK,aAAa;AAAA,EAC1B;AAAA,EACI,aAAa,QAAQ,UAAU,UAAU,YAAY;AACjD,QAAI,KAAK,YAAY;AACjB,YAAM,IAAI,mBAAmB,oDAAoD;AAAA,IAC7F;AACQ,SAAK,OAAQ;AACb,UAAM,SAAS,QAAQ,YAAY,MAAM;AACrC,aAAQ;AAAA,IACX,GAAE,QAAQ;AACX,SAAK,aAAa,aAAa,MAAM;AACjC,cAAQ,cAAc,MAAM;AAC5B,WAAK,aAAa;AAAA,IAC9B,CAAS;AAAA,EACT;AAAA,EACI,UAAU;AACN,SAAK,OAAQ;AACb,SAAK,aAAa;AAAA,EAC1B;AACA;AACO,MAAM,iBAAiB;AAAA,EAC1B,YAAY,QAAQ,OAAO;AACvB,SAAK,eAAe;AACpB,SAAK,SAAS;AACd,SAAK,UAAU;AACf,SAAK,iBAAiB,KAAK,UAAU,KAAK,IAAI;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA,EAII,UAAU;AACN,SAAK,OAAQ;AACb,SAAK,SAAS;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAII,SAAS;AACL,QAAI,KAAK,eAAe;AACpB,mBAAa,KAAK,YAAY;AAC9B,WAAK,eAAe;AAAA,IAChC;AAAA,EACA;AAAA;AAAA;AAAA;AAAA,EAII,SAAS,QAAQ,KAAK,SAAS;AAC3B,SAAK,OAAQ;AACb,SAAK,eAAe,WAAW,KAAK,gBAAgB,KAAK;AAAA,EACjE;AAAA,EACI,IAAI,QAAQ;AACR,WAAO,KAAK;AAAA,EACpB;AAAA,EACI,IAAI,MAAM,OAAO;AACb,SAAK,UAAU;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAII,cAAc;AACV,WAAO,KAAK,iBAAiB;AAAA,EACrC;AAAA,EACI,YAAY;AACR,SAAK,eAAe;AACpB,QAAI,KAAK,QAAQ;AACb,WAAK,MAAO;AAAA,IACxB;AAAA,EACA;AAAA,EACI,QAAQ;;AACJ,eAAK,WAAL;AAAA,EACR;AACA;AAsBU,IAAC;AACD,IAAC;AAAA,CACV,WAAY;AACT,MAAI,OAAO,WAAW,wBAAwB,cAAc,OAAO,WAAW,uBAAuB,YAAY;AAC7G,mBAAe,CAAC,eAAe,WAAW;AACtC,kBAAY,MAAM;AACd,YAAI,UAAU;AACV;AAAA,QACpB;AACgB,cAAM,MAAM,KAAK,IAAG,IAAK;AACzB,cAAM,WAAW;AAAA,UACb,YAAY;AAAA,UACZ,gBAAgB;AACZ,mBAAO,KAAK,IAAI,GAAG,MAAM,KAAK,KAAK;AAAA,UAC3D;AAAA,QACiB;AACD,eAAO,OAAO,OAAO,QAAQ,CAAC;AAAA,MAC9C,CAAa;AACD,UAAI,WAAW;AACf,aAAO;AAAA,QACH,UAAU;AACN,cAAI,UAAU;AACV;AAAA,UACxB;AACoB,qBAAW;AAAA,QAC/B;AAAA,MACa;AAAA,IACJ;AAAA,EACT,OACS;AACD,mBAAe,CAAC,cAAc,QAAQA,aAAY;AAC9C,YAAM,SAAS,aAAa,oBAAoB,QAAQ,OAAOA,aAAY,WAAW,EAAE,SAAAA,SAAS,IAAG,MAAS;AAC7G,UAAI,WAAW;AACf,aAAO;AAAA,QACH,UAAU;AACN,cAAI,UAAU;AACV;AAAA,UACxB;AACoB,qBAAW;AACX,uBAAa,mBAAmB,MAAM;AAAA,QAC1D;AAAA,MACa;AAAA,IACJ;AAAA,EACT;AACI,sBAAoB,CAAC,WAAW,aAAa,YAAY,MAAM;AACnE,GAAI;AACG,MAAM,kBAAkB;AAAA,EAC3B,YAAY,cAAc,UAAU;AAChC,SAAK,UAAU;AACf,SAAK,YAAY,MAAM;AACnB,UAAI;AACA,aAAK,SAAS,SAAU;AAAA,MACxC,SACmB,KAAK;AACR,aAAK,SAAS;AAAA,MAC9B,UACoB;AACJ,aAAK,UAAU;AAAA,MAC/B;AAAA,IACS;AACD,SAAK,UAAU,aAAa,cAAc,MAAM,KAAK,WAAW;AAAA,EACxE;AAAA,EACI,UAAU;AACN,SAAK,QAAQ,QAAS;AAAA,EAC9B;AAAA,EACI,IAAI,QAAQ;AACR,QAAI,CAAC,KAAK,SAAS;AACf,WAAK,QAAQ,QAAS;AACtB,WAAK,UAAW;AAAA,IAC5B;AACQ,QAAI,KAAK,QAAQ;AACb,YAAM,KAAK;AAAA,IACvB;AACQ,WAAO,KAAK;AAAA,EACpB;AAAA,EACI,IAAI,gBAAgB;AAChB,WAAO,KAAK;AAAA,EACpB;AACA;AAOO,MAAM,wBAAwB,kBAAkB;AAAA,EACnD,YAAY,UAAU;AAClB,UAAM,YAAY,QAAQ;AAAA,EAClC;AACA;AAIO,MAAM,gBAAgB;AAAA,EACzB,IAAI,aAAa;;AACb,aAAO,UAAK,YAAL,mBAAc,aAAY;AAAA,EACzC;AAAA,EACI,IAAI,YAAY;AACZ,WAAO,CAAC,CAAC,KAAK;AAAA,EACtB;AAAA,EACI,cAAc;AACV,SAAK,IAAI,IAAI,QAAQ,CAAC,GAAG,MAAM;AAC3B,WAAK,mBAAmB;AACxB,WAAK,gBAAgB;AAAA,IACjC,CAAS;AAAA,EACT;AAAA,EACI,SAAS,OAAO;AACZ,WAAO,IAAI,QAAQ,aAAW;AAC1B,WAAK,iBAAiB,KAAK;AAC3B,WAAK,UAAU,EAAE,SAAS,GAAkC,MAAO;AACnE,cAAS;AAAA,IACrB,CAAS;AAAA,EACT;AAAA,EACI,MAAM,KAAK;AACP,WAAO,IAAI,QAAQ,aAAW;AAC1B,WAAK,cAAc,GAAG;AACtB,WAAK,UAAU,EAAE,SAAS,GAAkC,OAAO,IAAK;AACxE,cAAS;AAAA,IACrB,CAAS;AAAA,EACT;AAAA,EACI,SAAS;AACL,WAAO,KAAK,MAAM,IAAI,mBAAmB;AAAA,EACjD;AACA;AAGU,IAAC;AAAA,CACV,SAAUG,WAAU;AAQjB,iBAAe,QAAQ,UAAU;AAC7B,QAAI,aAAa;AACjB,UAAM,SAAS,MAAM,QAAQ,IAAI,SAAS,IAAI,aAAW,QAAQ,KAAK,WAAS,OAAO,WAAS;AAC3F,UAAI,CAAC,YAAY;AACb,qBAAa;AAAA,MAC7B;AACY,aAAO;AAAA,IACV,CAAA,CAAC,CAAC;AACH,QAAI,OAAO,eAAe,aAAa;AACnC,YAAM;AAAA,IAClB;AACQ,WAAO;AAAA,EACf;AACI,EAAAA,UAAS,UAAU;AAWnB,WAAS,cAAc,QAAQ;AAE3B,WAAO,IAAI,QAAQ,OAAO,SAAS,WAAW;AAC1C,UAAI;AACA,cAAM,OAAO,SAAS,MAAM;AAAA,MAC5C,SACmB,OAAO;AACV,eAAO,KAAK;AAAA,MAC5B;AAAA,IACA,CAAS;AAAA,EACT;AACI,EAAAA,UAAS,gBAAgB;AAC7B,GAAG,aAAa,WAAW,CAAA,EAAG;AAIvB,MAAM,uBAAN,MAAM,qBAAoB;AAAA,EAC7B,OAAO,UAAU,OAAO;AACpB,WAAO,IAAI,qBAAoB,CAAC,WAAW;AACvC,aAAO,SAAS,KAAK;AAAA,IACjC,CAAS;AAAA,EACT;AAAA,EACI,OAAO,YAAY,SAAS;AACxB,WAAO,IAAI,qBAAoB,OAAO,YAAY;AAC9C,cAAQ,SAAS,MAAM,OAAO;AAAA,IAC1C,CAAS;AAAA,EACT;AAAA,EACI,OAAO,aAAa,UAAU;AAC1B,WAAO,IAAI,qBAAoB,OAAO,YAAY;AAC9C,YAAM,QAAQ,IAAI,SAAS,IAAI,OAAO,MAAM,QAAQ,QAAQ,MAAM,CAAC,CAAC,CAAC;AAAA,IACjF,CAAS;AAAA,EACT;AAAA,EACI,OAAO,MAAM,WAAW;AACpB,WAAO,IAAI,qBAAoB,OAAO,YAAY;AAC9C,YAAM,QAAQ,IAAI,UAAU,IAAI,OAAO,aAAa;AAChD,yBAAiB,QAAQ,UAAU;AAC/B,kBAAQ,QAAQ,IAAI;AAAA,QACxC;AAAA,MACA,CAAa,CAAC;AAAA,IACd,CAAS;AAAA,EACT;AAAA,EAEI,YAAY,UAAU,UAAU;AAC5B,SAAK,SAAS;AACd,SAAK,WAAW,CAAE;AAClB,SAAK,SAAS;AACd,SAAK,YAAY;AACjB,SAAK,kBAAkB,IAAI,QAAS;AACpC,mBAAe,YAAY;AACvB,YAAM,SAAS;AAAA,QACX,SAAS,CAAC,SAAS,KAAK,QAAQ,IAAI;AAAA,QACpC,UAAU,CAAC,UAAU,KAAK,SAAS,KAAK;AAAA,QACxC,QAAQ,CAAC,UAAU,KAAK,OAAO,KAAK;AAAA,MACvC;AACD,UAAI;AACA,cAAM,QAAQ,QAAQ,SAAS,MAAM,CAAC;AACtC,aAAK,QAAS;AAAA,MAC9B,SACmB,KAAK;AACR,aAAK,OAAO,GAAG;AAAA,MAC/B,UACoB;AACJ,eAAO,UAAU;AACjB,eAAO,WAAW;AAClB,eAAO,SAAS;AAAA,MAChC;AAAA,IACA,CAAS;AAAA,EACT;AAAA,EACI,CAAC,OAAO,aAAa,IAAI;AACrB,QAAI,IAAI;AACR,WAAO;AAAA,MACH,MAAM,YAAY;AACd,WAAG;AACC,cAAI,KAAK,WAAW,GAA4C;AAC5D,kBAAM,KAAK;AAAA,UACnC;AACoB,cAAI,IAAI,KAAK,SAAS,QAAQ;AAC1B,mBAAO,EAAE,MAAM,OAAO,OAAO,KAAK,SAAS,GAAG,EAAG;AAAA,UACzE;AACoB,cAAI,KAAK,WAAW,GAAyC;AACzD,mBAAO,EAAE,MAAM,MAAM,OAAO,OAAW;AAAA,UAC/D;AACoB,gBAAM,MAAM,UAAU,KAAK,gBAAgB,KAAK;AAAA,QACpE,SAAyB;AAAA,MACZ;AAAA,MACD,QAAQ,YAAY;;AAChB,mBAAK,cAAL;AACA,eAAO,EAAE,MAAM,MAAM,OAAO,OAAW;AAAA,MACvD;AAAA,IACS;AAAA,EACT;AAAA,EACI,OAAO,IAAI,UAAU,OAAO;AACxB,WAAO,IAAI,qBAAoB,OAAO,YAAY;AAC9C,uBAAiB,QAAQ,UAAU;AAC/B,gBAAQ,QAAQ,MAAM,IAAI,CAAC;AAAA,MAC3C;AAAA,IACA,CAAS;AAAA,EACT;AAAA,EACI,IAAI,OAAO;AACP,WAAO,qBAAoB,IAAI,MAAM,KAAK;AAAA,EAClD;AAAA,EACI,OAAO,OAAO,UAAU,UAAU;AAC9B,WAAO,IAAI,qBAAoB,OAAO,YAAY;AAC9C,uBAAiB,QAAQ,UAAU;AAC/B,YAAI,SAAS,IAAI,GAAG;AAChB,kBAAQ,QAAQ,IAAI;AAAA,QACxC;AAAA,MACA;AAAA,IACA,CAAS;AAAA,EACT;AAAA,EACI,OAAO,UAAU;AACb,WAAO,qBAAoB,OAAO,MAAM,QAAQ;AAAA,EACxD;AAAA,EACI,OAAO,SAAS,UAAU;AACtB,WAAO,qBAAoB,OAAO,UAAU,UAAQ,CAAC,CAAC,IAAI;AAAA,EAClE;AAAA,EACI,WAAW;AACP,WAAO,qBAAoB,SAAS,IAAI;AAAA,EAChD;AAAA,EACI,aAAa,UAAU,UAAU;AAC7B,UAAM,SAAS,CAAE;AACjB,qBAAiB,QAAQ,UAAU;AAC/B,aAAO,KAAK,IAAI;AAAA,IAC5B;AACQ,WAAO;AAAA,EACf;AAAA,EACI,YAAY;AACR,WAAO,qBAAoB,UAAU,IAAI;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMI,QAAQ,OAAO;AACX,QAAI,KAAK,WAAW,GAA0C;AAC1D;AAAA,IACZ;AAGQ,SAAK,SAAS,KAAK,KAAK;AACxB,SAAK,gBAAgB,KAAM;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMI,SAAS,QAAQ;AACb,QAAI,KAAK,WAAW,GAA0C;AAC1D;AAAA,IACZ;AAGQ,SAAK,WAAW,KAAK,SAAS,OAAO,MAAM;AAC3C,SAAK,gBAAgB,KAAM;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOI,UAAU;AACN,QAAI,KAAK,WAAW,GAA0C;AAC1D;AAAA,IACZ;AACQ,SAAK,SAAS;AACd,SAAK,gBAAgB,KAAM;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOI,OAAO,OAAO;AACV,QAAI,KAAK,WAAW,GAA0C;AAC1D;AAAA,IACZ;AACQ,SAAK,SAAS;AACd,SAAK,SAAS;AACd,SAAK,gBAAgB,KAAM;AAAA,EACnC;AACA;AA/Ia,qBAAK,QAAQ,qBAAoB,UAAU,CAAE,CAAA;AAzBnD,IAAM,sBAAN;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/cancellation.es.js

@@ -94,16 +94,8 @@ class CancellationTokenSource {
     }
   }
 }
-function cancelOnDispose(store) {
-  const source = new CancellationTokenSource();
-  store.add({ dispose() {
-    source.cancel();
-  } });
-  return source.token;
-}
 export {
   CancellationToken,
-  CancellationTokenSource,
-  cancelOnDispose
+  CancellationTokenSource
 };
 //# sourceMappingURL=cancellation.es.js.map

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/cancellation.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"cancellation.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/cancellation.js"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\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        if (cancel) {\n            this.cancel();\n        }\n        this._parentListener?.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}\nexport function cancelOnDispose(store) {\n    const source = new CancellationTokenSource();\n    store.add({ dispose() { source.cancel(); } });\n    return source.token;\n}\n"],"names":["CancellationToken"],"mappings":";AAKA,MAAM,gBAAgB,OAAO,OAAO,SAAU,UAAU,SAAS;AAC7D,QAAM,SAAS,WAAW,SAAS,KAAK,OAAO,GAAG,CAAC;AACnD,SAAO,EAAE,UAAU;AAAE,iBAAa,MAAM;AAAA,EAAE,EAAI;AAClD,CAAC;AACS,IAAC;AAAA,CACV,SAAUA,oBAAmB;AAC1B,WAAS,oBAAoB,OAAO;AAChC,QAAI,UAAUA,mBAAkB,QAAQ,UAAUA,mBAAkB,WAAW;AAC3E,aAAO;AAAA,IACnB;AACQ,QAAI,iBAAiB,cAAc;AAC/B,aAAO;AAAA,IACnB;AACQ,QAAI,CAAC,SAAS,OAAO,UAAU,UAAU;AACrC,aAAO;AAAA,IACnB;AACQ,WAAO,OAAO,MAAM,4BAA4B,aACzC,OAAO,MAAM,4BAA4B;AAAA,EACxD;AACI,EAAAA,mBAAkB,sBAAsB;AACxC,EAAAA,mBAAkB,OAAO,OAAO,OAAO;AAAA,IACnC,yBAAyB;AAAA,IACzB,yBAAyB,MAAM;AAAA,EACvC,CAAK;AACD,EAAAA,mBAAkB,YAAY,OAAO,OAAO;AAAA,IACxC,yBAAyB;AAAA,IACzB,yBAAyB;AAAA,EACjC,CAAK;AACL,GAAG,sBAAsB,oBAAoB,CAAA,EAAG;AAChD,MAAM,aAAa;AAAA,EACf,cAAc;AACV,SAAK,eAAe;AACpB,SAAK,WAAW;AAAA,EACxB;AAAA,EACI,SAAS;AACL,QAAI,CAAC,KAAK,cAAc;AACpB,WAAK,eAAe;AACpB,UAAI,KAAK,UAAU;AACf,aAAK,SAAS,KAAK,MAAS;AAC5B,aAAK,QAAS;AAAA,MAC9B;AAAA,IACA;AAAA,EACA;AAAA,EACI,IAAI,0BAA0B;AAC1B,WAAO,KAAK;AAAA,EACpB;AAAA,EACI,IAAI,0BAA0B;AAC1B,QAAI,KAAK,cAAc;AACnB,aAAO;AAAA,IACnB;AACQ,QAAI,CAAC,KAAK,UAAU;AAChB,WAAK,WAAW,IAAI,QAAS;AAAA,IACzC;AACQ,WAAO,KAAK,SAAS;AAAA,EAC7B;AAAA,EACI,UAAU;AACN,QAAI,KAAK,UAAU;AACf,WAAK,SAAS,QAAS;AACvB,WAAK,WAAW;AAAA,IAC5B;AAAA,EACA;AACA;AACO,MAAM,wBAAwB;AAAA,EACjC,YAAY,QAAQ;AAChB,SAAK,SAAS;AACd,SAAK,kBAAkB;AACvB,SAAK,kBAAkB,UAAU,OAAO,wBAAwB,KAAK,QAAQ,IAAI;AAAA,EACzF;AAAA,EACI,IAAI,QAAQ;AACR,QAAI,CAAC,KAAK,QAAQ;AAGd,WAAK,SAAS,IAAI,aAAc;AAAA,IAC5C;AACQ,WAAO,KAAK;AAAA,EACpB;AAAA,EACI,SAAS;AACL,QAAI,CAAC,KAAK,QAAQ;AAId,WAAK,SAAS,kBAAkB;AAAA,IAC5C,WACiB,KAAK,kBAAkB,cAAc;AAE1C,WAAK,OAAO,OAAQ;AAAA,IAChC;AAAA,EACA;AAAA,EACI,QAAQ,SAAS,OAAO;;AACpB,QAAI,QAAQ;AACR,WAAK,OAAQ;AAAA,IACzB;AACQ,eAAK,oBAAL,mBAAsB;AACtB,QAAI,CAAC,KAAK,QAAQ;AAEd,WAAK,SAAS,kBAAkB;AAAA,IAC5C,WACiB,KAAK,kBAAkB,cAAc;AAE1C,WAAK,OAAO,QAAS;AAAA,IACjC;AAAA,EACA;AACA;AACO,SAAS,gBAAgB,OAAO;AACnC,QAAM,SAAS,IAAI,wBAAyB;AAC5C,QAAM,IAAI,EAAE,UAAU;AAAE,WAAO,OAAM;AAAA,EAAG,GAAI;AAC5C,SAAO,OAAO;AAClB;","x_google_ignoreList":[0]}
+{"version":3,"file":"cancellation.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/cancellation.js"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\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        if (cancel) {\n            this.cancel();\n        }\n        this._parentListener?.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}\nexport function cancelOnDispose(store) {\n    const source = new CancellationTokenSource();\n    store.add({ dispose() { source.cancel(); } });\n    return source.token;\n}\n"],"names":["CancellationToken"],"mappings":";AAKA,MAAM,gBAAgB,OAAO,OAAO,SAAU,UAAU,SAAS;AAC7D,QAAM,SAAS,WAAW,SAAS,KAAK,OAAO,GAAG,CAAC;AACnD,SAAO,EAAE,UAAU;AAAE,iBAAa,MAAM;AAAA,EAAE,EAAI;AAClD,CAAC;AACS,IAAC;AAAA,CACV,SAAUA,oBAAmB;AAC1B,WAAS,oBAAoB,OAAO;AAChC,QAAI,UAAUA,mBAAkB,QAAQ,UAAUA,mBAAkB,WAAW;AAC3E,aAAO;AAAA,IACnB;AACQ,QAAI,iBAAiB,cAAc;AAC/B,aAAO;AAAA,IACnB;AACQ,QAAI,CAAC,SAAS,OAAO,UAAU,UAAU;AACrC,aAAO;AAAA,IACnB;AACQ,WAAO,OAAO,MAAM,4BAA4B,aACzC,OAAO,MAAM,4BAA4B;AAAA,EACxD;AACI,EAAAA,mBAAkB,sBAAsB;AACxC,EAAAA,mBAAkB,OAAO,OAAO,OAAO;AAAA,IACnC,yBAAyB;AAAA,IACzB,yBAAyB,MAAM;AAAA,EACvC,CAAK;AACD,EAAAA,mBAAkB,YAAY,OAAO,OAAO;AAAA,IACxC,yBAAyB;AAAA,IACzB,yBAAyB;AAAA,EACjC,CAAK;AACL,GAAG,sBAAsB,oBAAoB,CAAA,EAAG;AAChD,MAAM,aAAa;AAAA,EACf,cAAc;AACV,SAAK,eAAe;AACpB,SAAK,WAAW;AAAA,EACxB;AAAA,EACI,SAAS;AACL,QAAI,CAAC,KAAK,cAAc;AACpB,WAAK,eAAe;AACpB,UAAI,KAAK,UAAU;AACf,aAAK,SAAS,KAAK,MAAS;AAC5B,aAAK,QAAS;AAAA,MAC9B;AAAA,IACA;AAAA,EACA;AAAA,EACI,IAAI,0BAA0B;AAC1B,WAAO,KAAK;AAAA,EACpB;AAAA,EACI,IAAI,0BAA0B;AAC1B,QAAI,KAAK,cAAc;AACnB,aAAO;AAAA,IACnB;AACQ,QAAI,CAAC,KAAK,UAAU;AAChB,WAAK,WAAW,IAAI,QAAS;AAAA,IACzC;AACQ,WAAO,KAAK,SAAS;AAAA,EAC7B;AAAA,EACI,UAAU;AACN,QAAI,KAAK,UAAU;AACf,WAAK,SAAS,QAAS;AACvB,WAAK,WAAW;AAAA,IAC5B;AAAA,EACA;AACA;AACO,MAAM,wBAAwB;AAAA,EACjC,YAAY,QAAQ;AAChB,SAAK,SAAS;AACd,SAAK,kBAAkB;AACvB,SAAK,kBAAkB,UAAU,OAAO,wBAAwB,KAAK,QAAQ,IAAI;AAAA,EACzF;AAAA,EACI,IAAI,QAAQ;AACR,QAAI,CAAC,KAAK,QAAQ;AAGd,WAAK,SAAS,IAAI,aAAc;AAAA,IAC5C;AACQ,WAAO,KAAK;AAAA,EACpB;AAAA,EACI,SAAS;AACL,QAAI,CAAC,KAAK,QAAQ;AAId,WAAK,SAAS,kBAAkB;AAAA,IAC5C,WACiB,KAAK,kBAAkB,cAAc;AAE1C,WAAK,OAAO,OAAQ;AAAA,IAChC;AAAA,EACA;AAAA,EACI,QAAQ,SAAS,OAAO;;AACpB,QAAI,QAAQ;AACR,WAAK,OAAQ;AAAA,IACzB;AACQ,eAAK,oBAAL,mBAAsB;AACtB,QAAI,CAAC,KAAK,QAAQ;AAEd,WAAK,SAAS,kBAAkB;AAAA,IAC5C,WACiB,KAAK,kBAAkB,cAAc;AAE1C,WAAK,OAAO,QAAS;AAAA,IACjC;AAAA,EACA;AACA;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/equals.es.js

@@ -1,19 +1,10 @@
 import { equals } from "./arrays.es.js";
 const strictEquals = (a, b) => a === b;
-function itemsEquals(itemEquals2 = strictEquals) {
-  return (a, b) => equals(a, b, itemEquals2);
-}
-function itemEquals() {
-  return (a, b) => a.equals(b);
+function itemsEquals(itemEquals = strictEquals) {
+  return (a, b) => equals(a, b, itemEquals);
 }
 function equalsIfDefined(equalsOrV1, v2, equals2) {
-  if (equals2 !== void 0) {
-    const v1 = equalsOrV1;
-    if (v1 === void 0 || v1 === null || v2 === void 0 || v2 === null) {
-      return v2 === v1;
-    }
-    return equals2(v1, v2);
-  } else {
+  {
     const equals3 = equalsOrV1;
     return (v1, v22) => {
       if (v1 === void 0 || v1 === null || v22 === void 0 || v22 === null) {
@@ -23,49 +14,9 @@ function equalsIfDefined(equalsOrV1, v2, equals2) {
     };
   }
 }
-function structuralEquals(a, b) {
-  if (a === b) {
-    return true;
-  }
-  if (Array.isArray(a) && Array.isArray(b)) {
-    if (a.length !== b.length) {
-      return false;
-    }
-    for (let i = 0; i < a.length; i++) {
-      if (!structuralEquals(a[i], b[i])) {
-        return false;
-      }
-    }
-    return true;
-  }
-  if (a && typeof a === "object" && b && typeof b === "object") {
-    if (Object.getPrototypeOf(a) === Object.prototype && Object.getPrototypeOf(b) === Object.prototype) {
-      const aObj = a;
-      const bObj = b;
-      const keysA = Object.keys(aObj);
-      const keysB = Object.keys(bObj);
-      const keysBSet = new Set(keysB);
-      if (keysA.length !== keysB.length) {
-        return false;
-      }
-      for (const key of keysA) {
-        if (!keysBSet.has(key)) {
-          return false;
-        }
-        if (!structuralEquals(aObj[key], bObj[key])) {
-          return false;
-        }
-      }
-      return true;
-    }
-  }
-  return false;
-}
 export {
   equalsIfDefined,
-  itemEquals,
   itemsEquals,
-  strictEquals,
-  structuralEquals
+  strictEquals
 };
 //# sourceMappingURL=equals.es.js.map