@colyseus/schema 3.0.69 → 3.0.71

package/lib/types/ArraySchema.js

@@ -0,0 +1,555 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ArraySchema = exports.getArrayProxy = void 0;
+const ChangeTree_1 = require("../changes/ChangeTree");
+const spec_1 = require("../spec");
+const utils_1 = require("./utils");
+const DEFAULT_SORT = (a, b) => {
+    const A = a.toString();
+    const B = b.toString();
+    if (A < B)
+        return -1;
+    else if (A > B)
+        return 1;
+    else
+        return 0;
+};
+function getArrayProxy(value) {
+    value['$proxy'] = true;
+    //
+    // compatibility with @colyseus/schema 0.5.x
+    // - allow `map["key"]`
+    // - allow `map["key"] = "xxx"`
+    // - allow `delete map["key"]`
+    //
+    value = new Proxy(value, {
+        get: (obj, prop) => {
+            if (typeof (prop) !== "symbol" &&
+                !isNaN(prop) // https://stackoverflow.com/a/175787/892698
+            ) {
+                return obj.at(prop);
+            }
+            else {
+                return obj[prop];
+            }
+        },
+        set: (obj, prop, setValue) => {
+            if (typeof (prop) !== "symbol" &&
+                !isNaN(prop)) {
+                const indexes = Array.from(obj['$items'].keys());
+                const key = parseInt(indexes[prop] || prop);
+                if (setValue === undefined || setValue === null) {
+                    obj.deleteAt(key);
+                }
+                else {
+                    obj.setAt(key, setValue);
+                }
+            }
+            else {
+                obj[prop] = setValue;
+            }
+            return true;
+        },
+        deleteProperty: (obj, prop) => {
+            if (typeof (prop) === "number") {
+                obj.deleteAt(prop);
+            }
+            else {
+                delete obj[prop];
+            }
+            return true;
+        },
+        has: (obj, key) => {
+            if (typeof (key) !== "symbol" &&
+                !isNaN(Number(key))) {
+                return obj['$items'].has(Number(key));
+            }
+            return Reflect.has(obj, key);
+        }
+    });
+    return value;
+}
+exports.getArrayProxy = getArrayProxy;
+class ArraySchema {
+    static { Symbol.unscopables; }
+    onAdd(callback, triggerAll = true) {
+        return (0, utils_1.addCallback)((this.$callbacks || (this.$callbacks = {})), spec_1.OPERATION.ADD, callback, (triggerAll)
+            ? this.$items
+            : undefined);
+    }
+    onRemove(callback) { return (0, utils_1.addCallback)(this.$callbacks || (this.$callbacks = {}), spec_1.OPERATION.DELETE, callback); }
+    onChange(callback) { return (0, utils_1.addCallback)(this.$callbacks || (this.$callbacks = {}), spec_1.OPERATION.REPLACE, callback); }
+    static is(type) {
+        return (
+        // type format: ["string"]
+        Array.isArray(type) ||
+            // type format: { array: "string" }
+            (type['array'] !== undefined));
+    }
+    constructor(...items) {
+        this.$changes = new ChangeTree_1.ChangeTree(this);
+        this.$items = new Map();
+        this.$indexes = new Map();
+        this.$refId = 0;
+        this.push.apply(this, items);
+    }
+    set length(value) {
+        if (value === 0) {
+            this.clear();
+        }
+        else {
+            this.splice(value, this.length - value);
+        }
+    }
+    get length() {
+        return this.$items.size;
+    }
+    push(...values) {
+        let lastIndex;
+        values.forEach(value => {
+            // set "index" for reference.
+            lastIndex = this.$refId++;
+            this.setAt(lastIndex, value);
+        });
+        return lastIndex;
+    }
+    /**
+     * Removes the last element from an array and returns it.
+     */
+    pop() {
+        const key = Array.from(this.$indexes.values()).pop();
+        if (key === undefined) {
+            return undefined;
+        }
+        this.$changes.delete(key);
+        this.$indexes.delete(key);
+        const value = this.$items.get(key);
+        this.$items.delete(key);
+        return value;
+    }
+    at(index) {
+        //
+        // FIXME: this should be O(1)
+        //
+        const key = Array.from(this.$items.keys())[index];
+        return this.$items.get(key);
+    }
+    setAt(index, value) {
+        if (value === undefined || value === null) {
+            console.error("ArraySchema items cannot be null nor undefined; Use `deleteAt(index)` instead.");
+            return;
+        }
+        // skip if the value is the same as cached.
+        if (this.$items.get(index) === value) {
+            return;
+        }
+        if (value['$changes'] !== undefined) {
+            value['$changes'].setParent(this, this.$changes.root, index);
+        }
+        const operation = this.$changes.indexes[index]?.op ?? spec_1.OPERATION.ADD;
+        this.$changes.indexes[index] = index;
+        this.$indexes.set(index, index);
+        this.$items.set(index, value);
+        this.$changes.change(index, operation);
+    }
+    deleteAt(index) {
+        const key = Array.from(this.$items.keys())[index];
+        if (key === undefined) {
+            return false;
+        }
+        return this.$deleteAt(key);
+    }
+    $deleteAt(index) {
+        // delete at internal index
+        this.$changes.delete(index);
+        this.$indexes.delete(index);
+        return this.$items.delete(index);
+    }
+    clear(changes) {
+        // discard previous operations.
+        this.$changes.discard(true, true);
+        this.$changes.indexes = {};
+        // clear previous indexes
+        this.$indexes.clear();
+        //
+        // When decoding:
+        // - enqueue items for DELETE callback.
+        // - flag child items for garbage collection.
+        //
+        if (changes) {
+            utils_1.removeChildRefs.call(this, changes);
+        }
+        // clear items
+        this.$items.clear();
+        this.$changes.operation({ index: 0, op: spec_1.OPERATION.CLEAR });
+        // touch all structures until reach root
+        this.$changes.touchParents();
+    }
+    /**
+     * Combines two or more arrays.
+     * @param items Additional items to add to the end of array1.
+     */
+    // @ts-ignore
+    concat(...items) {
+        return new ArraySchema(...Array.from(this.$items.values()).concat(...items));
+    }
+    /**
+     * Adds all the elements of an array separated by the specified separator string.
+     * @param separator A string used to separate one element of an array from the next in the resulting String. If omitted, the array elements are separated with a comma.
+     */
+    join(separator) {
+        return Array.from(this.$items.values()).join(separator);
+    }
+    /**
+     * Reverses the elements in an Array.
+     */
+    // @ts-ignore
+    reverse() {
+        const indexes = Array.from(this.$items.keys());
+        const reversedItems = Array.from(this.$items.values()).reverse();
+        reversedItems.forEach((item, i) => {
+            this.setAt(indexes[i], item);
+        });
+        return this;
+    }
+    /**
+     * Removes the first element from an array and returns it.
+     */
+    shift() {
+        const indexes = Array.from(this.$items.keys());
+        const shiftAt = indexes.shift();
+        if (shiftAt === undefined) {
+            return undefined;
+        }
+        const value = this.$items.get(shiftAt);
+        this.$deleteAt(shiftAt);
+        return value;
+    }
+    /**
+     * Returns a section of an array.
+     * @param start The beginning of the specified portion of the array.
+     * @param end The end of the specified portion of the array. This is exclusive of the element at the index 'end'.
+     */
+    slice(start, end) {
+        const sliced = new ArraySchema();
+        sliced.push(...Array.from(this.$items.values()).slice(start, end));
+        return sliced;
+    }
+    /**
+     * Sorts an array.
+     * @param compareFn Function used to determine the order of the elements. It is expected to return
+     * a negative value if first argument is less than second argument, zero if they're equal and a positive
+     * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.
+     * ```ts
+     * [11,2,22,1].sort((a, b) => a - b)
+     * ```
+     */
+    sort(compareFn = DEFAULT_SORT) {
+        const indexes = Array.from(this.$items.keys());
+        const sortedItems = Array.from(this.$items.values()).sort(compareFn);
+        sortedItems.forEach((item, i) => {
+            this.setAt(indexes[i], item);
+        });
+        return this;
+    }
+    /**
+     * Removes elements from an array and, if necessary, inserts new elements in their place, returning the deleted elements.
+     * @param start The zero-based location in the array from which to start removing elements.
+     * @param deleteCount The number of elements to remove.
+     * @param items Elements to insert into the array in place of the deleted elements.
+     */
+    splice(start, deleteCount = this.length - start, ...items) {
+        const indexes = Array.from(this.$items.keys());
+        const removedItems = [];
+        for (let i = start; i < start + deleteCount; i++) {
+            removedItems.push(this.$items.get(indexes[i]));
+            this.$deleteAt(indexes[i]);
+        }
+        for (let i = 0; i < items.length; i++) {
+            this.setAt(start + i, items[i]);
+        }
+        return removedItems;
+    }
+    /**
+     * Inserts new elements at the start of an array.
+     * @param items  Elements to insert at the start of the Array.
+     */
+    unshift(...items) {
+        const length = this.length;
+        const addedLength = items.length;
+        // const indexes = Array.from(this.$items.keys());
+        const previousValues = Array.from(this.$items.values());
+        items.forEach((item, i) => {
+            this.setAt(i, item);
+        });
+        previousValues.forEach((previousValue, i) => {
+            this.setAt(addedLength + i, previousValue);
+        });
+        return length + addedLength;
+    }
+    /**
+     * Returns the index of the first occurrence of a value in an array.
+     * @param searchElement The value to locate in the array.
+     * @param fromIndex The array index at which to begin the search. If fromIndex is omitted, the search starts at index 0.
+     */
+    indexOf(searchElement, fromIndex) {
+        return Array.from(this.$items.values()).indexOf(searchElement, fromIndex);
+    }
+    /**
+     * Returns the index of the last occurrence of a specified value in an array.
+     * @param searchElement The value to locate in the array.
+     * @param fromIndex The array index at which to begin the search. If fromIndex is omitted, the search starts at the last index in the array.
+     */
+    lastIndexOf(searchElement, fromIndex = this.length - 1) {
+        return Array.from(this.$items.values()).lastIndexOf(searchElement, fromIndex);
+    }
+    /**
+     * Determines whether all the members of an array satisfy the specified test.
+     * @param callbackfn A function that accepts up to three arguments. The every method calls
+     * the callbackfn function for each element in the array until the callbackfn returns a value
+     * which is coercible to the Boolean value false, or until the end of the array.
+     * @param thisArg An object to which the this keyword can refer in the callbackfn function.
+     * If thisArg is omitted, undefined is used as the this value.
+     */
+    every(callbackfn, thisArg) {
+        return Array.from(this.$items.values()).every(callbackfn, thisArg);
+    }
+    /**
+     * Determines whether the specified callback function returns true for any element of an array.
+     * @param callbackfn A function that accepts up to three arguments. The some method calls
+     * the callbackfn function for each element in the array until the callbackfn returns a value
+     * which is coercible to the Boolean value true, or until the end of the array.
+     * @param thisArg An object to which the this keyword can refer in the callbackfn function.
+     * If thisArg is omitted, undefined is used as the this value.
+     */
+    some(callbackfn, thisArg) {
+        return Array.from(this.$items.values()).some(callbackfn, thisArg);
+    }
+    /**
+     * Performs the specified action for each element in an array.
+     * @param callbackfn  A function that accepts up to three arguments. forEach calls the callbackfn function one time for each element in the array.
+     * @param thisArg  An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
+     */
+    forEach(callbackfn, thisArg) {
+        Array.from(this.$items.values()).forEach(callbackfn, thisArg);
+    }
+    /**
+     * Calls a defined callback function on each element of an array, and returns an array that contains the results.
+     * @param callbackfn A function that accepts up to three arguments. The map method calls the callbackfn function one time for each element in the array.
+     * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
+     */
+    map(callbackfn, thisArg) {
+        return Array.from(this.$items.values()).map(callbackfn, thisArg);
+    }
+    filter(callbackfn, thisArg) {
+        return Array.from(this.$items.values()).filter(callbackfn, thisArg);
+    }
+    /**
+     * Calls the specified callback function for all the elements in an array. The return value of the callback function is the accumulated result, and is provided as an argument in the next call to the callback function.
+     * @param callbackfn A function that accepts up to four arguments. The reduce method calls the callbackfn function one time for each element in the array.
+     * @param initialValue If initialValue is specified, it is used as the initial value to start the accumulation. The first call to the callbackfn function provides this value as an argument instead of an array value.
+     */
+    reduce(callbackfn, initialValue) {
+        return Array.prototype.reduce.apply(Array.from(this.$items.values()), arguments);
+    }
+    /**
+     * Calls the specified callback function for all the elements in an array, in descending order. The return value of the callback function is the accumulated result, and is provided as an argument in the next call to the callback function.
+     * @param callbackfn A function that accepts up to four arguments. The reduceRight method calls the callbackfn function one time for each element in the array.
+     * @param initialValue If initialValue is specified, it is used as the initial value to start the accumulation. The first call to the callbackfn function provides this value as an argument instead of an array value.
+     */
+    reduceRight(callbackfn, initialValue) {
+        return Array.prototype.reduceRight.apply(Array.from(this.$items.values()), arguments);
+    }
+    /**
+     * Returns the value of the first element in the array where predicate is true, and undefined
+     * otherwise.
+     * @param predicate find calls predicate once for each element of the array, in ascending
+     * order, until it finds one where predicate returns true. If such an element is found, find
+     * immediately returns that element value. Otherwise, find returns undefined.
+     * @param thisArg If provided, it will be used as the this value for each invocation of
+     * predicate. If it is not provided, undefined is used instead.
+     */
+    find(predicate, thisArg) {
+        return Array.from(this.$items.values()).find(predicate, thisArg);
+    }
+    /**
+     * Returns the index of the first element in the array where predicate is true, and -1
+     * otherwise.
+     * @param predicate find calls predicate once for each element of the array, in ascending
+     * order, until it finds one where predicate returns true. If such an element is found,
+     * findIndex immediately returns that element index. Otherwise, findIndex returns -1.
+     * @param thisArg If provided, it will be used as the this value for each invocation of
+     * predicate. If it is not provided, undefined is used instead.
+     */
+    findIndex(predicate, thisArg) {
+        return Array.from(this.$items.values()).findIndex(predicate, thisArg);
+    }
+    /**
+     * Returns the this object after filling the section identified by start and end with value
+     * @param value value to fill array section with
+     * @param start index to start filling the array at. If start is negative, it is treated as
+     * length+start where length is the length of the array.
+     * @param end index to stop filling the array at. If end is negative, it is treated as
+     * length+end.
+     */
+    fill(value, start, end) {
+        //
+        // TODO
+        //
+        throw new Error("ArraySchema#fill() not implemented");
+        // this.$items.fill(value, start, end);
+        return this;
+    }
+    /**
+     * Returns the this object after copying a section of the array identified by start and end
+     * to the same array starting at position target
+     * @param target If target is negative, it is treated as length+target where length is the
+     * length of the array.
+     * @param start If start is negative, it is treated as length+start. If end is negative, it
+     * is treated as length+end.
+     * @param end If not specified, length of the this object is used as its default value.
+     */
+    copyWithin(target, start, end) {
+        //
+        // TODO
+        //
+        throw new Error("ArraySchema#copyWithin() not implemented");
+        return this;
+    }
+    /**
+     * Returns a string representation of an array.
+     */
+    toString() { return this.$items.toString(); }
+    /**
+     * Returns a string representation of an array. The elements are converted to string using their toLocalString methods.
+     */
+    toLocaleString() { return this.$items.toLocaleString(); }
+    ;
+    /** Iterator */
+    [Symbol.iterator]() {
+        return Array.from(this.$items.values())[Symbol.iterator]();
+    }
+    static get [Symbol.species]() {
+        return ArraySchema;
+    }
+    /**
+     * Returns an iterable of key, value pairs for every entry in the array
+     */
+    entries() { return this.$items.entries(); }
+    /**
+     * Returns an iterable of keys in the array
+     */
+    keys() { return this.$items.keys(); }
+    /**
+     * Returns an iterable of values in the array
+     */
+    values() { return this.$items.values(); }
+    /**
+     * Determines whether an array includes a certain element, returning true or false as appropriate.
+     * @param searchElement The element to search for.
+     * @param fromIndex The position in this array at which to begin searching for searchElement.
+     */
+    includes(searchElement, fromIndex) {
+        return Array.from(this.$items.values()).includes(searchElement, fromIndex);
+    }
+    //
+    // ES2022
+    //
+    /**
+     * Calls a defined callback function on each element of an array. Then, flattens the result into
+     * a new array.
+     * This is identical to a map followed by flat with depth 1.
+     *
+     * @param callback A function that accepts up to three arguments. The flatMap method calls the
+     * callback function one time for each element in the array.
+     * @param thisArg An object to which the this keyword can refer in the callback function. If
+     * thisArg is omitted, undefined is used as the this value.
+     */
+    // @ts-ignore
+    flatMap(callback, thisArg) {
+        // @ts-ignore
+        throw new Error("ArraySchema#flatMap() is not supported.");
+    }
+    /**
+     * Returns a new array with all sub-array elements concatenated into it recursively up to the
+     * specified depth.
+     *
+     * @param depth The maximum recursion depth
+     */
+    // @ts-ignore
+    flat(depth) {
+        throw new Error("ArraySchema#flat() is not supported.");
+    }
+    findLast() {
+        const arr = Array.from(this.$items.values());
+        // @ts-ignore
+        return arr.findLast.apply(arr, arguments);
+    }
+    findLastIndex(...args) {
+        const arr = Array.from(this.$items.values());
+        // @ts-ignore
+        return arr.findLastIndex.apply(arr, arguments);
+    }
+    //
+    // ES2023
+    //
+    with(index, value) {
+        const copy = Array.from(this.$items.values());
+        copy[index] = value;
+        return new ArraySchema(...copy);
+    }
+    toReversed() {
+        return Array.from(this.$items.values()).reverse();
+    }
+    toSorted(compareFn) {
+        return Array.from(this.$items.values()).sort(compareFn);
+    }
+    // @ts-ignore
+    toSpliced(start, deleteCount, ...items) {
+        const copy = Array.from(this.$items.values());
+        // @ts-ignore
+        return copy.toSpliced.apply(copy, arguments);
+    }
+    setIndex(index, key) {
+        this.$indexes.set(index, key);
+    }
+    getIndex(index) {
+        return this.$indexes.get(index);
+    }
+    getByIndex(index) {
+        return this.$items.get(this.$indexes.get(index));
+    }
+    deleteByIndex(index) {
+        const key = this.$indexes.get(index);
+        this.$items.delete(key);
+        this.$indexes.delete(index);
+    }
+    toArray() {
+        return Array.from(this.$items.values());
+    }
+    toJSON() {
+        return this.toArray().map((value) => {
+            return (typeof (value['toJSON']) === "function")
+                ? value['toJSON']()
+                : value;
+        });
+    }
+    //
+    // Decoding utilities
+    //
+    clone(isDecoding) {
+        let cloned;
+        if (isDecoding) {
+            cloned = new ArraySchema(...Array.from(this.$items.values()));
+        }
+        else {
+            cloned = new ArraySchema(...this.map(item => ((item['$changes'])
+                ? item.clone()
+                : item)));
+        }
+        return cloned;
+    }
+    ;
+}
+exports.ArraySchema = ArraySchema;
+//# sourceMappingURL=ArraySchema.js.map

package/lib/types/ArraySchema.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ArraySchema.js","sourceRoot":"","sources":["../../src/types/ArraySchema.ts"],"names":[],"mappings":";;;AAAA,sDAAmD;AACnD,kCAAoC;AAEpC,mCAAuD;AAGvD,MAAM,YAAY,GAAG,CAAC,CAAM,EAAE,CAAM,EAAE,EAAE;IACpC,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC;IACvB,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC;IACvB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC;SAChB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;;QACpB,OAAO,CAAC,CAAA;AACjB,CAAC,CAAA;AAED,SAAgB,aAAa,CAAC,KAAkB;IAC5C,KAAK,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;IAEvB,EAAE;IACF,4CAA4C;IAC5C,uBAAuB;IACvB,+BAA+B;IAC/B,8BAA8B;IAC9B,EAAE;IACF,KAAK,GAAG,IAAI,KAAK,CAAC,KAAK,EAAE;QACrB,GAAG,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;YACf,IACI,OAAO,CAAC,IAAI,CAAC,KAAK,QAAQ;gBAC1B,CAAC,KAAK,CAAC,IAAW,CAAC,CAAC,4CAA4C;cAClE,CAAC;gBACC,OAAO,GAAG,CAAC,EAAE,CAAC,IAAyB,CAAC,CAAC;YAE7C,CAAC;iBAAM,CAAC;gBACJ,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;QACL,CAAC;QAED,GAAG,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE;YACzB,IACI,OAAO,CAAC,IAAI,CAAC,KAAK,QAAQ;gBAC1B,CAAC,KAAK,CAAC,IAAW,CAAC,EACrB,CAAC;gBACC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;gBACjD,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;gBAC5C,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;oBAC9C,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBAEtB,CAAC;qBAAM,CAAC;oBACJ,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;gBAC7B,CAAC;YAEL,CAAC;iBAAM,CAAC;gBACJ,GAAG,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;YACzB,CAAC;YAED,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,cAAc,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;YAC1B,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;gBAC7B,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAEvB,CAAC;iBAAM,CAAC;gBACJ,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;YAED,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;YACd,IACI,OAAO,CAAC,GAAG,CAAC,KAAK,QAAQ;gBACzB,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EACrB,CAAC;gBACC,OAAO,GAAG,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAA;YACzC,CAAC;YACD,OAAO,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;QAChC,CAAC;KACJ,CAAC,CAAC;IAEH,OAAO,KAAK,CAAC;AACjB,CAAC;AAlED,sCAkEC;AAED,MAAa,WAAW;aAqcnB,MAAM,CAAC,WAAW;IAvbZ,KAAK,CAAC,QAAwC,EAAE,aAAsB,IAAI;QAC7E,OAAO,IAAA,mBAAW,EACd,CAAC,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC,CAAC,EAC3C,gBAAS,CAAC,GAAG,EACb,QAAQ,EACR,CAAC,UAAU,CAAC;YACR,CAAC,CAAC,IAAI,CAAC,MAAM;YACb,CAAC,CAAC,SAAS,CAClB,CAAC;IACN,CAAC;IACM,QAAQ,CAAC,QAAwC,IAAI,OAAO,IAAA,mBAAW,EAAC,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC,EAAE,gBAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjJ,QAAQ,CAAC,QAAwC,IAAI,OAAO,IAAA,mBAAW,EAAC,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC,EAAE,gBAAS,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IAEzJ,MAAM,CAAC,EAAE,CAAC,IAAS;QACf,OAAO;QACH,0BAA0B;QAC1B,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YAEnB,mCAAmC;YACnC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC,CAChC,CAAC;IACN,CAAC;IAED,YAAa,GAAG,KAAU;QApChB,aAAQ,GAAe,IAAI,uBAAU,CAAC,IAAI,CAAC,CAAC;QAE5C,WAAM,GAAmB,IAAI,GAAG,EAAa,CAAC;QAC9C,aAAQ,GAAwB,IAAI,GAAG,EAAkB,CAAC;QAE1D,WAAM,GAAW,CAAC,CAAC;QAgCzB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,IAAI,MAAM,CAAE,KAAa;QACrB,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YACd,IAAI,CAAC,KAAK,EAAE,CAAC;QAEjB,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;QAC5C,CAAC;IACL,CAAC;IAED,IAAI,MAAM;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IAC5B,CAAC;IAED,IAAI,CAAC,GAAG,MAAW;QACf,IAAI,SAAiB,CAAC;QAEtB,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;YACnB,6BAA6B;YAC7B,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAE1B,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,OAAO,SAAS,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,GAAG;QACC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;QACrD,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YAAC,OAAO,SAAS,CAAC;QAAC,CAAC;QAE5C,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAE1B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAExB,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,EAAE,CAAC,KAAa;QACZ,EAAE;QACF,6BAA6B;QAC7B,EAAE;QACF,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAED,KAAK,CAAC,KAAa,EAAE,KAAQ;QACzB,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACxC,OAAO,CAAC,KAAK,CAAC,gFAAgF,CAAC,CAAC;YAChG,OAAO;QACX,CAAC;QAED,2CAA2C;QAC3C,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,KAAK,EAAE,CAAC;YACnC,OAAO;QACX,CAAC;QAED,IAAI,KAAK,CAAC,UAAU,CAAC,KAAK,SAAS,EAAE,CAAC;YACjC,KAAK,CAAC,UAAU,CAAgB,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACjF,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,gBAAS,CAAC,GAAG,CAAC;QAEpE,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;QAErC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAE9B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAC3C,CAAC;IAED,QAAQ,CAAC,KAAa;QAClB,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAClD,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YAAC,OAAO,KAAK,CAAC;QAAC,CAAC;QACxC,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAES,SAAS,CAAC,KAAK;QACrB,2BAA2B;QAC3B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAE5B,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC;IAED,KAAK,CAAC,OAAsB;QACxB,+BAA+B;QAC/B,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,QAAQ,CAAC,OAAO,GAAG,EAAE,CAAC;QAE3B,yBAAyB;QACzB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QAEtB,EAAE;QACF,iBAAiB;QACjB,uCAAuC;QACvC,6CAA6C;QAC7C,EAAE;QACF,IAAI,OAAO,EAAE,CAAC;YACV,uBAAe,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACxC,CAAC;QAED,cAAc;QACd,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAEpB,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,gBAAS,CAAC,KAAK,EAAE,CAAC,CAAC;QAE3D,wCAAwC;QACxC,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,aAAa;IACb,MAAM,CAAC,GAAG,KAA6B;QACnC,OAAO,IAAI,WAAW,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IACjF,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,SAAkB;QACnB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC5D,CAAC;IAED;;OAEG;IACH,aAAa;IACb,OAAO;QACH,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;QAC/C,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QAEjE,aAAa,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YAC9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,KAAK;QACD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;QAE/C,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;QAChC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAAC,OAAO,SAAS,CAAC;QAAC,CAAC;QAEhD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAExB,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,KAAc,EAAE,GAAY;QAC9B,MAAM,MAAM,GAAG,IAAI,WAAW,EAAK,CAAC;QACpC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;QACnE,OAAO,MAAwB,CAAC;IACpC,CAAC;IAED;;;;;;;;OAQG;IACH,IAAI,CAAC,YAAoC,YAAY;QACjD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;QAC/C,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAErE,WAAW,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YAC5B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,MAAM,CACF,KAAa,EACb,cAAsB,IAAI,CAAC,MAAM,GAAG,KAAK,EACzC,GAAG,KAAU;QAEb,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;QAC/C,MAAM,YAAY,GAAQ,EAAE,CAAC;QAE7B,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/C,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC;QAED,OAAO,YAAY,CAAC;IACxB,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,GAAG,KAAU;QACjB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC;QAEjC,kDAAkD;QAClD,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QAExD,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACtB,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACxB,CAAC,CAAC,CAAC;QAEH,cAAc,CAAC,OAAO,CAAC,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE;YACxC,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,EAAE,aAAa,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,GAAG,WAAW,CAAC;IAChC,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,aAAgB,EAAE,SAAkB;QACxC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IAC9E,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,aAAgB,EAAE,YAAoB,IAAI,CAAC,MAAM,GAAG,CAAC;QAC7D,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IAClF,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,UAA4D,EAAE,OAAa;QAC7E,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACvE,CAAC;IAED;;;;;;;OAOG;IACH,IAAI,CAAC,UAA4D,EAAE,OAAa;QAC5E,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACtE,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,UAAyD,EAAE,OAAa;QAC5E,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAClE,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAI,UAAsD,EAAE,OAAa;QACxE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACrE,CAAC;IAQD,MAAM,CAAc,UAA+D,EAAE,OAAa;QAC9F,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACxE,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAM,UAAsF,EAAE,YAAgB;QAChH,OAAO,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IACrF,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAM,UAAsF,EAAE,YAAgB;QACrH,OAAO,KAAK,CAAC,SAAS,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IAC1F,CAAC;IAED;;;;;;;;OAQG;IACH,IAAI,CAAC,SAAyD,EAAE,OAAa;QACzE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IACrE,CAAC;IAED;;;;;;;;OAQG;IACH,SAAS,CAAC,SAAyD,EAAE,OAAa;QAC9E,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,SAAS,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC1E,CAAC;IAED;;;;;;;OAOG;IACH,IAAI,CAAC,KAAQ,EAAE,KAAc,EAAE,GAAY;QACvC,EAAE;QACF,OAAO;QACP,EAAE;QACF,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;QACtD,uCAAuC;QAEvC,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;;;OAQG;IACH,UAAU,CAAC,MAAc,EAAE,KAAa,EAAE,GAAY;QAClD,EAAE;QACF,OAAO;QACP,EAAE;QACF,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;QAC5D,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,QAAQ,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAErD;;OAEG;IACH,cAAc,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAA,CAAC,CAAC;IAAA,CAAC;IAEjE,eAAe;IACf,CAAC,MAAM,CAAC,QAAQ,CAAC;QACb,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IAC/D,CAAC;IAED,MAAM,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC;QACvB,OAAO,WAAW,CAAC;IACvB,CAAC;IAOD;;OAEG;IACH,OAAO,KAAoC,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAE1E;;OAEG;IACH,IAAI,KAA+B,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAE/D;;OAEG;IACH,MAAM,KAA0B,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAE9D;;;;OAIG;IACH,QAAQ,CAAC,aAAgB,EAAE,SAAkB;QACzC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IAC/E,CAAC;IAED,EAAE;IACF,SAAS;IACT,EAAE;IAEF;;;;;;;;;OASG;IACH,aAAa;IACb,OAAO,CAAsB,QAAmF,EAAE,OAAc;QAC5H,aAAa;QACb,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;IAC/D,CAAC;IAED;;;;;OAKG;IACH,aAAa;IACb,IAAI,CAAmC,KAAS;QAC5C,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC5D,CAAC;IAED,QAAQ;QACJ,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QAC7C,aAAa;QACb,OAAO,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;IAC9C,CAAC;IAED,aAAa,CAAC,GAAG,IAAI;QACjB,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QAC7C,aAAa;QACb,OAAO,GAAG,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IAED,EAAE;IACF,SAAS;IACT,EAAE;IACF,IAAI,CAAC,KAAa,EAAE,KAAQ;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9C,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;QACpB,OAAO,IAAI,WAAW,CAAC,GAAG,IAAI,CAAC,CAAC;IACpC,CAAC;IACD,UAAU;QACN,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;IACtD,CAAC;IACD,QAAQ,CAAC,SAAkC;QACvC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC5D,CAAC;IAGD,aAAa;IACb,SAAS,CAAC,KAAc,EAAE,WAAqB,EAAE,GAAG,KAAiB;QACjE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9C,aAAa;QACb,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACjD,CAAC;IAES,QAAQ,CAAC,KAAa,EAAE,GAAW;QACzC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAClC,CAAC;IAES,QAAQ,CAAC,KAAa;QAC5B,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IAES,UAAU,CAAC,KAAa;QAC9B,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACrD,CAAC;IAES,aAAa,CAAC,KAAa;QACjC,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAED,OAAO;QACH,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED,MAAM;QACF,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YAChC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,KAAK,UAAU,CAAC;gBAC5C,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE;gBACnB,CAAC,CAAC,KAAK,CAAC;QAChB,CAAC,CAAC,CAAC;IACP,CAAC;IAED,EAAE;IACF,qBAAqB;IACrB,EAAE;IACF,KAAK,CAAC,UAAoB;QACtB,IAAI,MAAmB,CAAC;QAExB,IAAI,UAAU,EAAE,CAAC;YACb,MAAM,GAAG,IAAI,WAAW,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAElE,CAAC;aAAM,CAAC;YACJ,MAAM,GAAG,IAAI,WAAW,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CACzC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACd,CAAC,CAAE,IAAsB,CAAC,KAAK,EAAE;gBACjC,CAAC,CAAC,IAAI,CACb,CAAC,CAAC,CAAC;QACR,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAAA,CAAC;CAEL;AAnlBD,kCAmlBC","sourcesContent":["import { ChangeTree } from \"../changes/ChangeTree\";\nimport { OPERATION } from \"../spec\";\nimport { SchemaDecoderCallbacks, Schema } from \"../Schema\";\nimport { addCallback, removeChildRefs } from \"./utils\";\nimport { DataChange } from \"..\";\n\nconst DEFAULT_SORT = (a: any, b: any) => {\n    const A = a.toString();\n    const B = b.toString();\n    if (A < B) return -1;\n    else if (A > B) return 1;\n    else return 0\n}\n\nexport function getArrayProxy(value: ArraySchema) {\n    value['$proxy'] = true;\n\n    //\n    // compatibility with @colyseus/schema 0.5.x\n    // - allow `map[\"key\"]`\n    // - allow `map[\"key\"] = \"xxx\"`\n    // - allow `delete map[\"key\"]`\n    //\n    value = new Proxy(value, {\n        get: (obj, prop) => {\n            if (\n                typeof (prop) !== \"symbol\" &&\n                !isNaN(prop as any) // https://stackoverflow.com/a/175787/892698\n            ) {\n                return obj.at(prop as unknown as number);\n\n            } else {\n                return obj[prop];\n            }\n        },\n\n        set: (obj, prop, setValue) => {\n            if (\n                typeof (prop) !== \"symbol\" &&\n                !isNaN(prop as any)\n            ) {\n                const indexes = Array.from(obj['$items'].keys());\n                const key = parseInt(indexes[prop] || prop);\n                if (setValue === undefined || setValue === null) {\n                    obj.deleteAt(key);\n\n                } else {\n                    obj.setAt(key, setValue);\n                }\n\n            } else {\n                obj[prop] = setValue;\n            }\n\n            return true;\n        },\n\n        deleteProperty: (obj, prop) => {\n            if (typeof (prop) === \"number\") {\n                obj.deleteAt(prop);\n\n            } else {\n                delete obj[prop];\n            }\n\n            return true;\n        },\n\n        has: (obj, key) => {\n            if (\n                typeof (key) !== \"symbol\" &&\n                !isNaN(Number(key))\n            ) {\n                return obj['$items'].has(Number(key))\n            }\n            return Reflect.has(obj, key)\n        }\n    });\n\n    return value;\n}\n\nexport class ArraySchema<V = any> implements Array<V>, SchemaDecoderCallbacks {\n    protected $changes: ChangeTree = new ChangeTree(this);\n\n    protected $items: Map<number, V> = new Map<number, V>();\n    protected $indexes: Map<number, number> = new Map<number, number>();\n\n    protected $refId: number = 0;\n\n    [n: number]: V;\n\n    //\n    // Decoding callbacks\n    //\n    public $callbacks: { [operation: number]: Array<(item: V, key: number) => void> };\n    public onAdd(callback: (item: V, key: number) => void, triggerAll: boolean = true) {\n        return addCallback(\n            (this.$callbacks || (this.$callbacks = {})),\n            OPERATION.ADD,\n            callback,\n            (triggerAll)\n                ? this.$items\n                : undefined\n        );\n    }\n    public onRemove(callback: (item: V, key: number) => void) { return addCallback(this.$callbacks || (this.$callbacks = {}), OPERATION.DELETE, callback); }\n    public onChange(callback: (item: V, key: number) => void) { return addCallback(this.$callbacks || (this.$callbacks = {}), OPERATION.REPLACE, callback); }\n\n    static is(type: any) {\n        return (\n            // type format: [\"string\"]\n            Array.isArray(type) ||\n\n            // type format: { array: \"string\" }\n            (type['array'] !== undefined)\n        );\n    }\n\n    constructor (...items: V[]) {\n        this.push.apply(this, items);\n    }\n\n    set length (value: number) {\n        if (value === 0) {\n            this.clear();\n\n        } else {\n            this.splice(value, this.length - value);\n        }\n    }\n\n    get length() {\n        return this.$items.size;\n    }\n\n    push(...values: V[]) {\n        let lastIndex: number;\n\n        values.forEach(value => {\n            // set \"index\" for reference.\n            lastIndex = this.$refId++;\n\n            this.setAt(lastIndex, value);\n        });\n\n        return lastIndex;\n    }\n\n    /**\n     * Removes the last element from an array and returns it.\n     */\n    pop(): V | undefined {\n        const key = Array.from(this.$indexes.values()).pop();\n        if (key === undefined) { return undefined; }\n\n        this.$changes.delete(key);\n        this.$indexes.delete(key);\n\n        const value = this.$items.get(key);\n        this.$items.delete(key);\n\n        return value;\n    }\n\n    at(index: number) {\n        //\n        // FIXME: this should be O(1)\n        //\n        const key = Array.from(this.$items.keys())[index];\n        return this.$items.get(key);\n    }\n\n    setAt(index: number, value: V) {\n        if (value === undefined || value === null) {\n            console.error(\"ArraySchema items cannot be null nor undefined; Use `deleteAt(index)` instead.\");\n            return;\n        }\n\n        // skip if the value is the same as cached.\n        if (this.$items.get(index) === value) {\n            return;\n        }\n\n        if (value['$changes'] !== undefined) {\n            (value['$changes'] as ChangeTree).setParent(this, this.$changes.root, index);\n        }\n\n        const operation = this.$changes.indexes[index]?.op ?? OPERATION.ADD;\n\n        this.$changes.indexes[index] = index;\n\n        this.$indexes.set(index, index);\n        this.$items.set(index, value);\n\n        this.$changes.change(index, operation);\n    }\n\n    deleteAt(index: number) {\n        const key = Array.from(this.$items.keys())[index];\n        if (key === undefined) { return false; }\n        return this.$deleteAt(key);\n    }\n\n    protected $deleteAt(index) {\n        // delete at internal index\n        this.$changes.delete(index);\n        this.$indexes.delete(index);\n\n        return this.$items.delete(index);\n    }\n\n    clear(changes?: DataChange[]) {\n        // discard previous operations.\n        this.$changes.discard(true, true);\n        this.$changes.indexes = {};\n\n        // clear previous indexes\n        this.$indexes.clear();\n\n        //\n        // When decoding:\n        // - enqueue items for DELETE callback.\n        // - flag child items for garbage collection.\n        //\n        if (changes) {\n            removeChildRefs.call(this, changes);\n        }\n\n        // clear items\n        this.$items.clear();\n\n        this.$changes.operation({ index: 0, op: OPERATION.CLEAR });\n\n        // touch all structures until reach root\n        this.$changes.touchParents();\n    }\n\n    /**\n     * Combines two or more arrays.\n     * @param items Additional items to add to the end of array1.\n     */\n    // @ts-ignore\n    concat(...items: (V | ConcatArray<V>)[]): ArraySchema<V> {\n        return new ArraySchema(...Array.from(this.$items.values()).concat(...items));\n    }\n\n    /**\n     * Adds all the elements of an array separated by the specified separator string.\n     * @param separator A string used to separate one element of an array from the next in the resulting String. If omitted, the array elements are separated with a comma.\n     */\n    join(separator?: string): string {\n        return Array.from(this.$items.values()).join(separator);\n    }\n\n    /**\n     * Reverses the elements in an Array.\n     */\n    // @ts-ignore\n    reverse(): ArraySchema<V> {\n        const indexes = Array.from(this.$items.keys());\n        const reversedItems = Array.from(this.$items.values()).reverse();\n\n        reversedItems.forEach((item, i) => {\n            this.setAt(indexes[i], item);\n        });\n\n        return this;\n    }\n\n    /**\n     * Removes the first element from an array and returns it.\n     */\n    shift(): V | undefined {\n        const indexes = Array.from(this.$items.keys());\n\n        const shiftAt = indexes.shift();\n        if (shiftAt === undefined) { return undefined; }\n\n        const value = this.$items.get(shiftAt);\n        this.$deleteAt(shiftAt);\n\n        return value;\n    }\n\n    /**\n     * Returns a section of an array.\n     * @param start The beginning of the specified portion of the array.\n     * @param end The end of the specified portion of the array. This is exclusive of the element at the index 'end'.\n     */\n    slice(start?: number, end?: number): V[] {\n        const sliced = new ArraySchema<V>();\n        sliced.push(...Array.from(this.$items.values()).slice(start, end));\n        return sliced as unknown as V[];\n    }\n\n    /**\n     * Sorts an array.\n     * @param compareFn Function used to determine the order of the elements. It is expected to return\n     * a negative value if first argument is less than second argument, zero if they're equal and a positive\n     * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.\n     * ```ts\n     * [11,2,22,1].sort((a, b) => a - b)\n     * ```\n     */\n    sort(compareFn: (a: V, b: V) => number = DEFAULT_SORT): this {\n        const indexes = Array.from(this.$items.keys());\n        const sortedItems = Array.from(this.$items.values()).sort(compareFn);\n\n        sortedItems.forEach((item, i) => {\n            this.setAt(indexes[i], item);\n        });\n\n        return this;\n    }\n\n    /**\n     * Removes elements from an array and, if necessary, inserts new elements in their place, returning the deleted elements.\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     * @param items Elements to insert into the array in place of the deleted elements.\n     */\n    splice(\n        start: number,\n        deleteCount: number = this.length - start,\n        ...items: V[]\n    ): V[] {\n        const indexes = Array.from(this.$items.keys());\n        const removedItems: V[] = [];\n\n        for (let i = start; i < start + deleteCount; i++) {\n            removedItems.push(this.$items.get(indexes[i]));\n            this.$deleteAt(indexes[i]);\n        }\n\n        for (let i = 0; i < items.length; i++) {\n            this.setAt(start + i, items[i]);\n        }\n\n        return removedItems;\n    }\n\n    /**\n     * Inserts new elements at the start of an array.\n     * @param items  Elements to insert at the start of the Array.\n     */\n    unshift(...items: V[]): number {\n        const length = this.length;\n        const addedLength = items.length;\n\n        // const indexes = Array.from(this.$items.keys());\n        const previousValues = Array.from(this.$items.values());\n\n        items.forEach((item, i) => {\n            this.setAt(i, item);\n        });\n\n        previousValues.forEach((previousValue, i) => {\n            this.setAt(addedLength + i, previousValue);\n        });\n\n        return length + addedLength;\n    }\n\n    /**\n     * Returns the index of the first occurrence of a value in an array.\n     * @param searchElement The value to locate in the array.\n     * @param fromIndex The array index at which to begin the search. If fromIndex is omitted, the search starts at index 0.\n     */\n    indexOf(searchElement: V, fromIndex?: number): number {\n        return Array.from(this.$items.values()).indexOf(searchElement, fromIndex);\n    }\n\n    /**\n     * Returns the index of the last occurrence of a specified value in an array.\n     * @param searchElement The value to locate in the array.\n     * @param fromIndex The array index at which to begin the search. If fromIndex is omitted, the search starts at the last index in the array.\n     */\n    lastIndexOf(searchElement: V, fromIndex: number = this.length - 1): number {\n        return Array.from(this.$items.values()).lastIndexOf(searchElement, fromIndex);\n    }\n\n    /**\n     * Determines whether all the members of an array satisfy the specified test.\n     * @param callbackfn A function that accepts up to three arguments. The every method calls\n     * the callbackfn function for each element in the array until the callbackfn returns a value\n     * which is coercible to the Boolean value false, or until the end of the array.\n     * @param thisArg An object to which the this keyword can refer in the callbackfn function.\n     * If thisArg is omitted, undefined is used as the this value.\n     */\n    every(callbackfn: (value: V, index: number, array: V[]) => unknown, thisArg?: any): boolean {\n        return Array.from(this.$items.values()).every(callbackfn, thisArg);\n    }\n\n    /**\n     * Determines whether the specified callback function returns true for any element of an array.\n     * @param callbackfn A function that accepts up to three arguments. The some method calls\n     * the callbackfn function for each element in the array until the callbackfn returns a value\n     * which is coercible to the Boolean value true, or until the end of the array.\n     * @param thisArg An object to which the this keyword can refer in the callbackfn function.\n     * If thisArg is omitted, undefined is used as the this value.\n     */\n    some(callbackfn: (value: V, index: number, array: V[]) => unknown, thisArg?: any): boolean {\n        return Array.from(this.$items.values()).some(callbackfn, thisArg);\n    }\n\n    /**\n     * Performs the specified action for each element in an array.\n     * @param callbackfn  A function that accepts up to three arguments. forEach calls the callbackfn function one time for each element in the array.\n     * @param thisArg  An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.\n     */\n    forEach(callbackfn: (value: V, index: number, array: V[]) => void, thisArg?: any): void {\n        Array.from(this.$items.values()).forEach(callbackfn, thisArg);\n    }\n\n    /**\n     * Calls a defined callback function on each element of an array, and returns an array that contains the results.\n     * @param callbackfn A function that accepts up to three arguments. The map method calls the callbackfn function one time for each element in the array.\n     * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.\n     */\n    map<U>(callbackfn: (value: V, index: number, array: V[]) => U, thisArg?: any): U[] {\n        return Array.from(this.$items.values()).map(callbackfn, thisArg);\n    }\n\n    /**\n     * Returns the elements of an array that meet the condition specified in a callback function.\n     * @param callbackfn A function that accepts up to three arguments. The filter method calls the callbackfn function one time for each element in the array.\n     * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.\n     */\n    filter(callbackfn: (value: V, index: number, array: V[]) => unknown, thisArg?: any)\n    filter<S extends V>(callbackfn: (value: V, index: number, array: V[]) => value is S, thisArg?: any): V[] {\n        return Array.from(this.$items.values()).filter(callbackfn, thisArg);\n    }\n\n    /**\n     * Calls the specified callback function for all the elements in an array. The return value of the callback function is the accumulated result, and is provided as an argument in the next call to the callback function.\n     * @param callbackfn A function that accepts up to four arguments. The reduce method calls the callbackfn function one time for each element in the array.\n     * @param initialValue If initialValue is specified, it is used as the initial value to start the accumulation. The first call to the callbackfn function provides this value as an argument instead of an array value.\n     */\n    reduce<U=V>(callbackfn: (previousValue: U, currentValue: V, currentIndex: number, array: V[]) => U, initialValue?: U): U {\n        return Array.prototype.reduce.apply(Array.from(this.$items.values()), arguments);\n    }\n\n    /**\n     * Calls the specified callback function for all the elements in an array, in descending order. The return value of the callback function is the accumulated result, and is provided as an argument in the next call to the callback function.\n     * @param callbackfn A function that accepts up to four arguments. The reduceRight method calls the callbackfn function one time for each element in the array.\n     * @param initialValue If initialValue is specified, it is used as the initial value to start the accumulation. The first call to the callbackfn function provides this value as an argument instead of an array value.\n     */\n    reduceRight<U=V>(callbackfn: (previousValue: U, currentValue: V, currentIndex: number, array: V[]) => U, initialValue?: U): U {\n        return Array.prototype.reduceRight.apply(Array.from(this.$items.values()), arguments);\n    }\n\n    /**\n     * Returns the value of the first element in the array where predicate is true, and undefined\n     * otherwise.\n     * @param predicate find calls predicate once for each element of the array, in ascending\n     * order, until it finds one where predicate returns true. If such an element is found, find\n     * immediately returns that element value. Otherwise, find returns undefined.\n     * @param thisArg If provided, it will be used as the this value for each invocation of\n     * predicate. If it is not provided, undefined is used instead.\n     */\n    find(predicate: (value: V, index: number, obj: V[]) => boolean, thisArg?: any): V | undefined {\n        return Array.from(this.$items.values()).find(predicate, thisArg);\n    }\n\n    /**\n     * Returns the index of the first element in the array where predicate is true, and -1\n     * otherwise.\n     * @param predicate find calls predicate once for each element of the array, in ascending\n     * order, until it finds one where predicate returns true. If such an element is found,\n     * findIndex immediately returns that element index. Otherwise, findIndex returns -1.\n     * @param thisArg If provided, it will be used as the this value for each invocation of\n     * predicate. If it is not provided, undefined is used instead.\n     */\n    findIndex(predicate: (value: V, index: number, obj: V[]) => unknown, thisArg?: any): number {\n        return Array.from(this.$items.values()).findIndex(predicate, thisArg);\n    }\n\n    /**\n     * Returns the this object after filling the section identified by start and end with value\n     * @param value value to fill array section with\n     * @param start index to start filling the array at. If start is negative, it is treated as\n     * length+start where length is the length of the array.\n     * @param end index to stop filling the array at. If end is negative, it is treated as\n     * length+end.\n     */\n    fill(value: V, start?: number, end?: number): this {\n        //\n        // TODO\n        //\n        throw new Error(\"ArraySchema#fill() not implemented\");\n        // this.$items.fill(value, start, end);\n\n        return this;\n    }\n\n    /**\n     * Returns the this object after copying a section of the array identified by start and end\n     * to the same array starting at position target\n     * @param target If target is negative, it is treated as length+target where length is the\n     * length of the array.\n     * @param start If start is negative, it is treated as length+start. If end is negative, it\n     * is treated as length+end.\n     * @param end If not specified, length of the this object is used as its default value.\n     */\n    copyWithin(target: number, start: number, end?: number): this {\n        //\n        // TODO\n        //\n        throw new Error(\"ArraySchema#copyWithin() not implemented\");\n        return this;\n    }\n\n    /**\n     * Returns a string representation of an array.\n     */\n    toString(): string { return this.$items.toString(); }\n\n    /**\n     * Returns a string representation of an array. The elements are converted to string using their toLocalString methods.\n     */\n    toLocaleString(): string { return this.$items.toLocaleString() };\n\n    /** Iterator */\n    [Symbol.iterator](): IterableIterator<V> {\n        return Array.from(this.$items.values())[Symbol.iterator]();\n    }\n\n    static get [Symbol.species]() {\n        return ArraySchema;\n    }\n\n    // WORKAROUND for compatibility\n    // - TypeScript 4 defines @@unscopables as a function\n    // - TypeScript 5 defines @@unscopables as an object\n    [Symbol.unscopables]: any;\n\n    /**\n     * Returns an iterable of key, value pairs for every entry in the array\n     */\n    entries(): IterableIterator<[number, V]> { return this.$items.entries(); }\n\n    /**\n     * Returns an iterable of keys in the array\n     */\n    keys(): IterableIterator<number> { return this.$items.keys(); }\n\n    /**\n     * Returns an iterable of values in the array\n     */\n    values(): IterableIterator<V> { return this.$items.values(); }\n\n    /**\n     * Determines whether an array includes a certain element, returning true or false as appropriate.\n     * @param searchElement The element to search for.\n     * @param fromIndex The position in this array at which to begin searching for searchElement.\n     */\n    includes(searchElement: V, fromIndex?: number): boolean {\n        return Array.from(this.$items.values()).includes(searchElement, fromIndex);\n    }\n\n    //\n    // ES2022\n    //\n\n    /**\n     * Calls a defined callback function on each element of an array. Then, flattens the result into\n     * a new array.\n     * This is identical to a map followed by flat with depth 1.\n     *\n     * @param callback A function that accepts up to three arguments. The flatMap method calls the\n     * callback function one time for each element in the array.\n     * @param thisArg An object to which the this keyword can refer in the callback function. If\n     * thisArg is omitted, undefined is used as the this value.\n     */\n    // @ts-ignore\n    flatMap<U, This = undefined>(callback: (this: This, value: V, index: number, array: V[]) => U | ReadonlyArray<U>, thisArg?: This): U[] {\n        // @ts-ignore\n        throw new Error(\"ArraySchema#flatMap() is not supported.\");\n    }\n\n    /**\n     * Returns a new array with all sub-array elements concatenated into it recursively up to the\n     * specified depth.\n     *\n     * @param depth The maximum recursion depth\n     */\n    // @ts-ignore\n    flat<A, D extends number = 1>(this: A, depth?: D): any {\n        throw new Error(\"ArraySchema#flat() is not supported.\");\n    }\n\n    findLast() {\n        const arr = Array.from(this.$items.values());\n        // @ts-ignore\n        return arr.findLast.apply(arr, arguments);\n    }\n\n    findLastIndex(...args) {\n        const arr = Array.from(this.$items.values());\n        // @ts-ignore\n        return arr.findLastIndex.apply(arr, arguments);\n    }\n\n    //\n    // ES2023\n    //\n    with(index: number, value: V): ArraySchema<V> {\n        const copy = Array.from(this.$items.values());\n        copy[index] = value;\n        return new ArraySchema(...copy);\n    }\n    toReversed(): V[] {\n        return Array.from(this.$items.values()).reverse();\n    }\n    toSorted(compareFn?: (a: V, b: V) => number): V[] {\n        return Array.from(this.$items.values()).sort(compareFn);\n    }\n    toSpliced(start: number, deleteCount: number, ...items: V[]): V[];\n    toSpliced(start: number, deleteCount?: number): V[];\n    // @ts-ignore\n    toSpliced(start: unknown, deleteCount?: unknown, ...items?: unknown[]): V[] {\n        const copy = Array.from(this.$items.values());\n        // @ts-ignore\n        return copy.toSpliced.apply(copy, arguments);\n    }\n\n    protected setIndex(index: number, key: number) {\n        this.$indexes.set(index, key);\n    }\n\n    protected getIndex(index: number) {\n        return this.$indexes.get(index);\n    }\n\n    protected getByIndex(index: number) {\n        return this.$items.get(this.$indexes.get(index));\n    }\n\n    protected deleteByIndex(index: number) {\n        const key = this.$indexes.get(index);\n        this.$items.delete(key);\n        this.$indexes.delete(index);\n    }\n\n    toArray() {\n        return Array.from(this.$items.values());\n    }\n\n    toJSON() {\n        return this.toArray().map((value) => {\n            return (typeof (value['toJSON']) === \"function\")\n                ? value['toJSON']()\n                : value;\n        });\n    }\n\n    //\n    // Decoding utilities\n    //\n    clone(isDecoding?: boolean): ArraySchema<V> {\n        let cloned: ArraySchema;\n\n        if (isDecoding) {\n            cloned = new ArraySchema(...Array.from(this.$items.values()));\n\n        } else {\n            cloned = new ArraySchema(...this.map(item => (\n                (item['$changes'])\n                    ? (item as any as Schema).clone()\n                    : item\n            )));\n        }\n\n        return cloned;\n    };\n\n}\n"]}