@casual-simulation/expect 2.0.18

package/src/utils.js

@@ -0,0 +1,303 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+/* eslint-disable local/ban-types-eventually */
+import { isPrimitive } from './get-type';
+import { equals, isA, isImmutableUnorderedKeyed, isImmutableUnorderedSet, } from './jasmineUtils';
+/**
+ * Checks if `hasOwnProperty(object, key)` up the prototype chain, stopping at `Object.prototype`.
+ */
+const hasPropertyInObject = (object, key) => {
+    const shouldTerminate = !object || typeof object !== 'object' || object === Object.prototype;
+    if (shouldTerminate) {
+        return false;
+    }
+    return (Object.prototype.hasOwnProperty.call(object, key) ||
+        hasPropertyInObject(Object.getPrototypeOf(object), key));
+};
+export const getPath = (object, propertyPath) => {
+    if (!Array.isArray(propertyPath)) {
+        propertyPath = propertyPath.split('.');
+    }
+    if (propertyPath.length) {
+        const lastProp = propertyPath.length === 1;
+        const prop = propertyPath[0];
+        const newObject = object[prop];
+        if (!lastProp && (newObject === null || newObject === undefined)) {
+            // This is not the last prop in the chain. If we keep recursing it will
+            // hit a `can't access property X of undefined | null`. At this point we
+            // know that the chain has broken and we can return right away.
+            return {
+                hasEndProp: false,
+                lastTraversedObject: object,
+                traversedPath: [],
+            };
+        }
+        const result = getPath(newObject, propertyPath.slice(1));
+        if (result.lastTraversedObject === null) {
+            result.lastTraversedObject = object;
+        }
+        result.traversedPath.unshift(prop);
+        if (lastProp) {
+            // Does object have the property with an undefined value?
+            // Although primitive values support bracket notation (above)
+            // they would throw TypeError for in operator (below).
+            result.hasEndProp =
+                newObject !== undefined ||
+                    (!isPrimitive(object) && prop in object);
+            if (!result.hasEndProp) {
+                result.traversedPath.shift();
+            }
+        }
+        return result;
+    }
+    return {
+        lastTraversedObject: null,
+        traversedPath: [],
+        value: object,
+    };
+};
+// Strip properties from object that are not present in the subset. Useful for
+// printing the diff for toMatchObject() without adding unrelated noise.
+/* eslint-disable @typescript-eslint/explicit-module-boundary-types */
+export const getObjectSubset = (object, subset, seenReferences = new WeakMap()) => {
+    /* eslint-enable @typescript-eslint/explicit-module-boundary-types */
+    if (Array.isArray(object)) {
+        if (Array.isArray(subset) && subset.length === object.length) {
+            // The map method returns correct subclass of subset.
+            return subset.map((sub, i) => getObjectSubset(object[i], sub));
+        }
+    }
+    else if (object instanceof Date) {
+        return object;
+    }
+    else if (isObject(object) && isObject(subset)) {
+        if (equals(object, subset, [iterableEquality, subsetEquality])) {
+            // Avoid unnecessary copy which might return Object instead of subclass.
+            return subset;
+        }
+        const trimmed = {};
+        seenReferences.set(object, trimmed);
+        Object.keys(object)
+            .filter((key) => hasPropertyInObject(subset, key))
+            .forEach((key) => {
+            trimmed[key] = seenReferences.has(object[key])
+                ? seenReferences.get(object[key])
+                : getObjectSubset(object[key], subset[key], seenReferences);
+        });
+        if (Object.keys(trimmed).length > 0) {
+            return trimmed;
+        }
+    }
+    return object;
+};
+const IteratorSymbol = Symbol.iterator;
+const hasIterator = (object) => !!(object != null && object[IteratorSymbol]);
+/* eslint-disable @typescript-eslint/explicit-module-boundary-types */
+export const iterableEquality = (a, b, 
+/* eslint-enable @typescript-eslint/explicit-module-boundary-types */
+aStack = [], bStack = []) => {
+    if (typeof a !== 'object' ||
+        typeof b !== 'object' ||
+        Array.isArray(a) ||
+        Array.isArray(b) ||
+        !hasIterator(a) ||
+        !hasIterator(b)) {
+        return undefined;
+    }
+    if (a.constructor !== b.constructor) {
+        return false;
+    }
+    let length = aStack.length;
+    while (length--) {
+        // Linear search. Performance is inversely proportional to the number of
+        // unique nested structures.
+        // circular references at same depth are equal
+        // circular reference is not equal to non-circular one
+        if (aStack[length] === a) {
+            return bStack[length] === b;
+        }
+    }
+    aStack.push(a);
+    bStack.push(b);
+    const iterableEqualityWithStack = (a, b) => iterableEquality(a, b, [...aStack], [...bStack]);
+    if (a.size !== undefined) {
+        if (a.size !== b.size) {
+            return false;
+        }
+        else if (isA('Set', a) || isImmutableUnorderedSet(a)) {
+            let allFound = true;
+            for (const aValue of a) {
+                if (!b.has(aValue)) {
+                    let has = false;
+                    for (const bValue of b) {
+                        const isEqual = equals(aValue, bValue, [
+                            iterableEqualityWithStack,
+                        ]);
+                        if (isEqual === true) {
+                            has = true;
+                        }
+                    }
+                    if (has === false) {
+                        allFound = false;
+                        break;
+                    }
+                }
+            }
+            // Remove the first value from the stack of traversed values.
+            aStack.pop();
+            bStack.pop();
+            return allFound;
+        }
+        else if (isA('Map', a) || isImmutableUnorderedKeyed(a)) {
+            let allFound = true;
+            for (const aEntry of a) {
+                if (!b.has(aEntry[0]) ||
+                    !equals(aEntry[1], b.get(aEntry[0]), [
+                        iterableEqualityWithStack,
+                    ])) {
+                    let has = false;
+                    for (const bEntry of b) {
+                        const matchedKey = equals(aEntry[0], bEntry[0], [
+                            iterableEqualityWithStack,
+                        ]);
+                        let matchedValue = false;
+                        if (matchedKey === true) {
+                            matchedValue = equals(aEntry[1], bEntry[1], [
+                                iterableEqualityWithStack,
+                            ]);
+                        }
+                        if (matchedValue === true) {
+                            has = true;
+                        }
+                    }
+                    if (has === false) {
+                        allFound = false;
+                        break;
+                    }
+                }
+            }
+            // Remove the first value from the stack of traversed values.
+            aStack.pop();
+            bStack.pop();
+            return allFound;
+        }
+    }
+    const bIterator = b[IteratorSymbol]();
+    for (const aValue of a) {
+        const nextB = bIterator.next();
+        if (nextB.done ||
+            !equals(aValue, nextB.value, [iterableEqualityWithStack])) {
+            return false;
+        }
+    }
+    if (!bIterator.next().done) {
+        return false;
+    }
+    // Remove the first value from the stack of traversed values.
+    aStack.pop();
+    bStack.pop();
+    return true;
+};
+const isObject = (a) => a !== null && typeof a === 'object';
+const isObjectWithKeys = (a) => isObject(a) &&
+    !(a instanceof Error) &&
+    !(a instanceof Array) &&
+    !(a instanceof Date);
+export const subsetEquality = (object, subset) => {
+    // subsetEquality needs to keep track of the references
+    // it has already visited to avoid infinite loops in case
+    // there are circular references in the subset passed to it.
+    const subsetEqualityWithContext = (seenReferences = new WeakMap()) => (object, subset) => {
+        if (!isObjectWithKeys(subset)) {
+            return undefined;
+        }
+        return Object.keys(subset).every((key) => {
+            if (isObjectWithKeys(subset[key])) {
+                if (seenReferences.has(subset[key])) {
+                    return equals(object[key], subset[key], [
+                        iterableEquality,
+                    ]);
+                }
+                seenReferences.set(subset[key], true);
+            }
+            const result = object != null &&
+                hasPropertyInObject(object, key) &&
+                equals(object[key], subset[key], [
+                    iterableEquality,
+                    subsetEqualityWithContext(seenReferences),
+                ]);
+            // The main goal of using seenReference is to avoid circular node on tree.
+            // It will only happen within a parent and its child, not a node and nodes next to it (same level)
+            // We should keep the reference for a parent and its child only
+            // Thus we should delete the reference immediately so that it doesn't interfere
+            // other nodes within the same level on tree.
+            seenReferences.delete(subset[key]);
+            return result;
+        });
+    };
+    return subsetEqualityWithContext()(object, subset);
+};
+// eslint-disable-next-line @typescript-eslint/explicit-module-boundary-types
+export const typeEquality = (a, b) => {
+    if (a == null || b == null || a.constructor === b.constructor) {
+        return undefined;
+    }
+    return false;
+};
+export const arrayBufferEquality = (a, b) => {
+    if (!(a instanceof ArrayBuffer) || !(b instanceof ArrayBuffer)) {
+        return undefined;
+    }
+    const dataViewA = new DataView(a);
+    const dataViewB = new DataView(b);
+    // Buffers are not equal when they do not have the same byte length
+    if (dataViewA.byteLength !== dataViewB.byteLength) {
+        return false;
+    }
+    // Check if every byte value is equal to each other
+    for (let i = 0; i < dataViewA.byteLength; i++) {
+        if (dataViewA.getUint8(i) !== dataViewB.getUint8(i)) {
+            return false;
+        }
+    }
+    return true;
+};
+export const sparseArrayEquality = (a, b) => {
+    if (!Array.isArray(a) || !Array.isArray(b)) {
+        return undefined;
+    }
+    // A sparse array [, , 1] will have keys ["2"] whereas [undefined, undefined, 1] will have keys ["0", "1", "2"]
+    const aKeys = Object.keys(a);
+    const bKeys = Object.keys(b);
+    return (equals(a, b, [iterableEquality, typeEquality], true) &&
+        equals(aKeys, bKeys));
+};
+export const partition = (items, predicate) => {
+    const result = [[], []];
+    items.forEach((item) => result[predicate(item) ? 0 : 1].push(item));
+    return result;
+};
+// Copied from https://github.com/graingert/angular.js/blob/a43574052e9775cbc1d7dd8a086752c979b0f020/src/Angular.js#L685-L693
+export const isError = (value) => {
+    switch (Object.prototype.toString.call(value)) {
+        case '[object Error]':
+        case '[object Exception]':
+        case '[object DOMException]':
+            return true;
+        default:
+            return value instanceof Error;
+    }
+};
+export function emptyObject(obj) {
+    return obj && typeof obj === 'object' ? !Object.keys(obj).length : false;
+}
+const MULTILINE_REGEXP = /[\r\n]/;
+export const isOneline = (expected, received) => typeof expected === 'string' &&
+    typeof received === 'string' &&
+    (!MULTILINE_REGEXP.test(expected) || !MULTILINE_REGEXP.test(received));
+//# sourceMappingURL=utils.js.map

package/src/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["utils.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,+CAA+C;AAE/C,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACzC,OAAO,EACH,MAAM,EACN,GAAG,EACH,yBAAyB,EACzB,uBAAuB,GAC1B,MAAM,gBAAgB,CAAC;AASxB;;GAEG;AACH,MAAM,mBAAmB,GAAG,CAAC,MAAc,EAAE,GAAW,EAAW,EAAE;IACjE,MAAM,eAAe,GACjB,CAAC,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,MAAM,CAAC,SAAS,CAAC;IAEzE,IAAI,eAAe,EAAE;QACjB,OAAO,KAAK,CAAC;KAChB;IAED,OAAO,CACH,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;QACjD,mBAAmB,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAC1D,CAAC;AACN,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,OAAO,GAAG,CACnB,MAA2B,EAC3B,YAAoC,EAC7B,EAAE;IACT,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE;QAC9B,YAAY,GAAI,YAAuB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;KACtD;IAED,IAAI,YAAY,CAAC,MAAM,EAAE;QACrB,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC;QAC3C,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QAE/B,IAAI,CAAC,QAAQ,IAAI,CAAC,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,SAAS,CAAC,EAAE;YAC9D,uEAAuE;YACvE,wEAAwE;YACxE,+DAA+D;YAC/D,OAAO;gBACH,UAAU,EAAE,KAAK;gBACjB,mBAAmB,EAAE,MAAM;gBAC3B,aAAa,EAAE,EAAE;aACpB,CAAC;SACL;QAED,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAEzD,IAAI,MAAM,CAAC,mBAAmB,KAAK,IAAI,EAAE;YACrC,MAAM,CAAC,mBAAmB,GAAG,MAAM,CAAC;SACvC;QAED,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAEnC,IAAI,QAAQ,EAAE;YACV,yDAAyD;YACzD,6DAA6D;YAC7D,sDAAsD;YACtD,MAAM,CAAC,UAAU;gBACb,SAAS,KAAK,SAAS;oBACvB,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,MAAM,CAAC,CAAC;YAE7C,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE;gBACpB,MAAM,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;aAChC;SACJ;QAED,OAAO,MAAM,CAAC;KACjB;IAED,OAAO;QACH,mBAAmB,EAAE,IAAI;QACzB,aAAa,EAAE,EAAE;QACjB,KAAK,EAAE,MAAM;KAChB,CAAC;AACN,CAAC,CAAC;AAEF,8EAA8E;AAC9E,wEAAwE;AACxE,sEAAsE;AACtE,MAAM,CAAC,MAAM,eAAe,GAAG,CAC3B,MAAW,EACX,MAAW,EACX,iBAA2C,IAAI,OAAO,EAAE,EACrD,EAAE;IACL,qEAAqE;IACrE,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;QACvB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE;YAC1D,qDAAqD;YACrD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,GAAQ,EAAE,CAAS,EAAE,EAAE,CACtC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAClC,CAAC;SACL;KACJ;SAAM,IAAI,MAAM,YAAY,IAAI,EAAE;QAC/B,OAAO,MAAM,CAAC;KACjB;SAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE;QAC7C,IAAI,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,gBAAgB,EAAE,cAAc,CAAC,CAAC,EAAE;YAC5D,wEAAwE;YACxE,OAAO,MAAM,CAAC;SACjB;QAED,MAAM,OAAO,GAAQ,EAAE,CAAC;QACxB,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAEpC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;aACd,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,mBAAmB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;aACjD,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;YACb,OAAO,CAAC,GAAG,CAAC,GAAG,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBAC1C,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACjC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,CAAC;QACpE,CAAC,CAAC,CAAC;QAEP,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;YACjC,OAAO,OAAO,CAAC;SAClB;KACJ;IACD,OAAO,MAAM,CAAC;AAClB,CAAC,CAAC;AAEF,MAAM,cAAc,GAAG,MAAM,CAAC,QAAQ,CAAC;AAEvC,MAAM,WAAW,GAAG,CAAC,MAAW,EAAE,EAAE,CAChC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,IAAI,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC;AAEjD,sEAAsE;AACtE,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC5B,CAAM,EACN,CAAM;AACN,qEAAqE;AACrE,SAAqB,EAAE,EACvB,SAAqB,EAAE,EACJ,EAAE;IACrB,IACI,OAAO,CAAC,KAAK,QAAQ;QACrB,OAAO,CAAC,KAAK,QAAQ;QACrB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAChB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAChB,CAAC,WAAW,CAAC,CAAC,CAAC;QACf,CAAC,WAAW,CAAC,CAAC,CAAC,EACjB;QACE,OAAO,SAAS,CAAC;KACpB;IACD,IAAI,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,WAAW,EAAE;QACjC,OAAO,KAAK,CAAC;KAChB;IACD,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IAC3B,OAAO,MAAM,EAAE,EAAE;QACb,wEAAwE;QACxE,4BAA4B;QAC5B,8CAA8C;QAC9C,sDAAsD;QACtD,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;YACtB,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;SAC/B;KACJ;IACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACf,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEf,MAAM,yBAAyB,GAAG,CAAC,CAAM,EAAE,CAAM,EAAE,EAAE,CACjD,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAErD,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE;QACtB,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE;YACnB,OAAO,KAAK,CAAC;SAChB;aAAM,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,uBAAuB,CAAC,CAAC,CAAC,EAAE;YACpD,IAAI,QAAQ,GAAG,IAAI,CAAC;YACpB,KAAK,MAAM,MAAM,IAAI,CAAC,EAAE;gBACpB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;oBAChB,IAAI,GAAG,GAAG,KAAK,CAAC;oBAChB,KAAK,MAAM,MAAM,IAAI,CAAC,EAAE;wBACpB,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE;4BACnC,yBAAyB;yBAC5B,CAAC,CAAC;wBACH,IAAI,OAAO,KAAK,IAAI,EAAE;4BAClB,GAAG,GAAG,IAAI,CAAC;yBACd;qBACJ;oBAED,IAAI,GAAG,KAAK,KAAK,EAAE;wBACf,QAAQ,GAAG,KAAK,CAAC;wBACjB,MAAM;qBACT;iBACJ;aACJ;YACD,6DAA6D;YAC7D,MAAM,CAAC,GAAG,EAAE,CAAC;YACb,MAAM,CAAC,GAAG,EAAE,CAAC;YACb,OAAO,QAAQ,CAAC;SACnB;aAAM,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,yBAAyB,CAAC,CAAC,CAAC,EAAE;YACtD,IAAI,QAAQ,GAAG,IAAI,CAAC;YACpB,KAAK,MAAM,MAAM,IAAI,CAAC,EAAE;gBACpB,IACI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACjB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;wBACjC,yBAAyB;qBAC5B,CAAC,EACJ;oBACE,IAAI,GAAG,GAAG,KAAK,CAAC;oBAChB,KAAK,MAAM,MAAM,IAAI,CAAC,EAAE;wBACpB,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE;4BAC5C,yBAAyB;yBAC5B,CAAC,CAAC;wBAEH,IAAI,YAAY,GAAG,KAAK,CAAC;wBACzB,IAAI,UAAU,KAAK,IAAI,EAAE;4BACrB,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE;gCACxC,yBAAyB;6BAC5B,CAAC,CAAC;yBACN;wBACD,IAAI,YAAY,KAAK,IAAI,EAAE;4BACvB,GAAG,GAAG,IAAI,CAAC;yBACd;qBACJ;oBAED,IAAI,GAAG,KAAK,KAAK,EAAE;wBACf,QAAQ,GAAG,KAAK,CAAC;wBACjB,MAAM;qBACT;iBACJ;aACJ;YACD,6DAA6D;YAC7D,MAAM,CAAC,GAAG,EAAE,CAAC;YACb,MAAM,CAAC,GAAG,EAAE,CAAC;YACb,OAAO,QAAQ,CAAC;SACnB;KACJ;IAED,MAAM,SAAS,GAAG,CAAC,CAAC,cAAc,CAAC,EAAE,CAAC;IAEtC,KAAK,MAAM,MAAM,IAAI,CAAC,EAAE;QACpB,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC;QAC/B,IACI,KAAK,CAAC,IAAI;YACV,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,yBAAyB,CAAC,CAAC,EAC3D;YACE,OAAO,KAAK,CAAC;SAChB;KACJ;IACD,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE;QACxB,OAAO,KAAK,CAAC;KAChB;IAED,6DAA6D;IAC7D,MAAM,CAAC,GAAG,EAAE,CAAC;IACb,MAAM,CAAC,GAAG,EAAE,CAAC;IACb,OAAO,IAAI,CAAC;AAChB,CAAC,CAAC;AAEF,MAAM,QAAQ,GAAG,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,CAAC;AAEjE,MAAM,gBAAgB,GAAG,CAAC,CAAM,EAAE,EAAE,CAChC,QAAQ,CAAC,CAAC,CAAC;IACX,CAAC,CAAC,CAAC,YAAY,KAAK,CAAC;IACrB,CAAC,CAAC,CAAC,YAAY,KAAK,CAAC;IACrB,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC;AAEzB,MAAM,CAAC,MAAM,cAAc,GAAG,CAC1B,MAAe,EACf,MAAe,EACI,EAAE;IACrB,uDAAuD;IACvD,yDAAyD;IACzD,4DAA4D;IAC5D,MAAM,yBAAyB,GAC3B,CAAC,iBAA2C,IAAI,OAAO,EAAE,EAAE,EAAE,CAC7D,CAAC,MAAW,EAAE,MAAW,EAAuB,EAAE;QAC9C,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE;YAC3B,OAAO,SAAS,CAAC;SACpB;QAED,OAAO,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;YACrC,IAAI,gBAAgB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE;gBAC/B,IAAI,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE;oBACjC,OAAO,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;wBACpC,gBAAgB;qBACnB,CAAC,CAAC;iBACN;gBACD,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;aACzC;YACD,MAAM,MAAM,GACR,MAAM,IAAI,IAAI;gBACd,mBAAmB,CAAC,MAAM,EAAE,GAAG,CAAC;gBAChC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;oBAC7B,gBAAgB;oBAChB,yBAAyB,CAAC,cAAc,CAAC;iBAC5C,CAAC,CAAC;YACP,0EAA0E;YAC1E,kGAAkG;YAClG,+DAA+D;YAC/D,+EAA+E;YAC/E,6CAA6C;YAC7C,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YACnC,OAAO,MAAM,CAAC;QAClB,CAAC,CAAC,CAAC;IACP,CAAC,CAAC;IAEN,OAAO,yBAAyB,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AACvD,CAAC,CAAC;AAEF,6EAA6E;AAC7E,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAM,EAAE,CAAM,EAAuB,EAAE;IAChE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,WAAW,EAAE;QAC3D,OAAO,SAAS,CAAC;KACpB;IAED,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAC/B,CAAU,EACV,CAAU,EACS,EAAE;IACrB,IAAI,CAAC,CAAC,CAAC,YAAY,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,WAAW,CAAC,EAAE;QAC5D,OAAO,SAAS,CAAC;KACpB;IAED,MAAM,SAAS,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,SAAS,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;IAElC,mEAAmE;IACnE,IAAI,SAAS,CAAC,UAAU,KAAK,SAAS,CAAC,UAAU,EAAE;QAC/C,OAAO,KAAK,CAAC;KAChB;IAED,mDAAmD;IACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE;QAC3C,IAAI,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;YACjD,OAAO,KAAK,CAAC;SAChB;KACJ;IAED,OAAO,IAAI,CAAC;AAChB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAC/B,CAAU,EACV,CAAU,EACS,EAAE;IACrB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QACxC,OAAO,SAAS,CAAC;KACpB;IAED,+GAA+G;IAC/G,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7B,OAAO,CACH,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,gBAAgB,EAAE,YAAY,CAAC,EAAE,IAAI,CAAC;QACpD,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CACvB,CAAC;AACN,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,SAAS,GAAG,CACrB,KAAe,EACf,SAA8B,EACV,EAAE;IACtB,MAAM,MAAM,GAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAE9C,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAEpE,OAAO,MAAM,CAAC;AAClB,CAAC,CAAC;AAEF,6HAA6H;AAC7H,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,KAAc,EAAkB,EAAE;IACtD,QAAQ,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;QAC3C,KAAK,gBAAgB,CAAC;QACtB,KAAK,oBAAoB,CAAC;QAC1B,KAAK,uBAAuB;YACxB,OAAO,IAAI,CAAC;QAChB;YACI,OAAO,KAAK,YAAY,KAAK,CAAC;KACrC;AACL,CAAC,CAAC;AAEF,MAAM,UAAU,WAAW,CAAC,GAAY;IACpC,OAAO,GAAG,IAAI,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;AAC7E,CAAC;AAED,MAAM,gBAAgB,GAAG,QAAQ,CAAC;AAElC,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,QAAiB,EAAE,QAAiB,EAAW,EAAE,CACvE,OAAO,QAAQ,KAAK,QAAQ;IAC5B,OAAO,QAAQ,KAAK,QAAQ;IAC5B,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC"}