@opensumi/ide-core-common 2.17.8 → 2.18.0

package/lib/arrays.js

@@ -1,545 +0,0 @@
-"use strict";
-/* ---------------------------------------------------------------------------------------------
- *  Copyright (c) Microsoft Corporation. All rights reserved.
- *  Licensed under the MIT License. See License.txt in the project root for license information.
- *--------------------------------------------------------------------------------------------*/
-// Some code copied and modified from https://github.com/microsoft/vscode/blob/1.44.0/src/vs/base/common/arrays.ts
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.mapFind = exports.asArray = exports.mapArrayOrNot = exports.find = exports.pushToEnd = exports.pushToStart = exports.shuffle = exports.arrayInsert = exports.insert = exports.index = exports.fill = exports.range = exports.flatten = exports.commonPrefixLength = exports.first = exports.firstIndex = exports.lastIndex = exports.uniqueFilter = exports.distinctES6 = exports.distinct = exports.isNonEmptyArray = exports.isFalsyOrEmpty = exports.move = exports.coalesceInPlace = exports.coalesce = exports.topAsync = exports.top = exports.delta = exports.sortedDiff = exports.groupBy = exports.mergeSort = exports.findFirstInSorted = exports.binarySearch = exports.equals = exports.tail2 = exports.tail = void 0;
-const errors_1 = require("./errors");
-/**
- * Returns the last element of an array.
- * @param array The array.
- * @param n Which element from the end (default is zero).
- */
-function tail(array, n = 0) {
-    return array[array.length - (1 + n)];
-}
-exports.tail = tail;
-function tail2(arr) {
-    if (arr.length === 0) {
-        throw new Error('Invalid tail call');
-    }
-    return [arr.slice(0, arr.length - 1), arr[arr.length - 1]];
-}
-exports.tail2 = tail2;
-function equals(one, other, itemEquals = (a, b) => a === b) {
-    if (one === other) {
-        return true;
-    }
-    if (!one || !other) {
-        return false;
-    }
-    if (one.length !== other.length) {
-        return false;
-    }
-    for (let i = 0, len = one.length; i < len; i++) {
-        if (!itemEquals(one[i], other[i])) {
-            return false;
-        }
-    }
-    return true;
-}
-exports.equals = equals;
-function binarySearch(array, key, comparator) {
-    let low = 0;
-    let high = array.length - 1;
-    while (low <= high) {
-        const mid = ((low + high) / 2) | 0;
-        const comp = comparator(array[mid], key);
-        if (comp < 0) {
-            low = mid + 1;
-        }
-        else if (comp > 0) {
-            high = mid - 1;
-        }
-        else {
-            return mid;
-        }
-    }
-    return -(low + 1);
-}
-exports.binarySearch = binarySearch;
-/**
- * Takes a sorted array and a function p. The array is sorted in such a way that all elements where p(x) is false
- * are located before all elements where p(x) is true.
- * @returns the least x for which p(x) is true or array.length if no element fullfills the given function.
- */
-function findFirstInSorted(array, p) {
-    let low = 0;
-    let high = array.length;
-    if (high === 0) {
-        return 0; // no children
-    }
-    while (low < high) {
-        const mid = Math.floor((low + high) / 2);
-        if (p(array[mid])) {
-            high = mid;
-        }
-        else {
-            low = mid + 1;
-        }
-    }
-    return low;
-}
-exports.findFirstInSorted = findFirstInSorted;
-/**
- * Like `Array#sort` but always stable. Usually runs a little slower `than Array#sort`
- * so only use this when actually needing stable sort.
- */
-function mergeSort(data, compare) {
-    _sort(data, compare, 0, data.length - 1, []);
-    return data;
-}
-exports.mergeSort = mergeSort;
-function _merge(a, compare, lo, mid, hi, aux) {
-    let leftIdx = lo;
-    let rightIdx = mid + 1;
-    for (let i = lo; i <= hi; i++) {
-        aux[i] = a[i];
-    }
-    for (let i = lo; i <= hi; i++) {
-        if (leftIdx > mid) {
-            // left side consumed
-            a[i] = aux[rightIdx++];
-        }
-        else if (rightIdx > hi) {
-            // right side consumed
-            a[i] = aux[leftIdx++];
-        }
-        else if (compare(aux[rightIdx], aux[leftIdx]) < 0) {
-            // right element is less -> comes first
-            a[i] = aux[rightIdx++];
-        }
-        else {
-            // left element comes first (less or equal)
-            a[i] = aux[leftIdx++];
-        }
-    }
-}
-function _sort(a, compare, lo, hi, aux) {
-    if (hi <= lo) {
-        return;
-    }
-    const mid = (lo + (hi - lo) / 2) | 0;
-    _sort(a, compare, lo, mid, aux);
-    _sort(a, compare, mid + 1, hi, aux);
-    if (compare(a[mid], a[mid + 1]) <= 0) {
-        // left and right are sorted and if the last-left element is less
-        // or equals than the first-right element there is nothing else
-        // to do
-        return;
-    }
-    _merge(a, compare, lo, mid, hi, aux);
-}
-function groupBy(data, compare) {
-    const result = [];
-    let currentGroup;
-    for (const element of mergeSort(data.slice(0), compare)) {
-        if (!currentGroup || compare(currentGroup[0], element) !== 0) {
-            currentGroup = [element];
-            result.push(currentGroup);
-        }
-        else {
-            currentGroup.push(element);
-        }
-    }
-    return result;
-}
-exports.groupBy = groupBy;
-/**
- * Diffs two *sorted* arrays and computes the splices which apply the diff.
- */
-function sortedDiff(before, after, compare) {
-    const result = [];
-    function pushSplice(start, deleteCount, toInsert) {
-        if (deleteCount === 0 && toInsert.length === 0) {
-            return;
-        }
-        const latest = result[result.length - 1];
-        if (latest && latest.start + latest.deleteCount === start) {
-            latest.deleteCount += deleteCount;
-            latest.toInsert.push(...toInsert);
-        }
-        else {
-            result.push({ start, deleteCount, toInsert });
-        }
-    }
-    let beforeIdx = 0;
-    let afterIdx = 0;
-    while (true) {
-        if (beforeIdx === before.length) {
-            pushSplice(beforeIdx, 0, after.slice(afterIdx));
-            break;
-        }
-        if (afterIdx === after.length) {
-            pushSplice(beforeIdx, before.length - beforeIdx, []);
-            break;
-        }
-        const beforeElement = before[beforeIdx];
-        const afterElement = after[afterIdx];
-        const n = compare(beforeElement, afterElement);
-        if (n === 0) {
-            // equal
-            beforeIdx += 1;
-            afterIdx += 1;
-        }
-        else if (n < 0) {
-            // beforeElement is smaller -> before element removed
-            pushSplice(beforeIdx, 1, []);
-            beforeIdx += 1;
-        }
-        else if (n > 0) {
-            // beforeElement is greater -> after element added
-            pushSplice(beforeIdx, 0, [afterElement]);
-            afterIdx += 1;
-        }
-    }
-    return result;
-}
-exports.sortedDiff = sortedDiff;
-/**
- * Takes two *sorted* arrays and computes their delta (removed, added elements).
- * Finishes in `Math.min(before.length, after.length)` steps.
- */
-function delta(before, after, compare) {
-    const splices = sortedDiff(before, after, compare);
-    const removed = [];
-    const added = [];
-    for (const splice of splices) {
-        removed.push(...before.slice(splice.start, splice.start + splice.deleteCount));
-        added.push(...splice.toInsert);
-    }
-    return { removed, added };
-}
-exports.delta = delta;
-/**
- * Returns the top N elements from the array.
- *
- * Faster than sorting the entire array when the array is a lot larger than N.
- *
- * @param array The unsorted array.
- * @param compare A sort function for the elements.
- * @param n The number of elements to return.
- * @return The first n elemnts from array when sorted with compare.
- */
-function top(array, compare, n) {
-    if (n === 0) {
-        return [];
-    }
-    const result = array.slice(0, n).sort(compare);
-    topStep(array, compare, result, n, array.length);
-    return result;
-}
-exports.top = top;
-/**
- * Asynchronous variant of `top()` allowing for splitting up work in batches between which the event loop can run.
- *
- * Returns the top N elements from the array.
- *
- * Faster than sorting the entire array when the array is a lot larger than N.
- *
- * @param array The unsorted array.
- * @param compare A sort function for the elements.
- * @param n The number of elements to return.
- * @param batch The number of elements to examine before yielding to the event loop.
- * @return The first n elemnts from array when sorted with compare.
- */
-function topAsync(array, compare, n, batch, token) {
-    if (n === 0) {
-        return Promise.resolve([]);
-    }
-    return new Promise((resolve, reject) => {
-        (async () => {
-            const o = array.length;
-            const result = array.slice(0, n).sort(compare);
-            for (let i = n, m = Math.min(n + batch, o); i < o; i = m, m = Math.min(m + batch, o)) {
-                if (i > n) {
-                    await new Promise((resolve) => setTimeout(resolve)); // nextTick() would starve I/O.
-                }
-                if (token && token.isCancellationRequested) {
-                    throw (0, errors_1.canceled)();
-                }
-                topStep(array, compare, result, i, m);
-            }
-            return result;
-        })().then(resolve, reject);
-    });
-}
-exports.topAsync = topAsync;
-function topStep(array, compare, result, i, m) {
-    for (const n = result.length; i < m; i++) {
-        const element = array[i];
-        if (compare(element, result[n - 1]) < 0) {
-            result.pop();
-            const j = findFirstInSorted(result, (e) => compare(element, e) < 0);
-            result.splice(j, 0, element);
-        }
-    }
-}
-/**
- * @returns a new array with all falsy values removed. The original array IS NOT modified.
- */
-function coalesce(array) {
-    if (!array) {
-        return array;
-    }
-    return array.filter((e) => !!e);
-}
-exports.coalesce = coalesce;
-/**
- * Remove all falsey values from `array`. The original array IS modified.
- */
-function coalesceInPlace(array) {
-    if (!array) {
-        return;
-    }
-    let to = 0;
-    // eslint-disable-next-line @typescript-eslint/prefer-for-of
-    for (let i = 0; i < array.length; i++) {
-        if (array[i]) {
-            array[to] = array[i];
-            to += 1;
-        }
-    }
-    array.length = to;
-}
-exports.coalesceInPlace = coalesceInPlace;
-/**
- * Moves the element in the array for the provided positions.
- */
-function move(array, from, to) {
-    array.splice(to, 0, array.splice(from, 1)[0]);
-}
-exports.move = move;
-/**
- * @returns false if the provided object is an array and not empty.
- */
-function isFalsyOrEmpty(obj) {
-    return !Array.isArray(obj) || obj.length === 0;
-}
-exports.isFalsyOrEmpty = isFalsyOrEmpty;
-function isNonEmptyArray(obj) {
-    return Array.isArray(obj) && obj.length > 0;
-}
-exports.isNonEmptyArray = isNonEmptyArray;
-/**
- * Removes duplicates from the given array. The optional keyFn allows to specify
- * how elements are checked for equalness by returning a unique string for each.
- */
-function distinct(array, keyFn) {
-    if (!keyFn) {
-        return array.filter((element, position) => array.indexOf(element) === position);
-    }
-    const seen = Object.create(null);
-    return array.filter((elem) => {
-        const key = keyFn(elem);
-        if (seen[key]) {
-            return false;
-        }
-        seen[key] = true;
-        return true;
-    });
-}
-exports.distinct = distinct;
-function distinctES6(array) {
-    const seen = new Set();
-    return array.filter((element) => {
-        if (seen.has(element)) {
-            return false;
-        }
-        seen.add(element);
-        return true;
-    });
-}
-exports.distinctES6 = distinctES6;
-function uniqueFilter(keyFn) {
-    const seen = Object.create(null);
-    return (element) => {
-        const key = keyFn(element);
-        if (seen[key]) {
-            return false;
-        }
-        seen[key] = true;
-        return true;
-    };
-}
-exports.uniqueFilter = uniqueFilter;
-function lastIndex(array, fn) {
-    for (let i = array.length - 1; i >= 0; i--) {
-        const element = array[i];
-        if (fn(element)) {
-            return i;
-        }
-    }
-    return -1;
-}
-exports.lastIndex = lastIndex;
-function firstIndex(array, fn) {
-    for (let i = 0; i < array.length; i++) {
-        const element = array[i];
-        if (fn(element)) {
-            return i;
-        }
-    }
-    return -1;
-}
-exports.firstIndex = firstIndex;
-function first(array, fn, notFoundValue = undefined) {
-    const index = firstIndex(array, fn);
-    return index < 0 ? notFoundValue : array[index];
-}
-exports.first = first;
-function commonPrefixLength(one, other, equals = (a, b) => a === b) {
-    let result = 0;
-    for (let i = 0, len = Math.min(one.length, other.length); i < len && equals(one[i], other[i]); i++) {
-        result++;
-    }
-    return result;
-}
-exports.commonPrefixLength = commonPrefixLength;
-function flatten(arr) {
-    return [].concat(...arr);
-}
-exports.flatten = flatten;
-function range(arg, to) {
-    let from = typeof to === 'number' ? arg : 0;
-    if (typeof to === 'number') {
-        from = arg;
-    }
-    else {
-        from = 0;
-        to = arg;
-    }
-    const result = [];
-    if (from <= to) {
-        for (let i = from; i < to; i++) {
-            result.push(i);
-        }
-    }
-    else {
-        for (let i = from; i > to; i--) {
-            result.push(i);
-        }
-    }
-    return result;
-}
-exports.range = range;
-function fill(num, value, arr = []) {
-    for (let i = 0; i < num; i++) {
-        arr[i] = value;
-    }
-    return arr;
-}
-exports.fill = fill;
-function index(array, indexer, merger = (t) => t) {
-    return array.reduce((r, t) => {
-        const key = indexer(t);
-        r[key] = merger(t, r[key]);
-        return r;
-    }, Object.create(null));
-}
-exports.index = index;
-/**
- * Inserts an element into an array. Returns a function which, when
- * called, will remove that element from the array.
- */
-function insert(array, element) {
-    array.push(element);
-    return () => {
-        const index = array.indexOf(element);
-        if (index > -1) {
-            array.splice(index, 1);
-        }
-    };
-}
-exports.insert = insert;
-/**
- * Insert `insertArr` inside `target` at `insertIndex`.
- * Please don't touch unless you understand https://jsperf.com/inserting-an-array-within-an-array
- */
-function arrayInsert(target, insertIndex, insertArr) {
-    const before = target.slice(0, insertIndex);
-    const after = target.slice(insertIndex);
-    return before.concat(insertArr, after);
-}
-exports.arrayInsert = arrayInsert;
-/**
- * Uses Fisher-Yates shuffle to shuffle the given array
- */
-function shuffle(array, _seed) {
-    let rand;
-    if (typeof _seed === 'number') {
-        let seed = _seed;
-        // Seeded random number generator in JS. Modified from:
-        // https://stackoverflow.com/questions/521295/seeding-the-random-number-generator-in-javascript
-        rand = () => {
-            const x = Math.sin(seed++) * 179426549; // throw away most significant digits and reduce any potential bias
-            return x - Math.floor(x);
-        };
-    }
-    else {
-        rand = Math.random;
-    }
-    for (let i = array.length - 1; i > 0; i -= 1) {
-        const j = Math.floor(rand() * (i + 1));
-        const temp = array[i];
-        array[i] = array[j];
-        array[j] = temp;
-    }
-}
-exports.shuffle = shuffle;
-/**
- * Pushes an element to the start of the array, if found.
- */
-function pushToStart(arr, value) {
-    const index = arr.indexOf(value);
-    if (index > -1) {
-        arr.splice(index, 1);
-        arr.unshift(value);
-    }
-}
-exports.pushToStart = pushToStart;
-/**
- * Pushes an element to the end of the array, if found.
- */
-function pushToEnd(arr, value) {
-    const index = arr.indexOf(value);
-    if (index > -1) {
-        arr.splice(index, 1);
-        arr.push(value);
-    }
-}
-exports.pushToEnd = pushToEnd;
-function find(arr, predicate) {
-    for (let i = 0; i < arr.length; i++) {
-        const element = arr[i];
-        if (predicate(element, i, arr)) {
-            return element;
-        }
-    }
-    return undefined;
-}
-exports.find = find;
-function mapArrayOrNot(items, fn) {
-    return Array.isArray(items) ? items.map(fn) : fn(items);
-}
-exports.mapArrayOrNot = mapArrayOrNot;
-function asArray(x) {
-    return Array.isArray(x) ? x : [x];
-}
-exports.asArray = asArray;
-/**
- * Returns the first mapped value of the array which is not undefined.
- */
-function mapFind(array, mapFn) {
-    for (const value of array) {
-        const mapped = mapFn(value);
-        if (mapped !== undefined) {
-            return mapped;
-        }
-    }
-    return undefined;
-}
-exports.mapFind = mapFind;
-//# sourceMappingURL=arrays.js.map

package/lib/arrays.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrays.js","sourceRoot":"","sources":["../src/arrays.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;AAChG,kHAAkH;;;AAGlH,qCAAoC;AAGpC;;;;GAIG;AACH,SAAgB,IAAI,CAAI,KAAmB,EAAE,CAAC,GAAG,CAAC;IAChD,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACvC,CAAC;AAFD,oBAEC;AAED,SAAgB,KAAK,CAAI,GAAQ;IAC/B,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE;QACpB,MAAM,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAC;KACtC;IAED,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;AAC7D,CAAC;AAND,sBAMC;AAED,SAAgB,MAAM,CACpB,GAAiC,EACjC,KAAmC,EACnC,aAAsC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;IAEvD,IAAI,GAAG,KAAK,KAAK,EAAE;QACjB,OAAO,IAAI,CAAC;KACb;IAED,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE;QAClB,OAAO,KAAK,CAAC;KACd;IAED,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE;QAC/B,OAAO,KAAK,CAAC;KACd;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;QAC9C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;YACjC,OAAO,KAAK,CAAC;SACd;KACF;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAxBD,wBAwBC;AAED,SAAgB,YAAY,CAAI,KAAuB,EAAE,GAAM,EAAE,UAAsC;IACrG,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAE5B,OAAO,GAAG,IAAI,IAAI,EAAE;QAClB,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QACzC,IAAI,IAAI,GAAG,CAAC,EAAE;YACZ,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;SACf;aAAM,IAAI,IAAI,GAAG,CAAC,EAAE;YACnB,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;SAChB;aAAM;YACL,OAAO,GAAG,CAAC;SACZ;KACF;IACD,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AACpB,CAAC;AAhBD,oCAgBC;AAED;;;;GAIG;AACH,SAAgB,iBAAiB,CAAI,KAAuB,EAAE,CAAoB;IAChF,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC;IACxB,IAAI,IAAI,KAAK,CAAC,EAAE;QACd,OAAO,CAAC,CAAC,CAAC,cAAc;KACzB;IACD,OAAO,GAAG,GAAG,IAAI,EAAE;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE;YACjB,IAAI,GAAG,GAAG,CAAC;SACZ;aAAM;YACL,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;SACf;KACF;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAfD,8CAeC;AAID;;;GAGG;AACH,SAAgB,SAAS,CAAI,IAAS,EAAE,OAAmB;IACzD,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;IAC7C,OAAO,IAAI,CAAC;AACd,CAAC;AAHD,8BAGC;AAED,SAAS,MAAM,CAAI,CAAM,EAAE,OAAmB,EAAE,EAAU,EAAE,GAAW,EAAE,EAAU,EAAE,GAAQ;IAC3F,IAAI,OAAO,GAAG,EAAE,CAAC;IACjB,IAAI,QAAQ,GAAG,GAAG,GAAG,CAAC,CAAC;IACvB,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;QAC7B,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;KACf;IACD,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;QAC7B,IAAI,OAAO,GAAG,GAAG,EAAE;YACjB,qBAAqB;YACrB,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;SACxB;aAAM,IAAI,QAAQ,GAAG,EAAE,EAAE;YACxB,sBAAsB;YACtB,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;SACvB;aAAM,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE;YACnD,uCAAuC;YACvC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;SACxB;aAAM;YACL,2CAA2C;YAC3C,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;SACvB;KACF;AACH,CAAC;AAED,SAAS,KAAK,CAAI,CAAM,EAAE,OAAmB,EAAE,EAAU,EAAE,EAAU,EAAE,GAAQ;IAC7E,IAAI,EAAE,IAAI,EAAE,EAAE;QACZ,OAAO;KACR;IACD,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACrC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAChC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IACpC,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;QACpC,iEAAiE;QACjE,+DAA+D;QAC/D,QAAQ;QACR,OAAO;KACR;IACD,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;AACvC,CAAC;AAED,SAAgB,OAAO,CAAI,IAAsB,EAAE,OAA+B;IAChF,MAAM,MAAM,GAAU,EAAE,CAAC;IACzB,IAAI,YAA6B,CAAC;IAClC,KAAK,MAAM,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE;QACvD,IAAI,CAAC,YAAY,IAAI,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE;YAC5D,YAAY,GAAG,CAAC,OAAO,CAAC,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SAC3B;aAAM;YACL,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;SAC5B;KACF;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAZD,0BAYC;AAMD;;GAEG;AACH,SAAgB,UAAU,CACxB,MAAwB,EACxB,KAAuB,EACvB,OAA+B;IAE/B,MAAM,MAAM,GAAwB,EAAE,CAAC;IAEvC,SAAS,UAAU,CAAC,KAAa,EAAE,WAAmB,EAAE,QAAa;QACnE,IAAI,WAAW,KAAK,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;YAC9C,OAAO;SACR;QAED,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEzC,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,WAAW,KAAK,KAAK,EAAE;YACzD,MAAM,CAAC,WAAW,IAAI,WAAW,CAAC;YAClC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;SACnC;aAAM;YACL,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,CAAC,CAAC;SAC/C;IACH,CAAC;IAED,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,OAAO,IAAI,EAAE;QACX,IAAI,SAAS,KAAK,MAAM,CAAC,MAAM,EAAE;YAC/B,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;YAChD,MAAM;SACP;QACD,IAAI,QAAQ,KAAK,KAAK,CAAC,MAAM,EAAE;YAC7B,UAAU,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,GAAG,SAAS,EAAE,EAAE,CAAC,CAAC;YACrD,MAAM;SACP;QAED,MAAM,aAAa,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;QACxC,MAAM,YAAY,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,OAAO,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,CAAC,EAAE;YACX,QAAQ;YACR,SAAS,IAAI,CAAC,CAAC;YACf,QAAQ,IAAI,CAAC,CAAC;SACf;aAAM,IAAI,CAAC,GAAG,CAAC,EAAE;YAChB,qDAAqD;YACrD,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7B,SAAS,IAAI,CAAC,CAAC;SAChB;aAAM,IAAI,CAAC,GAAG,CAAC,EAAE;YAChB,kDAAkD;YAClD,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;YACzC,QAAQ,IAAI,CAAC,CAAC;SACf;KACF;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAtDD,gCAsDC;AAED;;;GAGG;AACH,SAAgB,KAAK,CACnB,MAAwB,EACxB,KAAuB,EACvB,OAA+B;IAE/B,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACnD,MAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,MAAM,KAAK,GAAQ,EAAE,CAAC;IAEtB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;QAC5B,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC;QAC/E,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;KAChC;IAED,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AAC5B,CAAC;AAfD,sBAeC;AAED;;;;;;;;;GASG;AACH,SAAgB,GAAG,CAAI,KAAuB,EAAE,OAA+B,EAAE,CAAS;IACxF,IAAI,CAAC,KAAK,CAAC,EAAE;QACX,OAAO,EAAE,CAAC;KACX;IACD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC/C,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IACjD,OAAO,MAAM,CAAC;AAChB,CAAC;AAPD,kBAOC;AAED;;;;;;;;;;;;GAYG;AACH,SAAgB,QAAQ,CACtB,KAAU,EACV,OAA+B,EAC/B,CAAS,EACT,KAAa,EACb,KAAyB;IAEzB,IAAI,CAAC,KAAK,CAAC,EAAE;QACX,OAAO,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;KAC5B;IAED,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACrC,CAAC,KAAK,IAAI,EAAE;YACV,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;YACvB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,EAAE;gBACpF,IAAI,CAAC,GAAG,CAAC,EAAE;oBACT,MAAM,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,+BAA+B;iBACrF;gBACD,IAAI,KAAK,IAAI,KAAK,CAAC,uBAAuB,EAAE;oBAC1C,MAAM,IAAA,iBAAQ,GAAE,CAAC;iBAClB;gBACD,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;aACvC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;AACL,CAAC;AA3BD,4BA2BC;AAED,SAAS,OAAO,CAAI,KAAuB,EAAE,OAA+B,EAAE,MAAW,EAAE,CAAS,EAAE,CAAS;IAC7G,KAAK,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QACxC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;YACvC,MAAM,CAAC,GAAG,EAAE,CAAC;YACb,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;SAC9B;KACF;AACH,CAAC;AAED;;GAEG;AACH,SAAgB,QAAQ,CAAI,KAA0C;IACpE,IAAI,CAAC,KAAK,EAAE;QACV,OAAO,KAAK,CAAC;KACd;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAQ,CAAC;AACzC,CAAC;AALD,4BAKC;AAED;;GAEG;AACH,SAAgB,eAAe,CAAI,KAAkC;IACnE,IAAI,CAAC,KAAK,EAAE;QACV,OAAO;KACR;IACD,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,4DAA4D;IAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACrC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE;YACZ,KAAK,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACrB,EAAE,IAAI,CAAC,CAAC;SACT;KACF;IACD,KAAK,CAAC,MAAM,GAAG,EAAE,CAAC;AACpB,CAAC;AAbD,0CAaC;AAED;;GAEG;AACH,SAAgB,IAAI,CAAC,KAAY,EAAE,IAAY,EAAE,EAAU;IACzD,KAAK,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AAFD,oBAEC;AAED;;GAEG;AACH,SAAgB,cAAc,CAAC,GAAQ;IACrC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC;AACjD,CAAC;AAFD,wCAEC;AAOD,SAAgB,eAAe,CAAI,GAA0C;IAC3E,OAAO,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;AAC9C,CAAC;AAFD,0CAEC;AAED;;;GAGG;AACH,SAAgB,QAAQ,CAAI,KAAuB,EAAE,KAAwB;IAC3E,IAAI,CAAC,KAAK,EAAE;QACV,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC;KACjF;IAED,MAAM,IAAI,GAA+B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC7D,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QAC3B,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE;YACb,OAAO,KAAK,CAAC;SACd;QAED,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QAEjB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAhBD,4BAgBC;AAED,SAAgB,WAAW,CAAI,KAAuB;IACpD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;IAC1B,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE;QAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;YACrB,OAAO,KAAK,CAAC;SACd;QAED,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAClB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAVD,kCAUC;AAED,SAAgB,YAAY,CAAI,KAAuB;IACrD,MAAM,IAAI,GAA+B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAE7D,OAAO,CAAC,OAAO,EAAE,EAAE;QACjB,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;QAE3B,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE;YACb,OAAO,KAAK,CAAC;SACd;QAED,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;AACJ,CAAC;AAbD,oCAaC;AAED,SAAgB,SAAS,CAAI,KAAuB,EAAE,EAAwB;IAC5E,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1C,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAEzB,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE;YACf,OAAO,CAAC,CAAC;SACV;KACF;IAED,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAVD,8BAUC;AAED,SAAgB,UAAU,CAAI,KAAuB,EAAE,EAAwB;IAC7E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACrC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAEzB,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE;YACf,OAAO,CAAC,CAAC;SACV;KACF;IAED,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAVD,gCAUC;AAID,SAAgB,KAAK,CACnB,KAAuB,EACvB,EAAwB,EACxB,gBAA+B,SAAS;IAExC,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACpC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AAClD,CAAC;AAPD,sBAOC;AAED,SAAgB,kBAAkB,CAChC,GAAqB,EACrB,KAAuB,EACvB,SAAkC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;IAEnD,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAClG,MAAM,EAAE,CAAC;KACV;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAZD,gDAYC;AAED,SAAgB,OAAO,CAAI,GAAU;IACnC,OAAQ,EAAU,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC;AACpC,CAAC;AAFD,0BAEC;AAGD,SAAgB,KAAK,CAAC,GAAW,EAAE,EAAW;IAC5C,IAAI,IAAI,GAAG,OAAO,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAE5C,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE;QAC1B,IAAI,GAAG,GAAG,CAAC;KACZ;SAAM;QACL,IAAI,GAAG,CAAC,CAAC;QACT,EAAE,GAAG,GAAG,CAAC;KACV;IAED,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,IAAI,IAAI,IAAI,EAAE,EAAE;QACd,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;YAC9B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SAChB;KACF;SAAM;QACL,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;YAC9B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SAChB;KACF;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAvBD,sBAuBC;AAED,SAAgB,IAAI,CAAI,GAAW,EAAE,KAAQ,EAAE,MAAW,EAAE;IAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;QAC5B,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;KAChB;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAND,oBAMC;AAQD,SAAgB,KAAK,CACnB,KAAuB,EACvB,OAAyB,EACzB,SAA4B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAQ;IAE3C,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3B,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3B,OAAO,CAAC,CAAC;IACX,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;AAC1B,CAAC;AAVD,sBAUC;AAED;;;GAGG;AACH,SAAgB,MAAM,CAAI,KAAU,EAAE,OAAU;IAC9C,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAEpB,OAAO,GAAG,EAAE;QACV,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACrC,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE;YACd,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;SACxB;IACH,CAAC,CAAC;AACJ,CAAC;AATD,wBASC;AAED;;;GAGG;AACH,SAAgB,WAAW,CAAI,MAAW,EAAE,WAAmB,EAAE,SAAc;IAC7E,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IACxC,OAAO,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;AACzC,CAAC;AAJD,kCAIC;AAED;;GAEG;AACH,SAAgB,OAAO,CAAI,KAAU,EAAE,KAAc;IACnD,IAAI,IAAkB,CAAC;IAEvB,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;QAC7B,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,uDAAuD;QACvD,+FAA+F;QAC/F,IAAI,GAAG,GAAG,EAAE;YACV,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,mEAAmE;YAC3G,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC,CAAC;KACH;SAAM;QACL,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;KACpB;IAED,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE;QAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;KACjB;AACH,CAAC;AArBD,0BAqBC;AAED;;GAEG;AACH,SAAgB,WAAW,CAAI,GAAQ,EAAE,KAAQ;IAC/C,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAEjC,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE;QACd,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACrB,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;KACpB;AACH,CAAC;AAPD,kCAOC;AAED;;GAEG;AACH,SAAgB,SAAS,CAAI,GAAQ,EAAE,KAAQ;IAC7C,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAEjC,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE;QACd,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACrB,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;KACjB;AACH,CAAC;AAPD,8BAOC;AAED,SAAgB,IAAI,CAClB,GAAiB,EACjB,SAA8D;IAE9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACnC,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;YAC9B,OAAO,OAAO,CAAC;SAChB;KACF;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAZD,oBAYC;AAED,SAAgB,aAAa,CAAO,KAAc,EAAE,EAAe;IACjE,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;AAC1D,CAAC;AAFD,sCAEC;AAED,SAAgB,OAAO,CAAI,CAAU;IACnC,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC;AAFD,0BAEC;AAED;;GAEG;AACH,SAAgB,OAAO,CAAO,KAAkB,EAAE,KAAkC;IAClF,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE;QACzB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAI,MAAM,KAAK,SAAS,EAAE;YACxB,OAAO,MAAM,CAAC;SACf;KACF;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AATD,0BASC"}