npm - @kestra-io/ui-libs - Versions diffs - 0.0.232 → 0.0.234 - Mend

@kestra-io/ui-libs 0.0.232 → 0.0.234

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (12) hide show

package/dist/VueFlowUtils-5yCq2fSo.js.map +1 -1
package/dist/VueFlowUtils-B2OVrQPC.cjs.map +1 -1
package/dist/components/nodes/EdgeNode.vue.d.ts +1 -1
package/dist/kestra-index.cjs.js.map +1 -1
package/dist/kestra-index.es.js.map +1 -1
package/dist/utils/Utils.d.ts +2 -2
package/dist/utils/Utils.d.ts.map +1 -1
package/dist/utils/plugins.d.ts +1 -1
package/dist/utils/plugins.d.ts.map +1 -1
package/package.json +1 -1
package/src/utils/Utils.ts +1 -1
package/src/utils/plugins.ts +1 -1

package/dist/VueFlowUtils-5yCq2fSo.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"VueFlowUtils-5yCq2fSo.js","sources":["../src/utils/constants.ts","../node_modules/lodash/_createBaseFor.js","../node_modules/lodash/_baseFor.js","../node_modules/lodash/_baseForOwn.js","../node_modules/lodash/_setCacheAdd.js","../node_modules/lodash/_setCacheHas.js","../node_modules/lodash/_SetCache.js","../node_modules/lodash/_arraySome.js","../node_modules/lodash/_cacheHas.js","../node_modules/lodash/_equalArrays.js","../node_modules/lodash/_mapToArray.js","../node_modules/lodash/_setToArray.js","../node_modules/lodash/_equalByTag.js","../node_modules/lodash/_equalObjects.js","../node_modules/lodash/_baseIsEqualDeep.js","../node_modules/lodash/_baseIsEqual.js","../node_modules/lodash/_baseIsMatch.js","../node_modules/lodash/_isStrictComparable.js","../node_modules/lodash/_getMatchData.js","../node_modules/lodash/_matchesStrictComparable.js","../node_modules/lodash/_baseMatches.js","../node_modules/lodash/isSymbol.js","../node_modules/lodash/_isKey.js","../node_modules/lodash/memoize.js","../node_modules/lodash/_memoizeCapped.js","../node_modules/lodash/_stringToPath.js","../node_modules/lodash/_arrayMap.js","../node_modules/lodash/_baseToString.js","../node_modules/lodash/toString.js","../node_modules/lodash/_castPath.js","../node_modules/lodash/_toKey.js","../node_modules/lodash/_baseGet.js","../node_modules/lodash/get.js","../node_modules/lodash/_baseHasIn.js","../node_modules/lodash/_hasPath.js","../node_modules/lodash/hasIn.js","../node_modules/lodash/_baseMatchesProperty.js","../node_modules/lodash/identity.js","../node_modules/lodash/_baseProperty.js","../node_modules/lodash/_basePropertyDeep.js","../node_modules/lodash/property.js","../node_modules/lodash/_baseIteratee.js","../node_modules/lodash/mapValues.js","../src/utils/Utils.ts","../node_modules/lodash/clone.js","../node_modules/lodash/constant.js","../node_modules/lodash/_createBaseEach.js","../node_modules/lodash/_baseEach.js","../node_modules/lodash/_castFunction.js","../node_modules/lodash/forEach.js","../node_modules/lodash/each.js","../node_modules/lodash/_baseFilter.js","../node_modules/lodash/filter.js","../node_modules/lodash/_baseHas.js","../node_modules/lodash/has.js","../node_modules/lodash/isEmpty.js","../node_modules/lodash/isUndefined.js","../node_modules/lodash/_baseMap.js","../node_modules/lodash/map.js","../node_modules/lodash/_arrayReduce.js","../node_modules/lodash/_baseReduce.js","../node_modules/lodash/reduce.js","../node_modules/lodash/isString.js","../node_modules/lodash/_asciiSize.js","../node_modules/lodash/_hasUnicode.js","../node_modules/lodash/_unicodeSize.js","../node_modules/lodash/_stringSize.js","../node_modules/lodash/size.js","../node_modules/lodash/transform.js","../node_modules/lodash/_isFlattenable.js","../node_modules/lodash/_baseFlatten.js","../node_modules/lodash/_apply.js","../node_modules/lodash/_overRest.js","../node_modules/lodash/_baseSetToString.js","../node_modules/lodash/_shortOut.js","../node_modules/lodash/_setToString.js","../node_modules/lodash/_baseRest.js","../node_modules/lodash/_baseFindIndex.js","../node_modules/lodash/_baseIsNaN.js","../node_modules/lodash/_strictIndexOf.js","../node_modules/lodash/_baseIndexOf.js","../node_modules/lodash/_arrayIncludes.js","../node_modules/lodash/_arrayIncludesWith.js","../node_modules/lodash/noop.js","../node_modules/lodash/_createSet.js","../node_modules/lodash/_baseUniq.js","../node_modules/lodash/isArrayLikeObject.js","../node_modules/lodash/union.js","../node_modules/lodash/_baseValues.js","../node_modules/lodash/values.js","../node_modules/graphlib/lib/lodash.js","../node_modules/graphlib/lib/graph.js","../node_modules/graphlib/lib/version.js","../node_modules/graphlib/lib/index.js","../node_modules/graphlib/lib/json.js","../node_modules/graphlib/lib/alg/components.js","../node_modules/graphlib/lib/data/priority-queue.js","../node_modules/graphlib/lib/alg/dijkstra.js","../node_modules/graphlib/lib/alg/dijkstra-all.js","../node_modules/graphlib/lib/alg/tarjan.js","../node_modules/graphlib/lib/alg/find-cycles.js","../node_modules/graphlib/lib/alg/floyd-warshall.js","../node_modules/graphlib/lib/alg/topsort.js","../node_modules/graphlib/lib/alg/is-acyclic.js","../node_modules/graphlib/lib/alg/dfs.js","../node_modules/graphlib/lib/alg/postorder.js","../node_modules/graphlib/lib/alg/preorder.js","../node_modules/graphlib/lib/alg/prim.js","../node_modules/graphlib/lib/alg/index.js","../node_modules/graphlib/index.js","../node_modules/dagre/lib/graphlib.js","../node_modules/lodash/_isIterateeCall.js","../node_modules/lodash/defaults.js","../node_modules/lodash/_createFind.js","../node_modules/lodash/_trimmedEndIndex.js","../node_modules/lodash/_baseTrim.js","../node_modules/lodash/toNumber.js","../node_modules/lodash/toFinite.js","../node_modules/lodash/toInteger.js","../node_modules/lodash/findIndex.js","../node_modules/lodash/find.js","../node_modules/lodash/flatten.js","../node_modules/lodash/forIn.js","../node_modules/lodash/last.js","../node_modules/lodash/_baseExtremum.js","../node_modules/lodash/_baseGt.js","../node_modules/lodash/max.js","../node_modules/lodash/_assignMergeValue.js","../node_modules/lodash/isPlainObject.js","../node_modules/lodash/_safeGet.js","../node_modules/lodash/toPlainObject.js","../node_modules/lodash/_baseMergeDeep.js","../node_modules/lodash/_baseMerge.js","../node_modules/lodash/_createAssigner.js","../node_modules/lodash/merge.js","../node_modules/lodash/_baseLt.js","../node_modules/lodash/min.js","../node_modules/lodash/minBy.js","../node_modules/lodash/now.js","../node_modules/lodash/_baseSet.js","../node_modules/lodash/_basePickBy.js","../node_modules/lodash/_basePick.js","../node_modules/lodash/_flatRest.js","../node_modules/lodash/pick.js","../node_modules/lodash/_baseRange.js","../node_modules/lodash/_createRange.js","../node_modules/lodash/range.js","../node_modules/lodash/_baseSortBy.js","../node_modules/lodash/_compareAscending.js","../node_modules/lodash/_compareMultiple.js","../node_modules/lodash/_baseOrderBy.js","../node_modules/lodash/sortBy.js","../node_modules/lodash/uniqueId.js","../node_modules/lodash/_baseZipObject.js","../node_modules/lodash/zipObject.js","../node_modules/dagre/lib/lodash.js","../node_modules/dagre/lib/data/list.js","../node_modules/dagre/lib/greedy-fas.js","../node_modules/dagre/lib/acyclic.js","../node_modules/dagre/lib/util.js","../node_modules/dagre/lib/normalize.js","../node_modules/dagre/lib/rank/util.js","../node_modules/dagre/lib/rank/feasible-tree.js","../node_modules/dagre/lib/rank/network-simplex.js","../node_modules/dagre/lib/rank/index.js","../node_modules/dagre/lib/parent-dummy-chains.js","../node_modules/dagre/lib/nesting-graph.js","../node_modules/dagre/lib/add-border-segments.js","../node_modules/dagre/lib/coordinate-system.js","../node_modules/dagre/lib/order/init-order.js","../node_modules/dagre/lib/order/cross-count.js","../node_modules/dagre/lib/order/barycenter.js","../node_modules/dagre/lib/order/resolve-conflicts.js","../node_modules/dagre/lib/order/sort.js","../node_modules/dagre/lib/order/sort-subgraph.js","../node_modules/dagre/lib/order/build-layer-graph.js","../node_modules/dagre/lib/order/add-subgraph-constraints.js","../node_modules/dagre/lib/order/index.js","../node_modules/dagre/lib/position/bk.js","../node_modules/dagre/lib/position/index.js","../node_modules/dagre/lib/layout.js","../node_modules/dagre/lib/debug.js","../node_modules/dagre/lib/version.js","../node_modules/dagre/index.js","../node_modules/lodash/isEqual.js","../src/utils/VueFlowUtils.ts"],"sourcesContent":["export const SECTIONS = {\n TASKS: \"TASKS\",\n TRIGGERS: \"TRIGGERS\",\n TASK_RUNNERS: \"TASK_RUNNERS\",\n} as const;\n\nexport const EVENTS = {\n EDIT: \"edit\",\n DELETE: \"delete\",\n SHOW_DESCRIPTION: \"showDescription\",\n COLLAPSE: \"collapse\",\n EXPAND: \"expand\",\n OPEN_LINK: \"openLink\",\n ADD_TASK: \"addTask\",\n SHOW_LOGS: \"showLogs\",\n MOUSE_OVER: \"mouseover\",\n MOUSE_LEAVE: \"mouseleave\",\n ADD_ERROR: \"addError\",\n EXPAND_DEPENDENCIES: \"expandDependencies\",\n SHOW_CONDITION: \"showCondition\",\n RUN_TASK: \"runTask\",\n} as const;\n\nexport const CLUSTER_PREFIX = \"cluster_\";\n\nexport const stateGlobalChartTypes = {\n EXECUTIONS: \"executions\",\n TASKRUNS: \"taskruns\",\n} as const;\n\nexport const logDisplayTypes = {\n ALL: \"all\",\n ERROR: \"error\",\n HIDDEN: \"hidden\",\n DEFAULT: \"all\",\n} as const;\n\nexport const NODE_SIZES = {\n TASK_WIDTH: 184,\n TASK_HEIGHT: 44,\n TRIGGER_WIDTH: 184,\n TRIGGER_HEIGHT: 44,\n DOT_WIDTH: 5,\n DOT_HEIGHT: 5,\n COLLAPSED_CLUSTER_WIDTH: 150,\n COLLAPSED_CLUSTER_HEIGHT: 44,\n TRIGGER_CLUSTER_WIDTH: 350,\n TRIGGER_CLUSTER_HEIGHT: 180,\n} as const;\n\nexport const editorViewTypes = {\n STORAGE_KEY: \"view-type\",\n SOURCE: \"source\",\n SOURCE_TOPOLOGY: \"source-topology\",\n SOURCE_DOC: \"source-doc\",\n TOPOLOGY: \"topology\",\n SOURCE_BLUEPRINTS: \"source-blueprints\",\n} as const;\n\nexport const storageKeys = {\n DISPLAY_EXECUTIONS_COLUMNS: \"displayExecutionsColumns\",\n DISPLAY_FLOW_EXECUTIONS_COLUMNS: \"displayFlowExecutionsColumns\",\n SELECTED_TENANT: \"selectedTenant\",\n EXECUTE_FLOW_BEHAVIOUR: \"executeFlowBehaviour\",\n SHOW_CHART: \"showChart\",\n SHOW_FLOWS_CHART: \"showFlowsChart\",\n SHOW_LOGS_CHART: \"showLogsChart\",\n DEFAULT_NAMESPACE: \"defaultNamespace\",\n LATEST_NAMESPACE: \"latestNamespace\",\n PAGINATION_SIZE: \"paginationSize\",\n IMPERSONATE: \"impersonate\",\n EDITOR_VIEW_TYPE: \"editorViewType\",\n} as const;\n\nexport const executeFlowBehaviours = {\n SAME_TAB: \"same tab\",\n NEW_TAB: \"new tab\",\n} as const;\n\nexport const stateDisplayValues = {\n INPROGRESS: \"IN-PROGRESS\",\n} as const;\n","/*\n Creates a base function for methods like `_.forIn` and `_.forOwn`.\n \n @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n /\nfunction createBaseFor(fromRight) {\n return function(object, iteratee, keysFunc) {\n var index = -1,\n iterable = Object(object),\n props = keysFunc(object),\n length = props.length;\n\n while (length--) {\n var key = props[fromRight ? length : ++index];\n if (iteratee(iterable[key], key, iterable) === false) {\n break;\n }\n }\n return object;\n };\n}\n\nmodule.exports = createBaseFor;\n","var createBaseFor = require('./_createBaseFor');\n\n/\n The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n \n @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n /\nvar baseFor = createBaseFor();\n\nmodule.exports = baseFor;\n","var baseFor = require('./_baseFor'),\n keys = require('./keys');\n\n/\n The base implementation of `_.forOwn` without support for iteratee shorthands.\n \n @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n /\nfunction baseForOwn(object, iteratee) {\n return object && baseFor(object, iteratee, keys);\n}\n\nmodule.exports = baseForOwn;\n","/* Used to stand-in for `undefined` hash values. /\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/\n Adds `value` to the array cache.\n \n @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {} value The value to cache.\n @returns {Object} Returns the cache instance.\n /\nfunction setCacheAdd(value) {\n this.__data__.set(value, HASH_UNDEFINED);\n return this;\n}\n\nmodule.exports = setCacheAdd;\n","/\n Checks if `value` is in the array cache.\n \n @private\n * @name has\n * @memberOf SetCache\n * @param {} value The value to search for.\n @returns {number} Returns `true` if `value` is found, else `false`.\n /\nfunction setCacheHas(value) {\n return this.__data__.has(value);\n}\n\nmodule.exports = setCacheHas;\n","var MapCache = require('./_MapCache'),\n setCacheAdd = require('./_setCacheAdd'),\n setCacheHas = require('./_setCacheHas');\n\n/\n \n * Creates an array cache object to store unique values.\n \n @private\n * @constructor\n * @param {Array} [values] The values to cache.\n /\nfunction SetCache(values) {\n var index = -1,\n length = values == null ? 0 : values.length;\n\n this.__data__ = new MapCache;\n while (++index < length) {\n this.add(values[index]);\n }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nmodule.exports = SetCache;\n","/\n A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n /\nfunction arraySome(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (predicate(array[index], index, array)) {\n return true;\n }\n }\n return false;\n}\n\nmodule.exports = arraySome;\n","/\n Checks if a `cache` value for `key` exists.\n \n @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n /\nfunction cacheHas(cache, key) {\n return cache.has(key);\n}\n\nmodule.exports = cacheHas;\n","var SetCache = require('./_SetCache'),\n arraySome = require('./_arraySome'),\n cacheHas = require('./_cacheHas');\n\n/* Used to compose bitmasks for value comparisons. /\nvar COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n/\n A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n \n @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n /\nfunction equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n arrLength = array.length,\n othLength = other.length;\n\n if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n return false;\n }\n // Check that cyclic values are equal.\n var arrStacked = stack.get(array);\n var othStacked = stack.get(other);\n if (arrStacked && othStacked) {\n return arrStacked == other && othStacked == array;\n }\n var index = -1,\n result = true,\n seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n stack.set(array, other);\n stack.set(other, array);\n\n // Ignore non-index properties.\n while (++index < arrLength) {\n var arrValue = array[index],\n othValue = other[index];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, arrValue, index, other, array, stack)\n : customizer(arrValue, othValue, index, array, other, stack);\n }\n if (compared !== undefined) {\n if (compared) {\n continue;\n }\n result = false;\n break;\n }\n // Recursively compare arrays (susceptible to call stack limits).\n if (seen) {\n if (!arraySome(other, function(othValue, othIndex) {\n if (!cacheHas(seen, othIndex) &&\n (arrValue === othValue \|\| equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n return seen.push(othIndex);\n }\n })) {\n result = false;\n break;\n }\n } else if (!(\n arrValue === othValue \|\|\n equalFunc(arrValue, othValue, bitmask, customizer, stack)\n )) {\n result = false;\n break;\n }\n }\n stack['delete'](array);\n stack['delete'](other);\n return result;\n}\n\nmodule.exports = equalArrays;\n","/\n Converts `map` to its key-value pairs.\n \n @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n /\nfunction mapToArray(map) {\n var index = -1,\n result = Array(map.size);\n\n map.forEach(function(value, key) {\n result[++index] = [key, value];\n });\n return result;\n}\n\nmodule.exports = mapToArray;\n","/\n Converts `set` to an array of its values.\n \n @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n /\nfunction setToArray(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = value;\n });\n return result;\n}\n\nmodule.exports = setToArray;\n","var Symbol = require('./_Symbol'),\n Uint8Array = require('./_Uint8Array'),\n eq = require('./eq'),\n equalArrays = require('./_equalArrays'),\n mapToArray = require('./_mapToArray'),\n setToArray = require('./_setToArray');\n\n/* Used to compose bitmasks for value comparisons. /\nvar COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n/* `Object#toString` result references. /\nvar boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n errorTag = '[object Error]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]';\n\n/* Used to convert symbols to primitives and strings. /\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/\n A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n \n Note: This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n \n @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n /\nfunction equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n switch (tag) {\n case dataViewTag:\n if ((object.byteLength != other.byteLength) \|\|\n (object.byteOffset != other.byteOffset)) {\n return false;\n }\n object = object.buffer;\n other = other.buffer;\n\n case arrayBufferTag:\n if ((object.byteLength != other.byteLength) \|\|\n !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n return false;\n }\n return true;\n\n case boolTag:\n case dateTag:\n case numberTag:\n // Coerce booleans to `1` or `0` and dates to milliseconds.\n // Invalid dates are coerced to `NaN`.\n return eq(+object, +other);\n\n case errorTag:\n return object.name == other.name && object.message == other.message;\n\n case regexpTag:\n case stringTag:\n // Coerce regexes to strings and treat strings, primitives and objects,\n // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n // for more details.\n return object == (other + '');\n\n case mapTag:\n var convert = mapToArray;\n\n case setTag:\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n convert \|\| (convert = setToArray);\n\n if (object.size != other.size && !isPartial) {\n return false;\n }\n // Assume cyclic values are equal.\n var stacked = stack.get(object);\n if (stacked) {\n return stacked == other;\n }\n bitmask \|= COMPARE_UNORDERED_FLAG;\n\n // Recursively compare objects (susceptible to call stack limits).\n stack.set(object, other);\n var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n stack['delete'](object);\n return result;\n\n case symbolTag:\n if (symbolValueOf) {\n return symbolValueOf.call(object) == symbolValueOf.call(other);\n }\n }\n return false;\n}\n\nmodule.exports = equalByTag;\n","var getAllKeys = require('./_getAllKeys');\n\n/* Used to compose bitmasks for value comparisons. /\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n \n @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n /\nfunction equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n objProps = getAllKeys(object),\n objLength = objProps.length,\n othProps = getAllKeys(other),\n othLength = othProps.length;\n\n if (objLength != othLength && !isPartial) {\n return false;\n }\n var index = objLength;\n while (index--) {\n var key = objProps[index];\n if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n return false;\n }\n }\n // Check that cyclic values are equal.\n var objStacked = stack.get(object);\n var othStacked = stack.get(other);\n if (objStacked && othStacked) {\n return objStacked == other && othStacked == object;\n }\n var result = true;\n stack.set(object, other);\n stack.set(other, object);\n\n var skipCtor = isPartial;\n while (++index < objLength) {\n key = objProps[index];\n var objValue = object[key],\n othValue = other[key];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, objValue, key, other, object, stack)\n : customizer(objValue, othValue, key, object, other, stack);\n }\n // Recursively compare objects (susceptible to call stack limits).\n if (!(compared === undefined\n ? (objValue === othValue \|\| equalFunc(objValue, othValue, bitmask, customizer, stack))\n : compared\n )) {\n result = false;\n break;\n }\n skipCtor \|\| (skipCtor = key == 'constructor');\n }\n if (result && !skipCtor) {\n var objCtor = object.constructor,\n othCtor = other.constructor;\n\n // Non `Object` object instances with different constructors are not equal.\n if (objCtor != othCtor &&\n ('constructor' in object && 'constructor' in other) &&\n !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n result = false;\n }\n }\n stack['delete'](object);\n stack['delete'](other);\n return result;\n}\n\nmodule.exports = equalObjects;\n","var Stack = require('./_Stack'),\n equalArrays = require('./_equalArrays'),\n equalByTag = require('./_equalByTag'),\n equalObjects = require('./_equalObjects'),\n getTag = require('./_getTag'),\n isArray = require('./isArray'),\n isBuffer = require('./isBuffer'),\n isTypedArray = require('./isTypedArray');\n\n/* Used to compose bitmasks for value comparisons. /\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/* `Object#toString` result references. /\nvar argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n objectTag = '[object Object]';\n\n/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n \n @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n /\nfunction baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n var objIsArr = isArray(object),\n othIsArr = isArray(other),\n objTag = objIsArr ? arrayTag : getTag(object),\n othTag = othIsArr ? arrayTag : getTag(other);\n\n objTag = objTag == argsTag ? objectTag : objTag;\n othTag = othTag == argsTag ? objectTag : othTag;\n\n var objIsObj = objTag == objectTag,\n othIsObj = othTag == objectTag,\n isSameTag = objTag == othTag;\n\n if (isSameTag && isBuffer(object)) {\n if (!isBuffer(other)) {\n return false;\n }\n objIsArr = true;\n objIsObj = false;\n }\n if (isSameTag && !objIsObj) {\n stack \|\| (stack = new Stack);\n return (objIsArr \|\| isTypedArray(object))\n ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n }\n if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n if (objIsWrapped \|\| othIsWrapped) {\n var objUnwrapped = objIsWrapped ? object.value() : object,\n othUnwrapped = othIsWrapped ? other.value() : other;\n\n stack \|\| (stack = new Stack);\n return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n }\n }\n if (!isSameTag) {\n return false;\n }\n stack \|\| (stack = new Stack);\n return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n}\n\nmodule.exports = baseIsEqualDeep;\n","var baseIsEqualDeep = require('./_baseIsEqualDeep'),\n isObjectLike = require('./isObjectLike');\n\n/\n The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n \n @private\n * @param {} value The value to compare.\n @param {} other The other value to compare.\n @param {boolean} bitmask The bitmask flags.\n * 1 - Unordered comparison\n * 2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n /\nfunction baseIsEqual(value, other, bitmask, customizer, stack) {\n if (value === other) {\n return true;\n }\n if (value == null \|\| other == null \|\| (!isObjectLike(value) && !isObjectLike(other))) {\n return value !== value && other !== other;\n }\n return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n}\n\nmodule.exports = baseIsEqual;\n","var Stack = require('./_Stack'),\n baseIsEqual = require('./_baseIsEqual');\n\n/* Used to compose bitmasks for value comparisons. /\nvar COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n/\n The base implementation of `_.isMatch` without support for iteratee shorthands.\n \n @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n /\nfunction baseIsMatch(object, source, matchData, customizer) {\n var index = matchData.length,\n length = index,\n noCustomizer = !customizer;\n\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (index--) {\n var data = matchData[index];\n if ((noCustomizer && data[2])\n ? data[1] !== object[data[0]]\n : !(data[0] in object)\n ) {\n return false;\n }\n }\n while (++index < length) {\n data = matchData[index];\n var key = data[0],\n objValue = object[key],\n srcValue = data[1];\n\n if (noCustomizer && data[2]) {\n if (objValue === undefined && !(key in object)) {\n return false;\n }\n } else {\n var stack = new Stack;\n if (customizer) {\n var result = customizer(objValue, srcValue, key, object, source, stack);\n }\n if (!(result === undefined\n ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG \| COMPARE_UNORDERED_FLAG, customizer, stack)\n : result\n )) {\n return false;\n }\n }\n }\n return true;\n}\n\nmodule.exports = baseIsMatch;\n","var isObject = require('./isObject');\n\n/\n Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` if suitable for strict\n * equality comparisons, else `false`.\n /\nfunction isStrictComparable(value) {\n return value === value && !isObject(value);\n}\n\nmodule.exports = isStrictComparable;\n","var isStrictComparable = require('./_isStrictComparable'),\n keys = require('./keys');\n\n/\n Gets the property names, values, and compare flags of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n /\nfunction getMatchData(object) {\n var result = keys(object),\n length = result.length;\n\n while (length--) {\n var key = result[length],\n value = object[key];\n\n result[length] = [key, value, isStrictComparable(value)];\n }\n return result;\n}\n\nmodule.exports = getMatchData;\n","/\n A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n \n @private\n * @param {string} key The key of the property to get.\n * @param {} srcValue The value to match.\n @returns {Function} Returns the new spec function.\n /\nfunction matchesStrictComparable(key, srcValue) {\n return function(object) {\n if (object == null) {\n return false;\n }\n return object[key] === srcValue &&\n (srcValue !== undefined \|\| (key in Object(object)));\n };\n}\n\nmodule.exports = matchesStrictComparable;\n","var baseIsMatch = require('./_baseIsMatch'),\n getMatchData = require('./_getMatchData'),\n matchesStrictComparable = require('./_matchesStrictComparable');\n\n/\n The base implementation of `_.matches` which doesn't clone `source`.\n \n @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n /\nfunction baseMatches(source) {\n var matchData = getMatchData(source);\n if (matchData.length == 1 && matchData[0][2]) {\n return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n }\n return function(object) {\n return object === source \|\| baseIsMatch(object, source, matchData);\n };\n}\n\nmodule.exports = baseMatches;\n","var baseGetTag = require('./_baseGetTag'),\n isObjectLike = require('./isObjectLike');\n\n/* `Object#toString` result references. /\nvar symbolTag = '[object Symbol]';\n\n/\n Checks if `value` is classified as a `Symbol` primitive or object.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n \n _.isSymbol(Symbol.iterator);\n * // => true\n \n _.isSymbol('abc');\n * // => false\n /\nfunction isSymbol(value) {\n return typeof value == 'symbol' \|\|\n (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nmodule.exports = isSymbol;\n","var isArray = require('./isArray'),\n isSymbol = require('./isSymbol');\n\n/* Used to match property names within property paths. /\nvar reIsDeepProp = /\\.\|\\[(?:[^[\\]]\|([\"'])(?:(?!\\1)[^\\\\]\|\\\\.)?\\1)\\]/,\n reIsPlainProp = /^\\w$/;\n\n/*\n Checks if `value` is a property name and not a property path.\n \n @private\n * @param {} value The value to check.\n @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n /\nfunction isKey(value, object) {\n if (isArray(value)) {\n return false;\n }\n var type = typeof value;\n if (type == 'number' \|\| type == 'symbol' \|\| type == 'boolean' \|\|\n value == null \|\| isSymbol(value)) {\n return true;\n }\n return reIsPlainProp.test(value) \|\| !reIsDeepProp.test(value) \|\|\n (object != null && value in Object(object));\n}\n\nmodule.exports = isKey;\n","var MapCache = require('./_MapCache');\n\n/* Error message constants. /\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/\n Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n \n Note: The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n \n var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n \n var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n \n values(other);\n * // => [3, 4]\n \n object.a = 2;\n * values(object);\n * // => [1, 2]\n \n // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n \n // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n /\nfunction memoize(func, resolver) {\n if (typeof func != 'function' \|\| (resolver != null && typeof resolver != 'function')) {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var memoized = function() {\n var args = arguments,\n key = resolver ? resolver.apply(this, args) : args[0],\n cache = memoized.cache;\n\n if (cache.has(key)) {\n return cache.get(key);\n }\n var result = func.apply(this, args);\n memoized.cache = cache.set(key, result) \|\| cache;\n return result;\n };\n memoized.cache = new (memoize.Cache \|\| MapCache);\n return memoized;\n}\n\n// Expose `MapCache`.\nmemoize.Cache = MapCache;\n\nmodule.exports = memoize;\n","var memoize = require('./memoize');\n\n/* Used as the maximum memoize cache size. /\nvar MAX_MEMOIZE_SIZE = 500;\n\n/\n A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n \n @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n /\nfunction memoizeCapped(func) {\n var result = memoize(func, function(key) {\n if (cache.size === MAX_MEMOIZE_SIZE) {\n cache.clear();\n }\n return key;\n });\n\n var cache = result.cache;\n return result;\n}\n\nmodule.exports = memoizeCapped;\n","var memoizeCapped = require('./_memoizeCapped');\n\n/* Used to match property names within property paths. /\nvar rePropName = /[^.[\\]]+\|\\[(?:(-?\\d+(?:\\.\\d+)?)\|([\"'])((?:(?!\\2)[^\\\\]\|\\\\.)?)\\2)\\]\|(?=(?:\\.\|\\[\\])(?:\\.\|\\[\\]\|$))/g;\n\n/** Used to match backslashes in property paths. /\nvar reEscapeChar = /\\\$\\\$?/g;\n\n/\n Converts `string` to a property path array.\n \n @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n /\nvar stringToPath = memoizeCapped(function(string) {\n var result = [];\n if (string.charCodeAt(0) === 46 / . /) {\n result.push('');\n }\n string.replace(rePropName, function(match, number, quote, subString) {\n result.push(quote ? subString.replace(reEscapeChar, '$1') : (number \|\| match));\n });\n return result;\n});\n\nmodule.exports = stringToPath;\n","/\n A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n /\nfunction arrayMap(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iteratee(array[index], index, array);\n }\n return result;\n}\n\nmodule.exports = arrayMap;\n","var Symbol = require('./_Symbol'),\n arrayMap = require('./_arrayMap'),\n isArray = require('./isArray'),\n isSymbol = require('./isSymbol');\n\n/* Used as references for various `Number` constants. /\nvar INFINITY = 1 / 0;\n\n/* Used to convert symbols to primitives and strings. /\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/\n The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n \n @private\n * @param {} value The value to process.\n @returns {string} Returns the string.\n /\nfunction baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isArray(value)) {\n // Recursively convert values (susceptible to call stack limits).\n return arrayMap(value, baseToString) + '';\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = baseToString;\n","var baseToString = require('./_baseToString');\n\n/\n Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to convert.\n @returns {string} Returns the converted string.\n * @example\n \n _.toString(null);\n * // => ''\n \n _.toString(-0);\n * // => '-0'\n \n _.toString([1, 2, 3]);\n * // => '1,2,3'\n /\nfunction toString(value) {\n return value == null ? '' : baseToString(value);\n}\n\nmodule.exports = toString;\n","var isArray = require('./isArray'),\n isKey = require('./_isKey'),\n stringToPath = require('./_stringToPath'),\n toString = require('./toString');\n\n/\n Casts `value` to a path array if it's not one.\n \n @private\n * @param {} value The value to inspect.\n @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n /\nfunction castPath(value, object) {\n if (isArray(value)) {\n return value;\n }\n return isKey(value, object) ? [value] : stringToPath(toString(value));\n}\n\nmodule.exports = castPath;\n","var isSymbol = require('./isSymbol');\n\n/* Used as references for various `Number` constants. /\nvar INFINITY = 1 / 0;\n\n/\n Converts `value` to a string key if it's not a string or symbol.\n \n @private\n * @param {} value The value to inspect.\n @returns {string\|symbol} Returns the key.\n /\nfunction toKey(value) {\n if (typeof value == 'string' \|\| isSymbol(value)) {\n return value;\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = toKey;\n","var castPath = require('./_castPath'),\n toKey = require('./_toKey');\n\n/\n The base implementation of `_.get` without support for default values.\n \n @private\n * @param {Object} object The object to query.\n * @param {Array\|string} path The path of the property to get.\n * @returns {} Returns the resolved value.\n /\nfunction baseGet(object, path) {\n path = castPath(path, object);\n\n var index = 0,\n length = path.length;\n\n while (object != null && index < length) {\n object = object[toKey(path[index++])];\n }\n return (index && index == length) ? object : undefined;\n}\n\nmodule.exports = baseGet;\n","var baseGet = require('./_baseGet');\n\n/*\n Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n \n @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array\|string} path The path of the property to get.\n * @param {} [defaultValue] The value returned for `undefined` resolved values.\n @returns {} Returns the resolved value.\n @example\n \n var object = { 'a': [{ 'b': { 'c': 3 } }] };\n \n _.get(object, 'a[0].b.c');\n * // => 3\n \n _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n \n _.get(object, 'a.b.c', 'default');\n * // => 'default'\n /\nfunction get(object, path, defaultValue) {\n var result = object == null ? undefined : baseGet(object, path);\n return result === undefined ? defaultValue : result;\n}\n\nmodule.exports = get;\n","/\n The base implementation of `_.hasIn` without support for deep paths.\n \n @private\n * @param {Object} [object] The object to query.\n * @param {Array\|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n /\nfunction baseHasIn(object, key) {\n return object != null && key in Object(object);\n}\n\nmodule.exports = baseHasIn;\n","var castPath = require('./_castPath'),\n isArguments = require('./isArguments'),\n isArray = require('./isArray'),\n isIndex = require('./_isIndex'),\n isLength = require('./isLength'),\n toKey = require('./_toKey');\n\n/\n Checks if `path` exists on `object`.\n \n @private\n * @param {Object} object The object to query.\n * @param {Array\|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n /\nfunction hasPath(object, path, hasFunc) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n result = false;\n\n while (++index < length) {\n var key = toKey(path[index]);\n if (!(result = object != null && hasFunc(object, key))) {\n break;\n }\n object = object[key];\n }\n if (result \|\| ++index != length) {\n return result;\n }\n length = object == null ? 0 : object.length;\n return !!length && isLength(length) && isIndex(key, length) &&\n (isArray(object) \|\| isArguments(object));\n}\n\nmodule.exports = hasPath;\n","var baseHasIn = require('./_baseHasIn'),\n hasPath = require('./_hasPath');\n\n/\n Checks if `path` is a direct or inherited property of `object`.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array\|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n \n var object = _.create({ 'a': _.create({ 'b': 2 }) });\n \n _.hasIn(object, 'a');\n * // => true\n \n _.hasIn(object, 'a.b');\n * // => true\n \n _.hasIn(object, ['a', 'b']);\n * // => true\n \n _.hasIn(object, 'b');\n * // => false\n /\nfunction hasIn(object, path) {\n return object != null && hasPath(object, path, baseHasIn);\n}\n\nmodule.exports = hasIn;\n","var baseIsEqual = require('./_baseIsEqual'),\n get = require('./get'),\n hasIn = require('./hasIn'),\n isKey = require('./_isKey'),\n isStrictComparable = require('./_isStrictComparable'),\n matchesStrictComparable = require('./_matchesStrictComparable'),\n toKey = require('./_toKey');\n\n/* Used to compose bitmasks for value comparisons. /\nvar COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n/\n The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n \n @private\n * @param {string} path The path of the property to get.\n * @param {} srcValue The value to match.\n @returns {Function} Returns the new spec function.\n /\nfunction baseMatchesProperty(path, srcValue) {\n if (isKey(path) && isStrictComparable(srcValue)) {\n return matchesStrictComparable(toKey(path), srcValue);\n }\n return function(object) {\n var objValue = get(object, path);\n return (objValue === undefined && objValue === srcValue)\n ? hasIn(object, path)\n : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG \| COMPARE_UNORDERED_FLAG);\n };\n}\n\nmodule.exports = baseMatchesProperty;\n","/\n This method returns the first argument it receives.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {} value Any value.\n @returns {} Returns `value`.\n @example\n \n var object = { 'a': 1 };\n \n console.log(_.identity(object) === object);\n * // => true\n /\nfunction identity(value) {\n return value;\n}\n\nmodule.exports = identity;\n","/\n The base implementation of `_.property` without support for deep paths.\n \n @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n /\nfunction baseProperty(key) {\n return function(object) {\n return object == null ? undefined : object[key];\n };\n}\n\nmodule.exports = baseProperty;\n","var baseGet = require('./_baseGet');\n\n/\n A specialized version of `baseProperty` which supports deep paths.\n \n @private\n * @param {Array\|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n /\nfunction basePropertyDeep(path) {\n return function(object) {\n return baseGet(object, path);\n };\n}\n\nmodule.exports = basePropertyDeep;\n","var baseProperty = require('./_baseProperty'),\n basePropertyDeep = require('./_basePropertyDeep'),\n isKey = require('./_isKey'),\n toKey = require('./_toKey');\n\n/\n Creates a function that returns the value at `path` of a given object.\n \n @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {Array\|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n * @example\n \n var objects = [\n * { 'a': { 'b': 2 } },\n * { 'a': { 'b': 1 } }\n * ];\n \n _.map(objects, _.property('a.b'));\n * // => [2, 1]\n \n _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n * // => [1, 2]\n /\nfunction property(path) {\n return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n}\n\nmodule.exports = property;\n","var baseMatches = require('./_baseMatches'),\n baseMatchesProperty = require('./_baseMatchesProperty'),\n identity = require('./identity'),\n isArray = require('./isArray'),\n property = require('./property');\n\n/\n The base implementation of `_.iteratee`.\n \n @private\n * @param {} [value=_.identity] The value to convert to an iteratee.\n @returns {Function} Returns the iteratee.\n /\nfunction baseIteratee(value) {\n // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n if (typeof value == 'function') {\n return value;\n }\n if (value == null) {\n return identity;\n }\n if (typeof value == 'object') {\n return isArray(value)\n ? baseMatchesProperty(value[0], value[1])\n : baseMatches(value);\n }\n return property(value);\n}\n\nmodule.exports = baseIteratee;\n","var baseAssignValue = require('./_baseAssignValue'),\n baseForOwn = require('./_baseForOwn'),\n baseIteratee = require('./_baseIteratee');\n\n/\n Creates an object with the same keys as `object` and values generated\n * by running each own enumerable string keyed property of `object` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, key, object).\n \n @static\n * @memberOf _\n * @since 2.4.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapKeys\n * @example\n \n var users = {\n * 'fred': { 'user': 'fred', 'age': 40 },\n * 'pebbles': { 'user': 'pebbles', 'age': 1 }\n * };\n \n _.mapValues(users, function(o) { return o.age; });\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n \n // The `_.property` iteratee shorthand.\n * _.mapValues(users, 'age');\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n /\nfunction mapValues(object, iteratee) {\n var result = {};\n iteratee = baseIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, key, iteratee(value, key, object));\n });\n return result;\n}\n\nmodule.exports = mapValues;\n","import {getCurrentInstance} from \"vue\";\nimport humanizeDuration, {type Options as HumanizeDurationOptions,} from \"humanize-duration\";\nimport moment from \"moment\";\nimport momentTz from \"moment-timezone\";\n\nconst humanizeDurationLanguages = {\n en: {\n y: () => \"y\",\n mo: () => \"mo\",\n w: () => \"w\",\n d: () => \"d\",\n h: () => \"h\",\n m: () => \"m\",\n s: () => \"s\",\n ms: () => \"ms\",\n },\n fr: {\n y: () => \"a\",\n mo: () => \"mo\",\n w: () => \"se\",\n d: () => \"j\",\n h: () => \"h\",\n m: () => \"m\",\n s: () => \"s\",\n ms: () => \"ms\",\n },\n};\n\nexport const DATE_FORMAT_STORAGE_KEY = \"dateFormat\";\nexport const TIMEZONE_STORAGE_KEY = \"timezone\";\n\n\nexport const capitalize = (str: string) => str.charAt(0).toUpperCase() + str.slice(1)\n\nexport const dateFilter = (dateString: string, format: string) => {\n const currentLocale = getCurrentInstance()?.appContext.config.globalProperties.$moment().locale();\n const momentInstance = getCurrentInstance()?.appContext.config.globalProperties.$moment(dateString).locale(currentLocale);\n let f;\n if (format === \"iso\") {\n f = \"YYYY-MM-DD HH:mm:ss.SSS\";\n } else {\n f = format ?? localStorage.getItem(DATE_FORMAT_STORAGE_KEY) ?? \"llll\";\n }\n // Apply timezone and format using the correct locale\n return momentInstance\n .tz(localStorage.getItem(TIMEZONE_STORAGE_KEY) ?? momentTz.tz.guess())\n .format(f);\n }\n\nexport function splitFirst(str: string, separator: string) {\n return str.split(separator).slice(1).join(separator);\n}\n\nexport function duration(isoString: string) {\n return (\n moment.duration(isoString, moment.ISO_8601 as any).asMilliseconds() / 1000\n );\n}\n\nexport function humanDuration(\n value: number \| string,\n options?: HumanizeDurationOptions & { languages?: any }\n) {\n options = options \|\| {maxDecimalPoints: 2};\n options.spacer = \"\";\n options.language = localStorage.getItem(\"lang\") \|\| \"en\";\n options.languages = humanizeDurationLanguages;\n options.largest = 2;\n\n if (typeof value !== \"number\") {\n value = duration(value);\n }\n\n return humanizeDuration(value 1000, options).replace(\n /\\.([0-9])s$/i,\n \".$10s\"\n );\n}\n\nexport function afterLastDot(str: string) {\n return str.split(\".\").pop();\n}\n\nexport function distinctFilter(value: any, index: number, array: any[]) {\n return array.indexOf(value) === index;\n}\n\nexport default {\n capitalize,\n dateFilter,\n splitFirst,\n duration,\n humanDuration,\n afterLastDot,\n distinctFilter\n};\n","var baseClone = require('./_baseClone');\n\n/** Used to compose bitmasks for cloning. /\nvar CLONE_SYMBOLS_FLAG = 4;\n\n/\n Creates a shallow clone of `value`.\n \n Note: This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to clone.\n @returns {} Returns the cloned value.\n @see _.cloneDeep\n * @example\n \n var objects = [{ 'a': 1 }, { 'b': 2 }];\n \n var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n /\nfunction clone(value) {\n return baseClone(value, CLONE_SYMBOLS_FLAG);\n}\n\nmodule.exports = clone;\n","/\n Creates a function that returns `value`.\n \n @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {} value The value to return from the new function.\n @returns {Function} Returns the new constant function.\n * @example\n \n var objects = _.times(2, _.constant({ 'a': 1 }));\n \n console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n \n console.log(objects[0] === objects[1]);\n * // => true\n /\nfunction constant(value) {\n return function() {\n return value;\n };\n}\n\nmodule.exports = constant;\n","var isArrayLike = require('./isArrayLike');\n\n/\n Creates a `baseEach` or `baseEachRight` function.\n \n @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n /\nfunction createBaseEach(eachFunc, fromRight) {\n return function(collection, iteratee) {\n if (collection == null) {\n return collection;\n }\n if (!isArrayLike(collection)) {\n return eachFunc(collection, iteratee);\n }\n var length = collection.length,\n index = fromRight ? length : -1,\n iterable = Object(collection);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (iteratee(iterable[index], index, iterable) === false) {\n break;\n }\n }\n return collection;\n };\n}\n\nmodule.exports = createBaseEach;\n","var baseForOwn = require('./_baseForOwn'),\n createBaseEach = require('./_createBaseEach');\n\n/\n The base implementation of `_.forEach` without support for iteratee shorthands.\n \n @private\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array\|Object} Returns `collection`.\n /\nvar baseEach = createBaseEach(baseForOwn);\n\nmodule.exports = baseEach;\n","var identity = require('./identity');\n\n/\n Casts `value` to `identity` if it's not a function.\n \n @private\n * @param {} value The value to inspect.\n @returns {Function} Returns cast function.\n /\nfunction castFunction(value) {\n return typeof value == 'function' ? value : identity;\n}\n\nmodule.exports = castFunction;\n","var arrayEach = require('./_arrayEach'),\n baseEach = require('./_baseEach'),\n castFunction = require('./_castFunction'),\n isArray = require('./isArray');\n\n/\n Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index\|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n \n Note: As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array\|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n \n _.forEach([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `1` then `2`.\n \n _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n /\nfunction forEach(collection, iteratee) {\n var func = isArray(collection) ? arrayEach : baseEach;\n return func(collection, castFunction(iteratee));\n}\n\nmodule.exports = forEach;\n","module.exports = require('./forEach');\n","var baseEach = require('./_baseEach');\n\n/\n The base implementation of `_.filter` without support for iteratee shorthands.\n \n @private\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n /\nfunction baseFilter(collection, predicate) {\n var result = [];\n baseEach(collection, function(value, index, collection) {\n if (predicate(value, index, collection)) {\n result.push(value);\n }\n });\n return result;\n}\n\nmodule.exports = baseFilter;\n","var arrayFilter = require('./_arrayFilter'),\n baseFilter = require('./_baseFilter'),\n baseIteratee = require('./_baseIteratee'),\n isArray = require('./isArray');\n\n/\n Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index\|key, collection).\n \n Note: Unlike `_.remove`, this method returns a new array.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n \n var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n \n _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n \n // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n \n // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n \n // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n \n // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n /\nfunction filter(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, baseIteratee(predicate, 3));\n}\n\nmodule.exports = filter;\n","/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n The base implementation of `_.has` without support for deep paths.\n \n @private\n * @param {Object} [object] The object to query.\n * @param {Array\|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n /\nfunction baseHas(object, key) {\n return object != null && hasOwnProperty.call(object, key);\n}\n\nmodule.exports = baseHas;\n","var baseHas = require('./_baseHas'),\n hasPath = require('./_hasPath');\n\n/\n Checks if `path` is a direct property of `object`.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array\|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n \n var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n \n _.has(object, 'a');\n * // => true\n \n _.has(object, 'a.b');\n * // => true\n \n _.has(object, ['a', 'b']);\n * // => true\n \n _.has(other, 'a');\n * // => false\n /\nfunction has(object, path) {\n return object != null && hasPath(object, path, baseHas);\n}\n\nmodule.exports = has;\n","var baseKeys = require('./_baseKeys'),\n getTag = require('./_getTag'),\n isArguments = require('./isArguments'),\n isArray = require('./isArray'),\n isArrayLike = require('./isArrayLike'),\n isBuffer = require('./isBuffer'),\n isPrototype = require('./_isPrototype'),\n isTypedArray = require('./isTypedArray');\n\n/* `Object#toString` result references. /\nvar mapTag = '[object Map]',\n setTag = '[object Set]';\n\n/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n Checks if `value` is an empty object, collection, map, or set.\n \n Objects are considered empty if they have no own enumerable string keyed\n * properties.\n \n Array-like values such as `arguments` objects, arrays, buffers, strings, or\n * jQuery-like collections are considered empty if they have a `length` of `0`.\n * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is empty, else `false`.\n * @example\n \n _.isEmpty(null);\n * // => true\n \n _.isEmpty(true);\n * // => true\n \n _.isEmpty(1);\n * // => true\n \n _.isEmpty([1, 2, 3]);\n * // => false\n \n _.isEmpty({ 'a': 1 });\n * // => false\n /\nfunction isEmpty(value) {\n if (value == null) {\n return true;\n }\n if (isArrayLike(value) &&\n (isArray(value) \|\| typeof value == 'string' \|\| typeof value.splice == 'function' \|\|\n isBuffer(value) \|\| isTypedArray(value) \|\| isArguments(value))) {\n return !value.length;\n }\n var tag = getTag(value);\n if (tag == mapTag \|\| tag == setTag) {\n return !value.size;\n }\n if (isPrototype(value)) {\n return !baseKeys(value).length;\n }\n for (var key in value) {\n if (hasOwnProperty.call(value, key)) {\n return false;\n }\n }\n return true;\n}\n\nmodule.exports = isEmpty;\n","/\n Checks if `value` is `undefined`.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n * @example\n \n _.isUndefined(void 0);\n * // => true\n \n _.isUndefined(null);\n * // => false\n /\nfunction isUndefined(value) {\n return value === undefined;\n}\n\nmodule.exports = isUndefined;\n","var baseEach = require('./_baseEach'),\n isArrayLike = require('./isArrayLike');\n\n/\n The base implementation of `_.map` without support for iteratee shorthands.\n \n @private\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n /\nfunction baseMap(collection, iteratee) {\n var index = -1,\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value, key, collection) {\n result[++index] = iteratee(value, key, collection);\n });\n return result;\n}\n\nmodule.exports = baseMap;\n","var arrayMap = require('./_arrayMap'),\n baseIteratee = require('./_baseIteratee'),\n baseMap = require('./_baseMap'),\n isArray = require('./isArray');\n\n/\n Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index\|key, collection).\n \n Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n \n The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n \n function square(n) {\n * return n * n;\n * }\n \n _.map([4, 8], square);\n * // => [16, 64]\n \n _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n \n var users = [\n * { 'user': 'barney' },\n * { 'user': 'fred' }\n * ];\n \n // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n /\nfunction map(collection, iteratee) {\n var func = isArray(collection) ? arrayMap : baseMap;\n return func(collection, baseIteratee(iteratee, 3));\n}\n\nmodule.exports = map;\n","/\n A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {} [accumulator] The initial value.\n @param {boolean} [initAccum] Specify using the first element of `array` as\n * the initial value.\n * @returns {} Returns the accumulated value.\n /\nfunction arrayReduce(array, iteratee, accumulator, initAccum) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n if (initAccum && length) {\n accumulator = array[++index];\n }\n while (++index < length) {\n accumulator = iteratee(accumulator, array[index], index, array);\n }\n return accumulator;\n}\n\nmodule.exports = arrayReduce;\n","/*\n The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n \n @private\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {} accumulator The initial value.\n @param {boolean} initAccum Specify using the first or last element of\n * `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {} Returns the accumulated value.\n /\nfunction baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n eachFunc(collection, function(value, index, collection) {\n accumulator = initAccum\n ? (initAccum = false, value)\n : iteratee(accumulator, value, index, collection);\n });\n return accumulator;\n}\n\nmodule.exports = baseReduce;\n","var arrayReduce = require('./_arrayReduce'),\n baseEach = require('./_baseEach'),\n baseIteratee = require('./_baseIteratee'),\n baseReduce = require('./_baseReduce'),\n isArray = require('./isArray');\n\n/*\n Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index\|key, collection).\n \n Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n \n The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {} [accumulator] The initial value.\n @returns {} Returns the accumulated value.\n @see _.reduceRight\n * @example\n \n _.reduce([1, 2], function(sum, n) {\n * return sum + n;\n * }, 0);\n * // => 3\n \n _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] \|\| (result[value] = [])).push(key);\n * return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n /\nfunction reduce(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduce : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, baseIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n}\n\nmodule.exports = reduce;\n","var baseGetTag = require('./_baseGetTag'),\n isArray = require('./isArray'),\n isObjectLike = require('./isObjectLike');\n\n/* `Object#toString` result references. /\nvar stringTag = '[object String]';\n\n/\n Checks if `value` is classified as a `String` primitive or object.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n \n _.isString('abc');\n * // => true\n \n _.isString(1);\n * // => false\n /\nfunction isString(value) {\n return typeof value == 'string' \|\|\n (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n}\n\nmodule.exports = isString;\n","var baseProperty = require('./_baseProperty');\n\n/\n Gets the size of an ASCII `string`.\n \n @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n /\nvar asciiSize = baseProperty('length');\n\nmodule.exports = asciiSize;\n","/* Used to compose unicode character classes. /\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n rsComboMarksRange = '\\\\u0300-\\\\u036f',\n reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/* Used to compose unicode capture groups. /\nvar rsZWJ = '\\\\u200d';\n\n/* Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). /\nvar reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']');\n\n/\n Checks if `string` contains Unicode symbols.\n \n @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n /\nfunction hasUnicode(string) {\n return reHasUnicode.test(string);\n}\n\nmodule.exports = hasUnicode;\n","/* Used to compose unicode character classes. /\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n rsComboMarksRange = '\\\\u0300-\\\\u036f',\n reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/* Used to compose unicode capture groups. /\nvar rsAstral = '[' + rsAstralRange + ']',\n rsCombo = '[' + rsComboRange + ']',\n rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n rsModifier = '(?:' + rsCombo + '\|' + rsFitz + ')',\n rsNonAstral = '[^' + rsAstralRange + ']',\n rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n rsZWJ = '\\\\u200d';\n\n/* Used to compose unicode regexes. /\nvar reOptMod = rsModifier + '?',\n rsOptVar = '[' + rsVarRange + ']?',\n rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('\|') + ')' + rsOptVar + reOptMod + ')',\n rsSeq = rsOptVar + reOptMod + rsOptJoin,\n rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('\|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). /\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')\|' + rsSymbol + rsSeq, 'g');\n\n/\n Gets the size of a Unicode `string`.\n \n @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n /\nfunction unicodeSize(string) {\n var result = reUnicode.lastIndex = 0;\n while (reUnicode.test(string)) {\n ++result;\n }\n return result;\n}\n\nmodule.exports = unicodeSize;\n","var asciiSize = require('./_asciiSize'),\n hasUnicode = require('./_hasUnicode'),\n unicodeSize = require('./_unicodeSize');\n\n/\n Gets the number of symbols in `string`.\n \n @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n /\nfunction stringSize(string) {\n return hasUnicode(string)\n ? unicodeSize(string)\n : asciiSize(string);\n}\n\nmodule.exports = stringSize;\n","var baseKeys = require('./_baseKeys'),\n getTag = require('./_getTag'),\n isArrayLike = require('./isArrayLike'),\n isString = require('./isString'),\n stringSize = require('./_stringSize');\n\n/* `Object#toString` result references. /\nvar mapTag = '[object Map]',\n setTag = '[object Set]';\n\n/\n Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object\|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n \n _.size([1, 2, 3]);\n * // => 3\n \n _.size({ 'a': 1, 'b': 2 });\n * // => 2\n \n _.size('pebbles');\n * // => 7\n /\nfunction size(collection) {\n if (collection == null) {\n return 0;\n }\n if (isArrayLike(collection)) {\n return isString(collection) ? stringSize(collection) : collection.length;\n }\n var tag = getTag(collection);\n if (tag == mapTag \|\| tag == setTag) {\n return collection.size;\n }\n return baseKeys(collection).length;\n}\n\nmodule.exports = size;\n","var arrayEach = require('./_arrayEach'),\n baseCreate = require('./_baseCreate'),\n baseForOwn = require('./_baseForOwn'),\n baseIteratee = require('./_baseIteratee'),\n getPrototype = require('./_getPrototype'),\n isArray = require('./isArray'),\n isBuffer = require('./isBuffer'),\n isFunction = require('./isFunction'),\n isObject = require('./isObject'),\n isTypedArray = require('./isTypedArray');\n\n/\n An alternative to `_.reduce`; this method transforms `object` to a new\n * `accumulator` object which is the result of running each of its own\n * enumerable string keyed properties thru `iteratee`, with each invocation\n * potentially mutating the `accumulator` object. If `accumulator` is not\n * provided, a new object with the same `[[Prototype]]` will be used. The\n * iteratee is invoked with four arguments: (accumulator, value, key, object).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n \n @static\n * @memberOf _\n * @since 1.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {} [accumulator] The custom accumulator value.\n @returns {} Returns the accumulated value.\n @example\n \n _.transform([2, 3, 4], function(result, n) {\n * result.push(n = n);\n return n % 2 == 0;\n * }, []);\n * // => [4, 9]\n \n _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] \|\| (result[value] = [])).push(key);\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] }\n /\nfunction transform(object, iteratee, accumulator) {\n var isArr = isArray(object),\n isArrLike = isArr \|\| isBuffer(object) \|\| isTypedArray(object);\n\n iteratee = baseIteratee(iteratee, 4);\n if (accumulator == null) {\n var Ctor = object && object.constructor;\n if (isArrLike) {\n accumulator = isArr ? new Ctor : [];\n }\n else if (isObject(object)) {\n accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n }\n else {\n accumulator = {};\n }\n }\n (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n return iteratee(accumulator, value, index, object);\n });\n return accumulator;\n}\n\nmodule.exports = transform;\n","var Symbol = require('./_Symbol'),\n isArguments = require('./isArguments'),\n isArray = require('./isArray');\n\n/* Built-in value references. /\nvar spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/\n Checks if `value` is a flattenable `arguments` object or array.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n /\nfunction isFlattenable(value) {\n return isArray(value) \|\| isArguments(value) \|\|\n !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\nmodule.exports = isFlattenable;\n","var arrayPush = require('./_arrayPush'),\n isFlattenable = require('./_isFlattenable');\n\n/\n The base implementation of `_.flatten` with support for restricting flattening.\n \n @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n /\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n var index = -1,\n length = array.length;\n\n predicate \|\| (predicate = isFlattenable);\n result \|\| (result = []);\n\n while (++index < length) {\n var value = array[index];\n if (depth > 0 && predicate(value)) {\n if (depth > 1) {\n // Recursively flatten arrays (susceptible to call stack limits).\n baseFlatten(value, depth - 1, predicate, isStrict, result);\n } else {\n arrayPush(result, value);\n }\n } else if (!isStrict) {\n result[result.length] = value;\n }\n }\n return result;\n}\n\nmodule.exports = baseFlatten;\n","/\n A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n \n @private\n * @param {Function} func The function to invoke.\n * @param {} thisArg The `this` binding of `func`.\n @param {Array} args The arguments to invoke `func` with.\n * @returns {} Returns the result of `func`.\n /\nfunction apply(func, thisArg, args) {\n switch (args.length) {\n case 0: return func.call(thisArg);\n case 1: return func.call(thisArg, args[0]);\n case 2: return func.call(thisArg, args[0], args[1]);\n case 3: return func.call(thisArg, args[0], args[1], args[2]);\n }\n return func.apply(thisArg, args);\n}\n\nmodule.exports = apply;\n","var apply = require('./_apply');\n\n/* Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeMax = Math.max;\n\n/\n A specialized version of `baseRest` which transforms the rest array.\n \n @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n /\nfunction overRest(func, start, transform) {\n start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n return function() {\n var args = arguments,\n index = -1,\n length = nativeMax(args.length - start, 0),\n array = Array(length);\n\n while (++index < length) {\n array[index] = args[start + index];\n }\n index = -1;\n var otherArgs = Array(start + 1);\n while (++index < start) {\n otherArgs[index] = args[index];\n }\n otherArgs[start] = transform(array);\n return apply(func, this, otherArgs);\n };\n}\n\nmodule.exports = overRest;\n","var constant = require('./constant'),\n defineProperty = require('./_defineProperty'),\n identity = require('./identity');\n\n/\n The base implementation of `setToString` without support for hot loop shorting.\n \n @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n /\nvar baseSetToString = !defineProperty ? identity : function(func, string) {\n return defineProperty(func, 'toString', {\n 'configurable': true,\n 'enumerable': false,\n 'value': constant(string),\n 'writable': true\n });\n};\n\nmodule.exports = baseSetToString;\n","/* Used to detect hot functions by number of calls within a span of milliseconds. /\nvar HOT_COUNT = 800,\n HOT_SPAN = 16;\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeNow = Date.now;\n\n/\n Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n \n @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n /\nfunction shortOut(func) {\n var count = 0,\n lastCalled = 0;\n\n return function() {\n var stamp = nativeNow(),\n remaining = HOT_SPAN - (stamp - lastCalled);\n\n lastCalled = stamp;\n if (remaining > 0) {\n if (++count >= HOT_COUNT) {\n return arguments[0];\n }\n } else {\n count = 0;\n }\n return func.apply(undefined, arguments);\n };\n}\n\nmodule.exports = shortOut;\n","var baseSetToString = require('./_baseSetToString'),\n shortOut = require('./_shortOut');\n\n/\n Sets the `toString` method of `func` to return `string`.\n \n @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n /\nvar setToString = shortOut(baseSetToString);\n\nmodule.exports = setToString;\n","var identity = require('./identity'),\n overRest = require('./_overRest'),\n setToString = require('./_setToString');\n\n/\n The base implementation of `_.rest` which doesn't validate or coerce arguments.\n \n @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n /\nfunction baseRest(func, start) {\n return setToString(overRest(func, start, identity), func + '');\n}\n\nmodule.exports = baseRest;\n","/\n The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n var length = array.length,\n index = fromIndex + (fromRight ? 1 : -1);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (predicate(array[index], index, array)) {\n return index;\n }\n }\n return -1;\n}\n\nmodule.exports = baseFindIndex;\n","/\n The base implementation of `_.isNaN` without support for number objects.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n /\nfunction baseIsNaN(value) {\n return value !== value;\n}\n\nmodule.exports = baseIsNaN;\n","/\n A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {} value The value to search for.\n @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction strictIndexOf(array, value, fromIndex) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (array[index] === value) {\n return index;\n }\n }\n return -1;\n}\n\nmodule.exports = strictIndexOf;\n","var baseFindIndex = require('./_baseFindIndex'),\n baseIsNaN = require('./_baseIsNaN'),\n strictIndexOf = require('./_strictIndexOf');\n\n/\n The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {} value The value to search for.\n @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction baseIndexOf(array, value, fromIndex) {\n return value === value\n ? strictIndexOf(array, value, fromIndex)\n : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nmodule.exports = baseIndexOf;\n","var baseIndexOf = require('./_baseIndexOf');\n\n/\n A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n \n @private\n * @param {Array} [array] The array to inspect.\n * @param {} target The value to search for.\n @returns {boolean} Returns `true` if `target` is found, else `false`.\n /\nfunction arrayIncludes(array, value) {\n var length = array == null ? 0 : array.length;\n return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nmodule.exports = arrayIncludes;\n","/\n This function is like `arrayIncludes` except that it accepts a comparator.\n \n @private\n * @param {Array} [array] The array to inspect.\n * @param {} target The value to search for.\n @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n /\nfunction arrayIncludesWith(array, value, comparator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (comparator(value, array[index])) {\n return true;\n }\n }\n return false;\n}\n\nmodule.exports = arrayIncludesWith;\n","/\n This method returns `undefined`.\n \n @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n \n _.times(2, _.noop);\n * // => [undefined, undefined]\n /\nfunction noop() {\n // No operation performed.\n}\n\nmodule.exports = noop;\n","var Set = require('./_Set'),\n noop = require('./noop'),\n setToArray = require('./_setToArray');\n\n/* Used as references for various `Number` constants. /\nvar INFINITY = 1 / 0;\n\n/\n Creates a set object of `values`.\n \n @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n /\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n return new Set(values);\n};\n\nmodule.exports = createSet;\n","var SetCache = require('./_SetCache'),\n arrayIncludes = require('./_arrayIncludes'),\n arrayIncludesWith = require('./_arrayIncludesWith'),\n cacheHas = require('./_cacheHas'),\n createSet = require('./_createSet'),\n setToArray = require('./_setToArray');\n\n/* Used as the size to enable large array optimizations. /\nvar LARGE_ARRAY_SIZE = 200;\n\n/\n The base implementation of `_.uniqBy` without support for iteratee shorthands.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n /\nfunction baseUniq(array, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n length = array.length,\n isCommon = true,\n result = [],\n seen = result;\n\n if (comparator) {\n isCommon = false;\n includes = arrayIncludesWith;\n }\n else if (length >= LARGE_ARRAY_SIZE) {\n var set = iteratee ? null : createSet(array);\n if (set) {\n return setToArray(set);\n }\n isCommon = false;\n includes = cacheHas;\n seen = new SetCache;\n }\n else {\n seen = iteratee ? [] : result;\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator \|\| value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var seenIndex = seen.length;\n while (seenIndex--) {\n if (seen[seenIndex] === computed) {\n continue outer;\n }\n }\n if (iteratee) {\n seen.push(computed);\n }\n result.push(value);\n }\n else if (!includes(seen, computed, comparator)) {\n if (seen !== result) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n}\n\nmodule.exports = baseUniq;\n","var isArrayLike = require('./isArrayLike'),\n isObjectLike = require('./isObjectLike');\n\n/\n This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an array-like object,\n * else `false`.\n * @example\n \n _.isArrayLikeObject([1, 2, 3]);\n * // => true\n \n _.isArrayLikeObject(document.body.children);\n * // => true\n \n _.isArrayLikeObject('abc');\n * // => false\n \n _.isArrayLikeObject(_.noop);\n * // => false\n /\nfunction isArrayLikeObject(value) {\n return isObjectLike(value) && isArrayLike(value);\n}\n\nmodule.exports = isArrayLikeObject;\n","var baseFlatten = require('./_baseFlatten'),\n baseRest = require('./_baseRest'),\n baseUniq = require('./_baseUniq'),\n isArrayLikeObject = require('./isArrayLikeObject');\n\n/\n Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n \n _.union([2], [1, 2]);\n * // => [2, 1]\n /\nvar union = baseRest(function(arrays) {\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n});\n\nmodule.exports = union;\n","var arrayMap = require('./_arrayMap');\n\n/\n The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n \n @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n /\nfunction baseValues(object, props) {\n return arrayMap(props, function(key) {\n return object[key];\n });\n}\n\nmodule.exports = baseValues;\n","var baseValues = require('./_baseValues'),\n keys = require('./keys');\n\n/\n Creates an array of the own enumerable string keyed property values of `object`.\n \n Note: Non-object values are coerced to objects.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n \n function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n \n Foo.prototype.c = 3;\n \n _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n \n _.values('hi');\n * // => ['h', 'i']\n /\nfunction values(object) {\n return object == null ? [] : baseValues(object, keys(object));\n}\n\nmodule.exports = values;\n","/ global window /\n\nvar lodash;\n\nif (typeof require === \"function\") {\n try {\n lodash = {\n clone: require(\"lodash/clone\"),\n constant: require(\"lodash/constant\"),\n each: require(\"lodash/each\"),\n filter: require(\"lodash/filter\"),\n has: require(\"lodash/has\"),\n isArray: require(\"lodash/isArray\"),\n isEmpty: require(\"lodash/isEmpty\"),\n isFunction: require(\"lodash/isFunction\"),\n isUndefined: require(\"lodash/isUndefined\"),\n keys: require(\"lodash/keys\"),\n map: require(\"lodash/map\"),\n reduce: require(\"lodash/reduce\"),\n size: require(\"lodash/size\"),\n transform: require(\"lodash/transform\"),\n union: require(\"lodash/union\"),\n values: require(\"lodash/values\")\n };\n } catch (e) {\n // continue regardless of error\n }\n}\n\nif (!lodash) {\n lodash = window._;\n}\n\nmodule.exports = lodash;\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = Graph;\n\nvar DEFAULT_EDGE_NAME = \"\\x00\";\nvar GRAPH_NODE = \"\\x00\";\nvar EDGE_KEY_DELIM = \"\\x01\";\n\n// Implementation notes:\n//\n// Node id query functions should return string ids for the nodes\n// * Edge id query functions should return an \"edgeObj\", edge object, that is\n// composed of enough information to uniquely identify an edge: {v, w, name}.\n// * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n// reference edges. This is because we need a performant way to look these\n// edges up and, object properties, which have string keys, are the closest\n// we're going to get to a performant hashtable in JavaScript.\n\nfunction Graph(opts) {\n this._isDirected = _.has(opts, \"directed\") ? opts.directed : true;\n this._isMultigraph = _.has(opts, \"multigraph\") ? opts.multigraph : false;\n this._isCompound = _.has(opts, \"compound\") ? opts.compound : false;\n\n // Label for the graph itself\n this._label = undefined;\n\n // Defaults to be set when creating a new node\n this._defaultNodeLabelFn = _.constant(undefined);\n\n // Defaults to be set when creating a new edge\n this._defaultEdgeLabelFn = _.constant(undefined);\n\n // v -> label\n this._nodes = {};\n\n if (this._isCompound) {\n // v -> parent\n this._parent = {};\n\n // v -> children\n this._children = {};\n this._children[GRAPH_NODE] = {};\n }\n\n // v -> edgeObj\n this._in = {};\n\n // u -> v -> Number\n this._preds = {};\n\n // v -> edgeObj\n this._out = {};\n\n // v -> w -> Number\n this._sucs = {};\n\n // e -> edgeObj\n this._edgeObjs = {};\n\n // e -> label\n this._edgeLabels = {};\n}\n\n/* Number of nodes in the graph. Should only be changed by the implementation. /\nGraph.prototype._nodeCount = 0;\n\n/ Number of edges in the graph. Should only be changed by the implementation. /\nGraph.prototype._edgeCount = 0;\n\n\n/ === Graph functions ========= /\n\nGraph.prototype.isDirected = function() {\n return this._isDirected;\n};\n\nGraph.prototype.isMultigraph = function() {\n return this._isMultigraph;\n};\n\nGraph.prototype.isCompound = function() {\n return this._isCompound;\n};\n\nGraph.prototype.setGraph = function(label) {\n this._label = label;\n return this;\n};\n\nGraph.prototype.graph = function() {\n return this._label;\n};\n\n\n/ === Node functions ========== /\n\nGraph.prototype.setDefaultNodeLabel = function(newDefault) {\n if (!_.isFunction(newDefault)) {\n newDefault = _.constant(newDefault);\n }\n this._defaultNodeLabelFn = newDefault;\n return this;\n};\n\nGraph.prototype.nodeCount = function() {\n return this._nodeCount;\n};\n\nGraph.prototype.nodes = function() {\n return _.keys(this._nodes);\n};\n\nGraph.prototype.sources = function() {\n var self = this;\n return _.filter(this.nodes(), function(v) {\n return _.isEmpty(self._in[v]);\n });\n};\n\nGraph.prototype.sinks = function() {\n var self = this;\n return _.filter(this.nodes(), function(v) {\n return _.isEmpty(self._out[v]);\n });\n};\n\nGraph.prototype.setNodes = function(vs, value) {\n var args = arguments;\n var self = this;\n _.each(vs, function(v) {\n if (args.length > 1) {\n self.setNode(v, value);\n } else {\n self.setNode(v);\n }\n });\n return this;\n};\n\nGraph.prototype.setNode = function(v, value) {\n if (_.has(this._nodes, v)) {\n if (arguments.length > 1) {\n this._nodes[v] = value;\n }\n return this;\n }\n\n this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);\n if (this._isCompound) {\n this._parent[v] = GRAPH_NODE;\n this._children[v] = {};\n this._children[GRAPH_NODE][v] = true;\n }\n this._in[v] = {};\n this._preds[v] = {};\n this._out[v] = {};\n this._sucs[v] = {};\n ++this._nodeCount;\n return this;\n};\n\nGraph.prototype.node = function(v) {\n return this._nodes[v];\n};\n\nGraph.prototype.hasNode = function(v) {\n return _.has(this._nodes, v);\n};\n\nGraph.prototype.removeNode = function(v) {\n var self = this;\n if (_.has(this._nodes, v)) {\n var removeEdge = function(e) { self.removeEdge(self._edgeObjs[e]); };\n delete this._nodes[v];\n if (this._isCompound) {\n this._removeFromParentsChildList(v);\n delete this._parent[v];\n _.each(this.children(v), function(child) {\n self.setParent(child);\n });\n delete this._children[v];\n }\n _.each(_.keys(this._in[v]), removeEdge);\n delete this._in[v];\n delete this._preds[v];\n _.each(_.keys(this._out[v]), removeEdge);\n delete this._out[v];\n delete this._sucs[v];\n --this._nodeCount;\n }\n return this;\n};\n\nGraph.prototype.setParent = function(v, parent) {\n if (!this._isCompound) {\n throw new Error(\"Cannot set parent in a non-compound graph\");\n }\n\n if (_.isUndefined(parent)) {\n parent = GRAPH_NODE;\n } else {\n // Coerce parent to string\n parent += \"\";\n for (var ancestor = parent;\n !_.isUndefined(ancestor);\n ancestor = this.parent(ancestor)) {\n if (ancestor === v) {\n throw new Error(\"Setting \" + parent+ \" as parent of \" + v +\n \" would create a cycle\");\n }\n }\n\n this.setNode(parent);\n }\n\n this.setNode(v);\n this._removeFromParentsChildList(v);\n this._parent[v] = parent;\n this._children[parent][v] = true;\n return this;\n};\n\nGraph.prototype._removeFromParentsChildList = function(v) {\n delete this._children[this._parent[v]][v];\n};\n\nGraph.prototype.parent = function(v) {\n if (this._isCompound) {\n var parent = this._parent[v];\n if (parent !== GRAPH_NODE) {\n return parent;\n }\n }\n};\n\nGraph.prototype.children = function(v) {\n if (_.isUndefined(v)) {\n v = GRAPH_NODE;\n }\n\n if (this._isCompound) {\n var children = this._children[v];\n if (children) {\n return _.keys(children);\n }\n } else if (v === GRAPH_NODE) {\n return this.nodes();\n } else if (this.hasNode(v)) {\n return [];\n }\n};\n\nGraph.prototype.predecessors = function(v) {\n var predsV = this._preds[v];\n if (predsV) {\n return _.keys(predsV);\n }\n};\n\nGraph.prototype.successors = function(v) {\n var sucsV = this._sucs[v];\n if (sucsV) {\n return _.keys(sucsV);\n }\n};\n\nGraph.prototype.neighbors = function(v) {\n var preds = this.predecessors(v);\n if (preds) {\n return _.union(preds, this.successors(v));\n }\n};\n\nGraph.prototype.isLeaf = function (v) {\n var neighbors;\n if (this.isDirected()) {\n neighbors = this.successors(v);\n } else {\n neighbors = this.neighbors(v);\n }\n return neighbors.length === 0;\n};\n\nGraph.prototype.filterNodes = function(filter) {\n var copy = new this.constructor({\n directed: this._isDirected,\n multigraph: this._isMultigraph,\n compound: this._isCompound\n });\n\n copy.setGraph(this.graph());\n\n var self = this;\n _.each(this._nodes, function(value, v) {\n if (filter(v)) {\n copy.setNode(v, value);\n }\n });\n\n _.each(this._edgeObjs, function(e) {\n if (copy.hasNode(e.v) && copy.hasNode(e.w)) {\n copy.setEdge(e, self.edge(e));\n }\n });\n\n var parents = {};\n function findParent(v) {\n var parent = self.parent(v);\n if (parent === undefined \|\| copy.hasNode(parent)) {\n parents[v] = parent;\n return parent;\n } else if (parent in parents) {\n return parents[parent];\n } else {\n return findParent(parent);\n }\n }\n\n if (this._isCompound) {\n _.each(copy.nodes(), function(v) {\n copy.setParent(v, findParent(v));\n });\n }\n\n return copy;\n};\n\n/ === Edge functions ========== /\n\nGraph.prototype.setDefaultEdgeLabel = function(newDefault) {\n if (!_.isFunction(newDefault)) {\n newDefault = _.constant(newDefault);\n }\n this._defaultEdgeLabelFn = newDefault;\n return this;\n};\n\nGraph.prototype.edgeCount = function() {\n return this._edgeCount;\n};\n\nGraph.prototype.edges = function() {\n return _.values(this._edgeObjs);\n};\n\nGraph.prototype.setPath = function(vs, value) {\n var self = this;\n var args = arguments;\n _.reduce(vs, function(v, w) {\n if (args.length > 1) {\n self.setEdge(v, w, value);\n } else {\n self.setEdge(v, w);\n }\n return w;\n });\n return this;\n};\n\n/\n * setEdge(v, w, [value, [name]])\n * setEdge({ v, w, [name] }, [value])\n /\nGraph.prototype.setEdge = function() {\n var v, w, name, value;\n var valueSpecified = false;\n var arg0 = arguments[0];\n\n if (typeof arg0 === \"object\" && arg0 !== null && \"v\" in arg0) {\n v = arg0.v;\n w = arg0.w;\n name = arg0.name;\n if (arguments.length === 2) {\n value = arguments[1];\n valueSpecified = true;\n }\n } else {\n v = arg0;\n w = arguments[1];\n name = arguments[3];\n if (arguments.length > 2) {\n value = arguments[2];\n valueSpecified = true;\n }\n }\n\n v = \"\" + v;\n w = \"\" + w;\n if (!_.isUndefined(name)) {\n name = \"\" + name;\n }\n\n var e = edgeArgsToId(this._isDirected, v, w, name);\n if (_.has(this._edgeLabels, e)) {\n if (valueSpecified) {\n this._edgeLabels[e] = value;\n }\n return this;\n }\n\n if (!_.isUndefined(name) && !this._isMultigraph) {\n throw new Error(\"Cannot set a named edge when isMultigraph = false\");\n }\n\n // It didn't exist, so we need to create it.\n // First ensure the nodes exist.\n this.setNode(v);\n this.setNode(w);\n\n this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);\n\n var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);\n // Ensure we add undirected edges in a consistent way.\n v = edgeObj.v;\n w = edgeObj.w;\n\n Object.freeze(edgeObj);\n this._edgeObjs[e] = edgeObj;\n incrementOrInitEntry(this._preds[w], v);\n incrementOrInitEntry(this._sucs[v], w);\n this._in[w][e] = edgeObj;\n this._out[v][e] = edgeObj;\n this._edgeCount++;\n return this;\n};\n\nGraph.prototype.edge = function(v, w, name) {\n var e = (arguments.length === 1\n ? edgeObjToId(this._isDirected, arguments[0])\n : edgeArgsToId(this._isDirected, v, w, name));\n return this._edgeLabels[e];\n};\n\nGraph.prototype.hasEdge = function(v, w, name) {\n var e = (arguments.length === 1\n ? edgeObjToId(this._isDirected, arguments[0])\n : edgeArgsToId(this._isDirected, v, w, name));\n return _.has(this._edgeLabels, e);\n};\n\nGraph.prototype.removeEdge = function(v, w, name) {\n var e = (arguments.length === 1\n ? edgeObjToId(this._isDirected, arguments[0])\n : edgeArgsToId(this._isDirected, v, w, name));\n var edge = this._edgeObjs[e];\n if (edge) {\n v = edge.v;\n w = edge.w;\n delete this._edgeLabels[e];\n delete this._edgeObjs[e];\n decrementOrRemoveEntry(this._preds[w], v);\n decrementOrRemoveEntry(this._sucs[v], w);\n delete this._in[w][e];\n delete this._out[v][e];\n this._edgeCount--;\n }\n return this;\n};\n\nGraph.prototype.inEdges = function(v, u) {\n var inV = this._in[v];\n if (inV) {\n var edges = _.values(inV);\n if (!u) {\n return edges;\n }\n return _.filter(edges, function(edge) { return edge.v === u; });\n }\n};\n\nGraph.prototype.outEdges = function(v, w) {\n var outV = this._out[v];\n if (outV) {\n var edges = _.values(outV);\n if (!w) {\n return edges;\n }\n return _.filter(edges, function(edge) { return edge.w === w; });\n }\n};\n\nGraph.prototype.nodeEdges = function(v, w) {\n var inEdges = this.inEdges(v, w);\n if (inEdges) {\n return inEdges.concat(this.outEdges(v, w));\n }\n};\n\nfunction incrementOrInitEntry(map, k) {\n if (map[k]) {\n map[k]++;\n } else {\n map[k] = 1;\n }\n}\n\nfunction decrementOrRemoveEntry(map, k) {\n if (!--map[k]) { delete map[k]; }\n}\n\nfunction edgeArgsToId(isDirected, v_, w_, name) {\n var v = \"\" + v_;\n var w = \"\" + w_;\n if (!isDirected && v > w) {\n var tmp = v;\n v = w;\n w = tmp;\n }\n return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +\n (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);\n}\n\nfunction edgeArgsToObj(isDirected, v_, w_, name) {\n var v = \"\" + v_;\n var w = \"\" + w_;\n if (!isDirected && v > w) {\n var tmp = v;\n v = w;\n w = tmp;\n }\n var edgeObj = { v: v, w: w };\n if (name) {\n edgeObj.name = name;\n }\n return edgeObj;\n}\n\nfunction edgeObjToId(isDirected, edgeObj) {\n return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);\n}\n","module.exports = '2.1.8';\n","// Includes only the \"core\" of graphlib\nmodule.exports = {\n Graph: require(\"./graph\"),\n version: require(\"./version\")\n};\n","var _ = require(\"./lodash\");\nvar Graph = require(\"./graph\");\n\nmodule.exports = {\n write: write,\n read: read\n};\n\nfunction write(g) {\n var json = {\n options: {\n directed: g.isDirected(),\n multigraph: g.isMultigraph(),\n compound: g.isCompound()\n },\n nodes: writeNodes(g),\n edges: writeEdges(g)\n };\n if (!_.isUndefined(g.graph())) {\n json.value = _.clone(g.graph());\n }\n return json;\n}\n\nfunction writeNodes(g) {\n return _.map(g.nodes(), function(v) {\n var nodeValue = g.node(v);\n var parent = g.parent(v);\n var node = { v: v };\n if (!_.isUndefined(nodeValue)) {\n node.value = nodeValue;\n }\n if (!_.isUndefined(parent)) {\n node.parent = parent;\n }\n return node;\n });\n}\n\nfunction writeEdges(g) {\n return _.map(g.edges(), function(e) {\n var edgeValue = g.edge(e);\n var edge = { v: e.v, w: e.w };\n if (!_.isUndefined(e.name)) {\n edge.name = e.name;\n }\n if (!_.isUndefined(edgeValue)) {\n edge.value = edgeValue;\n }\n return edge;\n });\n}\n\nfunction read(json) {\n var g = new Graph(json.options).setGraph(json.value);\n _.each(json.nodes, function(entry) {\n g.setNode(entry.v, entry.value);\n if (entry.parent) {\n g.setParent(entry.v, entry.parent);\n }\n });\n _.each(json.edges, function(entry) {\n g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n });\n return g;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = components;\n\nfunction components(g) {\n var visited = {};\n var cmpts = [];\n var cmpt;\n\n function dfs(v) {\n if (_.has(visited, v)) return;\n visited[v] = true;\n cmpt.push(v);\n _.each(g.successors(v), dfs);\n _.each(g.predecessors(v), dfs);\n }\n\n _.each(g.nodes(), function(v) {\n cmpt = [];\n dfs(v);\n if (cmpt.length) {\n cmpts.push(cmpt);\n }\n });\n\n return cmpts;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = PriorityQueue;\n\n/\n A min-priority queue data structure. This algorithm is derived from Cormen,\n * et al., \"Introduction to Algorithms\". The basic idea of a min-priority\n * queue is that you can efficiently (in O(1) time) get the smallest key in\n * the queue. Adding and removing elements takes O(log n) time. A key can\n * have its priority decreased in O(log n) time.\n /\nfunction PriorityQueue() {\n this._arr = [];\n this._keyIndices = {};\n}\n\n/\n Returns the number of elements in the queue. Takes `O(1)` time.\n /\nPriorityQueue.prototype.size = function() {\n return this._arr.length;\n};\n\n/\n Returns the keys that are in the queue. Takes `O(n)` time.\n /\nPriorityQueue.prototype.keys = function() {\n return this._arr.map(function(x) { return x.key; });\n};\n\n/\n Returns `true` if key is in the queue and `false` if not.\n /\nPriorityQueue.prototype.has = function(key) {\n return _.has(this._keyIndices, key);\n};\n\n/\n Returns the priority for key. If key is not present in the queue\n * then this function returns `undefined`. Takes `O(1)` time.\n \n @param {Object} key\n /\nPriorityQueue.prototype.priority = function(key) {\n var index = this._keyIndices[key];\n if (index !== undefined) {\n return this._arr[index].priority;\n }\n};\n\n/\n Returns the key for the minimum element in this queue. If the queue is\n * empty this function throws an Error. Takes `O(1)` time.\n /\nPriorityQueue.prototype.min = function() {\n if (this.size() === 0) {\n throw new Error(\"Queue underflow\");\n }\n return this._arr[0].key;\n};\n\n/\n Inserts a new key into the priority queue. If the key already exists in\n * the queue this function returns `false`; otherwise it will return `true`.\n * Takes `O(n)` time.\n \n @param {Object} key the key to add\n * @param {Number} priority the initial priority for the key\n /\nPriorityQueue.prototype.add = function(key, priority) {\n var keyIndices = this._keyIndices;\n key = String(key);\n if (!_.has(keyIndices, key)) {\n var arr = this._arr;\n var index = arr.length;\n keyIndices[key] = index;\n arr.push({key: key, priority: priority});\n this._decrease(index);\n return true;\n }\n return false;\n};\n\n/\n Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n /\nPriorityQueue.prototype.removeMin = function() {\n this._swap(0, this._arr.length - 1);\n var min = this._arr.pop();\n delete this._keyIndices[min.key];\n this._heapify(0);\n return min.key;\n};\n\n/\n Decreases the priority for key to priority. If the new priority is\n * greater than the previous priority, this function will throw an Error.\n \n @param {Object} key the key for which to raise priority\n * @param {Number} priority the new priority for the key\n /\nPriorityQueue.prototype.decrease = function(key, priority) {\n var index = this._keyIndices[key];\n if (priority > this._arr[index].priority) {\n throw new Error(\"New priority is greater than current priority. \" +\n \"Key: \" + key + \" Old: \" + this._arr[index].priority + \" New: \" + priority);\n }\n this._arr[index].priority = priority;\n this._decrease(index);\n};\n\nPriorityQueue.prototype._heapify = function(i) {\n var arr = this._arr;\n var l = 2 i;\n var r = l + 1;\n var largest = i;\n if (l < arr.length) {\n largest = arr[l].priority < arr[largest].priority ? l : largest;\n if (r < arr.length) {\n largest = arr[r].priority < arr[largest].priority ? r : largest;\n }\n if (largest !== i) {\n this._swap(i, largest);\n this._heapify(largest);\n }\n }\n};\n\nPriorityQueue.prototype._decrease = function(index) {\n var arr = this._arr;\n var priority = arr[index].priority;\n var parent;\n while (index !== 0) {\n parent = index >> 1;\n if (arr[parent].priority < priority) {\n break;\n }\n this._swap(index, parent);\n index = parent;\n }\n};\n\nPriorityQueue.prototype._swap = function(i, j) {\n var arr = this._arr;\n var keyIndices = this._keyIndices;\n var origArrI = arr[i];\n var origArrJ = arr[j];\n arr[i] = origArrJ;\n arr[j] = origArrI;\n keyIndices[origArrJ.key] = i;\n keyIndices[origArrI.key] = j;\n};\n","var _ = require(\"../lodash\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = dijkstra;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction dijkstra(g, source, weightFn, edgeFn) {\n return runDijkstra(g, String(source),\n weightFn \|\| DEFAULT_WEIGHT_FUNC,\n edgeFn \|\| function(v) { return g.outEdges(v); });\n}\n\nfunction runDijkstra(g, source, weightFn, edgeFn) {\n var results = {};\n var pq = new PriorityQueue();\n var v, vEntry;\n\n var updateNeighbors = function(edge) {\n var w = edge.v !== v ? edge.v : edge.w;\n var wEntry = results[w];\n var weight = weightFn(edge);\n var distance = vEntry.distance + weight;\n\n if (weight < 0) {\n throw new Error(\"dijkstra does not allow negative edge weights. \" +\n \"Bad edge: \" + edge + \" Weight: \" + weight);\n }\n\n if (distance < wEntry.distance) {\n wEntry.distance = distance;\n wEntry.predecessor = v;\n pq.decrease(w, distance);\n }\n };\n\n g.nodes().forEach(function(v) {\n var distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n results[v] = { distance: distance };\n pq.add(v, distance);\n });\n\n while (pq.size() > 0) {\n v = pq.removeMin();\n vEntry = results[v];\n if (vEntry.distance === Number.POSITIVE_INFINITY) {\n break;\n }\n\n edgeFn(v).forEach(updateNeighbors);\n }\n\n return results;\n}\n","var dijkstra = require(\"./dijkstra\");\nvar _ = require(\"../lodash\");\n\nmodule.exports = dijkstraAll;\n\nfunction dijkstraAll(g, weightFunc, edgeFunc) {\n return _.transform(g.nodes(), function(acc, v) {\n acc[v] = dijkstra(g, v, weightFunc, edgeFunc);\n }, {});\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = tarjan;\n\nfunction tarjan(g) {\n var index = 0;\n var stack = [];\n var visited = {}; // node id -> { onStack, lowlink, index }\n var results = [];\n\n function dfs(v) {\n var entry = visited[v] = {\n onStack: true,\n lowlink: index,\n index: index++\n };\n stack.push(v);\n\n g.successors(v).forEach(function(w) {\n if (!_.has(visited, w)) {\n dfs(w);\n entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);\n } else if (visited[w].onStack) {\n entry.lowlink = Math.min(entry.lowlink, visited[w].index);\n }\n });\n\n if (entry.lowlink === entry.index) {\n var cmpt = [];\n var w;\n do {\n w = stack.pop();\n visited[w].onStack = false;\n cmpt.push(w);\n } while (v !== w);\n results.push(cmpt);\n }\n }\n\n g.nodes().forEach(function(v) {\n if (!_.has(visited, v)) {\n dfs(v);\n }\n });\n\n return results;\n}\n","var _ = require(\"../lodash\");\nvar tarjan = require(\"./tarjan\");\n\nmodule.exports = findCycles;\n\nfunction findCycles(g) {\n return _.filter(tarjan(g), function(cmpt) {\n return cmpt.length > 1 \|\| (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n });\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = floydWarshall;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction floydWarshall(g, weightFn, edgeFn) {\n return runFloydWarshall(g,\n weightFn \|\| DEFAULT_WEIGHT_FUNC,\n edgeFn \|\| function(v) { return g.outEdges(v); });\n}\n\nfunction runFloydWarshall(g, weightFn, edgeFn) {\n var results = {};\n var nodes = g.nodes();\n\n nodes.forEach(function(v) {\n results[v] = {};\n results[v][v] = { distance: 0 };\n nodes.forEach(function(w) {\n if (v !== w) {\n results[v][w] = { distance: Number.POSITIVE_INFINITY };\n }\n });\n edgeFn(v).forEach(function(edge) {\n var w = edge.v === v ? edge.w : edge.v;\n var d = weightFn(edge);\n results[v][w] = { distance: d, predecessor: v };\n });\n });\n\n nodes.forEach(function(k) {\n var rowK = results[k];\n nodes.forEach(function(i) {\n var rowI = results[i];\n nodes.forEach(function(j) {\n var ik = rowI[k];\n var kj = rowK[j];\n var ij = rowI[j];\n var altDistance = ik.distance + kj.distance;\n if (altDistance < ij.distance) {\n ij.distance = altDistance;\n ij.predecessor = kj.predecessor;\n }\n });\n });\n });\n\n return results;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = topsort;\ntopsort.CycleException = CycleException;\n\nfunction topsort(g) {\n var visited = {};\n var stack = {};\n var results = [];\n\n function visit(node) {\n if (_.has(stack, node)) {\n throw new CycleException();\n }\n\n if (!_.has(visited, node)) {\n stack[node] = true;\n visited[node] = true;\n _.each(g.predecessors(node), visit);\n delete stack[node];\n results.push(node);\n }\n }\n\n _.each(g.sinks(), visit);\n\n if (_.size(visited) !== g.nodeCount()) {\n throw new CycleException();\n }\n\n return results;\n}\n\nfunction CycleException() {}\nCycleException.prototype = new Error(); // must be an instance of Error to pass testing","var topsort = require(\"./topsort\");\n\nmodule.exports = isAcyclic;\n\nfunction isAcyclic(g) {\n try {\n topsort(g);\n } catch (e) {\n if (e instanceof topsort.CycleException) {\n return false;\n }\n throw e;\n }\n return true;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = dfs;\n\n/\n A helper that preforms a pre- or post-order traversal on the input graph\n * and returns the nodes in the order they were visited. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n \n Order must be one of \"pre\" or \"post\".\n /\nfunction dfs(g, vs, order) {\n if (!_.isArray(vs)) {\n vs = [vs];\n }\n\n var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);\n\n var acc = [];\n var visited = {};\n _.each(vs, function(v) {\n if (!g.hasNode(v)) {\n throw new Error(\"Graph does not have node: \" + v);\n }\n\n doDfs(g, v, order === \"post\", visited, navigation, acc);\n });\n return acc;\n}\n\nfunction doDfs(g, v, postorder, visited, navigation, acc) {\n if (!_.has(visited, v)) {\n visited[v] = true;\n\n if (!postorder) { acc.push(v); }\n _.each(navigation(v), function(w) {\n doDfs(g, w, postorder, visited, navigation, acc);\n });\n if (postorder) { acc.push(v); }\n }\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = postorder;\n\nfunction postorder(g, vs) {\n return dfs(g, vs, \"post\");\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = preorder;\n\nfunction preorder(g, vs) {\n return dfs(g, vs, \"pre\");\n}\n","var _ = require(\"../lodash\");\nvar Graph = require(\"../graph\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = prim;\n\nfunction prim(g, weightFunc) {\n var result = new Graph();\n var parents = {};\n var pq = new PriorityQueue();\n var v;\n\n function updateNeighbors(edge) {\n var w = edge.v === v ? edge.w : edge.v;\n var pri = pq.priority(w);\n if (pri !== undefined) {\n var edgeWeight = weightFunc(edge);\n if (edgeWeight < pri) {\n parents[w] = v;\n pq.decrease(w, edgeWeight);\n }\n }\n }\n\n if (g.nodeCount() === 0) {\n return result;\n }\n\n _.each(g.nodes(), function(v) {\n pq.add(v, Number.POSITIVE_INFINITY);\n result.setNode(v);\n });\n\n // Start from an arbitrary node\n pq.decrease(g.nodes()[0], 0);\n\n var init = false;\n while (pq.size() > 0) {\n v = pq.removeMin();\n if (_.has(parents, v)) {\n result.setEdge(v, parents[v]);\n } else if (init) {\n throw new Error(\"Input graph is not connected: \" + g);\n } else {\n init = true;\n }\n\n g.nodeEdges(v).forEach(updateNeighbors);\n }\n\n return result;\n}\n","module.exports = {\n components: require(\"./components\"),\n dijkstra: require(\"./dijkstra\"),\n dijkstraAll: require(\"./dijkstra-all\"),\n findCycles: require(\"./find-cycles\"),\n floydWarshall: require(\"./floyd-warshall\"),\n isAcyclic: require(\"./is-acyclic\"),\n postorder: require(\"./postorder\"),\n preorder: require(\"./preorder\"),\n prim: require(\"./prim\"),\n tarjan: require(\"./tarjan\"),\n topsort: require(\"./topsort\")\n};\n","/\n Copyright (c) 2014, Chris Pettitt\n * All rights reserved.\n \n Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n \n 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n \n 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n \n 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n \n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n /\n\nvar lib = require(\"./lib\");\n\nmodule.exports = {\n Graph: lib.Graph,\n json: require(\"./lib/json\"),\n alg: require(\"./lib/alg\"),\n version: lib.version\n};\n","/ global window /\n\nvar graphlib;\n\nif (typeof require === \"function\") {\n try {\n graphlib = require(\"graphlib\");\n } catch (e) {\n // continue regardless of error\n }\n}\n\nif (!graphlib) {\n graphlib = window.graphlib;\n}\n\nmodule.exports = graphlib;\n","var eq = require('./eq'),\n isArrayLike = require('./isArrayLike'),\n isIndex = require('./_isIndex'),\n isObject = require('./isObject');\n\n/\n Checks if the given arguments are from an iteratee call.\n \n @private\n * @param {} value The potential iteratee value argument.\n @param {} index The potential iteratee index or key argument.\n @param {} object The potential iteratee object argument.\n @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n * else `false`.\n /\nfunction isIterateeCall(value, index, object) {\n if (!isObject(object)) {\n return false;\n }\n var type = typeof index;\n if (type == 'number'\n ? (isArrayLike(object) && isIndex(index, object.length))\n : (type == 'string' && index in object)\n ) {\n return eq(object[index], value);\n }\n return false;\n}\n\nmodule.exports = isIterateeCall;\n","var baseRest = require('./_baseRest'),\n eq = require('./eq'),\n isIterateeCall = require('./_isIterateeCall'),\n keysIn = require('./keysIn');\n\n/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n \n Note: This method mutates `object`.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n \n _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n /\nvar defaults = baseRest(function(object, sources) {\n object = Object(object);\n\n var index = -1;\n var length = sources.length;\n var guard = length > 2 ? sources[2] : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n length = 1;\n }\n\n while (++index < length) {\n var source = sources[index];\n var props = keysIn(source);\n var propsIndex = -1;\n var propsLength = props.length;\n\n while (++propsIndex < propsLength) {\n var key = props[propsIndex];\n var value = object[key];\n\n if (value === undefined \|\|\n (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n object[key] = source[key];\n }\n }\n }\n\n return object;\n});\n\nmodule.exports = defaults;\n","var baseIteratee = require('./_baseIteratee'),\n isArrayLike = require('./isArrayLike'),\n keys = require('./keys');\n\n/\n Creates a `_.find` or `_.findLast` function.\n \n @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n /\nfunction createFind(findIndexFunc) {\n return function(collection, predicate, fromIndex) {\n var iterable = Object(collection);\n if (!isArrayLike(collection)) {\n var iteratee = baseIteratee(predicate, 3);\n collection = keys(collection);\n predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n }\n var index = findIndexFunc(collection, predicate, fromIndex);\n return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n };\n}\n\nmodule.exports = createFind;\n","/* Used to match a single whitespace character. /\nvar reWhitespace = /\\s/;\n\n/\n Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n \n @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n /\nfunction trimmedEndIndex(string) {\n var index = string.length;\n\n while (index-- && reWhitespace.test(string.charAt(index))) {}\n return index;\n}\n\nmodule.exports = trimmedEndIndex;\n","var trimmedEndIndex = require('./_trimmedEndIndex');\n\n/* Used to match leading whitespace. /\nvar reTrimStart = /^\\s+/;\n\n/\n The base implementation of `_.trim`.\n \n @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n /\nfunction baseTrim(string) {\n return string\n ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n : string;\n}\n\nmodule.exports = baseTrim;\n","var baseTrim = require('./_baseTrim'),\n isObject = require('./isObject'),\n isSymbol = require('./isSymbol');\n\n/* Used as references for various `Number` constants. /\nvar NAN = 0 / 0;\n\n/* Used to detect bad signed hexadecimal string values. /\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/* Used to detect binary string values. /\nvar reIsBinary = /^0b[01]+$/i;\n\n/* Used to detect octal string values. /\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/* Built-in method references without a dependency on `root`. /\nvar freeParseInt = parseInt;\n\n/\n Converts `value` to a number.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to process.\n @returns {number} Returns the number.\n * @example\n \n _.toNumber(3.2);\n * // => 3.2\n \n _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n \n _.toNumber(Infinity);\n * // => Infinity\n \n _.toNumber('3.2');\n * // => 3.2\n /\nfunction toNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n if (isObject(value)) {\n var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n value = isObject(other) ? (other + '') : other;\n }\n if (typeof value != 'string') {\n return value === 0 ? value : +value;\n }\n value = baseTrim(value);\n var isBinary = reIsBinary.test(value);\n return (isBinary \|\| reIsOctal.test(value))\n ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = toNumber;\n","var toNumber = require('./toNumber');\n\n/* Used as references for various `Number` constants. /\nvar INFINITY = 1 / 0,\n MAX_INTEGER = 1.7976931348623157e+308;\n\n/\n Converts `value` to a finite number.\n \n @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {} value The value to convert.\n @returns {number} Returns the converted number.\n * @example\n \n _.toFinite(3.2);\n * // => 3.2\n \n _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n \n _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n \n _.toFinite('3.2');\n * // => 3.2\n /\nfunction toFinite(value) {\n if (!value) {\n return value === 0 ? value : 0;\n }\n value = toNumber(value);\n if (value === INFINITY \|\| value === -INFINITY) {\n var sign = (value < 0 ? -1 : 1);\n return sign MAX_INTEGER;\n }\n return value === value ? value : 0;\n}\n\nmodule.exports = toFinite;\n","var toFinite = require('./toFinite');\n\n/*\n Converts `value` to an integer.\n \n Note: This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to convert.\n @returns {number} Returns the converted integer.\n * @example\n \n _.toInteger(3.2);\n * // => 3\n \n _.toInteger(Number.MIN_VALUE);\n * // => 0\n \n _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n \n _.toInteger('3.2');\n * // => 3\n /\nfunction toInteger(value) {\n var result = toFinite(value),\n remainder = result % 1;\n\n return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nmodule.exports = toInteger;\n","var baseFindIndex = require('./_baseFindIndex'),\n baseIteratee = require('./_baseIteratee'),\n toInteger = require('./toInteger');\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeMax = Math.max;\n\n/\n This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n \n @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n \n var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n \n _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n \n // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n \n // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n \n // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n /\nfunction findIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseFindIndex(array, baseIteratee(predicate, 3), index);\n}\n\nmodule.exports = findIndex;\n","var createFind = require('./_createFind'),\n findIndex = require('./findIndex');\n\n/\n Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index\|key, collection).\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {} Returns the matched element, else `undefined`.\n @example\n \n var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false },\n * { 'user': 'pebbles', 'age': 1, 'active': true }\n * ];\n \n _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n \n // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n \n // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n \n // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n /\nvar find = createFind(findIndex);\n\nmodule.exports = find;\n","var baseFlatten = require('./_baseFlatten');\n\n/\n Flattens `array` a single level deep.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n \n _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n /\nfunction flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n}\n\nmodule.exports = flatten;\n","var baseFor = require('./_baseFor'),\n castFunction = require('./_castFunction'),\n keysIn = require('./keysIn');\n\n/\n Iterates over own and inherited enumerable string keyed properties of an\n * object and invokes `iteratee` for each property. The iteratee is invoked\n * with three arguments: (value, key, object). Iteratee functions may exit\n * iteration early by explicitly returning `false`.\n \n @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forInRight\n * @example\n \n function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n \n Foo.prototype.c = 3;\n \n _.forIn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n /\nfunction forIn(object, iteratee) {\n return object == null\n ? object\n : baseFor(object, castFunction(iteratee), keysIn);\n}\n\nmodule.exports = forIn;\n","/\n Gets the last element of `array`.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {} Returns the last element of `array`.\n @example\n \n _.last([1, 2, 3]);\n * // => 3\n /\nfunction last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n}\n\nmodule.exports = last;\n","var isSymbol = require('./isSymbol');\n\n/\n The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n \n @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {} Returns the extremum value.\n /\nfunction baseExtremum(array, iteratee, comparator) {\n var index = -1,\n length = array.length;\n\n while (++index < length) {\n var value = array[index],\n current = iteratee(value);\n\n if (current != null && (computed === undefined\n ? (current === current && !isSymbol(current))\n : comparator(current, computed)\n )) {\n var computed = current,\n result = value;\n }\n }\n return result;\n}\n\nmodule.exports = baseExtremum;\n","/*\n The base implementation of `_.gt` which doesn't coerce arguments.\n \n @private\n * @param {} value The value to compare.\n @param {} other The other value to compare.\n @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n /\nfunction baseGt(value, other) {\n return value > other;\n}\n\nmodule.exports = baseGt;\n","var baseExtremum = require('./_baseExtremum'),\n baseGt = require('./_baseGt'),\n identity = require('./identity');\n\n/\n Computes the maximum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {} Returns the maximum value.\n @example\n \n _.max([4, 2, 8, 6]);\n * // => 8\n \n _.max([]);\n * // => undefined\n /\nfunction max(array) {\n return (array && array.length)\n ? baseExtremum(array, identity, baseGt)\n : undefined;\n}\n\nmodule.exports = max;\n","var baseAssignValue = require('./_baseAssignValue'),\n eq = require('./eq');\n\n/\n This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n \n @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {} value The value to assign.\n /\nfunction assignMergeValue(object, key, value) {\n if ((value !== undefined && !eq(object[key], value)) \|\|\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n}\n\nmodule.exports = assignMergeValue;\n","var baseGetTag = require('./_baseGetTag'),\n getPrototype = require('./_getPrototype'),\n isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. /\nvar objectTag = '[object Object]';\n\n/* Used for built-in method references. /\nvar funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n/* Used to resolve the decompiled source of functions. /\nvar funcToString = funcProto.toString;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/* Used to infer the `Object` constructor. /\nvar objectCtorString = funcToString.call(Object);\n\n/\n Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n \n @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n \n function Foo() {\n * this.a = 1;\n * }\n \n _.isPlainObject(new Foo);\n * // => false\n \n _.isPlainObject([1, 2, 3]);\n * // => false\n \n _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n \n _.isPlainObject(Object.create(null));\n * // => true\n /\nfunction isPlainObject(value) {\n if (!isObjectLike(value) \|\| baseGetTag(value) != objectTag) {\n return false;\n }\n var proto = getPrototype(value);\n if (proto === null) {\n return true;\n }\n var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n funcToString.call(Ctor) == objectCtorString;\n}\n\nmodule.exports = isPlainObject;\n","/\n Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n \n @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {} Returns the property value.\n /\nfunction safeGet(object, key) {\n if (key === 'constructor' && typeof object[key] === 'function') {\n return;\n }\n\n if (key == '__proto__') {\n return;\n }\n\n return object[key];\n}\n\nmodule.exports = safeGet;\n","var copyObject = require('./_copyObject'),\n keysIn = require('./keysIn');\n\n/*\n Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n \n @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {} value The value to convert.\n @returns {Object} Returns the converted plain object.\n * @example\n \n function Foo() {\n * this.b = 2;\n * }\n \n Foo.prototype.c = 3;\n \n _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n \n _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n /\nfunction toPlainObject(value) {\n return copyObject(value, keysIn(value));\n}\n\nmodule.exports = toPlainObject;\n","var assignMergeValue = require('./_assignMergeValue'),\n cloneBuffer = require('./_cloneBuffer'),\n cloneTypedArray = require('./_cloneTypedArray'),\n copyArray = require('./_copyArray'),\n initCloneObject = require('./_initCloneObject'),\n isArguments = require('./isArguments'),\n isArray = require('./isArray'),\n isArrayLikeObject = require('./isArrayLikeObject'),\n isBuffer = require('./isBuffer'),\n isFunction = require('./isFunction'),\n isObject = require('./isObject'),\n isPlainObject = require('./isPlainObject'),\n isTypedArray = require('./isTypedArray'),\n safeGet = require('./_safeGet'),\n toPlainObject = require('./toPlainObject');\n\n/\n A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n \n @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n /\nfunction baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n var objValue = safeGet(object, key),\n srcValue = safeGet(source, key),\n stacked = stack.get(srcValue);\n\n if (stacked) {\n assignMergeValue(object, key, stacked);\n return;\n }\n var newValue = customizer\n ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n : undefined;\n\n var isCommon = newValue === undefined;\n\n if (isCommon) {\n var isArr = isArray(srcValue),\n isBuff = !isArr && isBuffer(srcValue),\n isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n newValue = srcValue;\n if (isArr \|\| isBuff \|\| isTyped) {\n if (isArray(objValue)) {\n newValue = objValue;\n }\n else if (isArrayLikeObject(objValue)) {\n newValue = copyArray(objValue);\n }\n else if (isBuff) {\n isCommon = false;\n newValue = cloneBuffer(srcValue, true);\n }\n else if (isTyped) {\n isCommon = false;\n newValue = cloneTypedArray(srcValue, true);\n }\n else {\n newValue = [];\n }\n }\n else if (isPlainObject(srcValue) \|\| isArguments(srcValue)) {\n newValue = objValue;\n if (isArguments(objValue)) {\n newValue = toPlainObject(objValue);\n }\n else if (!isObject(objValue) \|\| isFunction(objValue)) {\n newValue = initCloneObject(srcValue);\n }\n }\n else {\n isCommon = false;\n }\n }\n if (isCommon) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, newValue);\n mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n stack['delete'](srcValue);\n }\n assignMergeValue(object, key, newValue);\n}\n\nmodule.exports = baseMergeDeep;\n","var Stack = require('./_Stack'),\n assignMergeValue = require('./_assignMergeValue'),\n baseFor = require('./_baseFor'),\n baseMergeDeep = require('./_baseMergeDeep'),\n isObject = require('./isObject'),\n keysIn = require('./keysIn'),\n safeGet = require('./_safeGet');\n\n/\n The base implementation of `_.merge` without support for multiple sources.\n \n @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n /\nfunction baseMerge(object, source, srcIndex, customizer, stack) {\n if (object === source) {\n return;\n }\n baseFor(source, function(srcValue, key) {\n stack \|\| (stack = new Stack);\n if (isObject(srcValue)) {\n baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n }\n else {\n var newValue = customizer\n ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n : undefined;\n\n if (newValue === undefined) {\n newValue = srcValue;\n }\n assignMergeValue(object, key, newValue);\n }\n }, keysIn);\n}\n\nmodule.exports = baseMerge;\n","var baseRest = require('./_baseRest'),\n isIterateeCall = require('./_isIterateeCall');\n\n/\n Creates a function like `_.assign`.\n \n @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n /\nfunction createAssigner(assigner) {\n return baseRest(function(object, sources) {\n var index = -1,\n length = sources.length,\n customizer = length > 1 ? sources[length - 1] : undefined,\n guard = length > 2 ? sources[2] : undefined;\n\n customizer = (assigner.length > 3 && typeof customizer == 'function')\n ? (length--, customizer)\n : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n customizer = length < 3 ? undefined : customizer;\n length = 1;\n }\n object = Object(object);\n while (++index < length) {\n var source = sources[index];\n if (source) {\n assigner(object, source, index, customizer);\n }\n }\n return object;\n });\n}\n\nmodule.exports = createAssigner;\n","var baseMerge = require('./_baseMerge'),\n createAssigner = require('./_createAssigner');\n\n/\n This method is like `_.assign` except that it recursively merges own and\n * inherited enumerable string keyed properties of source objects into the\n * destination object. Source properties that resolve to `undefined` are\n * skipped if a destination value exists. Array and plain object properties\n * are merged recursively. Other objects and value types are overridden by\n * assignment. Source objects are applied from left to right. Subsequent\n * sources overwrite property assignments of previous sources.\n \n Note: This method mutates `object`.\n \n @static\n * @memberOf _\n * @since 0.5.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @example\n \n var object = {\n * 'a': [{ 'b': 2 }, { 'd': 4 }]\n * };\n \n var other = {\n * 'a': [{ 'c': 3 }, { 'e': 5 }]\n * };\n \n _.merge(object, other);\n * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n /\nvar merge = createAssigner(function(object, source, srcIndex) {\n baseMerge(object, source, srcIndex);\n});\n\nmodule.exports = merge;\n","/\n The base implementation of `_.lt` which doesn't coerce arguments.\n \n @private\n * @param {} value The value to compare.\n @param {} other The other value to compare.\n @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n /\nfunction baseLt(value, other) {\n return value < other;\n}\n\nmodule.exports = baseLt;\n","var baseExtremum = require('./_baseExtremum'),\n baseLt = require('./_baseLt'),\n identity = require('./identity');\n\n/\n Computes the minimum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {} Returns the minimum value.\n @example\n \n _.min([4, 2, 8, 6]);\n * // => 2\n \n _.min([]);\n * // => undefined\n /\nfunction min(array) {\n return (array && array.length)\n ? baseExtremum(array, identity, baseLt)\n : undefined;\n}\n\nmodule.exports = min;\n","var baseExtremum = require('./_baseExtremum'),\n baseIteratee = require('./_baseIteratee'),\n baseLt = require('./_baseLt');\n\n/\n This method is like `_.min` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {} Returns the minimum value.\n @example\n \n var objects = [{ 'n': 1 }, { 'n': 2 }];\n \n _.minBy(objects, function(o) { return o.n; });\n * // => { 'n': 1 }\n \n // The `_.property` iteratee shorthand.\n * _.minBy(objects, 'n');\n * // => { 'n': 1 }\n /\nfunction minBy(array, iteratee) {\n return (array && array.length)\n ? baseExtremum(array, baseIteratee(iteratee, 2), baseLt)\n : undefined;\n}\n\nmodule.exports = minBy;\n","var root = require('./_root');\n\n/\n Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n \n @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n \n _.defer(function(stamp) {\n * console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n /\nvar now = function() {\n return root.Date.now();\n};\n\nmodule.exports = now;\n","var assignValue = require('./_assignValue'),\n castPath = require('./_castPath'),\n isIndex = require('./_isIndex'),\n isObject = require('./isObject'),\n toKey = require('./_toKey');\n\n/\n The base implementation of `_.set`.\n \n @private\n * @param {Object} object The object to modify.\n * @param {Array\|string} path The path of the property to set.\n * @param {} value The value to set.\n @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n /\nfunction baseSet(object, path, value, customizer) {\n if (!isObject(object)) {\n return object;\n }\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n lastIndex = length - 1,\n nested = object;\n\n while (nested != null && ++index < length) {\n var key = toKey(path[index]),\n newValue = value;\n\n if (key === '__proto__' \|\| key === 'constructor' \|\| key === 'prototype') {\n return object;\n }\n\n if (index != lastIndex) {\n var objValue = nested[key];\n newValue = customizer ? customizer(objValue, key, nested) : undefined;\n if (newValue === undefined) {\n newValue = isObject(objValue)\n ? objValue\n : (isIndex(path[index + 1]) ? [] : {});\n }\n }\n assignValue(nested, key, newValue);\n nested = nested[key];\n }\n return object;\n}\n\nmodule.exports = baseSet;\n","var baseGet = require('./_baseGet'),\n baseSet = require('./_baseSet'),\n castPath = require('./_castPath');\n\n/\n The base implementation of `_.pickBy` without support for iteratee shorthands.\n \n @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n /\nfunction basePickBy(object, paths, predicate) {\n var index = -1,\n length = paths.length,\n result = {};\n\n while (++index < length) {\n var path = paths[index],\n value = baseGet(object, path);\n\n if (predicate(value, path)) {\n baseSet(result, castPath(path, object), value);\n }\n }\n return result;\n}\n\nmodule.exports = basePickBy;\n","var basePickBy = require('./_basePickBy'),\n hasIn = require('./hasIn');\n\n/\n The base implementation of `_.pick` without support for individual\n * property identifiers.\n \n @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n /\nfunction basePick(object, paths) {\n return basePickBy(object, paths, function(value, path) {\n return hasIn(object, path);\n });\n}\n\nmodule.exports = basePick;\n","var flatten = require('./flatten'),\n overRest = require('./_overRest'),\n setToString = require('./_setToString');\n\n/\n A specialized version of `baseRest` which flattens the rest array.\n \n @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n /\nfunction flatRest(func) {\n return setToString(overRest(func, undefined, flatten), func + '');\n}\n\nmodule.exports = flatRest;\n","var basePick = require('./_basePick'),\n flatRest = require('./_flatRest');\n\n/\n Creates an object composed of the picked `object` properties.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string\|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n \n var object = { 'a': 1, 'b': '2', 'c': 3 };\n \n _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n /\nvar pick = flatRest(function(object, paths) {\n return object == null ? {} : basePick(object, paths);\n});\n\nmodule.exports = pick;\n","/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeCeil = Math.ceil,\n nativeMax = Math.max;\n\n/\n The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n \n @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n /\nfunction baseRange(start, end, step, fromRight) {\n var index = -1,\n length = nativeMax(nativeCeil((end - start) / (step \|\| 1)), 0),\n result = Array(length);\n\n while (length--) {\n result[fromRight ? length : ++index] = start;\n start += step;\n }\n return result;\n}\n\nmodule.exports = baseRange;\n","var baseRange = require('./_baseRange'),\n isIterateeCall = require('./_isIterateeCall'),\n toFinite = require('./toFinite');\n\n/\n Creates a `_.range` or `_.rangeRight` function.\n \n @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n /\nfunction createRange(fromRight) {\n return function(start, end, step) {\n if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n end = step = undefined;\n }\n // Ensure the sign of `-0` is preserved.\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n return baseRange(start, end, step, fromRight);\n };\n}\n\nmodule.exports = createRange;\n","var createRange = require('./_createRange');\n\n/\n Creates an array of numbers (positive and/or negative) progressing from\n * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n * `start` is specified without an `end` or `step`. If `end` is not specified,\n * it's set to `start` with `start` then set to `0`.\n \n Note: JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @param {number} [step=1] The value to increment or decrement by.\n * @returns {Array} Returns the range of numbers.\n * @see _.inRange, _.rangeRight\n * @example\n \n _.range(4);\n * // => [0, 1, 2, 3]\n \n _.range(-4);\n * // => [0, -1, -2, -3]\n \n _.range(1, 5);\n * // => [1, 2, 3, 4]\n \n _.range(0, 20, 5);\n * // => [0, 5, 10, 15]\n \n _.range(0, -4, -1);\n * // => [0, -1, -2, -3]\n \n _.range(1, 4, 0);\n * // => [1, 1, 1]\n \n _.range(0);\n * // => []\n /\nvar range = createRange();\n\nmodule.exports = range;\n","/\n The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n \n @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n /\nfunction baseSortBy(array, comparer) {\n var length = array.length;\n\n array.sort(comparer);\n while (length--) {\n array[length] = array[length].value;\n }\n return array;\n}\n\nmodule.exports = baseSortBy;\n","var isSymbol = require('./isSymbol');\n\n/\n Compares values to sort them in ascending order.\n \n @private\n * @param {} value The value to compare.\n @param {} other The other value to compare.\n @returns {number} Returns the sort order indicator for `value`.\n /\nfunction compareAscending(value, other) {\n if (value !== other) {\n var valIsDefined = value !== undefined,\n valIsNull = value === null,\n valIsReflexive = value === value,\n valIsSymbol = isSymbol(value);\n\n var othIsDefined = other !== undefined,\n othIsNull = other === null,\n othIsReflexive = other === other,\n othIsSymbol = isSymbol(other);\n\n if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) \|\|\n (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) \|\|\n (valIsNull && othIsDefined && othIsReflexive) \|\|\n (!valIsDefined && othIsReflexive) \|\|\n !valIsReflexive) {\n return 1;\n }\n if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) \|\|\n (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) \|\|\n (othIsNull && valIsDefined && valIsReflexive) \|\|\n (!othIsDefined && valIsReflexive) \|\|\n !othIsReflexive) {\n return -1;\n }\n }\n return 0;\n}\n\nmodule.exports = compareAscending;\n","var compareAscending = require('./_compareAscending');\n\n/\n Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n \n If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n \n @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]\|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n /\nfunction compareMultiple(object, other, orders) {\n var index = -1,\n objCriteria = object.criteria,\n othCriteria = other.criteria,\n length = objCriteria.length,\n ordersLength = orders.length;\n\n while (++index < length) {\n var result = compareAscending(objCriteria[index], othCriteria[index]);\n if (result) {\n if (index >= ordersLength) {\n return result;\n }\n var order = orders[index];\n return result (order == 'desc' ? -1 : 1);\n }\n }\n // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n // that causes it, under certain circumstances, to provide the same value for\n // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n // for more details.\n //\n // This also ensures a stable sort in V8 and other engines.\n // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n return object.index - other.index;\n}\n\nmodule.exports = compareMultiple;\n","var arrayMap = require('./_arrayMap'),\n baseGet = require('./_baseGet'),\n baseIteratee = require('./_baseIteratee'),\n baseMap = require('./_baseMap'),\n baseSortBy = require('./_baseSortBy'),\n baseUnary = require('./_baseUnary'),\n compareMultiple = require('./_compareMultiple'),\n identity = require('./identity'),\n isArray = require('./isArray');\n\n/*\n The base implementation of `_.orderBy` without param guards.\n \n @private\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function[]\|Object[]\|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n /\nfunction baseOrderBy(collection, iteratees, orders) {\n if (iteratees.length) {\n iteratees = arrayMap(iteratees, function(iteratee) {\n if (isArray(iteratee)) {\n return function(value) {\n return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n }\n }\n return iteratee;\n });\n } else {\n iteratees = [identity];\n }\n\n var index = -1;\n iteratees = arrayMap(iteratees, baseUnary(baseIteratee));\n\n var result = baseMap(collection, function(value, key, collection) {\n var criteria = arrayMap(iteratees, function(iteratee) {\n return iteratee(value);\n });\n return { 'criteria': criteria, 'index': ++index, 'value': value };\n });\n\n return baseSortBy(result, function(object, other) {\n return compareMultiple(object, other, orders);\n });\n}\n\nmodule.exports = baseOrderBy;\n","var baseFlatten = require('./_baseFlatten'),\n baseOrderBy = require('./_baseOrderBy'),\n baseRest = require('./_baseRest'),\n isIterateeCall = require('./_isIterateeCall');\n\n/\n Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {...(Function\|Function[])} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n \n var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 30 },\n * { 'user': 'barney', 'age': 34 }\n * ];\n \n _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n \n _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n /\nvar sortBy = baseRest(function(collection, iteratees) {\n if (collection == null) {\n return [];\n }\n var length = iteratees.length;\n if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n iteratees = [];\n } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n iteratees = [iteratees[0]];\n }\n return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n});\n\nmodule.exports = sortBy;\n","var toString = require('./toString');\n\n/* Used to generate unique IDs. /\nvar idCounter = 0;\n\n/\n Generates a unique ID. If `prefix` is given, the ID is appended to it.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {string} [prefix=''] The value to prefix the ID with.\n * @returns {string} Returns the unique ID.\n * @example\n \n _.uniqueId('contact_');\n * // => 'contact_104'\n \n _.uniqueId();\n * // => '105'\n /\nfunction uniqueId(prefix) {\n var id = ++idCounter;\n return toString(prefix) + id;\n}\n\nmodule.exports = uniqueId;\n","/\n This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n \n @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n /\nfunction baseZipObject(props, values, assignFunc) {\n var index = -1,\n length = props.length,\n valsLength = values.length,\n result = {};\n\n while (++index < length) {\n var value = index < valsLength ? values[index] : undefined;\n assignFunc(result, props[index], value);\n }\n return result;\n}\n\nmodule.exports = baseZipObject;\n","var assignValue = require('./_assignValue'),\n baseZipObject = require('./_baseZipObject');\n\n/\n This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n \n @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n \n _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n /\nfunction zipObject(props, values) {\n return baseZipObject(props \|\| [], values \|\| [], assignValue);\n}\n\nmodule.exports = zipObject;\n","/ global window /\n\nvar lodash;\n\nif (typeof require === \"function\") {\n try {\n lodash = {\n cloneDeep: require(\"lodash/cloneDeep\"),\n constant: require(\"lodash/constant\"),\n defaults: require(\"lodash/defaults\"),\n each: require(\"lodash/each\"),\n filter: require(\"lodash/filter\"),\n find: require(\"lodash/find\"),\n flatten: require(\"lodash/flatten\"),\n forEach: require(\"lodash/forEach\"),\n forIn: require(\"lodash/forIn\"),\n has: require(\"lodash/has\"),\n isUndefined: require(\"lodash/isUndefined\"),\n last: require(\"lodash/last\"),\n map: require(\"lodash/map\"),\n mapValues: require(\"lodash/mapValues\"),\n max: require(\"lodash/max\"),\n merge: require(\"lodash/merge\"),\n min: require(\"lodash/min\"),\n minBy: require(\"lodash/minBy\"),\n now: require(\"lodash/now\"),\n pick: require(\"lodash/pick\"),\n range: require(\"lodash/range\"),\n reduce: require(\"lodash/reduce\"),\n sortBy: require(\"lodash/sortBy\"),\n uniqueId: require(\"lodash/uniqueId\"),\n values: require(\"lodash/values\"),\n zipObject: require(\"lodash/zipObject\"),\n };\n } catch (e) {\n // continue regardless of error\n }\n}\n\nif (!lodash) {\n lodash = window._;\n}\n\nmodule.exports = lodash;\n","/\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n /\n\nmodule.exports = List;\n\nfunction List() {\n var sentinel = {};\n sentinel._next = sentinel._prev = sentinel;\n this._sentinel = sentinel;\n}\n\nList.prototype.dequeue = function() {\n var sentinel = this._sentinel;\n var entry = sentinel._prev;\n if (entry !== sentinel) {\n unlink(entry);\n return entry;\n }\n};\n\nList.prototype.enqueue = function(entry) {\n var sentinel = this._sentinel;\n if (entry._prev && entry._next) {\n unlink(entry);\n }\n entry._next = sentinel._next;\n sentinel._next._prev = entry;\n sentinel._next = entry;\n entry._prev = sentinel;\n};\n\nList.prototype.toString = function() {\n var strs = [];\n var sentinel = this._sentinel;\n var curr = sentinel._prev;\n while (curr !== sentinel) {\n strs.push(JSON.stringify(curr, filterOutLinks));\n curr = curr._prev;\n }\n return \"[\" + strs.join(\", \") + \"]\";\n};\n\nfunction unlink(entry) {\n entry._prev._next = entry._next;\n entry._next._prev = entry._prev;\n delete entry._next;\n delete entry._prev;\n}\n\nfunction filterOutLinks(k, v) {\n if (k !== \"_next\" && k !== \"_prev\") {\n return v;\n }\n}\n","var _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\nvar List = require(\"./data/list\");\n\n/\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n /\nmodule.exports = greedyFAS;\n\nvar DEFAULT_WEIGHT_FN = _.constant(1);\n\nfunction greedyFAS(g, weightFn) {\n if (g.nodeCount() <= 1) {\n return [];\n }\n var state = buildState(g, weightFn \|\| DEFAULT_WEIGHT_FN);\n var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n // Expand multi-edges\n return _.flatten(_.map(results, function(e) {\n return g.outEdges(e.v, e.w);\n }), true);\n}\n\nfunction doGreedyFAS(g, buckets, zeroIdx) {\n var results = [];\n var sources = buckets[buckets.length - 1];\n var sinks = buckets[0];\n\n var entry;\n while (g.nodeCount()) {\n while ((entry = sinks.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n if (g.nodeCount()) {\n for (var i = buckets.length - 2; i > 0; --i) {\n entry = buckets[i].dequeue();\n if (entry) {\n results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n break;\n }\n }\n }\n }\n\n return results;\n}\n\nfunction removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n var results = collectPredecessors ? [] : undefined;\n\n _.forEach(g.inEdges(entry.v), function(edge) {\n var weight = g.edge(edge);\n var uEntry = g.node(edge.v);\n\n if (collectPredecessors) {\n results.push({ v: edge.v, w: edge.w });\n }\n\n uEntry.out -= weight;\n assignBucket(buckets, zeroIdx, uEntry);\n });\n\n _.forEach(g.outEdges(entry.v), function(edge) {\n var weight = g.edge(edge);\n var w = edge.w;\n var wEntry = g.node(w);\n wEntry[\"in\"] -= weight;\n assignBucket(buckets, zeroIdx, wEntry);\n });\n\n g.removeNode(entry.v);\n\n return results;\n}\n\nfunction buildState(g, weightFn) {\n var fasGraph = new Graph();\n var maxIn = 0;\n var maxOut = 0;\n\n _.forEach(g.nodes(), function(v) {\n fasGraph.setNode(v, { v: v, \"in\": 0, out: 0 });\n });\n\n // Aggregate weights on nodes, but also sum the weights across multi-edges\n // into a single edge for the fasGraph.\n _.forEach(g.edges(), function(e) {\n var prevWeight = fasGraph.edge(e.v, e.w) \|\| 0;\n var weight = weightFn(e);\n var edgeWeight = prevWeight + weight;\n fasGraph.setEdge(e.v, e.w, edgeWeight);\n maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);\n maxIn = Math.max(maxIn, fasGraph.node(e.w)[\"in\"] += weight);\n });\n\n var buckets = _.range(maxOut + maxIn + 3).map(function() { return new List(); });\n var zeroIdx = maxIn + 1;\n\n _.forEach(fasGraph.nodes(), function(v) {\n assignBucket(buckets, zeroIdx, fasGraph.node(v));\n });\n\n return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };\n}\n\nfunction assignBucket(buckets, zeroIdx, entry) {\n if (!entry.out) {\n buckets[0].enqueue(entry);\n } else if (!entry[\"in\"]) {\n buckets[buckets.length - 1].enqueue(entry);\n } else {\n buckets[entry.out - entry[\"in\"] + zeroIdx].enqueue(entry);\n }\n}\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar greedyFAS = require(\"./greedy-fas\");\n\nmodule.exports = {\n run: run,\n undo: undo\n};\n\nfunction run(g) {\n var fas = (g.graph().acyclicer === \"greedy\"\n ? greedyFAS(g, weightFn(g))\n : dfsFAS(g));\n _.forEach(fas, function(e) {\n var label = g.edge(e);\n g.removeEdge(e);\n label.forwardName = e.name;\n label.reversed = true;\n g.setEdge(e.w, e.v, label, _.uniqueId(\"rev\"));\n });\n\n function weightFn(g) {\n return function(e) {\n return g.edge(e).weight;\n };\n }\n}\n\nfunction dfsFAS(g) {\n var fas = [];\n var stack = {};\n var visited = {};\n\n function dfs(v) {\n if (_.has(visited, v)) {\n return;\n }\n visited[v] = true;\n stack[v] = true;\n _.forEach(g.outEdges(v), function(e) {\n if (_.has(stack, e.w)) {\n fas.push(e);\n } else {\n dfs(e.w);\n }\n });\n delete stack[v];\n }\n\n _.forEach(g.nodes(), dfs);\n return fas;\n}\n\nfunction undo(g) {\n _.forEach(g.edges(), function(e) {\n var label = g.edge(e);\n if (label.reversed) {\n g.removeEdge(e);\n\n var forwardName = label.forwardName;\n delete label.reversed;\n delete label.forwardName;\n g.setEdge(e.w, e.v, label, forwardName);\n }\n });\n}\n","/ eslint \"no-console\": off /\n\n\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n addDummyNode: addDummyNode,\n simplify: simplify,\n asNonCompoundGraph: asNonCompoundGraph,\n successorWeights: successorWeights,\n predecessorWeights: predecessorWeights,\n intersectRect: intersectRect,\n buildLayerMatrix: buildLayerMatrix,\n normalizeRanks: normalizeRanks,\n removeEmptyRanks: removeEmptyRanks,\n addBorderNode: addBorderNode,\n maxRank: maxRank,\n partition: partition,\n time: time,\n notime: notime\n};\n\n/\n * Adds a dummy node to the graph and return v.\n /\nfunction addDummyNode(g, type, attrs, name) {\n var v;\n do {\n v = _.uniqueId(name);\n } while (g.hasNode(v));\n\n attrs.dummy = type;\n g.setNode(v, attrs);\n return v;\n}\n\n/\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n /\nfunction simplify(g) {\n var simplified = new Graph().setGraph(g.graph());\n _.forEach(g.nodes(), function(v) { simplified.setNode(v, g.node(v)); });\n _.forEach(g.edges(), function(e) {\n var simpleLabel = simplified.edge(e.v, e.w) \|\| { weight: 0, minlen: 1 };\n var label = g.edge(e);\n simplified.setEdge(e.v, e.w, {\n weight: simpleLabel.weight + label.weight,\n minlen: Math.max(simpleLabel.minlen, label.minlen)\n });\n });\n return simplified;\n}\n\nfunction asNonCompoundGraph(g) {\n var simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());\n _.forEach(g.nodes(), function(v) {\n if (!g.children(v).length) {\n simplified.setNode(v, g.node(v));\n }\n });\n _.forEach(g.edges(), function(e) {\n simplified.setEdge(e, g.edge(e));\n });\n return simplified;\n}\n\nfunction successorWeights(g) {\n var weightMap = _.map(g.nodes(), function(v) {\n var sucs = {};\n _.forEach(g.outEdges(v), function(e) {\n sucs[e.w] = (sucs[e.w] \|\| 0) + g.edge(e).weight;\n });\n return sucs;\n });\n return _.zipObject(g.nodes(), weightMap);\n}\n\nfunction predecessorWeights(g) {\n var weightMap = _.map(g.nodes(), function(v) {\n var preds = {};\n _.forEach(g.inEdges(v), function(e) {\n preds[e.v] = (preds[e.v] \|\| 0) + g.edge(e).weight;\n });\n return preds;\n });\n return _.zipObject(g.nodes(), weightMap);\n}\n\n/\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n /\nfunction intersectRect(rect, point) {\n var x = rect.x;\n var y = rect.y;\n\n // Rectangle intersection algorithm from:\n // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n var dx = point.x - x;\n var dy = point.y - y;\n var w = rect.width / 2;\n var h = rect.height / 2;\n\n if (!dx && !dy) {\n throw new Error(\"Not possible to find intersection inside of the rectangle\");\n }\n\n var sx, sy;\n if (Math.abs(dy) w > Math.abs(dx) * h) {\n // Intersection is top or bottom of rect.\n if (dy < 0) {\n h = -h;\n }\n sx = h * dx / dy;\n sy = h;\n } else {\n // Intersection is left or right of rect.\n if (dx < 0) {\n w = -w;\n }\n sx = w;\n sy = w * dy / dx;\n }\n\n return { x: x + sx, y: y + sy };\n}\n\n/\n Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * function will produce a matrix with the ids of each node.\n /\nfunction buildLayerMatrix(g) {\n var layering = _.map(_.range(maxRank(g) + 1), function() { return []; });\n _.forEach(g.nodes(), function(v) {\n var node = g.node(v);\n var rank = node.rank;\n if (!_.isUndefined(rank)) {\n layering[rank][node.order] = v;\n }\n });\n return layering;\n}\n\n/\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n /\nfunction normalizeRanks(g) {\n var min = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n _.forEach(g.nodes(), function(v) {\n var node = g.node(v);\n if (_.has(node, \"rank\")) {\n node.rank -= min;\n }\n });\n}\n\nfunction removeEmptyRanks(g) {\n // Ranks may not start at 0, so we need to offset them\n var offset = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n\n var layers = [];\n _.forEach(g.nodes(), function(v) {\n var rank = g.node(v).rank - offset;\n if (!layers[rank]) {\n layers[rank] = [];\n }\n layers[rank].push(v);\n });\n\n var delta = 0;\n var nodeRankFactor = g.graph().nodeRankFactor;\n _.forEach(layers, function(vs, i) {\n if (_.isUndefined(vs) && i % nodeRankFactor !== 0) {\n --delta;\n } else if (delta) {\n _.forEach(vs, function(v) { g.node(v).rank += delta; });\n }\n });\n}\n\nfunction addBorderNode(g, prefix, rank, order) {\n var node = {\n width: 0,\n height: 0\n };\n if (arguments.length >= 4) {\n node.rank = rank;\n node.order = order;\n }\n return addDummyNode(g, \"border\", node, prefix);\n}\n\nfunction maxRank(g) {\n return _.max(_.map(g.nodes(), function(v) {\n var rank = g.node(v).rank;\n if (!_.isUndefined(rank)) {\n return rank;\n }\n }));\n}\n\n/\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * function returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n /\nfunction partition(collection, fn) {\n var result = { lhs: [], rhs: [] };\n _.forEach(collection, function(value) {\n if (fn(value)) {\n result.lhs.push(value);\n } else {\n result.rhs.push(value);\n }\n });\n return result;\n}\n\n/\n * Returns a new function that wraps `fn` with a timer. The wrapper logs the\n * time it takes to execute the function.\n /\nfunction time(name, fn) {\n var start = _.now();\n try {\n return fn();\n } finally {\n console.log(name + \" time: \" + (_.now() - start) + \"ms\");\n }\n}\n\nfunction notime(name, fn) {\n return fn();\n}\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = {\n run: run,\n undo: undo\n};\n\n/\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n \n Pre-conditions:\n \n 1. The input graph is a DAG.\n * 2. Each node in the graph has a \"rank\" property.\n \n Post-condition:\n \n 1. All edges in the graph have a length of 1.\n * 2. Dummy nodes are added where edges have been split into segments.\n * 3. The graph is augmented with a \"dummyChains\" attribute which contains\n * the first dummy in each chain of dummy nodes produced.\n /\nfunction run(g) {\n g.graph().dummyChains = [];\n _.forEach(g.edges(), function(edge) { normalizeEdge(g, edge); });\n}\n\nfunction normalizeEdge(g, e) {\n var v = e.v;\n var vRank = g.node(v).rank;\n var w = e.w;\n var wRank = g.node(w).rank;\n var name = e.name;\n var edgeLabel = g.edge(e);\n var labelRank = edgeLabel.labelRank;\n\n if (wRank === vRank + 1) return;\n\n g.removeEdge(e);\n\n var dummy, attrs, i;\n for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n edgeLabel.points = [];\n attrs = {\n width: 0, height: 0,\n edgeLabel: edgeLabel, edgeObj: e,\n rank: vRank\n };\n dummy = util.addDummyNode(g, \"edge\", attrs, \"_d\");\n if (vRank === labelRank) {\n attrs.width = edgeLabel.width;\n attrs.height = edgeLabel.height;\n attrs.dummy = \"edge-label\";\n attrs.labelpos = edgeLabel.labelpos;\n }\n g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n if (i === 0) {\n g.graph().dummyChains.push(dummy);\n }\n v = dummy;\n }\n\n g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n}\n\nfunction undo(g) {\n _.forEach(g.graph().dummyChains, function(v) {\n var node = g.node(v);\n var origLabel = node.edgeLabel;\n var w;\n g.setEdge(node.edgeObj, origLabel);\n while (node.dummy) {\n w = g.successors(v)[0];\n g.removeNode(v);\n origLabel.points.push({ x: node.x, y: node.y });\n if (node.dummy === \"edge-label\") {\n origLabel.x = node.x;\n origLabel.y = node.y;\n origLabel.width = node.width;\n origLabel.height = node.height;\n }\n v = w;\n node = g.node(v);\n }\n });\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = {\n longestPath: longestPath,\n slack: slack\n};\n\n/\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n \n This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n \n Pre-conditions:\n \n 1. Input graph is a DAG.\n * 2. Input graph node labels can be assigned properties.\n \n Post-conditions:\n \n 1. Each node will be assign an (unnormalized) \"rank\" property.\n /\nfunction longestPath(g) {\n var visited = {};\n\n function dfs(v) {\n var label = g.node(v);\n if (_.has(visited, v)) {\n return label.rank;\n }\n visited[v] = true;\n\n var rank = _.min(_.map(g.outEdges(v), function(e) {\n return dfs(e.w) - g.edge(e).minlen;\n }));\n\n if (rank === Number.POSITIVE_INFINITY \|\| // return value of _.map([]) for Lodash 3\n rank === undefined \|\| // return value of _.map([]) for Lodash 4\n rank === null) { // return value of _.map([null])\n rank = 0;\n }\n\n return (label.rank = rank);\n }\n\n _.forEach(g.sources(), dfs);\n}\n\n/\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n /\nfunction slack(g, e) {\n return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\nvar slack = require(\"./util\").slack;\n\nmodule.exports = feasibleTree;\n\n/\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n \n The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n \n Pre-conditions:\n \n 1. Graph must be a DAG.\n * 2. Graph must be connected.\n * 3. Graph must have at least one node.\n * 5. Graph nodes must have been previously assigned a \"rank\" property that\n * respects the \"minlen\" property of incident edges.\n * 6. Graph edges must have a \"minlen\" property.\n \n Post-conditions:\n \n - Graph nodes will have their rank adjusted to ensure that all edges are\n * tight.\n \n Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n /\nfunction feasibleTree(g) {\n var t = new Graph({ directed: false });\n\n // Choose arbitrary node from which to start our tree\n var start = g.nodes()[0];\n var size = g.nodeCount();\n t.setNode(start, {});\n\n var edge, delta;\n while (tightTree(t, g) < size) {\n edge = findMinSlackEdge(t, g);\n delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);\n shiftRanks(t, g, delta);\n }\n\n return t;\n}\n\n/\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n /\nfunction tightTree(t, g) {\n function dfs(v) {\n _.forEach(g.nodeEdges(v), function(e) {\n var edgeV = e.v,\n w = (v === edgeV) ? e.w : edgeV;\n if (!t.hasNode(w) && !slack(g, e)) {\n t.setNode(w, {});\n t.setEdge(v, w, {});\n dfs(w);\n }\n });\n }\n\n _.forEach(t.nodes(), dfs);\n return t.nodeCount();\n}\n\n/\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n /\nfunction findMinSlackEdge(t, g) {\n return _.minBy(g.edges(), function(e) {\n if (t.hasNode(e.v) !== t.hasNode(e.w)) {\n return slack(g, e);\n }\n });\n}\n\nfunction shiftRanks(t, g, delta) {\n _.forEach(t.nodes(), function(v) {\n g.node(v).rank += delta;\n });\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar feasibleTree = require(\"./feasible-tree\");\nvar slack = require(\"./util\").slack;\nvar initRank = require(\"./util\").longestPath;\nvar preorder = require(\"../graphlib\").alg.preorder;\nvar postorder = require(\"../graphlib\").alg.postorder;\nvar simplify = require(\"../util\").simplify;\n\nmodule.exports = networkSimplex;\n\n// Expose some internals for testing purposes\nnetworkSimplex.initLowLimValues = initLowLimValues;\nnetworkSimplex.initCutValues = initCutValues;\nnetworkSimplex.calcCutValue = calcCutValue;\nnetworkSimplex.leaveEdge = leaveEdge;\nnetworkSimplex.enterEdge = enterEdge;\nnetworkSimplex.exchangeEdges = exchangeEdges;\n\n/\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n \n Preconditions:\n \n 1. The input graph must be a DAG.\n * 2. All nodes in the graph must have an object value.\n * 3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n \n Postconditions:\n \n 1. All nodes in the graph will have an assigned \"rank\" attribute that has\n * been optimized by the network simplex algorithm. Ranks start at 0.\n \n \n * A rough sketch of the algorithm is as follows:\n \n 1. Assign initial ranks to each node. We use the longest path algorithm,\n * which assigns ranks to the lowest position possible. In general this\n * leads to very wide bottom ranks and unnecessarily long edges.\n * 2. Construct a feasible tight tree. A tight tree is one such that all\n * edges in the tree have no slack (difference between length of edge\n * and minlen for the edge). This by itself greatly improves the assigned\n * rankings by shorting edges.\n * 3. Iteratively find edges that have negative cut values. Generally a\n * negative cut value indicates that the edge could be removed and a new\n * tree edge could be added to produce a more compact graph.\n \n Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n /\nfunction networkSimplex(g) {\n g = simplify(g);\n initRank(g);\n var t = feasibleTree(g);\n initLowLimValues(t);\n initCutValues(t, g);\n\n var e, f;\n while ((e = leaveEdge(t))) {\n f = enterEdge(t, g, e);\n exchangeEdges(t, g, e, f);\n }\n}\n\n/\n * Initializes cut values for all edges in the tree.\n /\nfunction initCutValues(t, g) {\n var vs = postorder(t, t.nodes());\n vs = vs.slice(0, vs.length - 1);\n _.forEach(vs, function(v) {\n assignCutValue(t, g, v);\n });\n}\n\nfunction assignCutValue(t, g, child) {\n var childLab = t.node(child);\n var parent = childLab.parent;\n t.edge(child, parent).cutvalue = calcCutValue(t, g, child);\n}\n\n/\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n /\nfunction calcCutValue(t, g, child) {\n var childLab = t.node(child);\n var parent = childLab.parent;\n // True if the child is on the tail end of the edge in the directed graph\n var childIsTail = true;\n // The graph's view of the tree edge we're inspecting\n var graphEdge = g.edge(child, parent);\n // The accumulated cut value for the edge between this node and its parent\n var cutValue = 0;\n\n if (!graphEdge) {\n childIsTail = false;\n graphEdge = g.edge(parent, child);\n }\n\n cutValue = graphEdge.weight;\n\n _.forEach(g.nodeEdges(child), function(e) {\n var isOutEdge = e.v === child,\n other = isOutEdge ? e.w : e.v;\n\n if (other !== parent) {\n var pointsToHead = isOutEdge === childIsTail,\n otherWeight = g.edge(e).weight;\n\n cutValue += pointsToHead ? otherWeight : -otherWeight;\n if (isTreeEdge(t, child, other)) {\n var otherCutValue = t.edge(child, other).cutvalue;\n cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n }\n }\n });\n\n return cutValue;\n}\n\nfunction initLowLimValues(tree, root) {\n if (arguments.length < 2) {\n root = tree.nodes()[0];\n }\n dfsAssignLowLim(tree, {}, 1, root);\n}\n\nfunction dfsAssignLowLim(tree, visited, nextLim, v, parent) {\n var low = nextLim;\n var label = tree.node(v);\n\n visited[v] = true;\n _.forEach(tree.neighbors(v), function(w) {\n if (!_.has(visited, w)) {\n nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);\n }\n });\n\n label.low = low;\n label.lim = nextLim++;\n if (parent) {\n label.parent = parent;\n } else {\n // TODO should be able to remove this when we incrementally update low lim\n delete label.parent;\n }\n\n return nextLim;\n}\n\nfunction leaveEdge(tree) {\n return _.find(tree.edges(), function(e) {\n return tree.edge(e).cutvalue < 0;\n });\n}\n\nfunction enterEdge(t, g, edge) {\n var v = edge.v;\n var w = edge.w;\n\n // For the rest of this function we assume that v is the tail and w is the\n // head, so if we don't have this edge in the graph we should flip it to\n // match the correct orientation.\n if (!g.hasEdge(v, w)) {\n v = edge.w;\n w = edge.v;\n }\n\n var vLabel = t.node(v);\n var wLabel = t.node(w);\n var tailLabel = vLabel;\n var flip = false;\n\n // If the root is in the tail of the edge then we need to flip the logic that\n // checks for the head and tail nodes in the candidates function below.\n if (vLabel.lim > wLabel.lim) {\n tailLabel = wLabel;\n flip = true;\n }\n\n var candidates = _.filter(g.edges(), function(edge) {\n return flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n flip !== isDescendant(t, t.node(edge.w), tailLabel);\n });\n\n return _.minBy(candidates, function(edge) { return slack(g, edge); });\n}\n\nfunction exchangeEdges(t, g, e, f) {\n var v = e.v;\n var w = e.w;\n t.removeEdge(v, w);\n t.setEdge(f.v, f.w, {});\n initLowLimValues(t);\n initCutValues(t, g);\n updateRanks(t, g);\n}\n\nfunction updateRanks(t, g) {\n var root = _.find(t.nodes(), function(v) { return !g.node(v).parent; });\n var vs = preorder(t, root);\n vs = vs.slice(1);\n _.forEach(vs, function(v) {\n var parent = t.node(v).parent,\n edge = g.edge(v, parent),\n flipped = false;\n\n if (!edge) {\n edge = g.edge(parent, v);\n flipped = true;\n }\n\n g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);\n });\n}\n\n/\n * Returns true if the edge is in the tree.\n /\nfunction isTreeEdge(tree, u, v) {\n return tree.hasEdge(u, v);\n}\n\n/\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n /\nfunction isDescendant(tree, vLabel, rootLabel) {\n return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;\n}\n","\"use strict\";\n\nvar rankUtil = require(\"./util\");\nvar longestPath = rankUtil.longestPath;\nvar feasibleTree = require(\"./feasible-tree\");\nvar networkSimplex = require(\"./network-simplex\");\n\nmodule.exports = rank;\n\n/\n * Assigns a rank to each node in the input graph that respects the \"minlen\"\n * constraint specified on edges between nodes.\n \n This basic structure is derived from Gansner, et al., \"A Technique for\n * Drawing Directed Graphs.\"\n \n Pre-conditions:\n \n 1. Graph must be a connected DAG\n * 2. Graph nodes must be objects\n * 3. Graph edges must have \"weight\" and \"minlen\" attributes\n \n Post-conditions:\n \n 1. Graph nodes will have a \"rank\" attribute based on the results of the\n * algorithm. Ranks can start at any index (including negative), we'll\n * fix them up later.\n /\nfunction rank(g) {\n switch(g.graph().ranker) {\n case \"network-simplex\": networkSimplexRanker(g); break;\n case \"tight-tree\": tightTreeRanker(g); break;\n case \"longest-path\": longestPathRanker(g); break;\n default: networkSimplexRanker(g);\n }\n}\n\n// A fast and simple ranker, but results are far from optimal.\nvar longestPathRanker = longestPath;\n\nfunction tightTreeRanker(g) {\n longestPath(g);\n feasibleTree(g);\n}\n\nfunction networkSimplexRanker(g) {\n networkSimplex(g);\n}\n","var _ = require(\"./lodash\");\n\nmodule.exports = parentDummyChains;\n\nfunction parentDummyChains(g) {\n var postorderNums = postorder(g);\n\n _.forEach(g.graph().dummyChains, function(v) {\n var node = g.node(v);\n var edgeObj = node.edgeObj;\n var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n var path = pathData.path;\n var lca = pathData.lca;\n var pathIdx = 0;\n var pathV = path[pathIdx];\n var ascending = true;\n\n while (v !== edgeObj.w) {\n node = g.node(v);\n\n if (ascending) {\n while ((pathV = path[pathIdx]) !== lca &&\n g.node(pathV).maxRank < node.rank) {\n pathIdx++;\n }\n\n if (pathV === lca) {\n ascending = false;\n }\n }\n\n if (!ascending) {\n while (pathIdx < path.length - 1 &&\n g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {\n pathIdx++;\n }\n pathV = path[pathIdx];\n }\n\n g.setParent(v, pathV);\n v = g.successors(v)[0];\n }\n });\n}\n\n// Find a path from v to w through the lowest common ancestor (LCA). Return the\n// full path and the LCA.\nfunction findPath(g, postorderNums, v, w) {\n var vPath = [];\n var wPath = [];\n var low = Math.min(postorderNums[v].low, postorderNums[w].low);\n var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n var parent;\n var lca;\n\n // Traverse up from v to find the LCA\n parent = v;\n do {\n parent = g.parent(parent);\n vPath.push(parent);\n } while (parent &&\n (postorderNums[parent].low > low \|\| lim > postorderNums[parent].lim));\n lca = parent;\n\n // Traverse from w to LCA\n parent = w;\n while ((parent = g.parent(parent)) !== lca) {\n wPath.push(parent);\n }\n\n return { path: vPath.concat(wPath.reverse()), lca: lca };\n}\n\nfunction postorder(g) {\n var result = {};\n var lim = 0;\n\n function dfs(v) {\n var low = lim;\n _.forEach(g.children(v), dfs);\n result[v] = { low: low, lim: lim++ };\n }\n _.forEach(g.children(), dfs);\n\n return result;\n}\n","var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = {\n run: run,\n cleanup: cleanup\n};\n\n/\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundries, and ensures that the graph is connected.\n \n In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n \n Preconditions:\n \n 1. Input graph is a DAG\n * 2. Nodes in the input graph has a minlen attribute\n \n Postconditions:\n \n 1. Input graph is connected.\n * 2. Dummy nodes are added for the tops and bottoms of subgraphs.\n * 3. The minlen attribute for nodes is adjusted to ensure nodes do not\n * get placed on the same rank as subgraph border nodes.\n \n The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n /\nfunction run(g) {\n var root = util.addDummyNode(g, \"root\", {}, \"_root\");\n var depths = treeDepths(g);\n var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array\n var nodeSep = 2 height + 1;\n\n g.graph().nestingRoot = root;\n\n // Multiply minlen by nodeSep to align nodes on non-border ranks.\n _.forEach(g.edges(), function(e) { g.edge(e).minlen = nodeSep; });\n\n // Calculate a weight that is sufficient to keep subgraphs vertically compact\n var weight = sumWeights(g) + 1;\n\n // Create border nodes and link them up\n _.forEach(g.children(), function(child) {\n dfs(g, root, nodeSep, weight, height, depths, child);\n });\n\n // Save the multiplier for node layers for later removal of empty border\n // layers.\n g.graph().nodeRankFactor = nodeSep;\n}\n\nfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n var children = g.children(v);\n if (!children.length) {\n if (v !== root) {\n g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n }\n return;\n }\n\n var top = util.addBorderNode(g, \"_bt\");\n var bottom = util.addBorderNode(g, \"_bb\");\n var label = g.node(v);\n\n g.setParent(top, v);\n label.borderTop = top;\n g.setParent(bottom, v);\n label.borderBottom = bottom;\n\n _.forEach(children, function(child) {\n dfs(g, root, nodeSep, weight, height, depths, child);\n\n var childNode = g.node(child);\n var childTop = childNode.borderTop ? childNode.borderTop : child;\n var childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n var thisWeight = childNode.borderTop ? weight : 2 weight;\n var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n g.setEdge(top, childTop, {\n weight: thisWeight,\n minlen: minlen,\n nestingEdge: true\n });\n\n g.setEdge(childBottom, bottom, {\n weight: thisWeight,\n minlen: minlen,\n nestingEdge: true\n });\n });\n\n if (!g.parent(v)) {\n g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n }\n}\n\nfunction treeDepths(g) {\n var depths = {};\n function dfs(v, depth) {\n var children = g.children(v);\n if (children && children.length) {\n _.forEach(children, function(child) {\n dfs(child, depth + 1);\n });\n }\n depths[v] = depth;\n }\n _.forEach(g.children(), function(v) { dfs(v, 1); });\n return depths;\n}\n\nfunction sumWeights(g) {\n return _.reduce(g.edges(), function(acc, e) {\n return acc + g.edge(e).weight;\n }, 0);\n}\n\nfunction cleanup(g) {\n var graphLabel = g.graph();\n g.removeNode(graphLabel.nestingRoot);\n delete graphLabel.nestingRoot;\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n if (edge.nestingEdge) {\n g.removeEdge(e);\n }\n });\n}\n","var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = addBorderSegments;\n\nfunction addBorderSegments(g) {\n function dfs(v) {\n var children = g.children(v);\n var node = g.node(v);\n if (children.length) {\n _.forEach(children, dfs);\n }\n\n if (_.has(node, \"minRank\")) {\n node.borderLeft = [];\n node.borderRight = [];\n for (var rank = node.minRank, maxRank = node.maxRank + 1;\n rank < maxRank;\n ++rank) {\n addBorderNode(g, \"borderLeft\", \"_bl\", v, node, rank);\n addBorderNode(g, \"borderRight\", \"_br\", v, node, rank);\n }\n }\n }\n\n _.forEach(g.children(), dfs);\n}\n\nfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n var label = { width: 0, height: 0, rank: rank, borderType: prop };\n var prev = sgNode[prop][rank - 1];\n var curr = util.addDummyNode(g, \"border\", label, prefix);\n sgNode[prop][rank] = curr;\n g.setParent(curr, sg);\n if (prev) {\n g.setEdge(prev, curr, { weight: 1 });\n }\n}\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = {\n adjust: adjust,\n undo: undo\n};\n\nfunction adjust(g) {\n var rankDir = g.graph().rankdir.toLowerCase();\n if (rankDir === \"lr\" \|\| rankDir === \"rl\") {\n swapWidthHeight(g);\n }\n}\n\nfunction undo(g) {\n var rankDir = g.graph().rankdir.toLowerCase();\n if (rankDir === \"bt\" \|\| rankDir === \"rl\") {\n reverseY(g);\n }\n\n if (rankDir === \"lr\" \|\| rankDir === \"rl\") {\n swapXY(g);\n swapWidthHeight(g);\n }\n}\n\nfunction swapWidthHeight(g) {\n _.forEach(g.nodes(), function(v) { swapWidthHeightOne(g.node(v)); });\n _.forEach(g.edges(), function(e) { swapWidthHeightOne(g.edge(e)); });\n}\n\nfunction swapWidthHeightOne(attrs) {\n var w = attrs.width;\n attrs.width = attrs.height;\n attrs.height = w;\n}\n\nfunction reverseY(g) {\n _.forEach(g.nodes(), function(v) { reverseYOne(g.node(v)); });\n\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n _.forEach(edge.points, reverseYOne);\n if (_.has(edge, \"y\")) {\n reverseYOne(edge);\n }\n });\n}\n\nfunction reverseYOne(attrs) {\n attrs.y = -attrs.y;\n}\n\nfunction swapXY(g) {\n _.forEach(g.nodes(), function(v) { swapXYOne(g.node(v)); });\n\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n _.forEach(edge.points, swapXYOne);\n if (_.has(edge, \"x\")) {\n swapXYOne(edge);\n }\n });\n}\n\nfunction swapXYOne(attrs) {\n var x = attrs.x;\n attrs.x = attrs.y;\n attrs.y = x;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = initOrder;\n\n/\n Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n \n This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n \n Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n /\nfunction initOrder(g) {\n var visited = {};\n var simpleNodes = _.filter(g.nodes(), function(v) {\n return !g.children(v).length;\n });\n var maxRank = _.max(_.map(simpleNodes, function(v) { return g.node(v).rank; }));\n var layers = _.map(_.range(maxRank + 1), function() { return []; });\n\n function dfs(v) {\n if (_.has(visited, v)) return;\n visited[v] = true;\n var node = g.node(v);\n layers[node.rank].push(v);\n _.forEach(g.successors(v), dfs);\n }\n\n var orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v).rank; });\n _.forEach(orderedVs, dfs);\n\n return layers;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = crossCount;\n\n/\n * A function that takes a layering (an array of layers, each with an array of\n * ordererd nodes) and a graph and returns a weighted crossing count.\n \n Pre-conditions:\n \n 1. Input graph must be simple (not a multigraph), directed, and include\n * only simple edges.\n * 2. Edges in the input graph must have assigned weights.\n \n Post-conditions:\n \n 1. The graph and layering matrix are left unchanged.\n \n This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n /\nfunction crossCount(g, layering) {\n var cc = 0;\n for (var i = 1; i < layering.length; ++i) {\n cc += twoLayerCrossCount(g, layering[i-1], layering[i]);\n }\n return cc;\n}\n\nfunction twoLayerCrossCount(g, northLayer, southLayer) {\n // Sort all of the edges between the north and south layers by their position\n // in the north layer and then the south. Map these edges to the position of\n // their head in the south layer.\n var southPos = _.zipObject(southLayer,\n _.map(southLayer, function (v, i) { return i; }));\n var southEntries = _.flatten(_.map(northLayer, function(v) {\n return _.sortBy(_.map(g.outEdges(v), function(e) {\n return { pos: southPos[e.w], weight: g.edge(e).weight };\n }), \"pos\");\n }), true);\n\n // Build the accumulator tree\n var firstIndex = 1;\n while (firstIndex < southLayer.length) firstIndex <<= 1;\n var treeSize = 2 firstIndex - 1;\n firstIndex -= 1;\n var tree = _.map(new Array(treeSize), function() { return 0; });\n\n // Calculate the weighted crossings\n var cc = 0;\n _.forEach(southEntries.forEach(function(entry) {\n var index = entry.pos + firstIndex;\n tree[index] += entry.weight;\n var weightSum = 0;\n while (index > 0) {\n if (index % 2) {\n weightSum += tree[index + 1];\n }\n index = (index - 1) >> 1;\n tree[index] += entry.weight;\n }\n cc += entry.weight * weightSum;\n }));\n\n return cc;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = barycenter;\n\nfunction barycenter(g, movable) {\n return _.map(movable, function(v) {\n var inV = g.inEdges(v);\n if (!inV.length) {\n return { v: v };\n } else {\n var result = _.reduce(inV, function(acc, e) {\n var edge = g.edge(e),\n nodeU = g.node(e.v);\n return {\n sum: acc.sum + (edge.weight * nodeU.order),\n weight: acc.weight + edge.weight\n };\n }, { sum: 0, weight: 0 });\n\n return {\n v: v,\n barycenter: result.sum / result.weight,\n weight: result.weight\n };\n }\n });\n}\n\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = resolveConflicts;\n\n/\n Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n \n This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n \n Pre-conditions:\n \n 1. Each entry has the form {v, barycenter, weight}, or if the node has\n * no barycenter, then {v}.\n \n Returns:\n \n A new list of entries of the form {vs, i, barycenter, weight}. The list\n * `vs` may either be a singleton or it may be an aggregation of nodes\n * ordered such that they do not violate constraints from the constraint\n * graph. The property `i` is the lowest original index of any of the\n * elements in `vs`.\n /\nfunction resolveConflicts(entries, cg) {\n var mappedEntries = {};\n _.forEach(entries, function(entry, i) {\n var tmp = mappedEntries[entry.v] = {\n indegree: 0,\n \"in\": [],\n out: [],\n vs: [entry.v],\n i: i\n };\n if (!_.isUndefined(entry.barycenter)) {\n tmp.barycenter = entry.barycenter;\n tmp.weight = entry.weight;\n }\n });\n\n _.forEach(cg.edges(), function(e) {\n var entryV = mappedEntries[e.v];\n var entryW = mappedEntries[e.w];\n if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {\n entryW.indegree++;\n entryV.out.push(mappedEntries[e.w]);\n }\n });\n\n var sourceSet = _.filter(mappedEntries, function(entry) {\n return !entry.indegree;\n });\n\n return doResolveConflicts(sourceSet);\n}\n\nfunction doResolveConflicts(sourceSet) {\n var entries = [];\n\n function handleIn(vEntry) {\n return function(uEntry) {\n if (uEntry.merged) {\n return;\n }\n if (_.isUndefined(uEntry.barycenter) \|\|\n _.isUndefined(vEntry.barycenter) \|\|\n uEntry.barycenter >= vEntry.barycenter) {\n mergeEntries(vEntry, uEntry);\n }\n };\n }\n\n function handleOut(vEntry) {\n return function(wEntry) {\n wEntry[\"in\"].push(vEntry);\n if (--wEntry.indegree === 0) {\n sourceSet.push(wEntry);\n }\n };\n }\n\n while (sourceSet.length) {\n var entry = sourceSet.pop();\n entries.push(entry);\n _.forEach(entry[\"in\"].reverse(), handleIn(entry));\n _.forEach(entry.out, handleOut(entry));\n }\n\n return _.map(_.filter(entries, function(entry) { return !entry.merged; }),\n function(entry) {\n return _.pick(entry, [\"vs\", \"i\", \"barycenter\", \"weight\"]);\n });\n\n}\n\nfunction mergeEntries(target, source) {\n var sum = 0;\n var weight = 0;\n\n if (target.weight) {\n sum += target.barycenter target.weight;\n weight += target.weight;\n }\n\n if (source.weight) {\n sum += source.barycenter * source.weight;\n weight += source.weight;\n }\n\n target.vs = source.vs.concat(target.vs);\n target.barycenter = sum / weight;\n target.weight = weight;\n target.i = Math.min(source.i, target.i);\n source.merged = true;\n}\n","var _ = require(\"../lodash\");\nvar util = require(\"../util\");\n\nmodule.exports = sort;\n\nfunction sort(entries, biasRight) {\n var parts = util.partition(entries, function(entry) {\n return _.has(entry, \"barycenter\");\n });\n var sortable = parts.lhs,\n unsortable = _.sortBy(parts.rhs, function(entry) { return -entry.i; }),\n vs = [],\n sum = 0,\n weight = 0,\n vsIndex = 0;\n\n sortable.sort(compareWithBias(!!biasRight));\n\n vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n _.forEach(sortable, function (entry) {\n vsIndex += entry.vs.length;\n vs.push(entry.vs);\n sum += entry.barycenter * entry.weight;\n weight += entry.weight;\n vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n });\n\n var result = { vs: _.flatten(vs, true) };\n if (weight) {\n result.barycenter = sum / weight;\n result.weight = weight;\n }\n return result;\n}\n\nfunction consumeUnsortable(vs, unsortable, index) {\n var last;\n while (unsortable.length && (last = _.last(unsortable)).i <= index) {\n unsortable.pop();\n vs.push(last.vs);\n index++;\n }\n return index;\n}\n\nfunction compareWithBias(bias) {\n return function(entryV, entryW) {\n if (entryV.barycenter < entryW.barycenter) {\n return -1;\n } else if (entryV.barycenter > entryW.barycenter) {\n return 1;\n }\n\n return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n };\n}\n","var _ = require(\"../lodash\");\nvar barycenter = require(\"./barycenter\");\nvar resolveConflicts = require(\"./resolve-conflicts\");\nvar sort = require(\"./sort\");\n\nmodule.exports = sortSubgraph;\n\nfunction sortSubgraph(g, v, cg, biasRight) {\n var movable = g.children(v);\n var node = g.node(v);\n var bl = node ? node.borderLeft : undefined;\n var br = node ? node.borderRight: undefined;\n var subgraphs = {};\n\n if (bl) {\n movable = _.filter(movable, function(w) {\n return w !== bl && w !== br;\n });\n }\n\n var barycenters = barycenter(g, movable);\n _.forEach(barycenters, function(entry) {\n if (g.children(entry.v).length) {\n var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n subgraphs[entry.v] = subgraphResult;\n if (_.has(subgraphResult, \"barycenter\")) {\n mergeBarycenters(entry, subgraphResult);\n }\n }\n });\n\n var entries = resolveConflicts(barycenters, cg);\n expandSubgraphs(entries, subgraphs);\n\n var result = sort(entries, biasRight);\n\n if (bl) {\n result.vs = _.flatten([bl, result.vs, br], true);\n if (g.predecessors(bl).length) {\n var blPred = g.node(g.predecessors(bl)[0]),\n brPred = g.node(g.predecessors(br)[0]);\n if (!_.has(result, \"barycenter\")) {\n result.barycenter = 0;\n result.weight = 0;\n }\n result.barycenter = (result.barycenter * result.weight +\n blPred.order + brPred.order) / (result.weight + 2);\n result.weight += 2;\n }\n }\n\n return result;\n}\n\nfunction expandSubgraphs(entries, subgraphs) {\n _.forEach(entries, function(entry) {\n entry.vs = _.flatten(entry.vs.map(function(v) {\n if (subgraphs[v]) {\n return subgraphs[v].vs;\n }\n return v;\n }), true);\n });\n}\n\nfunction mergeBarycenters(target, other) {\n if (!_.isUndefined(target.barycenter)) {\n target.barycenter = (target.barycenter * target.weight +\n other.barycenter * other.weight) /\n (target.weight + other.weight);\n target.weight += other.weight;\n } else {\n target.barycenter = other.barycenter;\n target.weight = other.weight;\n }\n}\n","var _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\n\nmodule.exports = buildLayerGraph;\n\n/\n Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n \n Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n \n Pre-conditions:\n \n 1. Input graph is a DAG\n * 2. Base nodes in the input graph have a rank attribute\n * 3. Subgraph nodes in the input graph has minRank and maxRank attributes\n * 4. Edges have an assigned weight\n \n Post-conditions:\n \n 1. Output graph has all nodes in the movable rank with preserved\n * hierarchy.\n * 2. Root nodes in the movable layer are made children of the node\n * indicated by the root attribute of the graph.\n * 3. Non-movable nodes incident on movable nodes, selected by the\n * relationship parameter, are included in the graph (without hierarchy).\n * 4. Edges incident on movable nodes, selected by the relationship\n * parameter, are added to the output graph.\n * 5. The weights for copied edges are aggregated as need, since the output\n * graph is not a multi-graph.\n /\nfunction buildLayerGraph(g, rank, relationship) {\n var root = createRootNode(g),\n result = new Graph({ compound: true }).setGraph({ root: root })\n .setDefaultNodeLabel(function(v) { return g.node(v); });\n\n _.forEach(g.nodes(), function(v) {\n var node = g.node(v),\n parent = g.parent(v);\n\n if (node.rank === rank \|\| node.minRank <= rank && rank <= node.maxRank) {\n result.setNode(v);\n result.setParent(v, parent \|\| root);\n\n // This assumes we have only short edges!\n _.forEach(g[relationship](v), function(e) {\n var u = e.v === v ? e.w : e.v,\n edge = result.edge(u, v),\n weight = !_.isUndefined(edge) ? edge.weight : 0;\n result.setEdge(u, v, { weight: g.edge(e).weight + weight });\n });\n\n if (_.has(node, \"minRank\")) {\n result.setNode(v, {\n borderLeft: node.borderLeft[rank],\n borderRight: node.borderRight[rank]\n });\n }\n }\n });\n\n return result;\n}\n\nfunction createRootNode(g) {\n var v;\n while (g.hasNode((v = _.uniqueId(\"_root\"))));\n return v;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = addSubgraphConstraints;\n\nfunction addSubgraphConstraints(g, cg, vs) {\n var prev = {},\n rootPrev;\n\n _.forEach(vs, function(v) {\n var child = g.parent(v),\n parent,\n prevChild;\n while (child) {\n parent = g.parent(child);\n if (parent) {\n prevChild = prev[parent];\n prev[parent] = child;\n } else {\n prevChild = rootPrev;\n rootPrev = child;\n }\n if (prevChild && prevChild !== child) {\n cg.setEdge(prevChild, child);\n return;\n }\n child = parent;\n }\n });\n\n /\n function dfs(v) {\n var children = v ? g.children(v) : g.children();\n if (children.length) {\n var min = Number.POSITIVE_INFINITY,\n subgraphs = [];\n _.each(children, function(child) {\n var childMin = dfs(child);\n if (g.children(child).length) {\n subgraphs.push({ v: child, order: childMin });\n }\n min = Math.min(min, childMin);\n });\n _.reduce(_.sortBy(subgraphs, \"order\"), function(prev, curr) {\n cg.setEdge(prev.v, curr.v);\n return curr;\n });\n return min;\n }\n return g.node(v).order;\n }\n dfs(undefined);\n /\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar initOrder = require(\"./init-order\");\nvar crossCount = require(\"./cross-count\");\nvar sortSubgraph = require(\"./sort-subgraph\");\nvar buildLayerGraph = require(\"./build-layer-graph\");\nvar addSubgraphConstraints = require(\"./add-subgraph-constraints\");\nvar Graph = require(\"../graphlib\").Graph;\nvar util = require(\"../util\");\n\nmodule.exports = order;\n\n/\n * Applies heuristics to minimize edge crossings in the graph and sets the best\n * order solution as an order attribute on each node.\n \n Pre-conditions:\n \n 1. Graph must be DAG\n * 2. Graph nodes must be objects with a \"rank\" attribute\n * 3. Graph edges must have the \"weight\" attribute\n \n Post-conditions:\n \n 1. Graph nodes will have an \"order\" attribute based on the results of the\n * algorithm.\n /\nfunction order(g) {\n var maxRank = util.maxRank(g),\n downLayerGraphs = buildLayerGraphs(g, _.range(1, maxRank + 1), \"inEdges\"),\n upLayerGraphs = buildLayerGraphs(g, _.range(maxRank - 1, -1, -1), \"outEdges\");\n\n var layering = initOrder(g);\n assignOrder(g, layering);\n\n var bestCC = Number.POSITIVE_INFINITY,\n best;\n\n for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);\n\n layering = util.buildLayerMatrix(g);\n var cc = crossCount(g, layering);\n if (cc < bestCC) {\n lastBest = 0;\n best = _.cloneDeep(layering);\n bestCC = cc;\n }\n }\n\n assignOrder(g, best);\n}\n\nfunction buildLayerGraphs(g, ranks, relationship) {\n return _.map(ranks, function(rank) {\n return buildLayerGraph(g, rank, relationship);\n });\n}\n\nfunction sweepLayerGraphs(layerGraphs, biasRight) {\n var cg = new Graph();\n _.forEach(layerGraphs, function(lg) {\n var root = lg.graph().root;\n var sorted = sortSubgraph(lg, root, cg, biasRight);\n _.forEach(sorted.vs, function(v, i) {\n lg.node(v).order = i;\n });\n addSubgraphConstraints(lg, cg, sorted.vs);\n });\n}\n\nfunction assignOrder(g, layering) {\n _.forEach(layering, function(layer) {\n _.forEach(layer, function(v, i) {\n g.node(v).order = i;\n });\n });\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\nvar util = require(\"../util\");\n\n/\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n /\n\nmodule.exports = {\n positionX: positionX,\n findType1Conflicts: findType1Conflicts,\n findType2Conflicts: findType2Conflicts,\n addConflict: addConflict,\n hasConflict: hasConflict,\n verticalAlignment: verticalAlignment,\n horizontalCompaction: horizontalCompaction,\n alignCoordinates: alignCoordinates,\n findSmallestWidthAlignment: findSmallestWidthAlignment,\n balance: balance\n};\n\n/\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n \n This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n \n This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n /\nfunction findType1Conflicts(g, layering) {\n var conflicts = {};\n\n function visitLayer(prevLayer, layer) {\n var\n // last visited node in the previous layer that is incident on an inner\n // segment.\n k0 = 0,\n // Tracks the last node in this layer scanned for crossings with a type-1\n // segment.\n scanPos = 0,\n prevLayerLength = prevLayer.length,\n lastNode = _.last(layer);\n\n _.forEach(layer, function(v, i) {\n var w = findOtherInnerSegmentNode(g, v),\n k1 = w ? g.node(w).order : prevLayerLength;\n\n if (w \|\| v === lastNode) {\n _.forEach(layer.slice(scanPos, i +1), function(scanNode) {\n _.forEach(g.predecessors(scanNode), function(u) {\n var uLabel = g.node(u),\n uPos = uLabel.order;\n if ((uPos < k0 \|\| k1 < uPos) &&\n !(uLabel.dummy && g.node(scanNode).dummy)) {\n addConflict(conflicts, u, scanNode);\n }\n });\n });\n scanPos = i + 1;\n k0 = k1;\n }\n });\n\n return layer;\n }\n\n _.reduce(layering, visitLayer);\n return conflicts;\n}\n\nfunction findType2Conflicts(g, layering) {\n var conflicts = {};\n\n function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n var v;\n _.forEach(_.range(southPos, southEnd), function(i) {\n v = south[i];\n if (g.node(v).dummy) {\n _.forEach(g.predecessors(v), function(u) {\n var uNode = g.node(u);\n if (uNode.dummy &&\n (uNode.order < prevNorthBorder \|\| uNode.order > nextNorthBorder)) {\n addConflict(conflicts, u, v);\n }\n });\n }\n });\n }\n\n\n function visitLayer(north, south) {\n var prevNorthPos = -1,\n nextNorthPos,\n southPos = 0;\n\n _.forEach(south, function(v, southLookahead) {\n if (g.node(v).dummy === \"border\") {\n var predecessors = g.predecessors(v);\n if (predecessors.length) {\n nextNorthPos = g.node(predecessors[0]).order;\n scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\n southPos = southLookahead;\n prevNorthPos = nextNorthPos;\n }\n }\n scan(south, southPos, south.length, nextNorthPos, north.length);\n });\n\n return south;\n }\n\n _.reduce(layering, visitLayer);\n return conflicts;\n}\n\nfunction findOtherInnerSegmentNode(g, v) {\n if (g.node(v).dummy) {\n return _.find(g.predecessors(v), function(u) {\n return g.node(u).dummy;\n });\n }\n}\n\nfunction addConflict(conflicts, v, w) {\n if (v > w) {\n var tmp = v;\n v = w;\n w = tmp;\n }\n\n var conflictsV = conflicts[v];\n if (!conflictsV) {\n conflicts[v] = conflictsV = {};\n }\n conflictsV[w] = true;\n}\n\nfunction hasConflict(conflicts, v, w) {\n if (v > w) {\n var tmp = v;\n v = w;\n w = tmp;\n }\n return _.has(conflicts[v], w);\n}\n\n/\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n /\nfunction verticalAlignment(g, layering, conflicts, neighborFn) {\n var root = {},\n align = {},\n pos = {};\n\n // We cache the position here based on the layering because the graph and\n // layering may be out of sync. The layering matrix is manipulated to\n // generate different extreme alignments.\n _.forEach(layering, function(layer) {\n _.forEach(layer, function(v, order) {\n root[v] = v;\n align[v] = v;\n pos[v] = order;\n });\n });\n\n _.forEach(layering, function(layer) {\n var prevIdx = -1;\n _.forEach(layer, function(v) {\n var ws = neighborFn(v);\n if (ws.length) {\n ws = _.sortBy(ws, function(w) { return pos[w]; });\n var mp = (ws.length - 1) / 2;\n for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n var w = ws[i];\n if (align[v] === v &&\n prevIdx < pos[w] &&\n !hasConflict(conflicts, v, w)) {\n align[w] = v;\n align[v] = root[v] = root[w];\n prevIdx = pos[w];\n }\n }\n }\n });\n });\n\n return { root: root, align: align };\n}\n\nfunction horizontalCompaction(g, layering, root, align, reverseSep) {\n // This portion of the algorithm differs from BK due to a number of problems.\n // Instead of their algorithm we construct a new block graph and do two\n // sweeps. The first sweep places blocks with the smallest possible\n // coordinates. The second sweep removes unused space by moving blocks to the\n // greatest coordinates without violating separation.\n var xs = {},\n blockG = buildBlockGraph(g, layering, root, reverseSep),\n borderType = reverseSep ? \"borderLeft\" : \"borderRight\";\n\n function iterate(setXsFunc, nextNodesFunc) {\n var stack = blockG.nodes();\n var elem = stack.pop();\n var visited = {};\n while (elem) {\n if (visited[elem]) {\n setXsFunc(elem);\n } else {\n visited[elem] = true;\n stack.push(elem);\n stack = stack.concat(nextNodesFunc(elem));\n }\n\n elem = stack.pop();\n }\n }\n\n // First pass, assign smallest coordinates\n function pass1(elem) {\n xs[elem] = blockG.inEdges(elem).reduce(function(acc, e) {\n return Math.max(acc, xs[e.v] + blockG.edge(e));\n }, 0);\n }\n\n // Second pass, assign greatest coordinates\n function pass2(elem) {\n var min = blockG.outEdges(elem).reduce(function(acc, e) {\n return Math.min(acc, xs[e.w] - blockG.edge(e));\n }, Number.POSITIVE_INFINITY);\n\n var node = g.node(elem);\n if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {\n xs[elem] = Math.max(xs[elem], min);\n }\n }\n\n iterate(pass1, blockG.predecessors.bind(blockG));\n iterate(pass2, blockG.successors.bind(blockG));\n\n // Assign x coordinates to all nodes\n _.forEach(align, function(v) {\n xs[v] = xs[root[v]];\n });\n\n return xs;\n}\n\n\nfunction buildBlockGraph(g, layering, root, reverseSep) {\n var blockGraph = new Graph(),\n graphLabel = g.graph(),\n sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n\n _.forEach(layering, function(layer) {\n var u;\n _.forEach(layer, function(v) {\n var vRoot = root[v];\n blockGraph.setNode(vRoot);\n if (u) {\n var uRoot = root[u],\n prevMax = blockGraph.edge(uRoot, vRoot);\n blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax \|\| 0));\n }\n u = v;\n });\n });\n\n return blockGraph;\n}\n\n/\n * Returns the alignment that has the smallest width of the given alignments.\n /\nfunction findSmallestWidthAlignment(g, xss) {\n return _.minBy(_.values(xss), function (xs) {\n var max = Number.NEGATIVE_INFINITY;\n var min = Number.POSITIVE_INFINITY;\n\n _.forIn(xs, function (x, v) {\n var halfWidth = width(g, v) / 2;\n\n max = Math.max(x + halfWidth, max);\n min = Math.min(x - halfWidth, min);\n });\n\n return max - min;\n });\n}\n\n/\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n /\nfunction alignCoordinates(xss, alignTo) {\n var alignToVals = _.values(alignTo),\n alignToMin = _.min(alignToVals),\n alignToMax = _.max(alignToVals);\n\n _.forEach([\"u\", \"d\"], function(vert) {\n _.forEach([\"l\", \"r\"], function(horiz) {\n var alignment = vert + horiz,\n xs = xss[alignment],\n delta;\n if (xs === alignTo) return;\n\n var xsVals = _.values(xs);\n delta = horiz === \"l\" ? alignToMin - _.min(xsVals) : alignToMax - _.max(xsVals);\n\n if (delta) {\n xss[alignment] = _.mapValues(xs, function(x) { return x + delta; });\n }\n });\n });\n}\n\nfunction balance(xss, align) {\n return _.mapValues(xss.ul, function(ignore, v) {\n if (align) {\n return xss[align.toLowerCase()][v];\n } else {\n var xs = _.sortBy(_.map(xss, v));\n return (xs[1] + xs[2]) / 2;\n }\n });\n}\n\nfunction positionX(g) {\n var layering = util.buildLayerMatrix(g);\n var conflicts = _.merge(\n findType1Conflicts(g, layering),\n findType2Conflicts(g, layering));\n\n var xss = {};\n var adjustedLayering;\n _.forEach([\"u\", \"d\"], function(vert) {\n adjustedLayering = vert === \"u\" ? layering : _.values(layering).reverse();\n _.forEach([\"l\", \"r\"], function(horiz) {\n if (horiz === \"r\") {\n adjustedLayering = _.map(adjustedLayering, function(inner) {\n return _.values(inner).reverse();\n });\n }\n\n var neighborFn = (vert === \"u\" ? g.predecessors : g.successors).bind(g);\n var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);\n var xs = horizontalCompaction(g, adjustedLayering,\n align.root, align.align, horiz === \"r\");\n if (horiz === \"r\") {\n xs = _.mapValues(xs, function(x) { return -x; });\n }\n xss[vert + horiz] = xs;\n });\n });\n\n var smallestWidth = findSmallestWidthAlignment(g, xss);\n alignCoordinates(xss, smallestWidth);\n return balance(xss, g.graph().align);\n}\n\nfunction sep(nodeSep, edgeSep, reverseSep) {\n return function(g, v, w) {\n var vLabel = g.node(v);\n var wLabel = g.node(w);\n var sum = 0;\n var delta;\n\n sum += vLabel.width / 2;\n if (_.has(vLabel, \"labelpos\")) {\n switch (vLabel.labelpos.toLowerCase()) {\n case \"l\": delta = -vLabel.width / 2; break;\n case \"r\": delta = vLabel.width / 2; break;\n }\n }\n if (delta) {\n sum += reverseSep ? delta : -delta;\n }\n delta = 0;\n\n sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n\n sum += wLabel.width / 2;\n if (_.has(wLabel, \"labelpos\")) {\n switch (wLabel.labelpos.toLowerCase()) {\n case \"l\": delta = wLabel.width / 2; break;\n case \"r\": delta = -wLabel.width / 2; break;\n }\n }\n if (delta) {\n sum += reverseSep ? delta : -delta;\n }\n delta = 0;\n\n return sum;\n };\n}\n\nfunction width(g, v) {\n return g.node(v).width;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar util = require(\"../util\");\nvar positionX = require(\"./bk\").positionX;\n\nmodule.exports = position;\n\nfunction position(g) {\n g = util.asNonCompoundGraph(g);\n\n positionY(g);\n _.forEach(positionX(g), function(x, v) {\n g.node(v).x = x;\n });\n}\n\nfunction positionY(g) {\n var layering = util.buildLayerMatrix(g);\n var rankSep = g.graph().ranksep;\n var prevY = 0;\n _.forEach(layering, function(layer) {\n var maxHeight = _.max(_.map(layer, function(v) { return g.node(v).height; }));\n _.forEach(layer, function(v) {\n g.node(v).y = prevY + maxHeight / 2;\n });\n prevY += maxHeight + rankSep;\n });\n}\n\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar acyclic = require(\"./acyclic\");\nvar normalize = require(\"./normalize\");\nvar rank = require(\"./rank\");\nvar normalizeRanks = require(\"./util\").normalizeRanks;\nvar parentDummyChains = require(\"./parent-dummy-chains\");\nvar removeEmptyRanks = require(\"./util\").removeEmptyRanks;\nvar nestingGraph = require(\"./nesting-graph\");\nvar addBorderSegments = require(\"./add-border-segments\");\nvar coordinateSystem = require(\"./coordinate-system\");\nvar order = require(\"./order\");\nvar position = require(\"./position\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = layout;\n\nfunction layout(g, opts) {\n var time = opts && opts.debugTiming ? util.time : util.notime;\n time(\"layout\", function() {\n var layoutGraph = \n time(\" buildLayoutGraph\", function() { return buildLayoutGraph(g); });\n time(\" runLayout\", function() { runLayout(layoutGraph, time); });\n time(\" updateInputGraph\", function() { updateInputGraph(g, layoutGraph); });\n });\n}\n\nfunction runLayout(g, time) {\n time(\" makeSpaceForEdgeLabels\", function() { makeSpaceForEdgeLabels(g); });\n time(\" removeSelfEdges\", function() { removeSelfEdges(g); });\n time(\" acyclic\", function() { acyclic.run(g); });\n time(\" nestingGraph.run\", function() { nestingGraph.run(g); });\n time(\" rank\", function() { rank(util.asNonCompoundGraph(g)); });\n time(\" injectEdgeLabelProxies\", function() { injectEdgeLabelProxies(g); });\n time(\" removeEmptyRanks\", function() { removeEmptyRanks(g); });\n time(\" nestingGraph.cleanup\", function() { nestingGraph.cleanup(g); });\n time(\" normalizeRanks\", function() { normalizeRanks(g); });\n time(\" assignRankMinMax\", function() { assignRankMinMax(g); });\n time(\" removeEdgeLabelProxies\", function() { removeEdgeLabelProxies(g); });\n time(\" normalize.run\", function() { normalize.run(g); });\n time(\" parentDummyChains\", function() { parentDummyChains(g); });\n time(\" addBorderSegments\", function() { addBorderSegments(g); });\n time(\" order\", function() { order(g); });\n time(\" insertSelfEdges\", function() { insertSelfEdges(g); });\n time(\" adjustCoordinateSystem\", function() { coordinateSystem.adjust(g); });\n time(\" position\", function() { position(g); });\n time(\" positionSelfEdges\", function() { positionSelfEdges(g); });\n time(\" removeBorderNodes\", function() { removeBorderNodes(g); });\n time(\" normalize.undo\", function() { normalize.undo(g); });\n time(\" fixupEdgeLabelCoords\", function() { fixupEdgeLabelCoords(g); });\n time(\" undoCoordinateSystem\", function() { coordinateSystem.undo(g); });\n time(\" translateGraph\", function() { translateGraph(g); });\n time(\" assignNodeIntersects\", function() { assignNodeIntersects(g); });\n time(\" reversePoints\", function() { reversePointsForReversedEdges(g); });\n time(\" acyclic.undo\", function() { acyclic.undo(g); });\n}\n\n/\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n /\nfunction updateInputGraph(inputGraph, layoutGraph) {\n _.forEach(inputGraph.nodes(), function(v) {\n var inputLabel = inputGraph.node(v);\n var layoutLabel = layoutGraph.node(v);\n\n if (inputLabel) {\n inputLabel.x = layoutLabel.x;\n inputLabel.y = layoutLabel.y;\n\n if (layoutGraph.children(v).length) {\n inputLabel.width = layoutLabel.width;\n inputLabel.height = layoutLabel.height;\n }\n }\n });\n\n _.forEach(inputGraph.edges(), function(e) {\n var inputLabel = inputGraph.edge(e);\n var layoutLabel = layoutGraph.edge(e);\n\n inputLabel.points = layoutLabel.points;\n if (_.has(layoutLabel, \"x\")) {\n inputLabel.x = layoutLabel.x;\n inputLabel.y = layoutLabel.y;\n }\n });\n\n inputGraph.graph().width = layoutGraph.graph().width;\n inputGraph.graph().height = layoutGraph.graph().height;\n}\n\nvar graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\nvar graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\nvar graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\nvar nodeNumAttrs = [\"width\", \"height\"];\nvar nodeDefaults = { width: 0, height: 0 };\nvar edgeNumAttrs = [\"minlen\", \"weight\", \"width\", \"height\", \"labeloffset\"];\nvar edgeDefaults = {\n minlen: 1, weight: 1, width: 0, height: 0,\n labeloffset: 10, labelpos: \"r\"\n};\nvar edgeAttrs = [\"labelpos\"];\n\n/\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n /\nfunction buildLayoutGraph(inputGraph) {\n var g = new Graph({ multigraph: true, compound: true });\n var graph = canonicalize(inputGraph.graph());\n\n g.setGraph(_.merge({},\n graphDefaults,\n selectNumberAttrs(graph, graphNumAttrs),\n _.pick(graph, graphAttrs)));\n\n _.forEach(inputGraph.nodes(), function(v) {\n var node = canonicalize(inputGraph.node(v));\n g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));\n g.setParent(v, inputGraph.parent(v));\n });\n\n _.forEach(inputGraph.edges(), function(e) {\n var edge = canonicalize(inputGraph.edge(e));\n g.setEdge(e, _.merge({},\n edgeDefaults,\n selectNumberAttrs(edge, edgeNumAttrs),\n _.pick(edge, edgeAttrs)));\n });\n\n return g;\n}\n\n/\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n \n We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n /\nfunction makeSpaceForEdgeLabels(g) {\n var graph = g.graph();\n graph.ranksep /= 2;\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n edge.minlen = 2;\n if (edge.labelpos.toLowerCase() !== \"c\") {\n if (graph.rankdir === \"TB\" \|\| graph.rankdir === \"BT\") {\n edge.width += edge.labeloffset;\n } else {\n edge.height += edge.labeloffset;\n }\n }\n });\n}\n\n/\n Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n /\nfunction injectEdgeLabelProxies(g) {\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n if (edge.width && edge.height) {\n var v = g.node(e.v);\n var w = g.node(e.w);\n var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };\n util.addDummyNode(g, \"edge-proxy\", label, \"_ep\");\n }\n });\n}\n\nfunction assignRankMinMax(g) {\n var maxRank = 0;\n _.forEach(g.nodes(), function(v) {\n var node = g.node(v);\n if (node.borderTop) {\n node.minRank = g.node(node.borderTop).rank;\n node.maxRank = g.node(node.borderBottom).rank;\n maxRank = _.max(maxRank, node.maxRank);\n }\n });\n g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g) {\n _.forEach(g.nodes(), function(v) {\n var node = g.node(v);\n if (node.dummy === \"edge-proxy\") {\n g.edge(node.e).labelRank = node.rank;\n g.removeNode(v);\n }\n });\n}\n\nfunction translateGraph(g) {\n var minX = Number.POSITIVE_INFINITY;\n var maxX = 0;\n var minY = Number.POSITIVE_INFINITY;\n var maxY = 0;\n var graphLabel = g.graph();\n var marginX = graphLabel.marginx \|\| 0;\n var marginY = graphLabel.marginy \|\| 0;\n\n function getExtremes(attrs) {\n var x = attrs.x;\n var y = attrs.y;\n var w = attrs.width;\n var h = attrs.height;\n minX = Math.min(minX, x - w / 2);\n maxX = Math.max(maxX, x + w / 2);\n minY = Math.min(minY, y - h / 2);\n maxY = Math.max(maxY, y + h / 2);\n }\n\n _.forEach(g.nodes(), function(v) { getExtremes(g.node(v)); });\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n if (_.has(edge, \"x\")) {\n getExtremes(edge);\n }\n });\n\n minX -= marginX;\n minY -= marginY;\n\n _.forEach(g.nodes(), function(v) {\n var node = g.node(v);\n node.x -= minX;\n node.y -= minY;\n });\n\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n _.forEach(edge.points, function(p) {\n p.x -= minX;\n p.y -= minY;\n });\n if (_.has(edge, \"x\")) { edge.x -= minX; }\n if (_.has(edge, \"y\")) { edge.y -= minY; }\n });\n\n graphLabel.width = maxX - minX + marginX;\n graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g) {\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n var nodeV = g.node(e.v);\n var nodeW = g.node(e.w);\n var p1, p2;\n if (!edge.points) {\n edge.points = [];\n p1 = nodeW;\n p2 = nodeV;\n } else {\n p1 = edge.points[0];\n p2 = edge.points[edge.points.length - 1];\n }\n edge.points.unshift(util.intersectRect(nodeV, p1));\n edge.points.push(util.intersectRect(nodeW, p2));\n });\n}\n\nfunction fixupEdgeLabelCoords(g) {\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n if (_.has(edge, \"x\")) {\n if (edge.labelpos === \"l\" \|\| edge.labelpos === \"r\") {\n edge.width -= edge.labeloffset;\n }\n switch (edge.labelpos) {\n case \"l\": edge.x -= edge.width / 2 + edge.labeloffset; break;\n case \"r\": edge.x += edge.width / 2 + edge.labeloffset; break;\n }\n }\n });\n}\n\nfunction reversePointsForReversedEdges(g) {\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n if (edge.reversed) {\n edge.points.reverse();\n }\n });\n}\n\nfunction removeBorderNodes(g) {\n _.forEach(g.nodes(), function(v) {\n if (g.children(v).length) {\n var node = g.node(v);\n var t = g.node(node.borderTop);\n var b = g.node(node.borderBottom);\n var l = g.node(_.last(node.borderLeft));\n var r = g.node(_.last(node.borderRight));\n\n node.width = Math.abs(r.x - l.x);\n node.height = Math.abs(b.y - t.y);\n node.x = l.x + node.width / 2;\n node.y = t.y + node.height / 2;\n }\n });\n\n _.forEach(g.nodes(), function(v) {\n if (g.node(v).dummy === \"border\") {\n g.removeNode(v);\n }\n });\n}\n\nfunction removeSelfEdges(g) {\n _.forEach(g.edges(), function(e) {\n if (e.v === e.w) {\n var node = g.node(e.v);\n if (!node.selfEdges) {\n node.selfEdges = [];\n }\n node.selfEdges.push({ e: e, label: g.edge(e) });\n g.removeEdge(e);\n }\n });\n}\n\nfunction insertSelfEdges(g) {\n var layers = util.buildLayerMatrix(g);\n _.forEach(layers, function(layer) {\n var orderShift = 0;\n _.forEach(layer, function(v, i) {\n var node = g.node(v);\n node.order = i + orderShift;\n _.forEach(node.selfEdges, function(selfEdge) {\n util.addDummyNode(g, \"selfedge\", {\n width: selfEdge.label.width,\n height: selfEdge.label.height,\n rank: node.rank,\n order: i + (++orderShift),\n e: selfEdge.e,\n label: selfEdge.label\n }, \"_se\");\n });\n delete node.selfEdges;\n });\n });\n}\n\nfunction positionSelfEdges(g) {\n _.forEach(g.nodes(), function(v) {\n var node = g.node(v);\n if (node.dummy === \"selfedge\") {\n var selfNode = g.node(node.e.v);\n var x = selfNode.x + selfNode.width / 2;\n var y = selfNode.y;\n var dx = node.x - x;\n var dy = selfNode.height / 2;\n g.setEdge(node.e, node.label);\n g.removeNode(v);\n node.label.points = [\n { x: x + 2 dx / 3, y: y - dy },\n { x: x + 5 * dx / 6, y: y - dy },\n { x: x + dx , y: y },\n { x: x + 5 * dx / 6, y: y + dy },\n { x: x + 2 * dx / 3, y: y + dy }\n ];\n node.label.x = node.x;\n node.label.y = node.y;\n }\n });\n}\n\nfunction selectNumberAttrs(obj, attrs) {\n return _.mapValues(_.pick(obj, attrs), Number);\n}\n\nfunction canonicalize(attrs) {\n var newAttrs = {};\n _.forEach(attrs, function(v, k) {\n newAttrs[k.toLowerCase()] = v;\n });\n return newAttrs;\n}\n","var _ = require(\"./lodash\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n debugOrdering: debugOrdering\n};\n\n/* istanbul ignore next /\nfunction debugOrdering(g) {\n var layerMatrix = util.buildLayerMatrix(g);\n\n var h = new Graph({ compound: true, multigraph: true }).setGraph({});\n\n _.forEach(g.nodes(), function(v) {\n h.setNode(v, { label: v });\n h.setParent(v, \"layer\" + g.node(v).rank);\n });\n\n _.forEach(g.edges(), function(e) {\n h.setEdge(e.v, e.w, {}, e.name);\n });\n\n _.forEach(layerMatrix, function(layer, i) {\n var layerV = \"layer\" + i;\n h.setNode(layerV, { rank: \"same\" });\n _.reduce(layer, function(u, v) {\n h.setEdge(u, v, { style: \"invis\" });\n return v;\n });\n });\n\n return h;\n}\n","module.exports = \"0.8.5\";\n","/\nCopyright (c) 2012-2014 Chris Pettitt\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n/\n\nmodule.exports = {\n graphlib: require(\"./lib/graphlib\"),\n\n layout: require(\"./lib/layout\"),\n debug: require(\"./lib/debug\"),\n util: {\n time: require(\"./lib/util\").time,\n notime: require(\"./lib/util\").notime\n },\n version: require(\"./lib/version\")\n};\n","var baseIsEqual = require('./_baseIsEqual');\n\n/\n Performs a deep comparison between two values to determine if they are\n * equivalent.\n \n Note: This method supports comparing arrays, array buffers, booleans,\n * date objects, error objects, maps, numbers, `Object` objects, regexes,\n * sets, strings, symbols, and typed arrays. `Object` objects are compared\n * by their own, not inherited, enumerable properties. Functions and DOM\n * nodes are compared by strict equality, i.e. `===`.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to compare.\n @param {} other The other value to compare.\n @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n \n var object = { 'a': 1 };\n * var other = { 'a': 1 };\n \n _.isEqual(object, other);\n * // => true\n \n object === other;\n * // => false\n /\nfunction isEqual(value, other) {\n return baseIsEqual(value, other);\n}\n\nmodule.exports = isEqual;\n","import {GraphNode, GraphEdge, MarkerType, Position, useVueFlow, Elements} from \"@vue-flow/core\";\nimport dagre from \"dagre\";\nimport Utils from \"./Utils\";\nimport {CLUSTER_PREFIX, NODE_SIZES} from \"./constants\";\nimport {flowHaveTasks as yamlFlowHaveTask} from \"./FlowYamlUtils\";\nimport isEqual from \"lodash/isEqual\"\n\nconst TRIGGERS_NODE_UID = \"root.Triggers\";\n\nenum BranchType {\n ERROR = \"ERROR\",\n FINALLY = \"FINALLY\",\n AFTER_EXECUTION = \"AFTER_EXECUTION\"\n}\n\ninterface MinimalNode {\n unused?: boolean;\n executionId?: string;\n branchType?: BranchType;\n uid: string;\n type: string;\n task?: {\n id?: string;\n type: string;\n namespace: string;\n flowId: string;\n }\n}\n\ninterface Cluster {\n uid: string\n type: string\n nodes: MinimalNode[]\n taskNode: {\n uid: string\n task: {\n type: string\n namespace: string\n flowId: string\n }\n }\n branchType: BranchType\n}\n\nexport interface FlowGraph {\n nodes: MinimalNode[];\n clusters: {\n cluster: Cluster;\n nodes: string[];\n parents: {\n uid: string;\n }[];\n }[];\n edges: GraphEdge[]\n}\n\ntype EdgeReplacer = Record<string, string>\n\n\nexport function predecessorsEdge(vueFlowId: string, nodeUid: string): GraphEdge[] {\n const {getEdges} = useVueFlow(vueFlowId);\n\n const nodes = [];\n\n for (const edge of getEdges.value) {\n if (edge.target === nodeUid) {\n nodes.push(edge);\n const recursiveEdge = predecessorsEdge(vueFlowId, edge.source);\n if (recursiveEdge.length > 0) {\n nodes.push(...recursiveEdge);\n }\n }\n }\n\n return nodes;\n}\n\nexport function successorsEdge(vueFlowId: string, nodeUid: string): GraphEdge[] {\n const {getEdges} = useVueFlow(vueFlowId);\n\n const nodes = [];\n\n for (const edge of getEdges.value) {\n if (edge.source === nodeUid) {\n nodes.push(edge);\n const recursiveEdge = successorsEdge(vueFlowId, edge.target);\n if (recursiveEdge.length > 0) {\n nodes.push(...recursiveEdge);\n }\n }\n }\n\n return nodes;\n}\n\nexport function predecessorsNode(vueFlowId: string, nodeUid: string): (GraphEdge \| GraphNode)[] {\n const {getEdges, findNode} = useVueFlow(vueFlowId);\n\n const foundNode = findNode(nodeUid)\n const nodes: (GraphEdge \| GraphNode)[] = foundNode ? [foundNode] : [];\n\n for (const edge of getEdges.value) {\n if (edge.target === nodeUid) {\n nodes.push(edge.sourceNode);\n const recursiveEdge = predecessorsNode(vueFlowId, edge.source);\n if (recursiveEdge.length > 0) {\n nodes.push(...recursiveEdge);\n }\n }\n }\n\n return nodes;\n}\n\nexport function successorsNode(vueFlowId: string, nodeUid: string) {\n const {getEdges, findNode} = useVueFlow(vueFlowId);\n\n const nodes = [findNode(nodeUid)];\n\n for (const edge of getEdges.value) {\n if (edge.source === nodeUid) {\n nodes.push(edge.targetNode);\n const recursiveEdge = successorsNode(vueFlowId, edge.target);\n if (recursiveEdge.length > 0) {\n nodes.push(...recursiveEdge);\n }\n }\n }\n\n return nodes;\n}\n\nexport function linkedElements(vueFlowId: string, nodeUid: string) {\n return [\n ...predecessorsEdge(vueFlowId, nodeUid),\n ...predecessorsNode(vueFlowId, nodeUid),\n ...successorsEdge(vueFlowId, nodeUid),\n ...successorsNode(vueFlowId, nodeUid),\n ];\n}\n\nexport function generateDagreGraph(\n flowGraph: { nodes: any; clusters: any; edges: any },\n hiddenNodes: string[],\n isHorizontal: boolean,\n clustersWithoutRootNode: string[],\n edgeReplacer: EdgeReplacer,\n collapsed: Set<string>,\n clusterToNode: MinimalNode[]\n) {\n const dagreGraph = new dagre.graphlib.Graph({compound: true});\n dagreGraph.setDefaultEdgeLabel(() => ({}));\n dagreGraph.setGraph({rankdir: isHorizontal ? \"LR\" : \"TB\"});\n\n for (const node of flowGraph.nodes) {\n if (!hiddenNodes.includes(node.uid)) {\n dagreGraph.setNode(node.uid, {\n width: getNodeWidth(node),\n height: getNodeHeight(node),\n });\n }\n }\n\n for (const cluster of flowGraph.clusters \|\| []) {\n const nodeUid = cluster.cluster.uid.replace(CLUSTER_PREFIX, \"\");\n if (\n clustersWithoutRootNode.includes(cluster.cluster.uid) &&\n collapsed.has(nodeUid)\n ) {\n const node = {uid: nodeUid, type: \"collapsedcluster\"};\n dagreGraph.setNode(nodeUid, {\n width: getNodeWidth(node),\n height: getNodeHeight(node),\n });\n clusterToNode.push(node);\n continue;\n }\n if (!edgeReplacer[cluster.cluster.uid]) {\n dagreGraph.setNode(cluster.cluster.uid, {clusterLabelPos: \"top\"});\n\n for (const node of cluster.nodes \|\| []) {\n if (!hiddenNodes.includes(node)) {\n dagreGraph.setParent(node, cluster.cluster.uid);\n }\n }\n }\n if (cluster.parents) {\n const nodeChild = edgeReplacer[cluster.cluster.uid]\n ? edgeReplacer[cluster.cluster.uid]\n : cluster.cluster.uid;\n if (!hiddenNodes.includes(nodeChild)) {\n dagreGraph.setParent(\n nodeChild,\n cluster.parents[cluster.parents.length - 1]\n );\n }\n }\n }\n\n for (const edge of flowGraph.edges \|\| []) {\n const newEdge = replaceIfCollapsed(\n edge.source,\n edge.target,\n edgeReplacer,\n hiddenNodes\n );\n if (newEdge) {\n dagreGraph.setEdge(newEdge.source, newEdge.target);\n }\n }\n\n dagre.layout(dagreGraph);\n return dagreGraph;\n}\n\nexport function getNodePosition(n: {\n x: number;\n y: number;\n width: number;\n height: number;\n}, parent?: {\n x: number;\n y: number;\n width: number;\n height: number;\n}) {\n const position = {x: n.x - n.width / 2, y: n.y - n.height / 2};\n\n // bug with parent node,\n if (parent) {\n const parentPosition = getNodePosition(parent);\n position.x = position.x - parentPosition.x;\n position.y = position.y - parentPosition.y;\n }\n return position;\n}\n\nexport function getNodeWidth(node: MinimalNode) {\n return isTaskNode(node) \|\| isTriggerNode(node)\n ? NODE_SIZES.TASK_WIDTH\n : (isCollapsedCluster(node)\n ? NODE_SIZES.COLLAPSED_CLUSTER_WIDTH\n : NODE_SIZES.DOT_WIDTH);\n}\n\nexport function getNodeHeight(node: MinimalNode) {\n return isTaskNode(node) \|\| isTriggerNode(node)\n ? NODE_SIZES.TASK_HEIGHT\n : (isCollapsedCluster(node)\n ? NODE_SIZES.COLLAPSED_CLUSTER_HEIGHT\n : NODE_SIZES.DOT_HEIGHT);\n}\n\nexport function isTaskNode(node: MinimalNode) {\n return [\"GraphTask\", \"SubflowGraphTask$1\"].some((t) => node.type.endsWith(t));\n}\n\nexport function isTriggerNode(node: MinimalNode) {\n return node.type.endsWith(\"GraphTrigger\");\n}\n\nexport function isCollapsedCluster(node: MinimalNode) {\n return node.type === \"collapsedcluster\";\n}\n\nexport function replaceIfCollapsed(source: string, target: string, edgeReplacer: EdgeReplacer, hiddenNodes: string[]) {\n const newSource = edgeReplacer[source] ? edgeReplacer[source] : source;\n const newTarget = edgeReplacer[target] ? edgeReplacer[target] : target;\n\n if (\n newSource === newTarget \|\|\n hiddenNodes.includes(newSource) \|\|\n hiddenNodes.includes(newTarget)\n ) {\n return null;\n }\n return {target: newTarget, source: newSource};\n}\n\nexport function cleanGraph(vueflowId: string) {\n const {\n getEdges,\n getNodes,\n getElements,\n removeEdges,\n removeNodes,\n removeSelectedElements,\n } = useVueFlow(vueflowId);\n removeEdges(getEdges.value);\n removeNodes(getNodes.value);\n removeSelectedElements(getElements.value);\n}\n\nexport function flowHaveTasks(source: string) {\n return source ? yamlFlowHaveTask(source) : false;\n}\n\nexport function nodeColor(node: MinimalNode, collapsed: Set<string>) {\n if (node.uid === TRIGGERS_NODE_UID) {\n return \"success\";\n }\n\n if (isTriggerNode(node) \|\| isCollapsedCluster(node)) {\n return \"success\";\n }\n\n if (node.type.endsWith(\"SubflowGraphTask\")) {\n return \"primary\";\n }\n\n if (node.branchType == BranchType.ERROR) {\n return \"danger\";\n }\n\n if (node.branchType == BranchType.FINALLY) {\n return \"warning\";\n }\n\n if (collapsed.has(node.uid)) {\n return \"blue\";\n }\n\n return \"default\";\n}\n\nexport function haveAdd(edge: GraphEdge,\n nodeByUid: Record<string, MinimalNode>,\n clustersRootTaskUids: string[],\n readOnlyUidPrefixes: string[]) {\n // prevent subflow edit (edge = subflowNode -> subflowNode)\n if (\n readOnlyUidPrefixes.some(\n (prefix) =>\n edge.source.startsWith(prefix) && edge.target.startsWith(prefix)\n )\n ) {\n return undefined;\n }\n\n // edge = clusterRoot -> clusterRootTask\n if (clustersRootTaskUids.includes(edge.target)) {\n return undefined;\n }\n\n // edge = Triggers cluster -> something \|\| edge = something -> Triggers cluster\n if (\n edge.source.startsWith(TRIGGERS_NODE_UID) \|\|\n edge.target.startsWith(TRIGGERS_NODE_UID)\n ) {\n return undefined;\n }\n\n const dotSplitTarget = edge.target.split(\".\");\n dotSplitTarget.pop();\n const targetNodeClusterUid = dotSplitTarget.join(\".\");\n const clusterRootTaskId = Utils.afterLastDot(targetNodeClusterUid);\n\n // edge = task of parallel -> end of parallel, we only add + symbol right after the parallel cluster root task node\n const targetNode = nodeByUid[edge.target];\n if (\n targetNode.type.endsWith(\"GraphClusterEnd\") &&\n nodeByUid[targetNodeClusterUid]?.task?.type?.endsWith(\"Parallel\")\n ) {\n return undefined;\n }\n\n // edge = something -> clusterRoot ==> we insert before the cluster\n // clusterUid = clusterTraversalPrefix.{rootTaskUid}\n // clusterRoot.uid = clusterUid.someUid = clusterTraversalPrefix.{rootTaskUid}.someUid\n if (targetNode.type.endsWith(\"GraphClusterRoot\")) {\n return [clusterRootTaskId, \"before\"];\n }\n\n const sourceIsEndOfCluster =\n nodeByUid[edge.source].type.endsWith(\"GraphClusterEnd\");\n // edge = clusterTask -> clusterEnd ==> we insert after the previous task\n if (!sourceIsEndOfCluster && targetNode.type.endsWith(\"GraphClusterEnd\")) {\n return [Utils.afterLastDot(edge.source), \"after\"];\n }\n\n // edge = cluster1End -> something ==> we insert after cluster1\n if (sourceIsEndOfCluster) {\n const dotSplitSource = edge.source.split(\".\");\n return [dotSplitSource[dotSplitSource.length - 2], \"after\"];\n }\n\n return [Utils.afterLastDot(edge.target), \"before\"];\n}\n\nexport function getEdgeColor(edge: GraphEdge, nodeByUid: Record<string, MinimalNode>, clusterByNodeUid: Record<string, Cluster>) {\n const findRootBranchType = (nodeId: string): BranchType \| null => {\n const uidParts = nodeId.split(\".\");\n for (let i = 1; i <= uidParts.length; i++) {\n const parentUid = uidParts.slice(0, i).join(\".\");\n const branchType = clusterByNodeUid[parentUid]?.branchType;\n if (branchType) return branchType;\n }\n return nodeByUid[nodeId]?.branchType ?? null;\n };\n\n const sourceBranchType = findRootBranchType(edge.source);\n const targetBranchType = findRootBranchType(edge.target);\n\n return [sourceBranchType, targetBranchType].includes(BranchType.ERROR) ? \"danger\"\n : [sourceBranchType, targetBranchType].includes(BranchType.FINALLY) ? \"warning\"\n : null;\n}\n\nexport function generateGraph(\n _vueFlowId: string,\n flowId: string \| undefined,\n namespace: string \| undefined,\n flowGraph: FlowGraph \| undefined,\n flowSource: string \| undefined,\n hiddenNodes: string[],\n isHorizontal: boolean,\n edgeReplacer: EdgeReplacer,\n collapsed: Set<string>,\n clusterToNode: MinimalNode[],\n isReadOnly: boolean,\n isAllowedEdit: boolean,\n enableSubflowInteraction: boolean\n): Elements \| undefined {\n const elements: Elements = [];\n\n const clustersWithoutRootNode = [CLUSTER_PREFIX + TRIGGERS_NODE_UID];\n\n if (!flowGraph \|\| (flowSource && !flowHaveTasks(flowSource))) {\n elements.push({\n id: \"start\",\n type: \"dot\",\n position: {x: 0, y: 0},\n style: {\n width: \"5px\",\n height: \"5px\",\n },\n sourcePosition: isHorizontal ? Position.Right : Position.Bottom,\n targetPosition: isHorizontal ? Position.Left : Position.Top,\n parentNode: undefined,\n draggable: false,\n });\n elements.push({\n id: \"end\",\n type: \"dot\",\n position: isHorizontal ? {x: 50, y: 0} : {x: 0, y: 50},\n style: {\n width: \"5px\",\n height: \"5px\",\n },\n sourcePosition: isHorizontal ? Position.Right : Position.Bottom,\n targetPosition: isHorizontal ? Position.Left : Position.Top,\n parentNode: undefined,\n draggable: false,\n });\n elements.push({\n id: \"start\|end\",\n source: \"start\",\n target: \"end\",\n type: \"edge\",\n data: {\n edge: {\n relation: {\n relationType: \"SEQUENTIAL\",\n },\n },\n isFlowable: false,\n initTask: true,\n color: \"primary\",\n },\n });\n\n return;\n }\n\n const dagreGraph = generateDagreGraph(\n flowGraph,\n hiddenNodes,\n isHorizontal,\n clustersWithoutRootNode,\n edgeReplacer,\n collapsed,\n clusterToNode\n );\n\n const clusterByNodeUid: Record<string, Cluster> = {};\n const clusters = flowGraph.clusters \|\| [];\n const rawClusters = clusters.map((c) => c.cluster);\n const readOnlyUidPrefixes = rawClusters\n .filter((c) => c.type.endsWith(\"SubflowGraphCluster\"))\n .map((c) => c.taskNode.uid);\n\n const nodeByUid = Object.fromEntries(\n flowGraph.nodes.concat(clusterToNode).map((node) => [node.uid, node])\n );\n for (const cluster of clusters) {\n if (\n !edgeReplacer[cluster.cluster.uid] &&\n !collapsed.has(cluster.cluster.uid)\n ) {\n if (\n cluster.cluster.taskNode?.task?.type ===\n \"io.kestra.core.tasks.flows.Dag\"\n ) {\n readOnlyUidPrefixes.push(cluster.cluster.taskNode.uid);\n }\n\n for (const nodeUid of cluster.nodes) {\n clusterByNodeUid[nodeUid] = cluster.cluster;\n }\n\n const clusterUid = cluster.cluster.uid;\n const dagreNode = dagreGraph.node(clusterUid);\n const parentNode = cluster.parents\n ? cluster.parents[cluster.parents.length - 1]\n : undefined;\n\n const clusterColor = computeClusterColor(cluster.cluster);\n\n elements.push({\n id: clusterUid,\n type: \"cluster\",\n parentNode: parentNode,\n position: getNodePosition(\n dagreNode,\n parentNode ? dagreGraph.node(parentNode) : undefined\n ),\n style: {\n width:\n clusterUid === TRIGGERS_NODE_UID && isHorizontal\n ? NODE_SIZES.TRIGGER_CLUSTER_WIDTH + \"px\"\n : dagreNode.width + \"px\",\n height:\n clusterUid === TRIGGERS_NODE_UID && !isHorizontal\n ? NODE_SIZES.TRIGGER_CLUSTER_HEIGHT + \"px\"\n : dagreNode.height + \"px\",\n },\n data: {\n collapsable: true,\n color: clusterColor,\n taskNode: cluster.cluster.taskNode,\n unused: cluster.cluster.taskNode\n ? nodeByUid[cluster.cluster.taskNode.uid].unused\n : false,\n },\n class: `ks-topology-${clusterColor}-border rounded p-2`,\n } as any);\n }\n }\n\n for (const node of flowGraph.nodes.concat(clusterToNode)) {\n if (!hiddenNodes.includes(node.uid)) {\n const dagreNode = dagreGraph.node(node.uid);\n let nodeType = \"task\";\n if (isClusterRootOrEnd(node)) {\n nodeType = \"dot\";\n } else if (node.type.includes(\"GraphTrigger\")) {\n nodeType = \"trigger\";\n } else if (node.type === \"collapsedcluster\") {\n nodeType = \"collapsedcluster\";\n }\n\n const color = nodeColor(node, collapsed);\n // If task type includes '$', it's an inner class so it's probably an internal class not supposed to be editable\n // In such case, only the root task will be editable\n const isReadOnlyTask =\n isReadOnly \|\|\n node.task?.type?.includes(\"$\") \|\|\n readOnlyUidPrefixes.some((prefix) =>\n node.uid.startsWith(prefix + \".\")\n );\n elements.push({\n id: node.uid,\n type: nodeType,\n position: getNodePosition(\n dagreNode,\n clusterByNodeUid[node.uid]\n ? dagreGraph.node(clusterByNodeUid[node.uid].uid)\n : undefined\n ),\n style: {\n width: getNodeWidth(node) + \"px\",\n height: getNodeHeight(node) + \"px\",\n },\n sourcePosition: isHorizontal ? Position.Right : Position.Bottom,\n targetPosition: isHorizontal ? Position.Left : Position.Top,\n parentNode: clusterByNodeUid[node.uid]\n ? clusterByNodeUid[node.uid].uid\n : undefined,\n draggable: nodeType === \"task\" ? !isReadOnlyTask : false,\n data: {\n node: node,\n parent: clusterByNodeUid[node.uid] ? clusterByNodeUid[node.uid] : undefined,\n namespace:\n clusterByNodeUid[node.uid]?.taskNode?.task?.namespace ??\n namespace,\n flowId:\n clusterByNodeUid[node.uid]?.taskNode?.task?.flowId ?? flowId,\n isFlowable:\n clusterByNodeUid[node.uid]?.uid === CLUSTER_PREFIX + node.uid &&\n !node.type.endsWith(\"SubflowGraphTask\"),\n color: color,\n expandable: isExpandableTask(\n node,\n clusterByNodeUid,\n edgeReplacer,\n enableSubflowInteraction\n ),\n isReadOnly: isReadOnlyTask,\n iconComponent: isCollapsedCluster(node)\n ? \"lightning-bolt\"\n : null,\n executionId: node.executionId,\n unused: node.unused,\n },\n class:\n node.type === \"collapsedcluster\"\n ? `ks-topology-${color}-border rounded`\n : \"\",\n });\n }\n }\n\n const clusterRootTaskNodeUids = rawClusters\n .filter((c) => c.taskNode)\n .map((c) => c.taskNode.uid);\n const edges = flowGraph.edges ?? [];\n\n for (const edge of edges) {\n const newEdge = replaceIfCollapsed(\n edge.source,\n edge.target,\n edgeReplacer,\n hiddenNodes\n );\n if (newEdge) {\n const edgeColor = getEdgeColor(edge, nodeByUid, clusterByNodeUid);\n elements.push({\n id: newEdge.source + \"\|\" + newEdge.target,\n source: newEdge.source,\n target: newEdge.target,\n type: \"edge\",\n markerEnd: isClusterRootOrEnd(nodeByUid[newEdge.target])\n ? \"\"\n : {\n id: \"marker-\" + (nodeByUid[newEdge.target].branchType ? nodeByUid[newEdge.target].branchType?.toLocaleLowerCase() : \"custom\"),\n type: MarkerType.ArrowClosed,\n color: edgeColor ? `var(--ks-border-${edgeColor})` : \"var(--ks-topology-edge-color)\"\n },\n data: {\n haveAdd:\n !isReadOnly &&\n isAllowedEdit &&\n haveAdd(\n edge,\n nodeByUid,\n clusterRootTaskNodeUids,\n readOnlyUidPrefixes\n ),\n haveDashArray:\n nodeByUid[edge.source].type.endsWith(\"GraphTrigger\") \|\|\n nodeByUid[edge.target].type.endsWith(\"GraphTrigger\") \|\|\n edge.source.startsWith(TRIGGERS_NODE_UID),\n color: edgeColor,\n unused: (edge as any).unused,\n },\n style: {\n zIndex: 10,\n },\n });\n }\n }\n\n return elements;\n}\n\nexport function isClusterRootOrEnd(node: MinimalNode) {\n return [\"GraphClusterRoot\", \"GraphClusterFinally\", \"GraphClusterAfterExecution\", \"GraphClusterEnd\"].some((s) =>\n node.type.endsWith(s)\n );\n}\n\nexport function computeClusterColor(cluster: Cluster) {\n if (cluster.uid === CLUSTER_PREFIX + TRIGGERS_NODE_UID) {\n return \"success\";\n }\n\n if (cluster.type.endsWith(\"SubflowGraphCluster\")) {\n return \"primary\";\n }\n\n if (cluster.branchType === BranchType.ERROR) {\n return \"danger\";\n }\n\n return \"blue\";\n}\n\nexport function isExpandableTask(\n node: MinimalNode,\n clusterByNodeUid: Record<string, Cluster>,\n edgeReplacer: EdgeReplacer,\n enableSubflowInteraction?: boolean\n) {\n if (Object.values(edgeReplacer).includes(node.uid)) {\n return true;\n }\n\n if (isCollapsedCluster(node)) {\n return true;\n }\n\n return (\n node.type.endsWith(\"SubflowGraphTask\") &&\n clusterByNodeUid[node.uid]?.uid?.replace(CLUSTER_PREFIX, \"\") !==\n node.uid &&\n enableSubflowInteraction\n );\n}\n\n/\n Get nodes that have no incoming edges, i.e., root nodes of the graph.\n /\nexport function getRootNodes(graph: FlowGraph) {\n const nodeUIDs = graph.nodes.map((node) => node.uid);\n const rootUIDs = nodeUIDs.filter((uid) => {\n return !graph.edges.some((edge) => edge.target === uid);\n });\n return graph.nodes.filter((node) => rootUIDs.includes(node.uid));\n}\n\n/\n Get the edges connected as the source to a specific node. (outward facing arrows)\n * @param graph The flow graph.\n * @param nodeUid The UID of the node.\n * @returns An array of edges connected to the node.\n /\nexport function getTargetNodesEdges(graph: FlowGraph, nodeUid?: string) {\n if (!nodeUid) {\n return undefined;\n }\n return graph.edges.filter((edge) => edge.source === nodeUid && edge.target);\n}\n\n/\n Follow the graph from a specific node to find the next task nodes.\n * This function traverses the graph until it finds a node that is not a cluster.\n * @param graph \n * @param initialNode The initial node to start the search from.\n * @returns An array of the next task nodes found.\n /\nexport function getNextTaskNodes(graph: FlowGraph, initialNode: MinimalNode) {\n let edges: GraphEdge[], nextTaskNodes: MinimalNode[], nodeUIDs: string[] = [initialNode.uid];\n // loop until we find a node that is not a cluster\n do {\n // find all the edges that are connected to this task\n edges = nodeUIDs.flatMap((uid) => getTargetNodesEdges(graph, uid)).filter(Boolean) as GraphEdge[];\n // if there are no edges, return undefined\n if (edges.length === 0) {\n return [];\n }\n nodeUIDs = edges.map((edge) => edge.target);\n nextTaskNodes = graph.nodes.filter((node) => nodeUIDs.includes(node.uid) && node.task);\n } while (!nextTaskNodes.length);\n\n return nextTaskNodes\n}\n\n/\n Check if the tasks in the current graph are identical to the previous graph until the specified task.\n * @param previousGraph The graph from the previous execution.\n * @param currentGraph The graph from the current execution.\n * @param taskId The ID of the task to check.\n * @returns True if all tasks are identical, false otherwise.\n /\nexport function areTasksIdenticalInGraphUntilTask(previousGraph: FlowGraph, currentGraph: FlowGraph, taskId?: string) {\n if (!taskId) {\n return false;\n }\n \n let previousRootTaskNodes = getRootNodes(previousGraph);\n let currentRootTaskNodes = getRootNodes(currentGraph);\n \n // if the root nodes are not the same, we cannot compare\n if (previousRootTaskNodes.length !== currentRootTaskNodes.length) {\n return false;\n }\n\n // avoid infinite loop\n let failIndex = 120\n\n // walk the graph until we find the taskId in the current root task nodes\n // or until we run out of nodes to compare\n do {\n currentRootTaskNodes = currentRootTaskNodes.flatMap((node) => getNextTaskNodes(currentGraph, node));\n \n // stop if we find the taskId in the current root task nodes\n if (currentRootTaskNodes.some((node: any) => node.task.id === taskId)) {\n return true;\n }\n\n previousRootTaskNodes = previousRootTaskNodes.flatMap((node) => getNextTaskNodes(previousGraph, node));\n\n if (previousRootTaskNodes.length !== currentRootTaskNodes.length) {\n return false;\n }\n\n for (const currentTaskNode of currentRootTaskNodes) {\n const prevTaskNode = previousRootTaskNodes.find((taskNode) => taskNode.task?.id === currentTaskNode.task?.id);\n const prevTaskValue = prevTaskNode?.task as Record<string, any> ?? {};\n const currentTaskValue = currentTaskNode.task as Record<string, any> ?? {};\n\n // if any member of the task is different, tasks are different\n if (!prevTaskNode \n \|\| Object.keys(prevTaskValue).length !== Object.keys(currentTaskValue).length\n ){\n return false;\n }\n \n if (!isEqual(prevTaskValue, currentTaskValue)) {\n return false;\n }\n \n }\n } while (previousRootTaskNodes.length && currentRootTaskNodes.length && failIndex-- > 0);\n\n if (failIndex <= 0) {\n console.warn(\"areTasksIdenticalInGraphUntilTask: Infinite loop detected, stopping comparison.\");\n return false;\n }\n\n return true;\n}\n\n/\n @deprecated prefer using VueFlowUtils directly for tree shaking\n */\nexport default {\n isClusterRootOrEnd,\n computeClusterColor,\n isExpandableTask,\n generateGraph,\n generateDagreGraph,\n getNodePosition,\n getNodeWidth,\n getNodeHeight,\n isTaskNode,\n isTriggerNode,\n isCollapsedCluster,\n replaceIfCollapsed,\n cleanGraph,\n flowHaveTasks,\n nodeColor,\n haveAdd,\n getEdgeColor,\n predecessorsEdge,\n successorsEdge,\n predecessorsNode,\n successorsNode,\n linkedElements,\n}"],"names":["SECTIONS","EVENTS","CLUSTER_PREFIX","stateGlobalChartTypes","logDisplayTypes","NODE_SIZES","editorViewTypes","storageKeys","executeFlowBehaviours","stateDisplayValues","createBaseFor","fromRight","object","iteratee","keysFunc","index","iterable","props","length","key","_createBaseFor","require$$0","baseFor","_baseFor","keys","require$$1","baseForOwn","_baseForOwn","HASH_UNDEFINED","setCacheAdd","value","_setCacheAdd","setCacheHas","_setCacheHas","MapCache","require$$2","SetCache","values","_SetCache","arraySome","array","predicate","_arraySome","cacheHas","cache","_cacheHas","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","equalArrays","other","bitmask","customizer","equalFunc","stack","isPartial","arrLength","othLength","arrStacked","othStacked","result","seen","arrValue","othValue","compared","othIndex","_equalArrays","mapToArray","map","_mapToArray","setToArray","set","_setToArray","Symbol","Uint8Array","eq","require$$3","require$$4","require$$5","boolTag","dateTag","errorTag","mapTag","numberTag","regexpTag","setTag","stringTag","symbolTag","arrayBufferTag","dataViewTag","symbolProto","symbolValueOf","equalByTag","tag","convert","stacked","_equalByTag","getAllKeys","objectProto","hasOwnProperty","equalObjects","objProps","objLength","othProps","objStacked","skipCtor","objValue","objCtor","othCtor","_equalObjects","Stack","getTag","isArray","isBuffer","require$$6","isTypedArray","require$$7","argsTag","arrayTag","objectTag","baseIsEqualDeep","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","_baseIsEqualDeep","isObjectLike","baseIsEqual","_baseIsEqual","baseIsMatch","source","matchData","noCustomizer","data","srcValue","_baseIsMatch","isObject","isStrictComparable","_isStrictComparable","getMatchData","_getMatchData","matchesStrictComparable","_matchesStrictComparable","baseMatches","_baseMatches","baseGetTag","isSymbol","isSymbol_1","reIsDeepProp","reIsPlainProp","isKey","type","_isKey","FUNC_ERROR_TEXT","memoize","func","resolver","memoized","args","memoize_1","MAX_MEMOIZE_SIZE","memoizeCapped","_memoizeCapped","rePropName","reEscapeChar","stringToPath","string","match","number","quote","subString","_stringToPath","arrayMap","_arrayMap","symbolToString","baseToString","_baseToString","toString","toString_1","castPath","_castPath","toKey","_toKey","baseGet","path","_baseGet","get","defaultValue","get_1","baseHasIn","_baseHasIn","isArguments","isIndex","isLength","hasPath","hasFunc","_hasPath","hasIn","hasIn_1","baseMatchesProperty","_baseMatchesProperty","identity","identity_1","baseProperty","_baseProperty","basePropertyDeep","_basePropertyDeep","property","property_1","baseIteratee","_baseIteratee","baseAssignValue","mapValues","mapValues_1","humanizeDurationLanguages","DATE_FORMAT_STORAGE_KEY","TIMEZONE_STORAGE_KEY","capitalize","str","dateFilter","dateString","format","currentLocale","_a","getCurrentInstance","momentInstance","_b","f","momentTz","splitFirst","separator","duration","isoString","moment","humanDuration","options","humanizeDuration","afterLastDot","distinctFilter","Utils","baseClone","CLONE_SYMBOLS_FLAG","clone","clone_1","constant","constant_1","isArrayLike","createBaseEach","eachFunc","collection","_createBaseEach","baseEach","_baseEach","castFunction","_castFunction","arrayEach","forEach","forEach_1","each","baseFilter","_baseFilter","arrayFilter","filter","filter_1","baseHas","_baseHas","has","has_1","baseKeys","isPrototype","isEmpty","isEmpty_1","isUndefined","isUndefined_1","baseMap","_baseMap","map_1","arrayReduce","accumulator","initAccum","_arrayReduce","baseReduce","_baseReduce","reduce","reduce_1","isString","isString_1","asciiSize","_asciiSize","rsAstralRange","rsComboMarksRange","reComboHalfMarksRange","rsComboSymbolsRange","rsComboRange","rsVarRange","rsZWJ","reHasUnicode","hasUnicode","_hasUnicode","rsAstral","rsCombo","rsFitz","rsModifier","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsOptVar","rsOptJoin","rsSeq","rsSymbol","reUnicode","unicodeSize","_unicodeSize","stringSize","_stringSize","size","size_1","baseCreate","getPrototype","isFunction","require$$8","require$$9","transform","isArr","isArrLike","Ctor","transform_1","spreadableSymbol","isFlattenable","_isFlattenable","arrayPush","baseFlatten","depth","isStrict","_baseFlatten","apply","thisArg","_apply","nativeMax","overRest","start","otherArgs","_overRest","defineProperty","baseSetToString","_baseSetToString","HOT_COUNT","HOT_SPAN","nativeNow","shortOut","count","lastCalled","stamp","remaining","_shortOut","setToString","_setToString","baseRest","_baseRest","baseFindIndex","fromIndex","_baseFindIndex","baseIsNaN","_baseIsNaN","strictIndexOf","_strictIndexOf","baseIndexOf","_baseIndexOf","arrayIncludes","_arrayIncludes","arrayIncludesWith","comparator","_arrayIncludesWith","noop","noop_1","Set","INFINITY","createSet","_createSet","LARGE_ARRAY_SIZE","baseUniq","includes","isCommon","outer","computed","seenIndex","_baseUniq","isArrayLikeObject","isArrayLikeObject_1","union","arrays","union_1","baseValues","_baseValues","values_1","lodash","require","require$$10","require$$11","require$$12","require$$13","require$$14","require$$15","lodash_1","_","graph","Graph","DEFAULT_EDGE_NAME","GRAPH_NODE","EDGE_KEY_DELIM","opts","label","newDefault","self","v","vs","removeEdge","e","child","parent","ancestor","children","predsV","sucsV","preds","neighbors","copy","parents","findParent","w","name","valueSpecified","arg0","edgeArgsToId","edgeObj","edgeArgsToObj","incrementOrInitEntry","edgeObjToId","edge","decrementOrRemoveEntry","u","inV","edges","outV","inEdges","k","isDirected","v_","w_","tmp","version","lib","json","write","read","g","writeNodes","writeEdges","nodeValue","node","edgeValue","entry","components_1","components","visited","cmpts","cmpt","dfs","priorityQueue","PriorityQueue","x","priority","keyIndices","arr","min","i","l","r","largest","j","origArrI","origArrJ","dijkstra_1","dijkstra","DEFAULT_WEIGHT_FUNC","weightFn","edgeFn","runDijkstra","results","pq","vEntry","updateNeighbors","wEntry","weight","distance","dijkstraAll_1","dijkstraAll","weightFunc","edgeFunc","acc","tarjan_1","tarjan","findCycles_1","findCycles","floydWarshall_1","floydWarshall","runFloydWarshall","nodes","d","rowK","rowI","ik","kj","ij","altDistance","topsort_1","topsort","CycleException","visit","isAcyclic_1","isAcyclic","dfs_1","order","navigation","doDfs","postorder","postorder_1","preorder_1","preorder","prim_1","prim","pri","edgeWeight","init","alg","graphlib","graphlib_1","isIterateeCall","_isIterateeCall","keysIn","defaults","sources","guard","propsIndex","propsLength","defaults_1","createFind","findIndexFunc","_createFind","reWhitespace","trimmedEndIndex","_trimmedEndIndex","reTrimStart","baseTrim","_baseTrim","NAN","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","toNumber","isBinary","toNumber_1","MAX_INTEGER","toFinite","sign","toFinite_1","toInteger","remainder","toInteger_1","findIndex","findIndex_1","find","find_1","flatten","flatten_1","forIn","forIn_1","last","last_1","baseExtremum","current","_baseExtremum","baseGt","_baseGt","max","max_1","assignMergeValue","_assignMergeValue","funcProto","funcToString","objectCtorString","isPlainObject","proto","isPlainObject_1","safeGet","_safeGet","copyObject","toPlainObject","toPlainObject_1","cloneBuffer","cloneTypedArray","copyArray","initCloneObject","baseMergeDeep","srcIndex","mergeFunc","newValue","isBuff","isTyped","_baseMergeDeep","baseMerge","_baseMerge","createAssigner","assigner","_createAssigner","merge","merge_1","baseLt","_baseLt","min_1","minBy","minBy_1","root","now","now_1","assignValue","baseSet","lastIndex","nested","_baseSet","basePickBy","paths","_basePickBy","basePick","_basePick","flatRest","_flatRest","pick","pick_1","nativeCeil","baseRange","end","step","_baseRange","createRange","_createRange","range","range_1","baseSortBy","comparer","_baseSortBy","compareAscending","valIsDefined","valIsNull","valIsReflexive","valIsSymbol","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","_compareAscending","compareMultiple","orders","objCriteria","othCriteria","ordersLength","_compareMultiple","baseUnary","baseOrderBy","iteratees","criteria","_baseOrderBy","sortBy","sortBy_1","idCounter","uniqueId","prefix","id","uniqueId_1","baseZipObject","assignFunc","valsLength","_baseZipObject","zipObject","zipObject_1","require$$16","require$$17","require$$18","require$$19","require$$20","require$$21","require$$22","require$$23","require$$24","require$$25","list","List","sentinel","unlink","strs","curr","filterOutLinks","greedyFas","greedyFAS","DEFAULT_WEIGHT_FN","state","buildState","doGreedyFAS","buckets","zeroIdx","sinks","removeNode","collectPredecessors","uEntry","assignBucket","fasGraph","maxIn","maxOut","prevWeight","acyclic","run","undo","fas","dfsFAS","forwardName","util","addDummyNode","simplify","asNonCompoundGraph","successorWeights","predecessorWeights","intersectRect","buildLayerMatrix","normalizeRanks","removeEmptyRanks","addBorderNode","maxRank","partition","time","notime","attrs","simplified","simpleLabel","weightMap","sucs","rect","point","y","dx","dy","h","sx","sy","layering","rank","offset","layers","delta","nodeRankFactor","fn","normalize","normalizeEdge","vRank","wRank","edgeLabel","labelRank","dummy","origLabel","longestPath","slack","feasibleTree_1","feasibleTree","t","tightTree","findMinSlackEdge","shiftRanks","edgeV","initRank","networkSimplex_1","networkSimplex","initLowLimValues","initCutValues","calcCutValue","leaveEdge","enterEdge","exchangeEdges","assignCutValue","childLab","childIsTail","graphEdge","cutValue","isOutEdge","pointsToHead","otherWeight","isTreeEdge","otherCutValue","tree","dfsAssignLowLim","nextLim","low","vLabel","wLabel","tailLabel","flip","candidates","isDescendant","updateRanks","flipped","rootLabel","rankUtil","rank_1","networkSimplexRanker","tightTreeRanker","longestPathRanker","parentDummyChains_1","parentDummyChains","postorderNums","pathData","findPath","lca","pathIdx","pathV","ascending","vPath","wPath","lim","nestingGraph","cleanup","depths","treeDepths","height","nodeSep","sumWeights","top","bottom","childNode","childTop","childBottom","thisWeight","minlen","graphLabel","addBorderSegments_1","addBorderSegments","prop","sg","sgNode","prev","coordinateSystem","adjust","rankDir","swapWidthHeight","reverseY","swapXY","swapWidthHeightOne","reverseYOne","swapXYOne","initOrder_1","initOrder","simpleNodes","orderedVs","crossCount_1","crossCount","cc","twoLayerCrossCount","northLayer","southLayer","southPos","southEntries","firstIndex","treeSize","weightSum","barycenter_1","barycenter","movable","nodeU","resolveConflicts_1","resolveConflicts","entries","cg","mappedEntries","entryV","entryW","sourceSet","doResolveConflicts","handleIn","mergeEntries","handleOut","target","sum","sort_1","sort","biasRight","parts","sortable","unsortable","vsIndex","compareWithBias","consumeUnsortable","bias","sortSubgraph_1","sortSubgraph","bl","br","subgraphs","barycenters","subgraphResult","mergeBarycenters","expandSubgraphs","blPred","brPred","buildLayerGraph_1","buildLayerGraph","relationship","createRootNode","addSubgraphConstraints_1","addSubgraphConstraints","rootPrev","prevChild","order_1","downLayerGraphs","buildLayerGraphs","upLayerGraphs","assignOrder","bestCC","best","lastBest","sweepLayerGraphs","ranks","layerGraphs","lg","sorted","layer","bk","positionX","findType1Conflicts","findType2Conflicts","addConflict","hasConflict","verticalAlignment","horizontalCompaction","alignCoordinates","findSmallestWidthAlignment","balance","conflicts","visitLayer","prevLayer","k0","scanPos","prevLayerLength","lastNode","findOtherInnerSegmentNode","k1","scanNode","uLabel","uPos","scan","south","southEnd","prevNorthBorder","nextNorthBorder","uNode","north","prevNorthPos","nextNorthPos","southLookahead","predecessors","conflictsV","neighborFn","align","pos","prevIdx","ws","mp","il","reverseSep","xs","blockG","buildBlockGraph","borderType","iterate","setXsFunc","nextNodesFunc","elem","pass1","pass2","blockGraph","sepFn","sep","vRoot","uRoot","prevMax","xss","halfWidth","width","alignTo","alignToVals","alignToMin","alignToMax","vert","horiz","alignment","xsVals","ignore","adjustedLayering","inner","smallestWidth","edgeSep","position_1","position","positionY","rankSep","prevY","maxHeight","layout_1","layout","layoutGraph","buildLayoutGraph","runLayout","updateInputGraph","makeSpaceForEdgeLabels","removeSelfEdges","injectEdgeLabelProxies","assignRankMinMax","removeEdgeLabelProxies","insertSelfEdges","positionSelfEdges","removeBorderNodes","fixupEdgeLabelCoords","translateGraph","assignNodeIntersects","reversePointsForReversedEdges","inputGraph","inputLabel","layoutLabel","graphNumAttrs","graphDefaults","graphAttrs","nodeNumAttrs","nodeDefaults","edgeNumAttrs","edgeDefaults","edgeAttrs","canonicalize","selectNumberAttrs","minX","maxX","minY","maxY","marginX","marginY","getExtremes","p","nodeV","nodeW","p1","p2","b","orderShift","selfEdge","selfNode","obj","newAttrs","debug","debugOrdering","layerMatrix","layerV","dagre","isEqual","isEqual_1","TRIGGERS_NODE_UID","predecessorsEdge","vueFlowId","nodeUid","getEdges","useVueFlow","recursiveEdge","successorsEdge","predecessorsNode","findNode","foundNode","successorsNode","linkedElements","generateDagreGraph","flowGraph","hiddenNodes","isHorizontal","clustersWithoutRootNode","edgeReplacer","collapsed","clusterToNode","dagreGraph","getNodeWidth","getNodeHeight","cluster","nodeChild","newEdge","replaceIfCollapsed","getNodePosition","n","parentPosition","isTaskNode","isTriggerNode","isCollapsedCluster","newSource","newTarget","cleanGraph","vueflowId","getNodes","getElements","removeEdges","removeNodes","removeSelectedElements","flowHaveTasks","yamlFlowHaveTask","nodeColor","haveAdd","nodeByUid","clustersRootTaskUids","readOnlyUidPrefixes","dotSplitTarget","targetNodeClusterUid","clusterRootTaskId","targetNode","_c","sourceIsEndOfCluster","dotSplitSource","getEdgeColor","clusterByNodeUid","findRootBranchType","nodeId","uidParts","parentUid","branchType","sourceBranchType","targetBranchType","generateGraph","_vueFlowId","flowId","namespace","flowSource","isReadOnly","isAllowedEdit","enableSubflowInteraction","elements","Position","clusters","rawClusters","c","clusterUid","dagreNode","parentNode","clusterColor","computeClusterColor","nodeType","isClusterRootOrEnd","color","isReadOnlyTask","_d","_g","_f","_e","_j","_i","_h","_k","isExpandableTask","clusterRootTaskNodeUids","edgeColor","_l","MarkerType","s","getRootNodes","rootUIDs","uid","getTargetNodesEdges","getNextTaskNodes","initialNode","nextTaskNodes","nodeUIDs","areTasksIdenticalInGraphUntilTask","previousGraph","currentGraph","taskId","previousRootTaskNodes","currentRootTaskNodes","failIndex","currentTaskNode","prevTaskNode","taskNode","prevTaskValue","currentTaskValue","VueFlowUtils"],"mappings":";;;;;;AAAO,MAAMA,KAAW;AAAA,EACtB,OAAO;AAAA,EACP,UAAU;AAAA,EACV,cAAc;AAChB,GAEaC,KAAS;AAAA,EACpB,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,kBAAkB;AAAA,EAClB,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,UAAU;AAAA,EACV,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,WAAW;AAAA,EACX,qBAAqB;AAAA,EACrB,gBAAgB;AAAA,EAChB,UAAU;AACZ,GAEaC,KAAiB,YAEjBC,KAAwB;AAAA,EACnC,YAAY;AAAA,EACZ,UAAU;AACZ,GAEaC,KAAkB;AAAA,EAC7B,KAAK;AAAA,EACL,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,SAAS;AACX,GAEaC,KAAa;AAAA,EACxB,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,eAAe;AAAA,EACf,gBAAgB;AAAA,EAChB,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,yBAAyB;AAAA,EACzB,0BAA0B;AAAA,EAC1B,uBAAuB;AAAA,EACvB,wBAAwB;AAC1B,GAEaC,KAAkB;AAAA,EAC7B,aAAa;AAAA,EACb,QAAQ;AAAA,EACR,iBAAiB;AAAA,EACjB,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,mBAAmB;AACrB,GAEaC,KAAc;AAAA,EACzB,4BAA4B;AAAA,EAC5B,iCAAiC;AAAA,EACjC,iBAAiB;AAAA,EACjB,wBAAwB;AAAA,EACxB,YAAY;AAAA,EACZ,kBAAkB;AAAA,EAClB,iBAAiB;AAAA,EACjB,mBAAmB;AAAA,EACnB,kBAAkB;AAAA,EAClB,iBAAiB;AAAA,EACjB,aAAa;AAAA,EACb,kBAAkB;AACpB,GAEaC,KAAwB;AAAA,EACnC,UAAU;AAAA,EACV,SAAS;AACX,GAEaC,KAAqB;AAAA,EAChC,YAAY;AACd;;;;;AC1EA,WAASC,EAAcC,GAAW;AAChC,WAAO,SAASC,GAAQC,GAAUC,GAAU;AAM1C,eALIC,IAAQ,IACRC,IAAW,OAAOJ,CAAM,GACxBK,IAAQH,EAASF,CAAM,GACvBM,IAASD,EAAM,QAEZC,OAAU;AACf,YAAIC,IAAMF,EAAMN,IAAYO,IAAS,EAAEH,CAAK;AAC5C,YAAIF,EAASG,EAASG,CAAG,GAAGA,GAAKH,CAAQ,MAAM;AAC7C;AAAA,MAER;AACI,aAAOJ;AAAA,IACR;AAAA,EACH;AAEA,SAAAQ,KAAiBV;;;;;;ACxBjB,MAAIA,IAAgBW,GAA2B,GAa3CC,IAAUZ,EAAe;AAE7B,SAAAa,KAAiBD;;;;;;ACfjB,MAAIA,IAAUD,GAAqB,GAC/BG,IAAOC,GAAiB;AAU5B,WAASC,EAAWd,GAAQC,GAAU;AACpC,WAAOD,KAAUU,EAAQV,GAAQC,GAAUW,CAAI;AAAA,EACjD;AAEA,SAAAG,KAAiBD;;;;;;ACdjB,MAAIE,IAAiB;AAYrB,WAASC,EAAYC,GAAO;AAC1B,gBAAK,SAAS,IAAIA,GAAOF,CAAc,GAChC;AAAA,EACT;AAEA,SAAAG,KAAiBF;;;;;;ACTjB,WAASG,EAAYF,GAAO;AAC1B,WAAO,KAAK,SAAS,IAAIA,CAAK;AAAA,EAChC;AAEA,SAAAG,KAAiBD;;;;;;ACbjB,MAAIE,IAAWb,GAAsB,GACjCQ,IAAcJ,GAAyB,GACvCO,IAAcG,GAAyB;AAU3C,WAASC,EAASC,GAAQ;AACxB,QAAItB,IAAQ,IACRG,IAASmB,KAAU,OAAO,IAAIA,EAAO;AAGzC,SADA,KAAK,WAAW,IAAIH,KACb,EAAEnB,IAAQG;AACf,WAAK,IAAImB,EAAOtB,CAAK,CAAC;AAAA,EAE1B;AAGA,SAAAqB,EAAS,UAAU,MAAMA,EAAS,UAAU,OAAOP,GACnDO,EAAS,UAAU,MAAMJ,GAEzBM,KAAiBF;;;;;;AChBjB,WAASG,EAAUC,GAAOC,GAAW;AAInC,aAHI1B,IAAQ,IACRG,IAASsB,KAAS,OAAO,IAAIA,EAAM,QAEhC,EAAEzB,IAAQG;AACf,UAAIuB,EAAUD,EAAMzB,CAAK,GAAGA,GAAOyB,CAAK;AACtC,eAAO;AAGX,WAAO;AAAA,EACT;AAEA,SAAAE,KAAiBH;;;;;;ACdjB,WAASI,EAASC,GAAOzB,GAAK;AAC5B,WAAOyB,EAAM,IAAIzB,CAAG;AAAA,EACtB;AAEA,SAAA0B,KAAiBF;;;;;;ACZjB,MAAIP,IAAWf,GAAsB,GACjCkB,IAAYd,GAAuB,GACnCkB,IAAWR,GAAsB,GAGjCW,IAAuB,GACvBC,IAAyB;AAe7B,WAASC,EAAYR,GAAOS,GAAOC,GAASC,GAAYC,GAAWC,GAAO;AACxE,QAAIC,IAAYJ,IAAUJ,GACtBS,IAAYf,EAAM,QAClBgB,IAAYP,EAAM;AAEtB,QAAIM,KAAaC,KAAa,EAAEF,KAAaE,IAAYD;AACvD,aAAO;AAGT,QAAIE,IAAaJ,EAAM,IAAIb,CAAK,GAC5BkB,IAAaL,EAAM,IAAIJ,CAAK;AAChC,QAAIQ,KAAcC;AAChB,aAAOD,KAAcR,KAASS,KAAclB;AAE9C,QAAIzB,IAAQ,IACR4C,IAAS,IACTC,IAAQV,IAAUH,IAA0B,IAAIX,MAAW;AAM/D,SAJAiB,EAAM,IAAIb,GAAOS,CAAK,GACtBI,EAAM,IAAIJ,GAAOT,CAAK,GAGf,EAAEzB,IAAQwC,KAAW;AAC1B,UAAIM,IAAWrB,EAAMzB,CAAK,GACtB+C,IAAWb,EAAMlC,CAAK;AAE1B,UAAIoC;AACF,YAAIY,IAAWT,IACXH,EAAWW,GAAUD,GAAU9C,GAAOkC,GAAOT,GAAOa,CAAK,IACzDF,EAAWU,GAAUC,GAAU/C,GAAOyB,GAAOS,GAAOI,CAAK;AAE/D,UAAIU,MAAa,QAAW;AAC1B,YAAIA;AACF;AAEF,QAAAJ,IAAS;AACT;AAAA,MACN;AAEI,UAAIC;AACF,YAAI,CAACrB,EAAUU,GAAO,SAASa,GAAUE,GAAU;AAC7C,cAAI,CAACrB,EAASiB,GAAMI,CAAQ,MACvBH,MAAaC,KAAYV,EAAUS,GAAUC,GAAUZ,GAASC,GAAYE,CAAK;AACpF,mBAAOO,EAAK,KAAKI,CAAQ;AAAA,QAEvC,CAAW,GAAG;AACN,UAAAL,IAAS;AACT;AAAA,QACR;AAAA,iBACe,EACLE,MAAaC,KACXV,EAAUS,GAAUC,GAAUZ,GAASC,GAAYE,CAAK,IACzD;AACL,QAAAM,IAAS;AACT;AAAA,MACN;AAAA,IACA;AACE,WAAAN,EAAM,OAAUb,CAAK,GACrBa,EAAM,OAAUJ,CAAK,GACdU;AAAA,EACT;AAEA,SAAAM,KAAiBjB;;;;;;AC5EjB,WAASkB,EAAWC,GAAK;AACvB,QAAIpD,IAAQ,IACR4C,IAAS,MAAMQ,EAAI,IAAI;AAE3B,WAAAA,EAAI,QAAQ,SAASrC,GAAOX,GAAK;AAC/B,MAAAwC,EAAO,EAAE5C,CAAK,IAAI,CAACI,GAAKW,CAAK;AAAA,IACjC,CAAG,GACM6B;AAAA,EACT;AAEA,SAAAS,KAAiBF;;;;;;ACVjB,WAASG,EAAWC,GAAK;AACvB,QAAIvD,IAAQ,IACR4C,IAAS,MAAMW,EAAI,IAAI;AAE3B,WAAAA,EAAI,QAAQ,SAASxC,GAAO;AAC1B,MAAA6B,EAAO,EAAE5C,CAAK,IAAIe;AAAA,IACtB,CAAG,GACM6B;AAAA,EACT;AAEA,SAAAY,KAAiBF;;;;;;ACjBjB,MAAIG,IAASnD,GAAoB,GAC7BoD,IAAahD,GAAwB,GACrCiD,IAAKvC,GAAe,GACpBa,IAAc2B,GAAyB,GACvCT,IAAaU,GAAwB,GACrCP,IAAaQ,GAAwB,GAGrC/B,IAAuB,GACvBC,IAAyB,GAGzB+B,IAAU,oBACVC,IAAU,iBACVC,IAAW,kBACXC,IAAS,gBACTC,IAAY,mBACZC,IAAY,mBACZC,IAAS,gBACTC,IAAY,mBACZC,IAAY,mBAEZC,IAAiB,wBACjBC,IAAc,qBAGdC,IAAcjB,IAASA,EAAO,YAAY,QAC1CkB,IAAgBD,IAAcA,EAAY,UAAU;AAmBxD,WAASE,EAAW/E,GAAQqC,GAAO2C,GAAK1C,GAASC,GAAYC,GAAWC,GAAO;AAC7E,YAAQuC,GAAG;AAAA,MACT,KAAKJ;AACH,YAAK5E,EAAO,cAAcqC,EAAM,cAC3BrC,EAAO,cAAcqC,EAAM;AAC9B,iBAAO;AAET,QAAArC,IAASA,EAAO,QAChBqC,IAAQA,EAAM;AAAA,MAEhB,KAAKsC;AACH,eAAK,EAAA3E,EAAO,cAAcqC,EAAM,cAC5B,CAACG,EAAU,IAAIqB,EAAW7D,CAAM,GAAG,IAAI6D,EAAWxB,CAAK,CAAC;AAAA,MAK9D,KAAK6B;AAAA,MACL,KAAKC;AAAA,MACL,KAAKG;AAGH,eAAOR,EAAG,CAAC9D,GAAQ,CAACqC,CAAK;AAAA,MAE3B,KAAK+B;AACH,eAAOpE,EAAO,QAAQqC,EAAM,QAAQrC,EAAO,WAAWqC,EAAM;AAAA,MAE9D,KAAKkC;AAAA,MACL,KAAKE;AAIH,eAAOzE,KAAWqC,IAAQ;AAAA,MAE5B,KAAKgC;AACH,YAAIY,IAAU3B;AAAA,MAEhB,KAAKkB;AACH,YAAI9B,IAAYJ,IAAUJ;AAG1B,YAFA+C,MAAYA,IAAUxB,IAElBzD,EAAO,QAAQqC,EAAM,QAAQ,CAACK;AAChC,iBAAO;AAGT,YAAIwC,IAAUzC,EAAM,IAAIzC,CAAM;AAC9B,YAAIkF;AACF,iBAAOA,KAAW7C;AAEpB,QAAAC,KAAWH,GAGXM,EAAM,IAAIzC,GAAQqC,CAAK;AACvB,YAAIU,IAASX,EAAY6C,EAAQjF,CAAM,GAAGiF,EAAQ5C,CAAK,GAAGC,GAASC,GAAYC,GAAWC,CAAK;AAC/F,eAAAA,EAAM,OAAUzC,CAAM,GACf+C;AAAA,MAET,KAAK2B;AACH,YAAII;AACF,iBAAOA,EAAc,KAAK9E,CAAM,KAAK8E,EAAc,KAAKzC,CAAK;AAAA,IAErE;AACE,WAAO;AAAA,EACT;AAEA,SAAA8C,KAAiBJ;;;;;;AC/GjB,MAAIK,IAAa3E,GAAwB,GAGrCyB,IAAuB,GAGvBmD,IAAc,OAAO,WAGrBC,IAAiBD,EAAY;AAejC,WAASE,EAAavF,GAAQqC,GAAOC,GAASC,GAAYC,GAAWC,GAAO;AAC1E,QAAIC,IAAYJ,IAAUJ,GACtBsD,IAAWJ,EAAWpF,CAAM,GAC5ByF,IAAYD,EAAS,QACrBE,IAAWN,EAAW/C,CAAK,GAC3BO,IAAY8C,EAAS;AAEzB,QAAID,KAAa7C,KAAa,CAACF;AAC7B,aAAO;AAGT,aADIvC,IAAQsF,GACLtF,OAAS;AACd,UAAII,IAAMiF,EAASrF,CAAK;AACxB,UAAI,EAAEuC,IAAYnC,KAAO8B,IAAQiD,EAAe,KAAKjD,GAAO9B,CAAG;AAC7D,eAAO;AAAA,IAEb;AAEE,QAAIoF,IAAalD,EAAM,IAAIzC,CAAM,GAC7B8C,IAAaL,EAAM,IAAIJ,CAAK;AAChC,QAAIsD,KAAc7C;AAChB,aAAO6C,KAActD,KAASS,KAAc9C;AAE9C,QAAI+C,IAAS;AACb,IAAAN,EAAM,IAAIzC,GAAQqC,CAAK,GACvBI,EAAM,IAAIJ,GAAOrC,CAAM;AAGvB,aADI4F,IAAWlD,GACR,EAAEvC,IAAQsF,KAAW;AAC1B,MAAAlF,IAAMiF,EAASrF,CAAK;AACpB,UAAI0F,IAAW7F,EAAOO,CAAG,GACrB2C,IAAWb,EAAM9B,CAAG;AAExB,UAAIgC;AACF,YAAIY,IAAWT,IACXH,EAAWW,GAAU2C,GAAUtF,GAAK8B,GAAOrC,GAAQyC,CAAK,IACxDF,EAAWsD,GAAU3C,GAAU3C,GAAKP,GAAQqC,GAAOI,CAAK;AAG9D,UAAI,EAAEU,MAAa,SACV0C,MAAa3C,KAAYV,EAAUqD,GAAU3C,GAAUZ,GAASC,GAAYE,CAAK,IAClFU,IACD;AACL,QAAAJ,IAAS;AACT;AAAA,MACN;AACI,MAAA6C,MAAaA,IAAWrF,KAAO;AAAA,IACnC;AACE,QAAIwC,KAAU,CAAC6C,GAAU;AACvB,UAAIE,IAAU9F,EAAO,aACjB+F,IAAU1D,EAAM;AAGpB,MAAIyD,KAAWC,KACV,iBAAiB/F,KAAU,iBAAiBqC,KAC7C,EAAE,OAAOyD,KAAW,cAAcA,aAAmBA,KACnD,OAAOC,KAAW,cAAcA,aAAmBA,OACvDhD,IAAS;AAAA,IAEf;AACE,WAAAN,EAAM,OAAUzC,CAAM,GACtByC,EAAM,OAAUJ,CAAK,GACdU;AAAA,EACT;AAEA,SAAAiD,KAAiBT;;;;;;ACzFjB,MAAIU,IAAQxF,GAAmB,GAC3B2B,IAAcvB,GAAyB,GACvCkE,IAAaxD,GAAwB,GACrCgE,IAAexB,GAA0B,GACzCmC,IAASlC,GAAoB,GAC7BmC,IAAUlC,EAAoB,GAC9BmC,IAAWC,GAAqB,GAChCC,IAAeC,GAAyB,GAGxCrE,IAAuB,GAGvBsE,IAAU,sBACVC,IAAW,kBACXC,IAAY,mBAGZrB,IAAc,OAAO,WAGrBC,IAAiBD,EAAY;AAgBjC,WAASsB,EAAgB3G,GAAQqC,GAAOC,GAASC,GAAYC,GAAWC,GAAO;AAC7E,QAAImE,IAAWT,EAAQnG,CAAM,GACzB6G,IAAWV,EAAQ9D,CAAK,GACxByE,IAASF,IAAWH,IAAWP,EAAOlG,CAAM,GAC5C+G,IAASF,IAAWJ,IAAWP,EAAO7D,CAAK;AAE/C,IAAAyE,IAASA,KAAUN,IAAUE,IAAYI,GACzCC,IAASA,KAAUP,IAAUE,IAAYK;AAEzC,QAAIC,IAAWF,KAAUJ,GACrBO,IAAWF,KAAUL,GACrBQ,IAAYJ,KAAUC;AAE1B,QAAIG,KAAad,EAASpG,CAAM,GAAG;AACjC,UAAI,CAACoG,EAAS/D,CAAK;AACjB,eAAO;AAET,MAAAuE,IAAW,IACXI,IAAW;AAAA,IACf;AACE,QAAIE,KAAa,CAACF;AAChB,aAAAvE,MAAUA,IAAQ,IAAIwD,MACdW,KAAYN,EAAatG,CAAM,IACnCoC,EAAYpC,GAAQqC,GAAOC,GAASC,GAAYC,GAAWC,CAAK,IAChEsC,EAAW/E,GAAQqC,GAAOyE,GAAQxE,GAASC,GAAYC,GAAWC,CAAK;AAE7E,QAAI,EAAEH,IAAUJ,IAAuB;AACrC,UAAIiF,IAAeH,KAAY1B,EAAe,KAAKtF,GAAQ,aAAa,GACpEoH,IAAeH,KAAY3B,EAAe,KAAKjD,GAAO,aAAa;AAEvE,UAAI8E,KAAgBC,GAAc;AAChC,YAAIC,IAAeF,IAAenH,EAAO,MAAO,IAAGA,GAC/CsH,IAAeF,IAAe/E,EAAM,MAAO,IAAGA;AAElD,eAAAI,MAAUA,IAAQ,IAAIwD,MACfzD,EAAU6E,GAAcC,GAAchF,GAASC,GAAYE,CAAK;AAAA,MAC7E;AAAA,IACA;AACE,WAAKyE,KAGLzE,MAAUA,IAAQ,IAAIwD,MACfV,EAAavF,GAAQqC,GAAOC,GAASC,GAAYC,GAAWC,CAAK,KAH/D;AAAA,EAIX;AAEA,SAAA8E,KAAiBZ;;;;;;AClFjB,MAAIA,IAAkBlG,GAA6B,GAC/C+G,IAAe3G,GAAyB;AAgB5C,WAAS4G,EAAYvG,GAAOmB,GAAOC,GAASC,GAAYE,GAAO;AAC7D,WAAIvB,MAAUmB,IACL,KAELnB,KAAS,QAAQmB,KAAS,QAAS,CAACmF,EAAatG,CAAK,KAAK,CAACsG,EAAanF,CAAK,IACzEnB,MAAUA,KAASmB,MAAUA,IAE/BsE,EAAgBzF,GAAOmB,GAAOC,GAASC,GAAYkF,GAAahF,CAAK;AAAA,EAC9E;AAEA,SAAAiF,KAAiBD;;;;;;AC3BjB,MAAIxB,IAAQxF,GAAmB,GAC3BgH,IAAc5G,GAAyB,GAGvCqB,IAAuB,GACvBC,IAAyB;AAY7B,WAASwF,EAAY3H,GAAQ4H,GAAQC,GAAWtF,GAAY;AAC1D,QAAIpC,IAAQ0H,EAAU,QAClBvH,IAASH,GACT2H,IAAe,CAACvF;AAEpB,QAAIvC,KAAU;AACZ,aAAO,CAACM;AAGV,SADAN,IAAS,OAAOA,CAAM,GACfG,OAAS;AACd,UAAI4H,IAAOF,EAAU1H,CAAK;AAC1B,UAAK2H,KAAgBC,EAAK,CAAC,IACnBA,EAAK,CAAC,MAAM/H,EAAO+H,EAAK,CAAC,CAAC,IAC1B,EAAEA,EAAK,CAAC,KAAK/H;AAEnB,eAAO;AAAA,IAEb;AACE,WAAO,EAAEG,IAAQG,KAAQ;AACvB,MAAAyH,IAAOF,EAAU1H,CAAK;AACtB,UAAII,IAAMwH,EAAK,CAAC,GACZlC,IAAW7F,EAAOO,CAAG,GACrByH,IAAWD,EAAK,CAAC;AAErB,UAAID,KAAgBC,EAAK,CAAC;AACxB,YAAIlC,MAAa,UAAa,EAAEtF,KAAOP;AACrC,iBAAO;AAAA,aAEJ;AACL,YAAIyC,IAAQ,IAAIwD;AAChB,YAAI1D;AACF,cAAIQ,IAASR,EAAWsD,GAAUmC,GAAUzH,GAAKP,GAAQ4H,GAAQnF,CAAK;AAExE,YAAI,EAAEM,MAAW,SACT0E,EAAYO,GAAUnC,GAAU3D,IAAuBC,GAAwBI,GAAYE,CAAK,IAChGM;AAEN,iBAAO;AAAA,MAEf;AAAA,IACA;AACE,WAAO;AAAA,EACT;AAEA,SAAAkF,KAAiBN;;;;;;AC7DjB,MAAIO,IAAWzH,GAAqB;AAUpC,WAAS0H,EAAmBjH,GAAO;AACjC,WAAOA,MAAUA,KAAS,CAACgH,EAAShH,CAAK;AAAA,EAC3C;AAEA,SAAAkH,KAAiBD;;;;;;ACdjB,MAAIA,IAAqB1H,GAAgC,GACrDG,IAAOC,GAAiB;AAS5B,WAASwH,EAAarI,GAAQ;AAI5B,aAHI+C,IAASnC,EAAKZ,CAAM,GACpBM,IAASyC,EAAO,QAEbzC,OAAU;AACf,UAAIC,IAAMwC,EAAOzC,CAAM,GACnBY,IAAQlB,EAAOO,CAAG;AAEtB,MAAAwC,EAAOzC,CAAM,IAAI,CAACC,GAAKW,GAAOiH,EAAmBjH,CAAK,CAAC;AAAA,IAC3D;AACE,WAAO6B;AAAA,EACT;AAEA,SAAAuF,KAAiBD;;;;;;ACdjB,WAASE,EAAwBhI,GAAKyH,GAAU;AAC9C,WAAO,SAAShI,GAAQ;AACtB,aAAIA,KAAU,OACL,KAEFA,EAAOO,CAAG,MAAMyH,MACpBA,MAAa,UAAczH,KAAO,OAAOP,CAAM;AAAA,IACnD;AAAA,EACH;AAEA,SAAAwI,KAAiBD;;;;;;ACnBjB,MAAIZ,IAAclH,GAAyB,GACvC4H,IAAexH,GAA0B,GACzC0H,IAA0BhH,GAAqC;AASnE,WAASkH,EAAYb,GAAQ;AAC3B,QAAIC,IAAYQ,EAAaT,CAAM;AACnC,WAAIC,EAAU,UAAU,KAAKA,EAAU,CAAC,EAAE,CAAC,IAClCU,EAAwBV,EAAU,CAAC,EAAE,CAAC,GAAGA,EAAU,CAAC,EAAE,CAAC,CAAC,IAE1D,SAAS7H,GAAQ;AACtB,aAAOA,MAAW4H,KAAUD,EAAY3H,GAAQ4H,GAAQC,CAAS;AAAA,IAClE;AAAA,EACH;AAEA,SAAAa,KAAiBD;;;;;;ACrBjB,MAAIE,IAAalI,GAAwB,GACrC+G,IAAe3G,GAAyB,GAGxC6D,IAAY;AAmBhB,WAASkE,EAAS1H,GAAO;AACvB,WAAO,OAAOA,KAAS,YACpBsG,EAAatG,CAAK,KAAKyH,EAAWzH,CAAK,KAAKwD;AAAA,EACjD;AAEA,SAAAmE,KAAiBD;;;;;;AC5BjB,MAAIzC,IAAU1F,EAAoB,GAC9BmI,IAAW/H,GAAqB,GAGhCiI,IAAe,oDACfC,IAAgB;AAUpB,WAASC,EAAM9H,GAAOlB,GAAQ;AAC5B,QAAImG,EAAQjF,CAAK;AACf,aAAO;AAET,QAAI+H,IAAO,OAAO/H;AAClB,WAAI+H,KAAQ,YAAYA,KAAQ,YAAYA,KAAQ,aAChD/H,KAAS,QAAQ0H,EAAS1H,CAAK,IAC1B,KAEF6H,EAAc,KAAK7H,CAAK,KAAK,CAAC4H,EAAa,KAAK5H,CAAK,KACzDlB,KAAU,QAAQkB,KAAS,OAAOlB,CAAM;AAAA,EAC7C;AAEA,SAAAkJ,KAAiBF;;;;;;AC5BjB,MAAI1H,IAAWb,GAAsB,GAGjC0I,IAAkB;AA8CtB,WAASC,EAAQC,GAAMC,GAAU;AAC/B,QAAI,OAAOD,KAAQ,cAAeC,KAAY,QAAQ,OAAOA,KAAY;AACvE,YAAM,IAAI,UAAUH,CAAe;AAErC,QAAII,IAAW,WAAW;AACxB,UAAIC,IAAO,WACPjJ,IAAM+I,IAAWA,EAAS,MAAM,MAAME,CAAI,IAAIA,EAAK,CAAC,GACpDxH,IAAQuH,EAAS;AAErB,UAAIvH,EAAM,IAAIzB,CAAG;AACf,eAAOyB,EAAM,IAAIzB,CAAG;AAEtB,UAAIwC,IAASsG,EAAK,MAAM,MAAMG,CAAI;AAClC,aAAAD,EAAS,QAAQvH,EAAM,IAAIzB,GAAKwC,CAAM,KAAKf,GACpCe;AAAA,IACR;AACD,WAAAwG,EAAS,QAAQ,KAAKH,EAAQ,SAAS9H,MAChCiI;AAAA,EACT;AAGA,SAAAH,EAAQ,QAAQ9H,GAEhBmI,KAAiBL;;;;;;ACxEjB,MAAIA,IAAU3I,GAAoB,GAG9BiJ,IAAmB;AAUvB,WAASC,EAAcN,GAAM;AAC3B,QAAItG,IAASqG,EAAQC,GAAM,SAAS9I,GAAK;AACvC,aAAIyB,EAAM,SAAS0H,KACjB1H,EAAM,MAAO,GAERzB;AAAA,IACX,CAAG,GAEGyB,IAAQe,EAAO;AACnB,WAAOA;AAAA,EACT;AAEA,SAAA6G,KAAiBD;;;;;;ACzBjB,MAAIA,IAAgBlJ,GAA2B,GAG3CoJ,IAAa,oGAGbC,IAAe,YASfC,IAAeJ,EAAc,SAASK,GAAQ;AAChD,QAAIjH,IAAS,CAAE;AACf,WAAIiH,EAAO,WAAW,CAAC,MAAM,MAC3BjH,EAAO,KAAK,EAAE,GAEhBiH,EAAO,QAAQH,GAAY,SAASI,GAAOC,GAAQC,GAAOC,GAAW;AACnE,MAAArH,EAAO,KAAKoH,IAAQC,EAAU,QAAQN,GAAc,IAAI,IAAKI,KAAUD,CAAM;AAAA,IACjF,CAAG,GACMlH;AAAA,EACT,CAAC;AAED,SAAAsH,KAAiBN;;;;;;ACjBjB,WAASO,EAAS1I,GAAO3B,GAAU;AAKjC,aAJIE,IAAQ,IACRG,IAASsB,KAAS,OAAO,IAAIA,EAAM,QACnCmB,IAAS,MAAMzC,CAAM,GAElB,EAAEH,IAAQG;AACf,MAAAyC,EAAO5C,CAAK,IAAIF,EAAS2B,EAAMzB,CAAK,GAAGA,GAAOyB,CAAK;AAErD,WAAOmB;AAAA,EACT;AAEA,SAAAwH,KAAiBD;;;;;;ACpBjB,MAAI1G,IAASnD,GAAoB,GAC7B6J,IAAWzJ,GAAsB,GACjCsF,IAAU5E,EAAoB,GAC9BqH,IAAW7E,GAAqB,GAMhCc,IAAcjB,IAASA,EAAO,YAAY,QAC1C4G,IAAiB3F,IAAcA,EAAY,WAAW;AAU1D,WAAS4F,EAAavJ,GAAO;AAE3B,QAAI,OAAOA,KAAS;AAClB,aAAOA;AAET,QAAIiF,EAAQjF,CAAK;AAEf,aAAOoJ,EAASpJ,GAAOuJ,CAAY,IAAI;AAEzC,QAAI7B,EAAS1H,CAAK;AAChB,aAAOsJ,IAAiBA,EAAe,KAAKtJ,CAAK,IAAI;AAEvD,QAAI6B,IAAU7B,IAAQ;AACtB,WAAQ6B,KAAU,OAAQ,IAAI7B,KAAU,SAAa,OAAO6B;AAAA,EAC9D;AAEA,SAAA2H,KAAiBD;;;;;;ACpCjB,MAAIA,IAAehK,GAA0B;AAuB7C,WAASkK,EAASzJ,GAAO;AACvB,WAAOA,KAAS,OAAO,KAAKuJ,EAAavJ,CAAK;AAAA,EAChD;AAEA,SAAA0J,KAAiBD;;;;;;AC3BjB,MAAIxE,IAAU1F,EAAoB,GAC9BuI,IAAQnI,GAAmB,GAC3BkJ,IAAexI,GAA0B,GACzCoJ,IAAW5G,GAAqB;AAUpC,WAAS8G,EAAS3J,GAAOlB,GAAQ;AAC/B,WAAImG,EAAQjF,CAAK,IACRA,IAEF8H,EAAM9H,GAAOlB,CAAM,IAAI,CAACkB,CAAK,IAAI6I,EAAaY,EAASzJ,CAAK,CAAC;AAAA,EACtE;AAEA,SAAA4J,KAAiBD;;;;;;ACpBjB,MAAIjC,IAAWnI,GAAqB;AAYpC,WAASsK,EAAM7J,GAAO;AACpB,QAAI,OAAOA,KAAS,YAAY0H,EAAS1H,CAAK;AAC5C,aAAOA;AAET,QAAI6B,IAAU7B,IAAQ;AACtB,WAAQ6B,KAAU,OAAQ,IAAI7B,KAAU,SAAa,OAAO6B;AAAA,EAC9D;AAEA,SAAAiI,KAAiBD;;;;;;ACpBjB,MAAIF,IAAWpK,GAAsB,GACjCsK,IAAQlK,GAAmB;AAU/B,WAASoK,EAAQjL,GAAQkL,GAAM;AAC7B,IAAAA,IAAOL,EAASK,GAAMlL,CAAM;AAK5B,aAHIG,IAAQ,GACRG,IAAS4K,EAAK,QAEXlL,KAAU,QAAQG,IAAQG;AAC/B,MAAAN,IAASA,EAAO+K,EAAMG,EAAK/K,GAAO,CAAC,CAAC;AAEtC,WAAQA,KAASA,KAASG,IAAUN,IAAS;AAAA,EAC/C;AAEA,SAAAmL,KAAiBF;;;;;;ACvBjB,MAAIA,IAAUxK,GAAqB;AA2BnC,WAAS2K,EAAIpL,GAAQkL,GAAMG,GAAc;AACvC,QAAItI,IAAS/C,KAAU,OAAO,SAAYiL,EAAQjL,GAAQkL,CAAI;AAC9D,WAAOnI,MAAW,SAAYsI,IAAetI;AAAA,EAC/C;AAEA,SAAAuI,KAAiBF;;;;;;ACxBjB,WAASG,EAAUvL,GAAQO,GAAK;AAC9B,WAAOP,KAAU,QAAQO,KAAO,OAAOP,CAAM;AAAA,EAC/C;AAEA,SAAAwL,KAAiBD;;;;;;ACZjB,MAAIV,IAAWpK,GAAsB,GACjCgL,IAAc5K,GAAwB,GACtCsF,IAAU5E,EAAoB,GAC9BmK,IAAU3H,GAAqB,GAC/B4H,IAAW3H,GAAqB,GAChC+G,IAAQ9G,GAAmB;AAW/B,WAAS2H,EAAQ5L,GAAQkL,GAAMW,GAAS;AACtC,IAAAX,IAAOL,EAASK,GAAMlL,CAAM;AAM5B,aAJIG,IAAQ,IACRG,IAAS4K,EAAK,QACdnI,IAAS,IAEN,EAAE5C,IAAQG,KAAQ;AACvB,UAAIC,IAAMwK,EAAMG,EAAK/K,CAAK,CAAC;AAC3B,UAAI,EAAE4C,IAAS/C,KAAU,QAAQ6L,EAAQ7L,GAAQO,CAAG;AAClD;AAEF,MAAAP,IAASA,EAAOO,CAAG;AAAA,IACvB;AACE,WAAIwC,KAAU,EAAE5C,KAASG,IAChByC,KAETzC,IAASN,KAAU,OAAO,IAAIA,EAAO,QAC9B,CAAC,CAACM,KAAUqL,EAASrL,CAAM,KAAKoL,EAAQnL,GAAKD,CAAM,MACvD6F,EAAQnG,CAAM,KAAKyL,EAAYzL,CAAM;AAAA,EAC1C;AAEA,SAAA8L,KAAiBF;;;;;;ACtCjB,MAAIL,IAAY9K,GAAuB,GACnCmL,IAAU/K,GAAqB;AA4BnC,WAASkL,EAAM/L,GAAQkL,GAAM;AAC3B,WAAOlL,KAAU,QAAQ4L,EAAQ5L,GAAQkL,GAAMK,CAAS;AAAA,EAC1D;AAEA,SAAAS,KAAiBD;;;;;;ACjCjB,MAAItE,IAAchH,GAAyB,GACvC2K,IAAMvK,GAAgB,GACtBkL,IAAQxK,GAAkB,GAC1ByH,IAAQjF,GAAmB,GAC3BoE,IAAqBnE,GAAgC,GACrDuE,IAA0BtE,GAAqC,GAC/D8G,IAAQ1E,GAAmB,GAG3BnE,IAAuB,GACvBC,IAAyB;AAU7B,WAAS8J,EAAoBf,GAAMlD,GAAU;AAC3C,WAAIgB,EAAMkC,CAAI,KAAK/C,EAAmBH,CAAQ,IACrCO,EAAwBwC,EAAMG,CAAI,GAAGlD,CAAQ,IAE/C,SAAShI,GAAQ;AACtB,UAAI6F,IAAWuF,EAAIpL,GAAQkL,CAAI;AAC/B,aAAQrF,MAAa,UAAaA,MAAamC,IAC3C+D,EAAM/L,GAAQkL,CAAI,IAClBzD,EAAYO,GAAUnC,GAAU3D,IAAuBC,CAAsB;AAAA,IAClF;AAAA,EACH;AAEA,SAAA+J,KAAiBD;;;;;;AChBjB,WAASE,EAASjL,GAAO;AACvB,WAAOA;AAAA,EACT;AAEA,SAAAkL,KAAiBD;;;;;;ACbjB,WAASE,EAAa9L,GAAK;AACzB,WAAO,SAASP,GAAQ;AACtB,aAAOA,KAAU,OAAO,SAAYA,EAAOO,CAAG;AAAA,IAC/C;AAAA,EACH;AAEA,SAAA+L,KAAiBD;;;;;;ACbjB,MAAIpB,IAAUxK,GAAqB;AASnC,WAAS8L,EAAiBrB,GAAM;AAC9B,WAAO,SAASlL,GAAQ;AACtB,aAAOiL,EAAQjL,GAAQkL,CAAI;AAAA,IAC5B;AAAA,EACH;AAEA,SAAAsB,KAAiBD;;;;;;ACfjB,MAAIF,IAAe5L,GAA0B,GACzC8L,IAAmB1L,GAA8B,GACjDmI,IAAQzH,GAAmB,GAC3BwJ,IAAQhH,GAAmB;AAwB/B,WAAS0I,EAASvB,GAAM;AACtB,WAAOlC,EAAMkC,CAAI,IAAImB,EAAatB,EAAMG,CAAI,CAAC,IAAIqB,EAAiBrB,CAAI;AAAA,EACxE;AAEA,SAAAwB,KAAiBD;;;;;;AC/BjB,MAAIhE,IAAchI,GAAyB,GACvCwL,IAAsBpL,GAAiC,GACvDsL,IAAW5K,GAAqB,GAChC4E,IAAUpC,EAAoB,GAC9B0I,IAAWzI,GAAqB;AASpC,WAAS2I,EAAazL,GAAO;AAG3B,WAAI,OAAOA,KAAS,aACXA,IAELA,KAAS,OACJiL,IAEL,OAAOjL,KAAS,WACXiF,EAAQjF,CAAK,IAChB+K,EAAoB/K,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC,IACtCuH,EAAYvH,CAAK,IAEhBuL,EAASvL,CAAK;AAAA,EACvB;AAEA,SAAA0L,KAAiBD;;;;;;AC9BjB,MAAIE,IAAkBpM,GAA6B,GAC/CK,IAAaD,GAAwB,GACrC8L,IAAepL,GAA0B;AA8B7C,WAASuL,EAAU9M,GAAQC,GAAU;AACnC,QAAI8C,IAAS,CAAE;AACf,WAAA9C,IAAW0M,EAAa1M,GAAU,CAAC,GAEnCa,EAAWd,GAAQ,SAASkB,GAAOX,GAAKP,GAAQ;AAC9C,MAAA6M,EAAgB9J,GAAQxC,GAAKN,EAASiB,GAAOX,GAAKP,CAAM,CAAC;AAAA,IAC7D,CAAG,GACM+C;AAAA,EACT;AAEA,SAAAgK,KAAiBD;;ACrCjB,MAAME,KAA4B;AAAA,EAC9B,IAAI;AAAA,IACA,GAAG,MAAM;AAAA,IACT,IAAI,MAAM;AAAA,IACV,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,IAAI,MAAM;AAAA,EACd;AAAA,EACA,IAAI;AAAA,IACA,GAAG,MAAM;AAAA,IACT,IAAI,MAAM;AAAA,IACV,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,IAAI,MAAM;AAAA,EAAA;AAElB,GAEaC,KAA0B,cAC1BC,KAAuB,YAGvBC,KAAa,CAACC,MAAgBA,EAAI,OAAO,CAAC,EAAE,gBAAgBA,EAAI,MAAM,CAAC,GAEvEC,KAAa,CAACC,GAAoBC,MAAmB;;AACpD,QAAAC,KAAgBC,IAAAC,SAAA,gBAAAD,EAAsB,WAAW,OAAO,iBAAiB,UAAU,UACnFE,KAAiBC,IAAAF,SAAA,gBAAAE,EAAsB,WAAW,OAAO,iBAAiB,QAAQN,GAAY,OAAOE;AACvG,MAAAK;AACJ,SAAIN,MAAW,QACPM,IAAA,4BAEJA,IAAIN,KAAU,aAAa,QAAQN,EAAuB,KAAK,QAG5DU,EACF,GAAG,aAAa,QAAQT,EAAoB,KAAKY,GAAS,GAAG,MAAM,CAAC,EACpE,OAAOD,CAAC;AACjB;AAEY,SAAAE,GAAWX,GAAaY,GAAmB;AAChD,SAAAZ,EAAI,MAAMY,CAAS,EAAE,MAAM,CAAC,EAAE,KAAKA,CAAS;AACvD;AAEO,SAASC,GAASC,GAAmB;AACxC,SACIC,GAAO,SAASD,GAAWC,GAAO,QAAe,EAAE,mBAAmB;AAE9E;AAEgB,SAAAC,GACZlN,GACAmN,GACF;AACY,SAAAA,IAAAA,KAAW,EAAC,kBAAkB,EAAC,GACzCA,EAAQ,SAAS,IACjBA,EAAQ,WAAW,aAAa,QAAQ,MAAM,KAAK,MACnDA,EAAQ,YAAYrB,IACpBqB,EAAQ,UAAU,GAEd,OAAOnN,KAAU,aACjBA,IAAQ+M,GAAS/M,CAAK,IAGnBoN,GAAiBpN,IAAQ,KAAMmN,CAAO,EAAE;AAAA,IAC3C;AAAA,IACA;AAAA,EACJ;AACJ;AAEO,SAASE,GAAanB,GAAa;AACtC,SAAOA,EAAI,MAAM,GAAG,EAAE,IAAI;AAC9B;AAEgB,SAAAoB,GAAetN,GAAYf,GAAeyB,GAAc;AAC7D,SAAAA,EAAM,QAAQV,CAAK,MAAMf;AACpC;AAEA,MAAesO,KAAA;AAAA,EACX,YAAAtB;AAAA,EACA,YAAAE;AAAA,EACA,YAAAU;AAAA,EACA,UAAAE;AAAA,EACA,eAAAG;AAAA,EACA,cAAAG;AAAA,EACA,gBAAAC;AACJ;;;;;;;;AC/FA,MAAIE,IAAYjO,GAAuB,GAGnCkO,IAAqB;AA4BzB,WAASC,EAAM1N,GAAO;AACpB,WAAOwN,EAAUxN,GAAOyN,CAAkB;AAAA,EAC5C;AAEA,SAAAE,KAAiBD;;;;;;AChBjB,WAASE,EAAS5N,GAAO;AACvB,WAAO,WAAW;AAChB,aAAOA;AAAA,IACR;AAAA,EACH;AAEA,SAAA6N,KAAiBD;;;;;;ACzBjB,MAAIE,IAAcvO,GAAwB;AAU1C,WAASwO,EAAeC,GAAUnP,GAAW;AAC3C,WAAO,SAASoP,GAAYlP,GAAU;AACpC,UAAIkP,KAAc;AAChB,eAAOA;AAET,UAAI,CAACH,EAAYG,CAAU;AACzB,eAAOD,EAASC,GAAYlP,CAAQ;AAMtC,eAJIK,IAAS6O,EAAW,QACpBhP,IAAQJ,IAAYO,IAAS,IAC7BF,IAAW,OAAO+O,CAAU,IAExBpP,IAAYI,MAAU,EAAEA,IAAQG,MAClCL,EAASG,EAASD,CAAK,GAAGA,GAAOC,CAAQ,MAAM;AAAnD;AAIF,aAAO+O;AAAA,IACR;AAAA,EACH;AAEA,SAAAC,KAAiBH;;;;;;AC/BjB,MAAInO,IAAaL,GAAwB,GACrCwO,IAAiBpO,GAA4B,GAU7CwO,IAAWJ,EAAenO,CAAU;AAExC,SAAAwO,KAAiBD;;;;;;ACbjB,MAAIlD,IAAW1L,GAAqB;AASpC,WAAS8O,EAAarO,GAAO;AAC3B,WAAO,OAAOA,KAAS,aAAaA,IAAQiL;AAAA,EAC9C;AAEA,SAAAqD,KAAiBD;;;;;;ACbjB,MAAIE,IAAYhP,GAAuB,GACnC4O,IAAWxO,GAAsB,GACjC0O,IAAehO,GAA0B,GACzC4E,IAAUpC,EAAoB;AAgClC,WAAS2L,EAAQP,GAAYlP,GAAU;AACrC,QAAIoJ,IAAOlD,EAAQgJ,CAAU,IAAIM,IAAYJ;AAC7C,WAAOhG,EAAK8F,GAAYI,EAAatP,CAAQ,CAAC;AAAA,EAChD;AAEA,SAAA0P,KAAiBD;;;;wBCxCjBE,KAAiBnP,GAAoB;;;;;;ACArC,MAAI4O,IAAW5O,GAAsB;AAUrC,WAASoP,EAAWV,GAAYtN,GAAW;AACzC,QAAIkB,IAAS,CAAE;AACf,WAAAsM,EAASF,GAAY,SAASjO,GAAOf,GAAOgP,GAAY;AACtD,MAAItN,EAAUX,GAAOf,GAAOgP,CAAU,KACpCpM,EAAO,KAAK7B,CAAK;AAAA,IAEvB,CAAG,GACM6B;AAAA,EACT;AAEA,SAAA+M,KAAiBD;;;;;;ACpBjB,MAAIE,IAActP,GAAyB,GACvCoP,IAAahP,GAAwB,GACrC8L,IAAepL,GAA0B,GACzC4E,IAAUpC,EAAoB;AA2ClC,WAASiM,EAAOb,GAAYtN,GAAW;AACrC,QAAIwH,IAAOlD,EAAQgJ,CAAU,IAAIY,IAAcF;AAC/C,WAAOxG,EAAK8F,GAAYxC,EAAa9K,GAAW,CAAC,CAAC;AAAA,EACpD;AAEA,SAAAoO,KAAiBD;;;;;;AClDjB,MAAI3K,IAAc,OAAO,WAGrBC,IAAiBD,EAAY;AAUjC,WAAS6K,EAAQlQ,GAAQO,GAAK;AAC5B,WAAOP,KAAU,QAAQsF,EAAe,KAAKtF,GAAQO,CAAG;AAAA,EAC1D;AAEA,SAAA4P,KAAiBD;;;;;;AClBjB,MAAIA,IAAUzP,GAAqB,GAC/BmL,IAAU/K,GAAqB;AA6BnC,WAASuP,EAAIpQ,GAAQkL,GAAM;AACzB,WAAOlL,KAAU,QAAQ4L,EAAQ5L,GAAQkL,GAAMgF,CAAO;AAAA,EACxD;AAEA,SAAAG,KAAiBD;;;;;;AClCjB,MAAIE,IAAW7P,GAAsB,GACjCyF,IAASrF,GAAoB,GAC7B4K,IAAclK,GAAwB,GACtC4E,IAAUpC,EAAoB,GAC9BiL,IAAchL,GAAwB,GACtCoC,IAAWnC,GAAqB,GAChCsM,IAAclK,GAAyB,GACvCC,IAAeC,GAAyB,GAGxClC,IAAS,gBACTG,IAAS,gBAGTa,IAAc,OAAO,WAGrBC,IAAiBD,EAAY;AAmCjC,WAASmL,EAAQtP,GAAO;AACtB,QAAIA,KAAS;AACX,aAAO;AAET,QAAI8N,EAAY9N,CAAK,MAChBiF,EAAQjF,CAAK,KAAK,OAAOA,KAAS,YAAY,OAAOA,EAAM,UAAU,cACpEkF,EAASlF,CAAK,KAAKoF,EAAapF,CAAK,KAAKuK,EAAYvK,CAAK;AAC/D,aAAO,CAACA,EAAM;AAEhB,QAAI8D,IAAMkB,EAAOhF,CAAK;AACtB,QAAI8D,KAAOX,KAAUW,KAAOR;AAC1B,aAAO,CAACtD,EAAM;AAEhB,QAAIqP,EAAYrP,CAAK;AACnB,aAAO,CAACoP,EAASpP,CAAK,EAAE;AAE1B,aAASX,KAAOW;AACd,UAAIoE,EAAe,KAAKpE,GAAOX,CAAG;AAChC,eAAO;AAGX,WAAO;AAAA,EACT;AAEA,SAAAkQ,KAAiBD;;;;;;AC3DjB,WAASE,EAAYxP,GAAO;AAC1B,WAAOA,MAAU;AAAA,EACnB;AAEA,SAAAyP,KAAiBD;;;;;;ACrBjB,MAAIrB,IAAW5O,GAAsB,GACjCuO,IAAcnO,GAAwB;AAU1C,WAAS+P,EAAQzB,GAAYlP,GAAU;AACrC,QAAIE,IAAQ,IACR4C,IAASiM,EAAYG,CAAU,IAAI,MAAMA,EAAW,MAAM,IAAI,CAAE;AAEpE,WAAAE,EAASF,GAAY,SAASjO,GAAOX,GAAK4O,GAAY;AACpD,MAAApM,EAAO,EAAE5C,CAAK,IAAIF,EAASiB,GAAOX,GAAK4O,CAAU;AAAA,IACrD,CAAG,GACMpM;AAAA,EACT;AAEA,SAAA8N,KAAiBD;;;;;;ACrBjB,MAAItG,IAAW7J,GAAsB,GACjCkM,IAAe9L,GAA0B,GACzC+P,IAAUrP,GAAqB,GAC/B4E,IAAUpC,EAAoB;AA4ClC,WAASR,EAAI4L,GAAYlP,GAAU;AACjC,QAAIoJ,IAAOlD,EAAQgJ,CAAU,IAAI7E,IAAWsG;AAC5C,WAAOvH,EAAK8F,GAAYxC,EAAa1M,GAAU,CAAC,CAAC;AAAA,EACnD;AAEA,SAAA6Q,KAAiBvN;;;;;;ACxCjB,WAASwN,EAAYnP,GAAO3B,GAAU+Q,GAAaC,GAAW;AAC5D,QAAI9Q,IAAQ,IACRG,IAASsB,KAAS,OAAO,IAAIA,EAAM;AAKvC,SAHIqP,KAAa3Q,MACf0Q,IAAcpP,EAAM,EAAEzB,CAAK,IAEtB,EAAEA,IAAQG;AACf,MAAA0Q,IAAc/Q,EAAS+Q,GAAapP,EAAMzB,CAAK,GAAGA,GAAOyB,CAAK;AAEhE,WAAOoP;AAAA,EACT;AAEA,SAAAE,KAAiBH;;;;;;ACZjB,WAASI,EAAWhC,GAAYlP,GAAU+Q,GAAaC,GAAW/B,GAAU;AAC1E,WAAAA,EAASC,GAAY,SAASjO,GAAOf,GAAOgP,GAAY;AACtD,MAAA6B,IAAcC,KACTA,IAAY,IAAO/P,KACpBjB,EAAS+Q,GAAa9P,GAAOf,GAAOgP,CAAU;AAAA,IACtD,CAAG,GACM6B;AAAA,EACT;AAEA,SAAAI,KAAiBD;;;;;;ACtBjB,MAAIJ,IAActQ,GAAyB,GACvC4O,IAAWxO,GAAsB,GACjC8L,IAAepL,GAA0B,GACzC4P,IAAapN,GAAwB,GACrCoC,IAAUnC,EAAoB;AAuClC,WAASqN,EAAOlC,GAAYlP,GAAU+Q,GAAa;AACjD,QAAI3H,IAAOlD,EAAQgJ,CAAU,IAAI4B,IAAcI,GAC3CF,IAAY,UAAU,SAAS;AAEnC,WAAO5H,EAAK8F,GAAYxC,EAAa1M,GAAU,CAAC,GAAG+Q,GAAaC,GAAW5B,CAAQ;AAAA,EACrF;AAEA,SAAAiC,KAAiBD;;;;;;AClDjB,MAAI1I,IAAalI,GAAwB,GACrC0F,IAAUtF,EAAoB,GAC9B2G,IAAejG,GAAyB,GAGxCkD,IAAY;AAmBhB,WAAS8M,EAASrQ,GAAO;AACvB,WAAO,OAAOA,KAAS,YACpB,CAACiF,EAAQjF,CAAK,KAAKsG,EAAatG,CAAK,KAAKyH,EAAWzH,CAAK,KAAKuD;AAAA,EACpE;AAEA,SAAA+M,KAAiBD;;;;;;AC7BjB,MAAIlF,IAAe5L,GAA0B,GASzCgR,IAAYpF,EAAa,QAAQ;AAErC,SAAAqF,KAAiBD;;;;;;ACVjB,MAAIE,IAAgB,mBAChBC,IAAoB,mBACpBC,IAAwB,mBACxBC,IAAsB,mBACtBC,IAAeH,IAAoBC,IAAwBC,GAC3DE,IAAa,kBAGbC,IAAQ,WAGRC,IAAe,OAAO,MAAMD,IAAQN,IAAiBI,IAAeC,IAAa,GAAG;AASxF,WAASG,EAAWnI,GAAQ;AAC1B,WAAOkI,EAAa,KAAKlI,CAAM;AAAA,EACjC;AAEA,SAAAoI,KAAiBD;;;;;;ACxBjB,MAAIR,IAAgB,mBAChBC,IAAoB,mBACpBC,IAAwB,mBACxBC,IAAsB,mBACtBC,IAAeH,IAAoBC,IAAwBC,GAC3DE,IAAa,kBAGbK,IAAW,MAAMV,IAAgB,KACjCW,IAAU,MAAMP,IAAe,KAC/BQ,IAAS,4BACTC,IAAa,QAAQF,IAAU,MAAMC,IAAS,KAC9CE,IAAc,OAAOd,IAAgB,KACrCe,IAAa,mCACbC,IAAa,sCACbV,IAAQ,WAGRW,IAAWJ,IAAa,KACxBK,IAAW,MAAMb,IAAa,MAC9Bc,IAAY,QAAQb,IAAQ,QAAQ,CAACQ,GAAaC,GAAYC,CAAU,EAAE,KAAK,GAAG,IAAI,MAAME,IAAWD,IAAW,MAClHG,IAAQF,IAAWD,IAAWE,GAC9BE,IAAW,QAAQ,CAACP,IAAcH,IAAU,KAAKA,GAASI,GAAYC,GAAYN,CAAQ,EAAE,KAAK,GAAG,IAAI,KAGxGY,IAAY,OAAOV,IAAS,QAAQA,IAAS,OAAOS,IAAWD,GAAO,GAAG;AAS7E,WAASG,EAAYlJ,GAAQ;AAE3B,aADIjH,IAASkQ,EAAU,YAAY,GAC5BA,EAAU,KAAKjJ,CAAM;AAC1B,QAAEjH;AAEJ,WAAOA;AAAA,EACT;AAEA,SAAAoQ,KAAiBD;;;;;;AC3CjB,MAAIzB,IAAYhR,GAAuB,GACnC0R,IAAatR,GAAwB,GACrCqS,IAAc3R,GAAyB;AAS3C,WAAS6R,EAAWpJ,GAAQ;AAC1B,WAAOmI,EAAWnI,CAAM,IACpBkJ,EAAYlJ,CAAM,IAClByH,EAAUzH,CAAM;AAAA,EACtB;AAEA,SAAAqJ,KAAiBD;;;;;;ACjBjB,MAAI9C,IAAW7P,GAAsB,GACjCyF,IAASrF,GAAoB,GAC7BmO,IAAczN,GAAwB,GACtCgQ,IAAWxN,GAAqB,GAChCqP,IAAapP,GAAwB,GAGrCK,IAAS,gBACTG,IAAS;AAuBb,WAAS8O,EAAKnE,GAAY;AACxB,QAAIA,KAAc;AAChB,aAAO;AAET,QAAIH,EAAYG,CAAU;AACxB,aAAOoC,EAASpC,CAAU,IAAIiE,EAAWjE,CAAU,IAAIA,EAAW;AAEpE,QAAInK,IAAMkB,EAAOiJ,CAAU;AAC3B,WAAInK,KAAOX,KAAUW,KAAOR,IACnB2K,EAAW,OAEbmB,EAASnB,CAAU,EAAE;AAAA,EAC9B;AAEA,SAAAoE,KAAiBD;;;;;;AC7CjB,MAAI7D,IAAYhP,GAAuB,GACnC+S,IAAa3S,GAAwB,GACrCC,IAAaS,GAAwB,GACrCoL,IAAe5I,GAA0B,GACzC0P,IAAezP,GAA0B,GACzCmC,IAAUlC,EAAoB,GAC9BmC,IAAWC,GAAqB,GAChCqN,IAAanN,GAAuB,GACpC2B,IAAWyL,GAAqB,GAChCrN,IAAesN,GAAyB;AAgC5C,WAASC,EAAU7T,GAAQC,GAAU+Q,GAAa;AAChD,QAAI8C,IAAQ3N,EAAQnG,CAAM,GACtB+T,IAAYD,KAAS1N,EAASpG,CAAM,KAAKsG,EAAatG,CAAM;AAGhE,QADAC,IAAW0M,EAAa1M,GAAU,CAAC,GAC/B+Q,KAAe,MAAM;AACvB,UAAIgD,IAAOhU,KAAUA,EAAO;AAC5B,MAAI+T,IACF/C,IAAc8C,IAAQ,IAAIE,MAAO,CAAE,IAE5B9L,EAASlI,CAAM,IACtBgR,IAAc0C,EAAWM,CAAI,IAAIR,EAAWC,EAAazT,CAAM,CAAC,IAAI,CAAE,IAGtEgR,IAAc,CAAE;AAAA,IAEtB;AACE,YAAC+C,IAAYtE,IAAY3O,GAAYd,GAAQ,SAASkB,GAAOf,GAAOH,GAAQ;AAC1E,aAAOC,EAAS+Q,GAAa9P,GAAOf,GAAOH,CAAM;AAAA,IACrD,CAAG,GACMgR;AAAA,EACT;AAEA,SAAAiD,KAAiBJ;;;;;;AChEjB,MAAIjQ,IAASnD,GAAoB,GAC7BgL,IAAc5K,GAAwB,GACtCsF,IAAU5E,EAAoB,GAG9B2S,IAAmBtQ,IAASA,EAAO,qBAAqB;AAS5D,WAASuQ,EAAcjT,GAAO;AAC5B,WAAOiF,EAAQjF,CAAK,KAAKuK,EAAYvK,CAAK,KACxC,CAAC,EAAEgT,KAAoBhT,KAASA,EAAMgT,CAAgB;AAAA,EAC1D;AAEA,SAAAE,KAAiBD;;;;;;ACnBjB,MAAIE,IAAY5T,GAAuB,GACnC0T,IAAgBtT,GAA2B;AAa/C,WAASyT,EAAY1S,GAAO2S,GAAO1S,GAAW2S,GAAUzR,GAAQ;AAC9D,QAAI5C,IAAQ,IACRG,IAASsB,EAAM;AAKnB,SAHAC,MAAcA,IAAYsS,IAC1BpR,MAAWA,IAAS,KAEb,EAAE5C,IAAQG,KAAQ;AACvB,UAAIY,IAAQU,EAAMzB,CAAK;AACvB,MAAIoU,IAAQ,KAAK1S,EAAUX,CAAK,IAC1BqT,IAAQ,IAEVD,EAAYpT,GAAOqT,IAAQ,GAAG1S,GAAW2S,GAAUzR,CAAM,IAEzDsR,EAAUtR,GAAQ7B,CAAK,IAEfsT,MACVzR,EAAOA,EAAO,MAAM,IAAI7B;AAAA,IAE9B;AACE,WAAO6B;AAAA,EACT;AAEA,SAAA0R,KAAiBH;;;;;;AC3BjB,WAASI,EAAMrL,GAAMsL,GAASnL,GAAM;AAClC,YAAQA,EAAK,QAAM;AAAA,MACjB,KAAK;AAAG,eAAOH,EAAK,KAAKsL,CAAO;AAAA,MAChC,KAAK;AAAG,eAAOtL,EAAK,KAAKsL,GAASnL,EAAK,CAAC,CAAC;AAAA,MACzC,KAAK;AAAG,eAAOH,EAAK,KAAKsL,GAASnL,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,MAClD,KAAK;AAAG,eAAOH,EAAK,KAAKsL,GAASnL,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,IAC/D;AACE,WAAOH,EAAK,MAAMsL,GAASnL,CAAI;AAAA,EACjC;AAEA,SAAAoL,KAAiBF;;;;;;ACpBjB,MAAIA,IAAQjU,GAAmB,GAG3BoU,IAAY,KAAK;AAWrB,WAASC,EAASzL,GAAM0L,GAAOlB,GAAW;AACxC,WAAAkB,IAAQF,EAAUE,MAAU,SAAa1L,EAAK,SAAS,IAAK0L,GAAO,CAAC,GAC7D,WAAW;AAMhB,eALIvL,IAAO,WACPrJ,IAAQ,IACRG,IAASuU,EAAUrL,EAAK,SAASuL,GAAO,CAAC,GACzCnT,IAAQ,MAAMtB,CAAM,GAEjB,EAAEH,IAAQG;AACf,QAAAsB,EAAMzB,CAAK,IAAIqJ,EAAKuL,IAAQ5U,CAAK;AAEnC,MAAAA,IAAQ;AAER,eADI6U,IAAY,MAAMD,IAAQ,CAAC,GACxB,EAAE5U,IAAQ4U;AACf,QAAAC,EAAU7U,CAAK,IAAIqJ,EAAKrJ,CAAK;AAE/B,aAAA6U,EAAUD,CAAK,IAAIlB,EAAUjS,CAAK,GAC3B8S,EAAMrL,GAAM,MAAM2L,CAAS;AAAA,IACnC;AAAA,EACH;AAEA,SAAAC,KAAiBH;;;;;;ACnCjB,MAAIhG,IAAWrO,GAAqB,GAChCyU,IAAiBrU,GAA4B,GAC7CsL,IAAW5K,GAAqB,GAUhC4T,IAAmBD,IAA4B,SAAS7L,GAAMW,GAAQ;AACxE,WAAOkL,EAAe7L,GAAM,YAAY;AAAA,MACtC,cAAgB;AAAA,MAChB,YAAc;AAAA,MACd,OAASyF,EAAS9E,CAAM;AAAA,MACxB,UAAY;AAAA,IAChB,CAAG;AAAA,EACF,IAPuCmC;AASxC,SAAAiJ,KAAiBD;;;;;;ACpBjB,MAAIE,IAAY,KACZC,IAAW,IAGXC,IAAY,KAAK;AAWrB,WAASC,EAASnM,GAAM;AACtB,QAAIoM,IAAQ,GACRC,IAAa;AAEjB,WAAO,WAAW;AAChB,UAAIC,IAAQJ,EAAW,GACnBK,IAAYN,KAAYK,IAAQD;AAGpC,UADAA,IAAaC,GACTC,IAAY;AACd,YAAI,EAAEH,KAASJ;AACb,iBAAO,UAAU,CAAC;AAAA;AAGpB,QAAAI,IAAQ;AAEV,aAAOpM,EAAK,MAAM,QAAW,SAAS;AAAA,IACvC;AAAA,EACH;AAEA,SAAAwM,KAAiBL;;;;;;ACpCjB,MAAIL,IAAkB1U,GAA6B,GAC/C+U,IAAW3U,GAAsB,GAUjCiV,IAAcN,EAASL,CAAe;AAE1C,SAAAY,KAAiBD;;;;;;ACbjB,MAAI3J,IAAW1L,GAAqB,GAChCqU,IAAWjU,GAAsB,GACjCiV,IAAcvU,GAAyB;AAU3C,WAASyU,EAAS3M,GAAM0L,GAAO;AAC7B,WAAOe,EAAYhB,EAASzL,GAAM0L,GAAO5I,CAAQ,GAAG9C,IAAO,EAAE;AAAA,EAC/D;AAEA,SAAA4M,KAAiBD;;;;;;ACLjB,WAASE,EAActU,GAAOC,GAAWsU,GAAWpW,GAAW;AAI7D,aAHIO,IAASsB,EAAM,QACfzB,IAAQgW,KAAapW,IAAY,IAAI,KAEjCA,IAAYI,MAAU,EAAEA,IAAQG;AACtC,UAAIuB,EAAUD,EAAMzB,CAAK,GAAGA,GAAOyB,CAAK;AACtC,eAAOzB;AAGX,WAAO;AAAA,EACT;AAEA,SAAAiW,KAAiBF;;;;;;AChBjB,WAASG,EAAUnV,GAAO;AACxB,WAAOA,MAAUA;AAAA,EACnB;AAEA,SAAAoV,KAAiBD;;;;;;ACDjB,WAASE,EAAc3U,GAAOV,GAAOiV,GAAW;AAI9C,aAHIhW,IAAQgW,IAAY,GACpB7V,IAASsB,EAAM,QAEZ,EAAEzB,IAAQG;AACf,UAAIsB,EAAMzB,CAAK,MAAMe;AACnB,eAAOf;AAGX,WAAO;AAAA,EACT;AAEA,SAAAqW,KAAiBD;;;;;;ACtBjB,MAAIL,IAAgBzV,GAA2B,GAC3C4V,IAAYxV,GAAuB,GACnC0V,IAAgBhV,GAA2B;AAW/C,WAASkV,EAAY7U,GAAOV,GAAOiV,GAAW;AAC5C,WAAOjV,MAAUA,IACbqV,EAAc3U,GAAOV,GAAOiV,CAAS,IACrCD,EAActU,GAAOyU,GAAWF,CAAS;AAAA,EAC/C;AAEA,SAAAO,KAAiBD;;;;;;ACnBjB,MAAIA,IAAchW,GAAyB;AAW3C,WAASkW,EAAc/U,GAAOV,GAAO;AACnC,QAAIZ,IAASsB,KAAS,OAAO,IAAIA,EAAM;AACvC,WAAO,CAAC,CAACtB,KAAUmW,EAAY7U,GAAOV,GAAO,CAAC,IAAI;AAAA,EACpD;AAEA,SAAA0V,KAAiBD;;;;;;ACPjB,WAASE,EAAkBjV,GAAOV,GAAO4V,GAAY;AAInD,aAHI3W,IAAQ,IACRG,IAASsB,KAAS,OAAO,IAAIA,EAAM,QAEhC,EAAEzB,IAAQG;AACf,UAAIwW,EAAW5V,GAAOU,EAAMzB,CAAK,CAAC;AAChC,eAAO;AAGX,WAAO;AAAA,EACT;AAEA,SAAA4W,KAAiBF;;;;;;ACTjB,WAASG,IAAO;AAAA,EAEhB;AAEA,SAAAC,KAAiBD;;;;;;AChBjB,MAAIE,IAAMzW,GAAiB,GACvBuW,IAAOnW,GAAiB,GACxB4C,IAAalC,GAAwB,GAGrC4V,IAAW,OASXC,IAAcF,KAAQ,IAAIzT,EAAW,IAAIyT,EAAI,CAAA,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAMC,IAAmB,SAAS1V,GAAQ;AAClG,WAAO,IAAIyV,EAAIzV,CAAM;AAAA,EACtB,IAF2EuV;AAI5E,SAAAK,KAAiBD;;;;;;AClBjB,MAAI5V,IAAWf,GAAsB,GACjCkW,IAAgB9V,GAA2B,GAC3CgW,IAAoBtV,GAA+B,GACnDQ,IAAWgC,GAAsB,GACjCqT,IAAYpT,GAAuB,GACnCP,IAAaQ,GAAwB,GAGrCqT,IAAmB;AAWvB,WAASC,EAAS3V,GAAO3B,GAAU6W,GAAY;AAC7C,QAAI3W,IAAQ,IACRqX,IAAWb,GACXrW,IAASsB,EAAM,QACf6V,IAAW,IACX1U,IAAS,CAAE,GACXC,IAAOD;AAEX,QAAI+T;AACF,MAAAW,IAAW,IACXD,IAAWX;AAAA,aAEJvW,KAAUgX,GAAkB;AACnC,UAAI5T,IAAMzD,IAAW,OAAOmX,EAAUxV,CAAK;AAC3C,UAAI8B;AACF,eAAOD,EAAWC,CAAG;AAEvB,MAAA+T,IAAW,IACXD,IAAWzV,GACXiB,IAAO,IAAIxB;AAAA,IACf;AAEI,MAAAwB,IAAO/C,IAAW,CAAA,IAAK8C;AAEzB,IAAA2U;AACA,aAAO,EAAEvX,IAAQG,KAAQ;AACvB,YAAIY,IAAQU,EAAMzB,CAAK,GACnBwX,IAAW1X,IAAWA,EAASiB,CAAK,IAAIA;AAG5C,YADAA,IAAS4V,KAAc5V,MAAU,IAAKA,IAAQ,GAC1CuW,KAAYE,MAAaA,GAAU;AAErC,mBADIC,IAAY5U,EAAK,QACd4U;AACL,gBAAI5U,EAAK4U,CAAS,MAAMD;AACtB,uBAASD;AAGb,UAAIzX,KACF+C,EAAK,KAAK2U,CAAQ,GAEpB5U,EAAO,KAAK7B,CAAK;AAAA,QACvB,MACS,CAAKsW,EAASxU,GAAM2U,GAAUb,CAAU,MACvC9T,MAASD,KACXC,EAAK,KAAK2U,CAAQ,GAEpB5U,EAAO,KAAK7B,CAAK;AAAA,MAEvB;AACE,WAAO6B;AAAA,EACT;AAEA,SAAA8U,KAAiBN;;;;;;ACvEjB,MAAIvI,IAAcvO,GAAwB,GACtC+G,IAAe3G,GAAyB;AA2B5C,WAASiX,EAAkB5W,GAAO;AAChC,WAAOsG,EAAatG,CAAK,KAAK8N,EAAY9N,CAAK;AAAA,EACjD;AAEA,SAAA6W,KAAiBD;;;;;;AChCjB,MAAIxD,IAAc7T,GAAyB,GACvCuV,IAAWnV,GAAsB,GACjC0W,IAAWhW,GAAsB,GACjCuW,IAAoB/T,GAA8B,GAkBlDiU,IAAQhC,EAAS,SAASiC,GAAQ;AACpC,WAAOV,EAASjD,EAAY2D,GAAQ,GAAGH,GAAmB,EAAI,CAAC;AAAA,EACjE,CAAC;AAED,SAAAI,KAAiBF;;;;;;ACzBjB,MAAI1N,IAAW7J,GAAsB;AAYrC,WAAS0X,EAAWnY,GAAQK,GAAO;AACjC,WAAOiK,EAASjK,GAAO,SAASE,GAAK;AACnC,aAAOP,EAAOO,CAAG;AAAA,IACrB,CAAG;AAAA,EACH;AAEA,SAAA6X,KAAiBD;;;;;;AClBjB,MAAIA,IAAa1X,GAAwB,GACrCG,IAAOC,GAAiB;AA4B5B,WAASY,EAAOzB,GAAQ;AACtB,WAAOA,KAAU,OAAO,CAAE,IAAGmY,EAAWnY,GAAQY,EAAKZ,CAAM,CAAC;AAAA,EAC9D;AAEA,SAAAqY,KAAiB5W;;;;;;AC/BjB,MAAI6W;AAEJ,MAAI,OAAOC,MAAY;AACrB,QAAI;AACF,MAAAD,IAAS;AAAA,QACP,OAAO7X,GAAuB;AAAA,QAC9B,UAAUI,GAA0B;AAAA,QACpC,MAAMU,GAAsB;AAAA,QAC5B,QAAQwC,GAAwB;AAAA,QAChC,KAAMC,GAAqB;AAAA,QAC3B,SAASC,EAAyB;AAAA,QAClC,SAASoC,GAAyB;AAAA,QAClC,YAAYE,GAA4B;AAAA,QACxC,aAAaoN,GAA6B;AAAA,QAC1C,MAAMC,GAAsB;AAAA,QAC5B,KAAK4E,GAAqB;AAAA,QAC1B,QAAQC,GAAwB;AAAA,QAChC,MAAMC,GAAsB;AAAA,QAC5B,WAAWC,GAA2B;AAAA,QACtC,OAAOC,GAAuB;AAAA,QAC9B,QAAQC,GAAA;AAAA,MACT;AAAA,IACF,QAAW;AAAA,IAEd;AAGA,SAAKP,MACHA,IAAS,OAAO,IAGlBQ,KAAiBR;;;;;;AC/BjB,MAAIS,IAAItY,EAAmB;AAE3B,EAAAuY,KAAiBC;AAEjB,MAAIC,IAAoB,MACpBC,IAAa,MACbC,IAAiB;AAYrB,WAASH,EAAMI,GAAM;AACnB,SAAK,cAAcN,EAAE,IAAIM,GAAM,UAAU,IAAIA,EAAK,WAAW,IAC7D,KAAK,gBAAgBN,EAAE,IAAIM,GAAM,YAAY,IAAIA,EAAK,aAAa,IACnE,KAAK,cAAcN,EAAE,IAAIM,GAAM,UAAU,IAAIA,EAAK,WAAW,IAG7D,KAAK,SAAS,QAGd,KAAK,sBAAsBN,EAAE,SAAS,MAAS,GAG/C,KAAK,sBAAsBA,EAAE,SAAS,MAAS,GAG/C,KAAK,SAAS,CAAE,GAEZ,KAAK,gBAEP,KAAK,UAAU,CAAE,GAGjB,KAAK,YAAY,CAAE,GACnB,KAAK,UAAUI,CAAU,IAAI,CAAE,IAIjC,KAAK,MAAM,CAAE,GAGb,KAAK,SAAS,CAAE,GAGhB,KAAK,OAAO,CAAE,GAGd,KAAK,QAAQ,CAAE,GAGf,KAAK,YAAY,CAAE,GAGnB,KAAK,cAAc,CAAE;AAAA,EACvB;AAGA,EAAAF,EAAM,UAAU,aAAa,GAG7BA,EAAM,UAAU,aAAa,GAK7BA,EAAM,UAAU,aAAa,WAAW;AACtC,WAAO,KAAK;AAAA,EACb,GAEDA,EAAM,UAAU,eAAe,WAAW;AACxC,WAAO,KAAK;AAAA,EACb,GAEDA,EAAM,UAAU,aAAa,WAAW;AACtC,WAAO,KAAK;AAAA,EACb,GAEDA,EAAM,UAAU,WAAW,SAASK,GAAO;AACzC,gBAAK,SAASA,GACP;AAAA,EACR,GAEDL,EAAM,UAAU,QAAQ,WAAW;AACjC,WAAO,KAAK;AAAA,EACb,GAKDA,EAAM,UAAU,sBAAsB,SAASM,GAAY;AACzD,WAAKR,EAAE,WAAWQ,CAAU,MAC1BA,IAAaR,EAAE,SAASQ,CAAU,IAEpC,KAAK,sBAAsBA,GACpB;AAAA,EACR,GAEDN,EAAM,UAAU,YAAY,WAAW;AACrC,WAAO,KAAK;AAAA,EACb,GAEDA,EAAM,UAAU,QAAQ,WAAW;AACjC,WAAOF,EAAE,KAAK,KAAK,MAAM;AAAA,EAC1B,GAEDE,EAAM,UAAU,UAAU,WAAW;AACnC,QAAIO,IAAO;AACX,WAAOT,EAAE,OAAO,KAAK,MAAO,GAAE,SAASU,GAAG;AACxC,aAAOV,EAAE,QAAQS,EAAK,IAAIC,CAAC,CAAC;AAAA,IAChC,CAAG;AAAA,EACF,GAEDR,EAAM,UAAU,QAAQ,WAAW;AACjC,QAAIO,IAAO;AACX,WAAOT,EAAE,OAAO,KAAK,MAAO,GAAE,SAASU,GAAG;AACxC,aAAOV,EAAE,QAAQS,EAAK,KAAKC,CAAC,CAAC;AAAA,IACjC,CAAG;AAAA,EACF,GAEDR,EAAM,UAAU,WAAW,SAASS,GAAIxY,GAAO;AAC7C,QAAIsI,IAAO,WACPgQ,IAAO;AACX,WAAAT,EAAE,KAAKW,GAAI,SAASD,GAAG;AACrB,MAAIjQ,EAAK,SAAS,IAChBgQ,EAAK,QAAQC,GAAGvY,CAAK,IAErBsY,EAAK,QAAQC,CAAC;AAAA,IAEpB,CAAG,GACM;AAAA,EACR,GAEDR,EAAM,UAAU,UAAU,SAASQ,GAAGvY,GAAO;AAC3C,WAAI6X,EAAE,IAAI,KAAK,QAAQU,CAAC,KAClB,UAAU,SAAS,MACrB,KAAK,OAAOA,CAAC,IAAIvY,IAEZ,SAGT,KAAK,OAAOuY,CAAC,IAAI,UAAU,SAAS,IAAIvY,IAAQ,KAAK,oBAAoBuY,CAAC,GACtE,KAAK,gBACP,KAAK,QAAQA,CAAC,IAAIN,GAClB,KAAK,UAAUM,CAAC,IAAI,CAAE,GACtB,KAAK,UAAUN,CAAU,EAAEM,CAAC,IAAI,KAElC,KAAK,IAAIA,CAAC,IAAI,CAAE,GAChB,KAAK,OAAOA,CAAC,IAAI,CAAE,GACnB,KAAK,KAAKA,CAAC,IAAI,CAAE,GACjB,KAAK,MAAMA,CAAC,IAAI,CAAE,GAClB,EAAE,KAAK,YACA;AAAA,EACR,GAEDR,EAAM,UAAU,OAAO,SAASQ,GAAG;AACjC,WAAO,KAAK,OAAOA,CAAC;AAAA,EACrB,GAEDR,EAAM,UAAU,UAAU,SAASQ,GAAG;AACpC,WAAOV,EAAE,IAAI,KAAK,QAAQU,CAAC;AAAA,EAC5B,GAEDR,EAAM,UAAU,aAAc,SAASQ,GAAG;AACxC,QAAID,IAAO;AACX,QAAIT,EAAE,IAAI,KAAK,QAAQU,CAAC,GAAG;AACzB,UAAIE,IAAa,SAASC,GAAG;AAAE,QAAAJ,EAAK,WAAWA,EAAK,UAAUI,CAAC,CAAC;AAAA,MAAI;AACpE,aAAO,KAAK,OAAOH,CAAC,GAChB,KAAK,gBACP,KAAK,4BAA4BA,CAAC,GAClC,OAAO,KAAK,QAAQA,CAAC,GACrBV,EAAE,KAAK,KAAK,SAASU,CAAC,GAAG,SAASI,GAAO;AACvC,QAAAL,EAAK,UAAUK,CAAK;AAAA,MAC5B,CAAO,GACD,OAAO,KAAK,UAAUJ,CAAC,IAEzBV,EAAE,KAAKA,EAAE,KAAK,KAAK,IAAIU,CAAC,CAAC,GAAGE,CAAU,GACtC,OAAO,KAAK,IAAIF,CAAC,GACjB,OAAO,KAAK,OAAOA,CAAC,GACpBV,EAAE,KAAKA,EAAE,KAAK,KAAK,KAAKU,CAAC,CAAC,GAAGE,CAAU,GACvC,OAAO,KAAK,KAAKF,CAAC,GAClB,OAAO,KAAK,MAAMA,CAAC,GACnB,EAAE,KAAK;AAAA,IACX;AACE,WAAO;AAAA,EACR,GAEDR,EAAM,UAAU,YAAY,SAASQ,GAAGK,GAAQ;AAC9C,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,MAAM,2CAA2C;AAG7D,QAAIf,EAAE,YAAYe,CAAM;AACtB,MAAAA,IAASX;AAAA,SACJ;AAEL,MAAAW,KAAU;AACV,eAASC,IAAWD,GAClB,CAACf,EAAE,YAAYgB,CAAQ,GACvBA,IAAW,KAAK,OAAOA,CAAQ;AAC/B,YAAIA,MAAaN;AACf,gBAAM,IAAI,MAAM,aAAaK,IAAQ,mBAAmBL,IACxC,uBAAuB;AAI3C,WAAK,QAAQK,CAAM;AAAA,IACvB;AAEE,gBAAK,QAAQL,CAAC,GACd,KAAK,4BAA4BA,CAAC,GAClC,KAAK,QAAQA,CAAC,IAAIK,GAClB,KAAK,UAAUA,CAAM,EAAEL,CAAC,IAAI,IACrB;AAAA,EACR,GAEDR,EAAM,UAAU,8BAA8B,SAASQ,GAAG;AACxD,WAAO,KAAK,UAAU,KAAK,QAAQA,CAAC,CAAC,EAAEA,CAAC;AAAA,EACzC,GAEDR,EAAM,UAAU,SAAS,SAASQ,GAAG;AACnC,QAAI,KAAK,aAAa;AACpB,UAAIK,IAAS,KAAK,QAAQL,CAAC;AAC3B,UAAIK,MAAWX;AACb,eAAOW;AAAA,IAEb;AAAA,EACC,GAEDb,EAAM,UAAU,WAAW,SAASQ,GAAG;AAKrC,QAJIV,EAAE,YAAYU,CAAC,MACjBA,IAAIN,IAGF,KAAK,aAAa;AACpB,UAAIa,IAAW,KAAK,UAAUP,CAAC;AAC/B,UAAIO;AACF,eAAOjB,EAAE,KAAKiB,CAAQ;AAAA,IAE5B,OAAS;AAAA,UAAIP,MAAMN;AACf,eAAO,KAAK,MAAO;AACd,UAAI,KAAK,QAAQM,CAAC;AACvB,eAAO,CAAE;AAAA;AAAA,EAEZ,GAEDR,EAAM,UAAU,eAAe,SAASQ,GAAG;AACzC,QAAIQ,IAAS,KAAK,OAAOR,CAAC;AAC1B,QAAIQ;AACF,aAAOlB,EAAE,KAAKkB,CAAM;AAAA,EAEvB,GAEDhB,EAAM,UAAU,aAAa,SAASQ,GAAG;AACvC,QAAIS,IAAQ,KAAK,MAAMT,CAAC;AACxB,QAAIS;AACF,aAAOnB,EAAE,KAAKmB,CAAK;AAAA,EAEtB,GAEDjB,EAAM,UAAU,YAAY,SAASQ,GAAG;AACtC,QAAIU,IAAQ,KAAK,aAAaV,CAAC;AAC/B,QAAIU;AACF,aAAOpB,EAAE,MAAMoB,GAAO,KAAK,WAAWV,CAAC,CAAC;AAAA,EAE3C,GAEDR,EAAM,UAAU,SAAS,SAAUQ,GAAG;AACpC,QAAIW;AACJ,WAAI,KAAK,eACPA,IAAY,KAAK,WAAWX,CAAC,IAE7BW,IAAY,KAAK,UAAUX,CAAC,GAEvBW,EAAU,WAAW;AAAA,EAC7B,GAEDnB,EAAM,UAAU,cAAc,SAASjJ,GAAQ;AAC7C,QAAIqK,IAAO,IAAI,KAAK,YAAY;AAAA,MAC9B,UAAU,KAAK;AAAA,MACf,YAAY,KAAK;AAAA,MACjB,UAAU,KAAK;AAAA,IACnB,CAAG;AAED,IAAAA,EAAK,SAAS,KAAK,OAAO;AAE1B,QAAIb,IAAO;AACX,IAAAT,EAAE,KAAK,KAAK,QAAQ,SAAS7X,GAAO,GAAG;AACrC,MAAI8O,EAAO,CAAC,KACVqK,EAAK,QAAQ,GAAGnZ,CAAK;AAAA,IAE3B,CAAG,GAED6X,EAAE,KAAK,KAAK,WAAW,SAASa,GAAG;AACjC,MAAIS,EAAK,QAAQT,EAAE,CAAC,KAAKS,EAAK,QAAQT,EAAE,CAAC,KACvCS,EAAK,QAAQT,GAAGJ,EAAK,KAAKI,CAAC,CAAC;AAAA,IAElC,CAAG;AAED,QAAIU,IAAU,CAAE;AAChB,aAASC,EAAWd,GAAG;AACrB,UAAIK,IAASN,EAAK,OAAOC,CAAC;AAC1B,aAAIK,MAAW,UAAaO,EAAK,QAAQP,CAAM,KAC7CQ,EAAQb,CAAC,IAAIK,GACNA,KACEA,KAAUQ,IACZA,EAAQR,CAAM,IAEdS,EAAWT,CAAM;AAAA,IAE9B;AAEE,WAAI,KAAK,eACPf,EAAE,KAAKsB,EAAK,MAAO,GAAE,SAASZ,GAAG;AAC/B,MAAAY,EAAK,UAAUZ,GAAGc,EAAWd,CAAC,CAAC;AAAA,IACrC,CAAK,GAGIY;AAAA,EACR,GAIDpB,EAAM,UAAU,sBAAsB,SAASM,GAAY;AACzD,WAAKR,EAAE,WAAWQ,CAAU,MAC1BA,IAAaR,EAAE,SAASQ,CAAU,IAEpC,KAAK,sBAAsBA,GACpB;AAAA,EACR,GAEDN,EAAM,UAAU,YAAY,WAAW;AACrC,WAAO,KAAK;AAAA,EACb,GAEDA,EAAM,UAAU,QAAQ,WAAW;AACjC,WAAOF,EAAE,OAAO,KAAK,SAAS;AAAA,EAC/B,GAEDE,EAAM,UAAU,UAAU,SAASS,GAAIxY,GAAO;AAC5C,QAAIsY,IAAO,MACPhQ,IAAO;AACX,WAAAuP,EAAE,OAAOW,GAAI,SAASD,GAAGe,GAAG;AAC1B,aAAIhR,EAAK,SAAS,IAChBgQ,EAAK,QAAQC,GAAGe,GAAGtZ,CAAK,IAExBsY,EAAK,QAAQC,GAAGe,CAAC,GAEZA;AAAA,IACX,CAAG,GACM;AAAA,EACR,GAMDvB,EAAM,UAAU,UAAU,WAAW;AACnC,QAAIQ,GAAGe,GAAGC,GAAMvZ,GACZwZ,IAAiB,IACjBC,IAAO,UAAU,CAAC;AAEtB,IAAI,OAAOA,KAAS,YAAYA,MAAS,QAAQ,OAAOA,KACtDlB,IAAIkB,EAAK,GACTH,IAAIG,EAAK,GACTF,IAAOE,EAAK,MACR,UAAU,WAAW,MACvBzZ,IAAQ,UAAU,CAAC,GACnBwZ,IAAiB,QAGnBjB,IAAIkB,GACJH,IAAI,UAAU,CAAC,GACfC,IAAO,UAAU,CAAC,GACd,UAAU,SAAS,MACrBvZ,IAAQ,UAAU,CAAC,GACnBwZ,IAAiB,MAIrBjB,IAAI,KAAKA,GACTe,IAAI,KAAKA,GACJzB,EAAE,YAAY0B,CAAI,MACrBA,IAAO,KAAKA;AAGd,QAAIb,IAAIgB,EAAa,KAAK,aAAanB,GAAGe,GAAGC,CAAI;AACjD,QAAI1B,EAAE,IAAI,KAAK,aAAaa,CAAC;AAC3B,aAAIc,MACF,KAAK,YAAYd,CAAC,IAAI1Y,IAEjB;AAGT,QAAI,CAAC6X,EAAE,YAAY0B,CAAI,KAAK,CAAC,KAAK;AAChC,YAAM,IAAI,MAAM,mDAAmD;AAKrE,SAAK,QAAQhB,CAAC,GACd,KAAK,QAAQe,CAAC,GAEd,KAAK,YAAYZ,CAAC,IAAIc,IAAiBxZ,IAAQ,KAAK,oBAAoBuY,GAAGe,GAAGC,CAAI;AAElF,QAAII,IAAUC,EAAc,KAAK,aAAarB,GAAGe,GAAGC,CAAI;AAExD,WAAAhB,IAAIoB,EAAQ,GACZL,IAAIK,EAAQ,GAEZ,OAAO,OAAOA,CAAO,GACrB,KAAK,UAAUjB,CAAC,IAAIiB,GACpBE,EAAqB,KAAK,OAAOP,CAAC,GAAGf,CAAC,GACtCsB,EAAqB,KAAK,MAAMtB,CAAC,GAAGe,CAAC,GACrC,KAAK,IAAIA,CAAC,EAAEZ,CAAC,IAAIiB,GACjB,KAAK,KAAKpB,CAAC,EAAEG,CAAC,IAAIiB,GAClB,KAAK,cACE;AAAA,EACR,GAED5B,EAAM,UAAU,OAAO,SAASQ,GAAGe,GAAGC,GAAM;AAC1C,QAAIb,IAAK,UAAU,WAAW,IAC1BoB,EAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1CJ,EAAa,KAAK,aAAanB,GAAGe,GAAGC,CAAI;AAC7C,WAAO,KAAK,YAAYb,CAAC;AAAA,EAC1B,GAEDX,EAAM,UAAU,UAAU,SAASQ,GAAGe,GAAGC,GAAM;AAC7C,QAAIb,IAAK,UAAU,WAAW,IAC1BoB,EAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1CJ,EAAa,KAAK,aAAanB,GAAGe,GAAGC,CAAI;AAC7C,WAAO1B,EAAE,IAAI,KAAK,aAAaa,CAAC;AAAA,EACjC,GAEDX,EAAM,UAAU,aAAa,SAASQ,GAAGe,GAAGC,GAAM;AAChD,QAAIb,IAAK,UAAU,WAAW,IAC1BoB,EAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1CJ,EAAa,KAAK,aAAanB,GAAGe,GAAGC,CAAI,GACzCQ,IAAO,KAAK,UAAUrB,CAAC;AAC3B,WAAIqB,MACFxB,IAAIwB,EAAK,GACTT,IAAIS,EAAK,GACT,OAAO,KAAK,YAAYrB,CAAC,GACzB,OAAO,KAAK,UAAUA,CAAC,GACvBsB,EAAuB,KAAK,OAAOV,CAAC,GAAGf,CAAC,GACxCyB,EAAuB,KAAK,MAAMzB,CAAC,GAAGe,CAAC,GACvC,OAAO,KAAK,IAAIA,CAAC,EAAEZ,CAAC,GACpB,OAAO,KAAK,KAAKH,CAAC,EAAEG,CAAC,GACrB,KAAK,eAEA;AAAA,EACR,GAEDX,EAAM,UAAU,UAAU,SAASQ,GAAG0B,GAAG;AACvC,QAAIC,IAAM,KAAK,IAAI3B,CAAC;AACpB,QAAI2B,GAAK;AACP,UAAIC,IAAQtC,EAAE,OAAOqC,CAAG;AACxB,aAAKD,IAGEpC,EAAE,OAAOsC,GAAO,SAASJ,GAAM;AAAE,eAAOA,EAAK,MAAME;AAAA,OAAI,IAFrDE;AAAA,IAGb;AAAA,EACC,GAEDpC,EAAM,UAAU,WAAW,SAASQ,GAAGe,GAAG;AACxC,QAAIc,IAAO,KAAK,KAAK7B,CAAC;AACtB,QAAI6B,GAAM;AACR,UAAID,IAAQtC,EAAE,OAAOuC,CAAI;AACzB,aAAKd,IAGEzB,EAAE,OAAOsC,GAAO,SAASJ,GAAM;AAAE,eAAOA,EAAK,MAAMT;AAAA,OAAI,IAFrDa;AAAA,IAGb;AAAA,EACC,GAEDpC,EAAM,UAAU,YAAY,SAASQ,GAAGe,GAAG;AACzC,QAAIe,IAAU,KAAK,QAAQ9B,GAAGe,CAAC;AAC/B,QAAIe;AACF,aAAOA,EAAQ,OAAO,KAAK,SAAS9B,GAAGe,CAAC,CAAC;AAAA,EAE5C;AAED,WAASO,EAAqBxX,GAAKiY,GAAG;AACpC,IAAIjY,EAAIiY,CAAC,IACPjY,EAAIiY,CAAC,MAELjY,EAAIiY,CAAC,IAAI;AAAA,EAEb;AAEA,WAASN,EAAuB3X,GAAKiY,GAAG;AACtC,IAAK,EAAEjY,EAAIiY,CAAC,KAAK,OAAOjY,EAAIiY,CAAC;AAAA,EAC/B;AAEA,WAASZ,EAAaa,GAAYC,GAAIC,GAAIlB,GAAM;AAC9C,QAAIhB,IAAI,KAAKiC,GACTlB,IAAI,KAAKmB;AACb,QAAI,CAACF,KAAchC,IAAIe,GAAG;AACxB,UAAIoB,IAAMnC;AACV,MAAAA,IAAIe,GACJA,IAAIoB;AAAA,IACR;AACE,WAAOnC,IAAIL,IAAiBoB,IAAIpB,KACpBL,EAAE,YAAY0B,CAAI,IAAIvB,IAAoBuB;AAAA,EACxD;AAEA,WAASK,EAAcW,GAAYC,GAAIC,GAAIlB,GAAM;AAC/C,QAAIhB,IAAI,KAAKiC,GACTlB,IAAI,KAAKmB;AACb,QAAI,CAACF,KAAchC,IAAIe,GAAG;AACxB,UAAIoB,IAAMnC;AACV,MAAAA,IAAIe,GACJA,IAAIoB;AAAA,IACR;AACE,QAAIf,IAAW,EAAE,GAAGpB,GAAG,GAAGe,EAAG;AAC7B,WAAIC,MACFI,EAAQ,OAAOJ,IAEVI;AAAA,EACT;AAEA,WAASG,EAAYS,GAAYZ,GAAS;AACxC,WAAOD,EAAaa,GAAYZ,EAAQ,GAAGA,EAAQ,GAAGA,EAAQ,IAAI;AAAA,EACpE;;;;;wBCnhBAgB,KAAiB;;;;wBCCjBC,KAAiB;AAAA,IACf,OAAOrb,GAAkB;AAAA,IACzB,SAASI,GAAA;AAAA,EACV;;;;;;ACJD,MAAIkY,IAAItY,EAAmB,GACvBwY,IAAQpY,GAAkB;AAE9B,EAAAkb,KAAiB;AAAA,IACf,OAAOC;AAAA,IACP,MAAMC;AAAA,EACP;AAED,WAASD,EAAME,GAAG;AAChB,QAAIH,IAAO;AAAA,MACT,SAAS;AAAA,QACP,UAAUG,EAAE,WAAY;AAAA,QACxB,YAAYA,EAAE,aAAc;AAAA,QAC5B,UAAUA,EAAE,WAAU;AAAA,MACvB;AAAA,MACD,OAAOC,EAAWD,CAAC;AAAA,MACnB,OAAOE,EAAWF,CAAC;AAAA,IACpB;AACD,WAAKnD,EAAE,YAAYmD,EAAE,MAAO,CAAA,MAC1BH,EAAK,QAAQhD,EAAE,MAAMmD,EAAE,MAAK,CAAE,IAEzBH;AAAA,EACT;AAEA,WAASI,EAAWD,GAAG;AACrB,WAAOnD,EAAE,IAAImD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAClC,UAAI4C,IAAYH,EAAE,KAAKzC,CAAC,GACpBK,IAASoC,EAAE,OAAOzC,CAAC,GACnB6C,IAAO,EAAE,GAAG7C,EAAG;AACnB,aAAKV,EAAE,YAAYsD,CAAS,MAC1BC,EAAK,QAAQD,IAEVtD,EAAE,YAAYe,CAAM,MACvBwC,EAAK,SAASxC,IAETwC;AAAA,IACX,CAAG;AAAA,EACH;AAEA,WAASF,EAAWF,GAAG;AACrB,WAAOnD,EAAE,IAAImD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAClC,UAAI2C,IAAYL,EAAE,KAAKtC,CAAC,GACpBqB,IAAO,EAAE,GAAGrB,EAAE,GAAG,GAAGA,EAAE,EAAG;AAC7B,aAAKb,EAAE,YAAYa,EAAE,IAAI,MACvBqB,EAAK,OAAOrB,EAAE,OAEXb,EAAE,YAAYwD,CAAS,MAC1BtB,EAAK,QAAQsB,IAERtB;AAAA,IACX,CAAG;AAAA,EACH;AAEA,WAASgB,EAAKF,GAAM;AAClB,QAAIG,IAAI,IAAIjD,EAAM8C,EAAK,OAAO,EAAE,SAASA,EAAK,KAAK;AACnD,WAAAhD,EAAE,KAAKgD,EAAK,OAAO,SAASS,GAAO;AACjC,MAAAN,EAAE,QAAQM,EAAM,GAAGA,EAAM,KAAK,GAC1BA,EAAM,UACRN,EAAE,UAAUM,EAAM,GAAGA,EAAM,MAAM;AAAA,IAEvC,CAAG,GACDzD,EAAE,KAAKgD,EAAK,OAAO,SAASS,GAAO;AACjC,MAAAN,EAAE,QAAQ,EAAE,GAAGM,EAAM,GAAG,GAAGA,EAAM,GAAG,MAAMA,EAAM,KAAI,GAAIA,EAAM,KAAK;AAAA,IACvE,CAAG,GACMN;AAAA,EACT;;;;;;;ACjEA,MAAInD,IAAItY,EAAoB;AAE5B,EAAAgc,KAAiBC;AAEjB,WAASA,EAAWR,GAAG;AACrB,QAAIS,IAAU,CAAE,GACZC,IAAQ,CAAE,GACVC;AAEJ,aAASC,EAAIrD,GAAG;AACd,MAAIV,EAAE,IAAI4D,GAASlD,CAAC,MACpBkD,EAAQlD,CAAC,IAAI,IACboD,EAAK,KAAKpD,CAAC,GACXV,EAAE,KAAKmD,EAAE,WAAWzC,CAAC,GAAGqD,CAAG,GAC3B/D,EAAE,KAAKmD,EAAE,aAAazC,CAAC,GAAGqD,CAAG;AAAA,IACjC;AAEE,WAAA/D,EAAE,KAAKmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC5B,MAAAoD,IAAO,CAAE,GACTC,EAAIrD,CAAC,GACDoD,EAAK,UACPD,EAAM,KAAKC,CAAI;AAAA,IAErB,CAAG,GAEMD;AAAA,EACT;;;;;;;AC1BA,MAAI7D,IAAItY,EAAoB;AAE5B,EAAAsc,KAAiBC;AASjB,WAASA,IAAgB;AACvB,SAAK,OAAO,CAAE,GACd,KAAK,cAAc,CAAE;AAAA,EACvB;AAKA,SAAAA,EAAc,UAAU,OAAO,WAAW;AACxC,WAAO,KAAK,KAAK;AAAA,EAClB,GAKDA,EAAc,UAAU,OAAO,WAAW;AACxC,WAAO,KAAK,KAAK,IAAI,SAASC,GAAG;AAAE,aAAOA,EAAE;AAAA,KAAM;AAAA,EACnD,GAKDD,EAAc,UAAU,MAAM,SAASzc,GAAK;AAC1C,WAAOwY,EAAE,IAAI,KAAK,aAAaxY,CAAG;AAAA,EACnC,GAQDyc,EAAc,UAAU,WAAW,SAASzc,GAAK;AAC/C,QAAIJ,IAAQ,KAAK,YAAYI,CAAG;AAChC,QAAIJ,MAAU;AACZ,aAAO,KAAK,KAAKA,CAAK,EAAE;AAAA,EAE3B,GAMD6c,EAAc,UAAU,MAAM,WAAW;AACvC,QAAI,KAAK,KAAM,MAAK;AAClB,YAAM,IAAI,MAAM,iBAAiB;AAEnC,WAAO,KAAK,KAAK,CAAC,EAAE;AAAA,EACrB,GAUDA,EAAc,UAAU,MAAM,SAASzc,GAAK2c,GAAU;AACpD,QAAIC,IAAa,KAAK;AAEtB,QADA5c,IAAM,OAAOA,CAAG,GACZ,CAACwY,EAAE,IAAIoE,GAAY5c,CAAG,GAAG;AAC3B,UAAI6c,IAAM,KAAK,MACXjd,IAAQid,EAAI;AAChB,aAAAD,EAAW5c,CAAG,IAAIJ,GAClBid,EAAI,KAAK,EAAC,KAAK7c,GAAK,UAAU2c,EAAQ,CAAC,GACvC,KAAK,UAAU/c,CAAK,GACb;AAAA,IACX;AACE,WAAO;AAAA,EACR,GAKD6c,EAAc,UAAU,YAAY,WAAW;AAC7C,SAAK,MAAM,GAAG,KAAK,KAAK,SAAS,CAAC;AAClC,QAAIK,IAAM,KAAK,KAAK,IAAK;AACzB,kBAAO,KAAK,YAAYA,EAAI,GAAG,GAC/B,KAAK,SAAS,CAAC,GACRA,EAAI;AAAA,EACZ,GASDL,EAAc,UAAU,WAAW,SAASzc,GAAK2c,GAAU;AACzD,QAAI/c,IAAQ,KAAK,YAAYI,CAAG;AAChC,QAAI2c,IAAW,KAAK,KAAK/c,CAAK,EAAE;AAC9B,YAAM,IAAI,MAAM,yDACFI,IAAM,WAAW,KAAK,KAAKJ,CAAK,EAAE,WAAW,WAAW+c,CAAQ;AAEhF,SAAK,KAAK/c,CAAK,EAAE,WAAW+c,GAC5B,KAAK,UAAU/c,CAAK;AAAA,EACrB,GAED6c,EAAc,UAAU,WAAW,SAASM,GAAG;AAC7C,QAAIF,IAAM,KAAK,MACXG,IAAI,IAAID,GACRE,IAAID,IAAI,GACRE,IAAUH;AACd,IAAIC,IAAIH,EAAI,WACVK,IAAUL,EAAIG,CAAC,EAAE,WAAWH,EAAIK,CAAO,EAAE,WAAWF,IAAIE,GACpDD,IAAIJ,EAAI,WACVK,IAAUL,EAAII,CAAC,EAAE,WAAWJ,EAAIK,CAAO,EAAE,WAAWD,IAAIC,IAEtDA,MAAYH,MACd,KAAK,MAAMA,GAAGG,CAAO,GACrB,KAAK,SAASA,CAAO;AAAA,EAG1B,GAEDT,EAAc,UAAU,YAAY,SAAS7c,GAAO;AAIlD,aAHIid,IAAM,KAAK,MACXF,IAAWE,EAAIjd,CAAK,EAAE,UACtB2Z,GACG3Z,MAAU,MACf2Z,IAAS3Z,KAAS,GACd,EAAAid,EAAItD,CAAM,EAAE,WAAWoD;AAG3B,WAAK,MAAM/c,GAAO2Z,CAAM,GACxB3Z,IAAQ2Z;AAAA,EAEX,GAEDkD,EAAc,UAAU,QAAQ,SAASM,GAAGI,GAAG;AAC7C,QAAIN,IAAM,KAAK,MACXD,IAAa,KAAK,aAClBQ,IAAWP,EAAIE,CAAC,GAChBM,IAAWR,EAAIM,CAAC;AACpB,IAAAN,EAAIE,CAAC,IAAIM,GACTR,EAAIM,CAAC,IAAIC,GACTR,EAAWS,EAAS,GAAG,IAAIN,GAC3BH,EAAWQ,EAAS,GAAG,IAAID;AAAA,EAC5B;;;;;;ACvJD,MAAI3E,IAAItY,EAAoB,GACxBuc,IAAgBnc,GAAiC;AAErD,EAAAgd,KAAiBC;AAEjB,MAAIC,IAAsBhF,EAAE,SAAS,CAAC;AAEtC,WAAS+E,EAAS5B,GAAGtU,GAAQoW,GAAUC,GAAQ;AAC7C,WAAOC;AAAA,MAAYhC;AAAA,MAAG,OAAOtU,CAAM;AAAA,MACjCoW,KAAYD;AAAA,MACZE,KAAU,SAASxE,GAAG;AAAE,eAAOyC,EAAE,SAASzC,CAAC;AAAA;IAAI;AAAA,EACnD;AAEA,WAASyE,EAAYhC,GAAGtU,GAAQoW,GAAUC,GAAQ;AAChD,QAAIE,IAAU,CAAE,GACZC,IAAK,IAAIpB,EAAe,GACxBvD,GAAG4E,GAEHC,IAAkB,SAASrD,GAAM;AACnC,UAAIT,IAAIS,EAAK,MAAMxB,IAAIwB,EAAK,IAAIA,EAAK,GACjCsD,IAASJ,EAAQ3D,CAAC,GAClBgE,IAASR,EAAS/C,CAAI,GACtBwD,IAAWJ,EAAO,WAAWG;AAEjC,UAAIA,IAAS;AACX,cAAM,IAAI,MAAM,8DACevD,IAAO,cAAcuD,CAAM;AAG5D,MAAIC,IAAWF,EAAO,aACpBA,EAAO,WAAWE,GAClBF,EAAO,cAAc9E,GACrB2E,EAAG,SAAS5D,GAAGiE,CAAQ;AAAA,IAE1B;AAQD,SANAvC,EAAE,MAAK,EAAG,QAAQ,SAASzC,GAAG;AAC5B,UAAIgF,IAAWhF,MAAM7R,IAAS,IAAI,OAAO;AACzC,MAAAuW,EAAQ1E,CAAC,IAAI,EAAE,UAAUgF,EAAU,GACnCL,EAAG,IAAI3E,GAAGgF,CAAQ;AAAA,IACtB,CAAG,GAEML,EAAG,KAAM,IAAG,MACjB3E,IAAI2E,EAAG,UAAW,GAClBC,IAASF,EAAQ1E,CAAC,GACd4E,EAAO,aAAa,OAAO;AAI/B,MAAAJ,EAAOxE,CAAC,EAAE,QAAQ6E,CAAe;AAGnC,WAAOH;AAAA,EACT;;;;;;;ACrDA,MAAIL,IAAWrd,GAAqB,GAChCsY,IAAIlY,EAAoB;AAE5B,EAAA6d,KAAiBC;AAEjB,WAASA,EAAYzC,GAAG0C,GAAYC,GAAU;AAC5C,WAAO9F,EAAE,UAAUmD,EAAE,MAAK,GAAI,SAAS4C,GAAKrF,GAAG;AAC7C,MAAAqF,EAAIrF,CAAC,IAAIqE,EAAS5B,GAAGzC,GAAGmF,GAAYC,CAAQ;AAAA,IAC7C,GAAE,EAAE;AAAA,EACP;;;;;;;ACTA,MAAI9F,IAAItY,EAAoB;AAE5B,EAAAse,KAAiBC;AAEjB,WAASA,EAAO9C,GAAG;AACjB,QAAI/b,IAAQ,GACRsC,IAAQ,CAAE,GACVka,IAAU,CAAA,GACVwB,IAAU,CAAE;AAEhB,aAASrB,EAAIrD,GAAG;AACd,UAAI+C,IAAQG,EAAQlD,CAAC,IAAI;AAAA,QACvB,SAAS;AAAA,QACT,SAAStZ;AAAA,QACT,OAAOA;AAAA,MACR;AAYD,UAXAsC,EAAM,KAAKgX,CAAC,GAEZyC,EAAE,WAAWzC,CAAC,EAAE,QAAQ,SAASe,GAAG;AAClC,QAAKzB,EAAE,IAAI4D,GAASnC,CAAC,IAGVmC,EAAQnC,CAAC,EAAE,YACpBgC,EAAM,UAAU,KAAK,IAAIA,EAAM,SAASG,EAAQnC,CAAC,EAAE,KAAK,MAHxDsC,EAAItC,CAAC,GACLgC,EAAM,UAAU,KAAK,IAAIA,EAAM,SAASG,EAAQnC,CAAC,EAAE,OAAO;AAAA,MAIlE,CAAK,GAEGgC,EAAM,YAAYA,EAAM,OAAO;AACjC,YAAIK,IAAO,CAAE,GACTrC;AACJ;AACE,UAAAA,IAAI/X,EAAM,IAAK,GACfka,EAAQnC,CAAC,EAAE,UAAU,IACrBqC,EAAK,KAAKrC,CAAC;AAAA,eACJf,MAAMe;AACf,QAAA2D,EAAQ,KAAKtB,CAAI;AAAA,MACvB;AAAA,IACA;AAEE,WAAAX,EAAE,MAAK,EAAG,QAAQ,SAASzC,GAAG;AAC5B,MAAKV,EAAE,IAAI4D,GAASlD,CAAC,KACnBqD,EAAIrD,CAAC;AAAA,IAEX,CAAG,GAEM0E;AAAA,EACT;;;;;;;AC9CA,MAAIpF,IAAItY,EAAoB,GACxBue,IAASne,GAAmB;AAEhC,EAAAoe,KAAiBC;AAEjB,WAASA,EAAWhD,GAAG;AACrB,WAAOnD,EAAE,OAAOiG,EAAO9C,CAAC,GAAG,SAASW,GAAM;AACxC,aAAOA,EAAK,SAAS,KAAMA,EAAK,WAAW,KAAKX,EAAE,QAAQW,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,IAC9E,CAAG;AAAA,EACH;;;;;;;ACTA,MAAI9D,IAAItY,EAAoB;AAE5B,EAAA0e,KAAiBC;AAEjB,MAAIrB,IAAsBhF,EAAE,SAAS,CAAC;AAEtC,WAASqG,EAAclD,GAAG8B,GAAUC,GAAQ;AAC1C,WAAOoB;AAAA,MAAiBnD;AAAA,MACtB8B,KAAYD;AAAA,MACZE,KAAU,SAASxE,GAAG;AAAE,eAAOyC,EAAE,SAASzC,CAAC;AAAA;IAAI;AAAA,EACnD;AAEA,WAAS4F,EAAiBnD,GAAG8B,GAAUC,GAAQ;AAC7C,QAAIE,IAAU,CAAE,GACZmB,IAAQpD,EAAE,MAAO;AAErB,WAAAoD,EAAM,QAAQ,SAAS7F,GAAG;AACxB,MAAA0E,EAAQ1E,CAAC,IAAI,CAAE,GACf0E,EAAQ1E,CAAC,EAAEA,CAAC,IAAI,EAAE,UAAU,EAAG,GAC/B6F,EAAM,QAAQ,SAAS9E,GAAG;AACxB,QAAIf,MAAMe,MACR2D,EAAQ1E,CAAC,EAAEe,CAAC,IAAI,EAAE,UAAU,OAAO,kBAAmB;AAAA,MAE9D,CAAK,GACDyD,EAAOxE,CAAC,EAAE,QAAQ,SAASwB,GAAM;AAC/B,YAAIT,IAAIS,EAAK,MAAMxB,IAAIwB,EAAK,IAAIA,EAAK,GACjCsE,IAAIvB,EAAS/C,CAAI;AACrB,QAAAkD,EAAQ1E,CAAC,EAAEe,CAAC,IAAI,EAAE,UAAU+E,GAAG,aAAa9F,EAAG;AAAA,MACrD,CAAK;AAAA,IACL,CAAG,GAED6F,EAAM,QAAQ,SAAS9D,GAAG;AACxB,UAAIgE,IAAOrB,EAAQ3C,CAAC;AACpB,MAAA8D,EAAM,QAAQ,SAAShC,GAAG;AACxB,YAAImC,IAAOtB,EAAQb,CAAC;AACpB,QAAAgC,EAAM,QAAQ,SAAS5B,GAAG;AACxB,cAAIgC,IAAKD,EAAKjE,CAAC,GACXmE,IAAKH,EAAK9B,CAAC,GACXkC,IAAKH,EAAK/B,CAAC,GACXmC,IAAcH,EAAG,WAAWC,EAAG;AACnC,UAAIE,IAAcD,EAAG,aACnBA,EAAG,WAAWC,GACdD,EAAG,cAAcD,EAAG;AAAA,QAE9B,CAAO;AAAA,MACP,CAAK;AAAA,IACL,CAAG,GAEMxB;AAAA,EACT;;;;;;;ACjDA,MAAIpF,IAAItY,EAAoB;AAE5B,EAAAqf,KAAiBC,GACjBA,EAAQ,iBAAiBC;AAEzB,WAASD,EAAQ7D,GAAG;AAClB,QAAIS,IAAU,CAAE,GACZla,IAAQ,CAAE,GACV0b,IAAU,CAAE;AAEhB,aAAS8B,EAAM3D,GAAM;AACnB,UAAIvD,EAAE,IAAItW,GAAO6Z,CAAI;AACnB,cAAM,IAAI0D,EAAgB;AAG5B,MAAKjH,EAAE,IAAI4D,GAASL,CAAI,MACtB7Z,EAAM6Z,CAAI,IAAI,IACdK,EAAQL,CAAI,IAAI,IAChBvD,EAAE,KAAKmD,EAAE,aAAaI,CAAI,GAAG2D,CAAK,GAClC,OAAOxd,EAAM6Z,CAAI,GACjB6B,EAAQ,KAAK7B,CAAI;AAAA,IAEvB;AAIE,QAFAvD,EAAE,KAAKmD,EAAE,MAAK,GAAI+D,CAAK,GAEnBlH,EAAE,KAAK4D,CAAO,MAAMT,EAAE,UAAS;AACjC,YAAM,IAAI8D,EAAgB;AAG5B,WAAO7B;AAAA,EACT;AAEA,WAAS6B,IAAiB;AAAA,EAAA;AAC1B,SAAAA,EAAe,YAAY,IAAI;;;;;;AClC/B,MAAID,IAAUtf,GAAoB;AAElC,EAAAyf,KAAiBC;AAEjB,WAASA,EAAUjE,GAAG;AACpB,QAAI;AACF,MAAA6D,EAAQ7D,CAAC;AAAA,IACV,SAAQtC,GAAG;AACV,UAAIA,aAAamG,EAAQ;AACvB,eAAO;AAET,YAAMnG;AAAA,IACV;AACE,WAAO;AAAA,EACT;;;;;;;ACdA,MAAIb,IAAItY,EAAoB;AAE5B,EAAA2f,KAAiBtD;AAUjB,WAASA,EAAIZ,GAAGxC,GAAI2G,GAAO;AACzB,IAAKtH,EAAE,QAAQW,CAAE,MACfA,IAAK,CAACA,CAAE;AAGV,QAAI4G,KAAcpE,EAAE,eAAeA,EAAE,aAAaA,EAAE,WAAW,KAAKA,CAAC,GAEjE4C,IAAM,CAAE,GACRnC,IAAU,CAAE;AAChB,WAAA5D,EAAE,KAAKW,GAAI,SAASD,GAAG;AACrB,UAAI,CAACyC,EAAE,QAAQzC,CAAC;AACd,cAAM,IAAI,MAAM,+BAA+BA,CAAC;AAGlD,MAAA8G,EAAMrE,GAAGzC,GAAG4G,MAAU,QAAQ1D,GAAS2D,GAAYxB,CAAG;AAAA,IAC1D,CAAG,GACMA;AAAA,EACT;AAEA,WAASyB,EAAMrE,GAAGzC,GAAG+G,GAAW7D,GAAS2D,GAAYxB,GAAK;AACxD,IAAK/F,EAAE,IAAI4D,GAASlD,CAAC,MACnBkD,EAAQlD,CAAC,IAAI,IAER+G,KAAa1B,EAAI,KAAKrF,CAAC,GAC5BV,EAAE,KAAKuH,EAAW7G,CAAC,GAAG,SAASe,GAAG;AAChC,MAAA+F,EAAMrE,GAAG1B,GAAGgG,GAAW7D,GAAS2D,GAAYxB,CAAG;AAAA,IACrD,CAAK,GACG0B,KAAa1B,EAAI,KAAKrF,CAAC;AAAA,EAE/B;;;;;;;ACzCA,MAAIqD,IAAMrc,GAAgB;AAE1B,EAAAggB,KAAiBD;AAEjB,WAASA,EAAUtE,GAAGxC,GAAI;AACxB,WAAOoD,EAAIZ,GAAGxC,GAAI,MAAM;AAAA,EAC1B;;;;;;;ACNA,MAAIoD,IAAMrc,GAAgB;AAE1B,EAAAigB,KAAiBC;AAEjB,WAASA,EAASzE,GAAGxC,GAAI;AACvB,WAAOoD,EAAIZ,GAAGxC,GAAI,KAAK;AAAA,EACzB;;;;;;;ACNA,MAAIX,IAAItY,EAAoB,GACxBwY,IAAQpY,GAAmB,GAC3Bmc,IAAgBzb,GAAiC;AAErD,EAAAqf,KAAiBC;AAEjB,WAASA,EAAK3E,GAAG0C,GAAY;AAC3B,QAAI7b,IAAS,IAAIkW,EAAO,GACpBqB,IAAU,CAAE,GACZ8D,IAAK,IAAIpB,EAAe,GACxBvD;AAEJ,aAAS6E,EAAgBrD,GAAM;AAC7B,UAAIT,IAAIS,EAAK,MAAMxB,IAAIwB,EAAK,IAAIA,EAAK,GACjC6F,IAAM1C,EAAG,SAAS5D,CAAC;AACvB,UAAIsG,MAAQ,QAAW;AACrB,YAAIC,IAAanC,EAAW3D,CAAI;AAChC,QAAI8F,IAAaD,MACfxG,EAAQE,CAAC,IAAIf,GACb2E,EAAG,SAAS5D,GAAGuG,CAAU;AAAA,MAEjC;AAAA,IACA;AAEE,QAAI7E,EAAE,UAAW,MAAK;AACpB,aAAOnZ;AAGT,IAAAgW,EAAE,KAAKmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC5B,MAAA2E,EAAG,IAAI3E,GAAG,OAAO,iBAAiB,GAClC1W,EAAO,QAAQ0W,CAAC;AAAA,IACpB,CAAG,GAGD2E,EAAG,SAASlC,EAAE,MAAK,EAAG,CAAC,GAAG,CAAC;AAG3B,aADI8E,IAAO,IACJ5C,EAAG,KAAM,IAAG,KAAG;AAEpB,UADA3E,IAAI2E,EAAG,UAAW,GACdrF,EAAE,IAAIuB,GAASb,CAAC;AAClB,QAAA1W,EAAO,QAAQ0W,GAAGa,EAAQb,CAAC,CAAC;AAAA,WACvB;AAAA,YAAIuH;AACT,gBAAM,IAAI,MAAM,mCAAmC9E,CAAC;AAEpD,QAAA8E,IAAO;AAAA;AAGT,MAAA9E,EAAE,UAAUzC,CAAC,EAAE,QAAQ6E,CAAe;AAAA,IAC1C;AAEE,WAAOvb;AAAA,EACT;;;;;wBCnDAke,KAAiB;AAAA,IACf,YAAYxgB,GAAuB;AAAA,IACnC,UAAUI,GAAqB;AAAA,IAC/B,aAAaU,GAAyB;AAAA,IACtC,YAAYwC,GAAwB;AAAA,IACpC,eAAeC,GAA2B;AAAA,IAC1C,WAAWC,GAAuB;AAAA,IAClC,WAAWoC,GAAsB;AAAA,IACjC,UAAUE,GAAqB;AAAA,IAC/B,MAAMoN,GAAiB;AAAA,IACvB,QAAQC,GAAmB;AAAA,IAC3B,SAAS4E,GAAA;AAAA,EACV;;;;;;ACkBD,MAAIsD,IAAMrb,GAAgB;AAE1B,SAAAygB,KAAiB;AAAA,IACf,OAAOpF,EAAI;AAAA,IACX,MAAMjb,GAAqB;AAAA,IAC3B,KAAKU,GAAoB;AAAA,IACzB,SAASua,EAAI;AAAA,EACd;;;;;;ACnCD,MAAIoF;AAEJ,MAAI,OAAO3I,MAAY;AACrB,QAAI;AACF,MAAA2I,IAAWzgB,GAAmB;AAAA,IAC/B,QAAW;AAAA,IAEd;AAGA,SAAKygB,MACHA,IAAW,OAAO,WAGpBC,KAAiBD;;;;;;AChBjB,MAAIpd,IAAKrD,GAAe,GACpBuO,IAAcnO,GAAwB,GACtC6K,IAAUnK,GAAqB,GAC/B2G,IAAWnE,GAAqB;AAYpC,WAASqd,EAAelgB,GAAOf,GAAOH,GAAQ;AAC5C,QAAI,CAACkI,EAASlI,CAAM;AAClB,aAAO;AAET,QAAIiJ,IAAO,OAAO9I;AAClB,YAAI8I,KAAQ,WACH+F,EAAYhP,CAAM,KAAK0L,EAAQvL,GAAOH,EAAO,MAAM,IACnDiJ,KAAQ,YAAY9I,KAASH,KAE7B8D,EAAG9D,EAAOG,CAAK,GAAGe,CAAK,IAEzB;AAAA,EACT;AAEA,SAAAmgB,KAAiBD;;;;;;AC7BjB,MAAIpL,IAAWvV,GAAsB,GACjCqD,IAAKjD,GAAe,GACpBugB,IAAiB7f,GAA4B,GAC7C+f,IAASvd,GAAmB,GAG5BsB,IAAc,OAAO,WAGrBC,IAAiBD,EAAY,gBAuB7Bkc,IAAWvL,EAAS,SAAShW,GAAQwhB,GAAS;AAChD,IAAAxhB,IAAS,OAAOA,CAAM;AAEtB,QAAIG,IAAQ,IACRG,IAASkhB,EAAQ,QACjBC,IAAQnhB,IAAS,IAAIkhB,EAAQ,CAAC,IAAI;AAMtC,SAJIC,KAASL,EAAeI,EAAQ,CAAC,GAAGA,EAAQ,CAAC,GAAGC,CAAK,MACvDnhB,IAAS,IAGJ,EAAEH,IAAQG;AAMf,eALIsH,IAAS4Z,EAAQrhB,CAAK,GACtBE,IAAQihB,EAAO1Z,CAAM,GACrB8Z,IAAa,IACbC,IAActhB,EAAM,QAEjB,EAAEqhB,IAAaC,KAAa;AACjC,YAAIphB,IAAMF,EAAMqhB,CAAU,GACtBxgB,IAAQlB,EAAOO,CAAG;AAEtB,SAAIW,MAAU,UACT4C,EAAG5C,GAAOmE,EAAY9E,CAAG,CAAC,KAAK,CAAC+E,EAAe,KAAKtF,GAAQO,CAAG,OAClEP,EAAOO,CAAG,IAAIqH,EAAOrH,CAAG;AAAA,MAEhC;AAGE,WAAOP;AAAA,EACT,CAAC;AAED,SAAA4hB,KAAiBL;;;;;;AC/DjB,MAAI5U,IAAelM,GAA0B,GACzCuO,IAAcnO,GAAwB,GACtCD,IAAOW,GAAiB;AAS5B,WAASsgB,EAAWC,GAAe;AACjC,WAAO,SAAS3S,GAAYtN,GAAWsU,GAAW;AAChD,UAAI/V,IAAW,OAAO+O,CAAU;AAChC,UAAI,CAACH,EAAYG,CAAU,GAAG;AAC5B,YAAIlP,IAAW0M,EAAa9K,GAAW,CAAC;AACxC,QAAAsN,IAAavO,EAAKuO,CAAU,GAC5BtN,IAAY,SAAStB,GAAK;AAAE,iBAAON,EAASG,EAASG,CAAG,GAAGA,GAAKH,CAAQ;AAAA,QAAI;AAAA,MAClF;AACI,UAAID,IAAQ2hB,EAAc3S,GAAYtN,GAAWsU,CAAS;AAC1D,aAAOhW,IAAQ,KAAKC,EAASH,IAAWkP,EAAWhP,CAAK,IAAIA,CAAK,IAAI;AAAA,IACtE;AAAA,EACH;AAEA,SAAA4hB,KAAiBF;;;;;;ACvBjB,MAAIG,IAAe;AAUnB,WAASC,EAAgBjY,GAAQ;AAG/B,aAFI7J,IAAQ6J,EAAO,QAEZ7J,OAAW6hB,EAAa,KAAKhY,EAAO,OAAO7J,CAAK,CAAC;AAAG;AAC3D,WAAOA;AAAA,EACT;AAEA,SAAA+hB,KAAiBD;;;;;;AClBjB,MAAIA,IAAkBxhB,GAA6B,GAG/C0hB,IAAc;AASlB,WAASC,EAASpY,GAAQ;AACxB,WAAOA,KACHA,EAAO,MAAM,GAAGiY,EAAgBjY,CAAM,IAAI,CAAC,EAAE,QAAQmY,GAAa,EAAE;AAAA,EAE1E;AAEA,SAAAE,KAAiBD;;;;;;AClBjB,MAAIA,IAAW3hB,GAAsB,GACjCyH,IAAWrH,GAAqB,GAChC+H,IAAWrH,GAAqB,GAGhC+gB,IAAM,KAGNC,IAAa,sBAGbC,IAAa,cAGbC,IAAY,eAGZC,IAAe;AAyBnB,WAASC,EAASzhB,GAAO;AACvB,QAAI,OAAOA,KAAS;AAClB,aAAOA;AAET,QAAI0H,EAAS1H,CAAK;AAChB,aAAOohB;AAET,QAAIpa,EAAShH,CAAK,GAAG;AACnB,UAAImB,IAAQ,OAAOnB,EAAM,WAAW,aAAaA,EAAM,QAAO,IAAKA;AACnE,MAAAA,IAAQgH,EAAS7F,CAAK,IAAKA,IAAQ,KAAMA;AAAA,IAC7C;AACE,QAAI,OAAOnB,KAAS;AAClB,aAAOA,MAAU,IAAIA,IAAQ,CAACA;AAEhC,IAAAA,IAAQkhB,EAASlhB,CAAK;AACtB,QAAI0hB,IAAWJ,EAAW,KAAKthB,CAAK;AACpC,WAAQ0hB,KAAYH,EAAU,KAAKvhB,CAAK,IACpCwhB,EAAaxhB,EAAM,MAAM,CAAC,GAAG0hB,IAAW,IAAI,CAAC,IAC5CL,EAAW,KAAKrhB,CAAK,IAAIohB,IAAM,CAACphB;AAAA,EACvC;AAEA,SAAA2hB,KAAiBF;;;;;;AC/DjB,MAAIA,IAAWliB,GAAqB,GAGhC0W,IAAW,OACX2L,IAAc;AAyBlB,WAASC,EAAS7hB,GAAO;AACvB,QAAI,CAACA;AACH,aAAOA,MAAU,IAAIA,IAAQ;AAG/B,QADAA,IAAQyhB,EAASzhB,CAAK,GAClBA,MAAUiW,KAAYjW,MAAU,QAAW;AAC7C,UAAI8hB,IAAQ9hB,IAAQ,IAAI,KAAK;AAC7B,aAAO8hB,IAAOF;AAAA,IAClB;AACE,WAAO5hB,MAAUA,IAAQA,IAAQ;AAAA,EACnC;AAEA,SAAA+hB,KAAiBF;;;;;;ACzCjB,MAAIA,IAAWtiB,GAAqB;AA4BpC,WAASyiB,EAAUhiB,GAAO;AACxB,QAAI6B,IAASggB,EAAS7hB,CAAK,GACvBiiB,IAAYpgB,IAAS;AAEzB,WAAOA,MAAWA,IAAUogB,IAAYpgB,IAASogB,IAAYpgB,IAAU;AAAA,EACzE;AAEA,SAAAqgB,KAAiBF;;;;;;ACnCjB,MAAIhN,IAAgBzV,GAA2B,GAC3CkM,IAAe9L,GAA0B,GACzCqiB,IAAY3hB,GAAsB,GAGlCsT,IAAY,KAAK;AAqCrB,WAASwO,EAAUzhB,GAAOC,GAAWsU,GAAW;AAC9C,QAAI7V,IAASsB,KAAS,OAAO,IAAIA,EAAM;AACvC,QAAI,CAACtB;AACH,aAAO;AAET,QAAIH,IAAQgW,KAAa,OAAO,IAAI+M,EAAU/M,CAAS;AACvD,WAAIhW,IAAQ,MACVA,IAAQ0U,EAAUvU,IAASH,GAAO,CAAC,IAE9B+V,EAActU,GAAO+K,EAAa9K,GAAW,CAAC,GAAG1B,CAAK;AAAA,EAC/D;AAEA,SAAAmjB,KAAiBD;;;;;;ACtDjB,MAAIxB,IAAaphB,GAAwB,GACrC4iB,IAAYxiB,GAAsB,GAsClC0iB,IAAO1B,EAAWwB,CAAS;AAE/B,SAAAG,KAAiBD;;;;;;ACzCjB,MAAIjP,IAAc7T,GAAyB;AAgB3C,WAASgjB,EAAQ7hB,GAAO;AACtB,QAAItB,IAASsB,KAAS,OAAO,IAAIA,EAAM;AACvC,WAAOtB,IAASgU,EAAY1S,GAAO,CAAC,IAAI,CAAE;AAAA,EAC5C;AAEA,SAAA8hB,KAAiBD;;;;;;ACrBjB,MAAI/iB,IAAUD,GAAqB,GAC/B8O,IAAe1O,GAA0B,GACzCygB,IAAS/f,GAAmB;AA8BhC,WAASoiB,EAAM3jB,GAAQC,GAAU;AAC/B,WAAOD,KAAU,OACbA,IACAU,EAAQV,GAAQuP,EAAatP,CAAQ,GAAGqhB,CAAM;AAAA,EACpD;AAEA,SAAAsC,KAAiBD;;;;;;ACxBjB,WAASE,EAAKjiB,GAAO;AACnB,QAAItB,IAASsB,KAAS,OAAO,IAAIA,EAAM;AACvC,WAAOtB,IAASsB,EAAMtB,IAAS,CAAC,IAAI;AAAA,EACtC;AAEA,SAAAwjB,KAAiBD;;;;;;ACnBjB,MAAIjb,IAAWnI,GAAqB;AAYpC,WAASsjB,EAAaniB,GAAO3B,GAAU6W,GAAY;AAIjD,aAHI3W,IAAQ,IACRG,IAASsB,EAAM,QAEZ,EAAEzB,IAAQG,KAAQ;AACvB,UAAIY,IAAQU,EAAMzB,CAAK,GACnB6jB,IAAU/jB,EAASiB,CAAK;AAE5B,UAAI8iB,KAAW,SAASrM,MAAa,SAC5BqM,MAAYA,KAAW,CAACpb,EAASob,CAAO,IACzClN,EAAWkN,GAASrM,CAAQ;AAElC,YAAIA,IAAWqM,GACXjhB,IAAS7B;AAAA,IAEnB;AACE,WAAO6B;AAAA,EACT;AAEA,SAAAkhB,KAAiBF;;;;;;ACtBjB,WAASG,EAAOhjB,GAAOmB,GAAO;AAC5B,WAAOnB,IAAQmB;AAAA,EACjB;AAEA,SAAA8hB,KAAiBD;;;;;;ACbjB,MAAIH,IAAetjB,GAA0B,GACzCyjB,IAASrjB,GAAoB,GAC7BsL,IAAW5K,GAAqB;AAoBpC,WAAS6iB,EAAIxiB,GAAO;AAClB,WAAQA,KAASA,EAAM,SACnBmiB,EAAaniB,GAAOuK,GAAU+X,CAAM,IACpC;AAAA,EACN;AAEA,SAAAG,KAAiBD;;;;;;AC5BjB,MAAIvX,IAAkBpM,GAA6B,GAC/CqD,IAAKjD,GAAe;AAWxB,WAASyjB,EAAiBtkB,GAAQO,GAAKW,GAAO;AAC5C,KAAKA,MAAU,UAAa,CAAC4C,EAAG9D,EAAOO,CAAG,GAAGW,CAAK,KAC7CA,MAAU,UAAa,EAAEX,KAAOP,OACnC6M,EAAgB7M,GAAQO,GAAKW,CAAK;AAAA,EAEtC;AAEA,SAAAqjB,KAAiBD;;;;;;ACnBjB,MAAI3b,IAAalI,GAAwB,GACrCgT,IAAe5S,GAA0B,GACzC2G,IAAejG,GAAyB,GAGxCmF,IAAY,mBAGZ8d,IAAY,SAAS,WACrBnf,IAAc,OAAO,WAGrBof,IAAeD,EAAU,UAGzBlf,IAAiBD,EAAY,gBAG7Bqf,IAAmBD,EAAa,KAAK,MAAM;AA8B/C,WAASE,EAAczjB,GAAO;AAC5B,QAAI,CAACsG,EAAatG,CAAK,KAAKyH,EAAWzH,CAAK,KAAKwF;AAC/C,aAAO;AAET,QAAIke,IAAQnR,EAAavS,CAAK;AAC9B,QAAI0jB,MAAU;AACZ,aAAO;AAET,QAAI5Q,IAAO1O,EAAe,KAAKsf,GAAO,aAAa,KAAKA,EAAM;AAC9D,WAAO,OAAO5Q,KAAQ,cAAcA,aAAgBA,KAClDyQ,EAAa,KAAKzQ,CAAI,KAAK0Q;AAAA,EAC/B;AAEA,SAAAG,KAAiBF;;;;;;ACrDjB,WAASG,EAAQ9kB,GAAQO,GAAK;AAC5B,QAAI,EAAAA,MAAQ,iBAAiB,OAAOP,EAAOO,CAAG,KAAM,eAIhDA,KAAO;AAIX,aAAOP,EAAOO,CAAG;AAAA,EACnB;AAEA,SAAAwkB,KAAiBD;;;;;;ACpBjB,MAAIE,IAAavkB,GAAwB,GACrC6gB,IAASzgB,GAAmB;AA0BhC,WAASokB,EAAc/jB,GAAO;AAC5B,WAAO8jB,EAAW9jB,GAAOogB,EAAOpgB,CAAK,CAAC;AAAA,EACxC;AAEA,SAAAgkB,KAAiBD;;;;;;AC/BjB,MAAIX,IAAmB7jB,GAA8B,GACjD0kB,IAActkB,GAAyB,GACvCukB,IAAkB7jB,GAA6B,GAC/C8jB,IAAYthB,GAAuB,GACnCuhB,IAAkBthB,GAA6B,GAC/CyH,IAAcxH,GAAwB,GACtCkC,IAAUE,EAAoB,GAC9ByR,IAAoBvR,GAA8B,GAClDH,IAAWuN,GAAqB,GAChCD,IAAaE,GAAuB,GACpC1L,IAAWsQ,GAAqB,GAChCmM,IAAgBlM,GAA0B,GAC1CnS,IAAeoS,GAAyB,GACxCoM,IAAUnM,GAAqB,GAC/BsM,IAAgBrM,GAA0B;AAiB9C,WAAS2M,EAAcvlB,GAAQ4H,GAAQrH,GAAKilB,GAAUC,GAAWljB,GAAYE,GAAO;AAClF,QAAIoD,IAAWif,EAAQ9kB,GAAQO,CAAG,GAC9ByH,IAAW8c,EAAQld,GAAQrH,CAAG,GAC9B2E,IAAUzC,EAAM,IAAIuF,CAAQ;AAEhC,QAAI9C,GAAS;AACX,MAAAof,EAAiBtkB,GAAQO,GAAK2E,CAAO;AACrC;AAAA,IACJ;AACE,QAAIwgB,IAAWnjB,IACXA,EAAWsD,GAAUmC,GAAWzH,IAAM,IAAKP,GAAQ4H,GAAQnF,CAAK,IAChE,QAEAgV,IAAWiO,MAAa;AAE5B,QAAIjO,GAAU;AACZ,UAAI3D,IAAQ3N,EAAQ6B,CAAQ,GACxB2d,IAAS,CAAC7R,KAAS1N,EAAS4B,CAAQ,GACpC4d,IAAU,CAAC9R,KAAS,CAAC6R,KAAUrf,EAAa0B,CAAQ;AAExD,MAAA0d,IAAW1d,GACP8L,KAAS6R,KAAUC,IACjBzf,EAAQN,CAAQ,IAClB6f,IAAW7f,IAEJiS,EAAkBjS,CAAQ,IACjC6f,IAAWL,EAAUxf,CAAQ,IAEtB8f,KACPlO,IAAW,IACXiO,IAAWP,EAAYnd,GAAU,EAAI,KAE9B4d,KACPnO,IAAW,IACXiO,IAAWN,EAAgBpd,GAAU,EAAI,KAGzC0d,IAAW,CAAE,IAGRf,EAAc3c,CAAQ,KAAKyD,EAAYzD,CAAQ,KACtD0d,IAAW7f,GACP4F,EAAY5F,CAAQ,IACtB6f,IAAWT,EAAcpf,CAAQ,KAE1B,CAACqC,EAASrC,CAAQ,KAAK6N,EAAW7N,CAAQ,OACjD6f,IAAWJ,EAAgBtd,CAAQ,MAIrCyP,IAAW;AAAA,IAEjB;AACE,IAAIA,MAEFhV,EAAM,IAAIuF,GAAU0d,CAAQ,GAC5BD,EAAUC,GAAU1d,GAAUwd,GAAUjjB,GAAYE,CAAK,GACzDA,EAAM,OAAUuF,CAAQ,IAE1Bsc,EAAiBtkB,GAAQO,GAAKmlB,CAAQ;AAAA,EACxC;AAEA,SAAAG,KAAiBN;;;;;;AC7FjB,MAAItf,IAAQxF,GAAmB,GAC3B6jB,IAAmBzjB,GAA8B,GACjDH,IAAUa,GAAqB,GAC/BgkB,IAAgBxhB,GAA2B,GAC3CmE,IAAWlE,GAAqB,GAChCsd,IAASrd,GAAmB,GAC5B6gB,IAAUze,GAAqB;AAanC,WAASyf,EAAU9lB,GAAQ4H,GAAQ4d,GAAUjjB,GAAYE,GAAO;AAC9D,IAAIzC,MAAW4H,KAGflH,EAAQkH,GAAQ,SAASI,GAAUzH,GAAK;AAEtC,UADAkC,MAAUA,IAAQ,IAAIwD,MAClBiC,EAASF,CAAQ;AACnB,QAAAud,EAAcvlB,GAAQ4H,GAAQrH,GAAKilB,GAAUM,GAAWvjB,GAAYE,CAAK;AAAA,WAEtE;AACH,YAAIijB,IAAWnjB,IACXA,EAAWuiB,EAAQ9kB,GAAQO,CAAG,GAAGyH,GAAWzH,IAAM,IAAKP,GAAQ4H,GAAQnF,CAAK,IAC5E;AAEJ,QAAIijB,MAAa,WACfA,IAAW1d,IAEbsc,EAAiBtkB,GAAQO,GAAKmlB,CAAQ;AAAA,MAC5C;AAAA,IACG,GAAEpE,CAAM;AAAA,EACX;AAEA,SAAAyE,KAAiBD;;;;;;ACzCjB,MAAI9P,IAAWvV,GAAsB,GACjC2gB,IAAiBvgB,GAA4B;AASjD,WAASmlB,EAAeC,GAAU;AAChC,WAAOjQ,EAAS,SAAShW,GAAQwhB,GAAS;AACxC,UAAIrhB,IAAQ,IACRG,IAASkhB,EAAQ,QACjBjf,IAAajC,IAAS,IAAIkhB,EAAQlhB,IAAS,CAAC,IAAI,QAChDmhB,IAAQnhB,IAAS,IAAIkhB,EAAQ,CAAC,IAAI;AAWtC,WATAjf,IAAc0jB,EAAS,SAAS,KAAK,OAAO1jB,KAAc,cACrDjC,KAAUiC,KACX,QAEAkf,KAASL,EAAeI,EAAQ,CAAC,GAAGA,EAAQ,CAAC,GAAGC,CAAK,MACvDlf,IAAajC,IAAS,IAAI,SAAYiC,GACtCjC,IAAS,IAEXN,IAAS,OAAOA,CAAM,GACf,EAAEG,IAAQG,KAAQ;AACvB,YAAIsH,IAAS4Z,EAAQrhB,CAAK;AAC1B,QAAIyH,KACFqe,EAASjmB,GAAQ4H,GAAQzH,GAAOoC,CAAU;AAAA,MAElD;AACI,aAAOvC;AAAA,IACX,CAAG;AAAA,EACH;AAEA,SAAAkmB,KAAiBF;;;;;;ACpCjB,MAAIF,IAAYrlB,GAAuB,GACnCulB,IAAiBnlB,GAA4B,GAiC7CslB,IAAQH,EAAe,SAAShmB,GAAQ4H,GAAQ4d,GAAU;AAC5D,IAAAM,EAAU9lB,GAAQ4H,GAAQ4d,CAAQ;AAAA,EACpC,CAAC;AAED,SAAAY,KAAiBD;;;;;;AC7BjB,WAASE,EAAOnlB,GAAOmB,GAAO;AAC5B,WAAOnB,IAAQmB;AAAA,EACjB;AAEA,SAAAikB,KAAiBD;;;;;;ACbjB,MAAItC,IAAetjB,GAA0B,GACzC4lB,IAASxlB,GAAoB,GAC7BsL,IAAW5K,GAAqB;AAoBpC,WAAS8b,EAAIzb,GAAO;AAClB,WAAQA,KAASA,EAAM,SACnBmiB,EAAaniB,GAAOuK,GAAUka,CAAM,IACpC;AAAA,EACN;AAEA,SAAAE,KAAiBlJ;;;;;;AC5BjB,MAAI0G,IAAetjB,GAA0B,GACzCkM,IAAe9L,GAA0B,GACzCwlB,IAAS9kB,GAAoB;AAyBjC,WAASilB,EAAM5kB,GAAO3B,GAAU;AAC9B,WAAQ2B,KAASA,EAAM,SACnBmiB,EAAaniB,GAAO+K,EAAa1M,GAAU,CAAC,GAAGomB,CAAM,IACrD;AAAA,EACN;AAEA,SAAAI,KAAiBD;;;;;;ACjCjB,MAAIE,IAAOjmB,GAAkB,GAkBzBkmB,IAAM,WAAW;AACnB,WAAOD,EAAK,KAAK,IAAK;AAAA,EACvB;AAED,SAAAE,KAAiBD;;;;;;ACtBjB,MAAIE,IAAcpmB,GAAyB,GACvCoK,IAAWhK,GAAsB,GACjC6K,IAAUnK,GAAqB,GAC/B2G,IAAWnE,GAAqB,GAChCgH,IAAQ/G,GAAmB;AAY/B,WAAS8iB,EAAQ9mB,GAAQkL,GAAMhK,GAAOqB,GAAY;AAChD,QAAI,CAAC2F,EAASlI,CAAM;AAClB,aAAOA;AAET,IAAAkL,IAAOL,EAASK,GAAMlL,CAAM;AAO5B,aALIG,IAAQ,IACRG,IAAS4K,EAAK,QACd6b,IAAYzmB,IAAS,GACrB0mB,IAAShnB,GAENgnB,KAAU,QAAQ,EAAE7mB,IAAQG,KAAQ;AACzC,UAAIC,IAAMwK,EAAMG,EAAK/K,CAAK,CAAC,GACvBulB,IAAWxkB;AAEf,UAAIX,MAAQ,eAAeA,MAAQ,iBAAiBA,MAAQ;AAC1D,eAAOP;AAGT,UAAIG,KAAS4mB,GAAW;AACtB,YAAIlhB,IAAWmhB,EAAOzmB,CAAG;AACzB,QAAAmlB,IAAWnjB,IAAaA,EAAWsD,GAAUtF,GAAKymB,CAAM,IAAI,QACxDtB,MAAa,WACfA,IAAWxd,EAASrC,CAAQ,IACxBA,IACC6F,EAAQR,EAAK/K,IAAQ,CAAC,CAAC,IAAI,CAAE,IAAG;MAE7C;AACI,MAAA0mB,EAAYG,GAAQzmB,GAAKmlB,CAAQ,GACjCsB,IAASA,EAAOzmB,CAAG;AAAA,IACvB;AACE,WAAOP;AAAA,EACT;AAEA,SAAAinB,KAAiBH;;;;;;AClDjB,MAAI7b,IAAUxK,GAAqB,GAC/BqmB,IAAUjmB,GAAqB,GAC/BgK,IAAWtJ,GAAsB;AAWrC,WAAS2lB,EAAWlnB,GAAQmnB,GAAOtlB,GAAW;AAK5C,aAJI1B,IAAQ,IACRG,IAAS6mB,EAAM,QACfpkB,IAAS,CAAE,GAER,EAAE5C,IAAQG,KAAQ;AACvB,UAAI4K,IAAOic,EAAMhnB,CAAK,GAClBe,IAAQ+J,EAAQjL,GAAQkL,CAAI;AAEhC,MAAIrJ,EAAUX,GAAOgK,CAAI,KACvB4b,EAAQ/jB,GAAQ8H,EAASK,GAAMlL,CAAM,GAAGkB,CAAK;AAAA,IAEnD;AACE,WAAO6B;AAAA,EACT;AAEA,SAAAqkB,KAAiBF;;;;;;AC7BjB,MAAIA,IAAazmB,GAAwB,GACrCsL,IAAQlL,GAAkB;AAW9B,WAASwmB,EAASrnB,GAAQmnB,GAAO;AAC/B,WAAOD,EAAWlnB,GAAQmnB,GAAO,SAASjmB,GAAOgK,GAAM;AACrD,aAAOa,EAAM/L,GAAQkL,CAAI;AAAA,IAC7B,CAAG;AAAA,EACH;AAEA,SAAAoc,KAAiBD;;;;;;AClBjB,MAAI5D,IAAUhjB,GAAoB,GAC9BqU,IAAWjU,GAAsB,GACjCiV,IAAcvU,GAAyB;AAS3C,WAASgmB,EAASle,GAAM;AACtB,WAAOyM,EAAYhB,EAASzL,GAAM,QAAWoa,CAAO,GAAGpa,IAAO,EAAE;AAAA,EAClE;AAEA,SAAAme,KAAiBD;;;;;;ACfjB,MAAIF,IAAW5mB,GAAsB,GACjC8mB,IAAW1mB,GAAsB,GAmBjC4mB,IAAOF,EAAS,SAASvnB,GAAQmnB,GAAO;AAC1C,WAAOnnB,KAAU,OAAO,CAAA,IAAKqnB,EAASrnB,GAAQmnB,CAAK;AAAA,EACrD,CAAC;AAED,SAAAO,KAAiBD;;;;;;ACvBjB,MAAIE,IAAa,KAAK,MAClB9S,IAAY,KAAK;AAarB,WAAS+S,EAAU7S,GAAO8S,GAAKC,GAAM/nB,GAAW;AAK9C,aAJII,IAAQ,IACRG,IAASuU,EAAU8S,GAAYE,IAAM9S,MAAU+S,KAAQ,EAAE,GAAG,CAAC,GAC7D/kB,IAAS,MAAMzC,CAAM,GAElBA;AACL,MAAAyC,EAAOhD,IAAYO,IAAS,EAAEH,CAAK,IAAI4U,GACvCA,KAAS+S;AAEX,WAAO/kB;AAAA,EACT;AAEA,SAAAglB,KAAiBH;;;;;;AC3BjB,MAAIA,IAAYnnB,GAAuB,GACnC2gB,IAAiBvgB,GAA4B,GAC7CkiB,IAAWxhB,GAAqB;AASpC,WAASymB,EAAYjoB,GAAW;AAC9B,WAAO,SAASgV,GAAO8S,GAAKC,GAAM;AAChC,aAAIA,KAAQ,OAAOA,KAAQ,YAAY1G,EAAerM,GAAO8S,GAAKC,CAAI,MACpED,IAAMC,IAAO,SAGf/S,IAAQgO,EAAShO,CAAK,GAClB8S,MAAQ,UACVA,IAAM9S,GACNA,IAAQ,KAER8S,IAAM9E,EAAS8E,CAAG,GAEpBC,IAAOA,MAAS,SAAa/S,IAAQ8S,IAAM,IAAI,KAAM9E,EAAS+E,CAAI,GAC3DF,EAAU7S,GAAO8S,GAAKC,GAAM/nB,CAAS;AAAA,IAC7C;AAAA,EACH;AAEA,SAAAkoB,KAAiBD;;;;;;AC7BjB,MAAIA,IAAcvnB,GAAyB,GA2CvCynB,IAAQF,EAAa;AAEzB,SAAAG,KAAiBD;;;;;;ACnCjB,WAASE,EAAWxmB,GAAOymB,GAAU;AACnC,QAAI/nB,IAASsB,EAAM;AAGnB,SADAA,EAAM,KAAKymB,CAAQ,GACZ/nB;AACL,MAAAsB,EAAMtB,CAAM,IAAIsB,EAAMtB,CAAM,EAAE;AAEhC,WAAOsB;AAAA,EACT;AAEA,SAAA0mB,KAAiBF;;;;;;ACpBjB,MAAIxf,IAAWnI,GAAqB;AAUpC,WAAS8nB,EAAiBrnB,GAAOmB,GAAO;AACtC,QAAInB,MAAUmB,GAAO;AACnB,UAAImmB,IAAetnB,MAAU,QACzBunB,IAAYvnB,MAAU,MACtBwnB,IAAiBxnB,MAAUA,GAC3BynB,IAAc/f,EAAS1H,CAAK,GAE5B0nB,IAAevmB,MAAU,QACzBwmB,IAAYxmB,MAAU,MACtBymB,IAAiBzmB,MAAUA,GAC3B0mB,IAAcngB,EAASvG,CAAK;AAEhC,UAAK,CAACwmB,KAAa,CAACE,KAAe,CAACJ,KAAeznB,IAAQmB,KACtDsmB,KAAeC,KAAgBE,KAAkB,CAACD,KAAa,CAACE,KAChEN,KAAaG,KAAgBE,KAC7B,CAACN,KAAgBM,KAClB,CAACJ;AACH,eAAO;AAET,UAAK,CAACD,KAAa,CAACE,KAAe,CAACI,KAAe7nB,IAAQmB,KACtD0mB,KAAeP,KAAgBE,KAAkB,CAACD,KAAa,CAACE,KAChEE,KAAaL,KAAgBE,KAC7B,CAACE,KAAgBF,KAClB,CAACI;AACH,eAAO;AAAA,IAEb;AACE,WAAO;AAAA,EACT;AAEA,SAAAE,KAAiBT;;;;;;ACxCjB,MAAIA,IAAmB9nB,GAA8B;AAgBrD,WAASwoB,EAAgBjpB,GAAQqC,GAAO6mB,GAAQ;AAO9C,aANI/oB,IAAQ,IACRgpB,IAAcnpB,EAAO,UACrBopB,IAAc/mB,EAAM,UACpB/B,IAAS6oB,EAAY,QACrBE,IAAeH,EAAO,QAEnB,EAAE/oB,IAAQG,KAAQ;AACvB,UAAIyC,IAASwlB,EAAiBY,EAAYhpB,CAAK,GAAGipB,EAAYjpB,CAAK,CAAC;AACpE,UAAI4C,GAAQ;AACV,YAAI5C,KAASkpB;AACX,iBAAOtmB;AAET,YAAIsd,IAAQ6I,EAAO/oB,CAAK;AACxB,eAAO4C,KAAUsd,KAAS,SAAS,KAAK;AAAA,MAC9C;AAAA,IACA;AAQE,WAAOrgB,EAAO,QAAQqC,EAAM;AAAA,EAC9B;AAEA,SAAAinB,KAAiBL;;;;;;AC3CjB,MAAI3e,IAAW7J,GAAsB,GACjCwK,IAAUpK,GAAqB,GAC/B8L,IAAepL,GAA0B,GACzCqP,IAAU7M,GAAqB,GAC/BqkB,IAAapkB,GAAwB,GACrCulB,IAAYtlB,GAAuB,GACnCglB,IAAkB5iB,GAA6B,GAC/C8F,IAAW5F,GAAqB,GAChCJ,IAAUwN,EAAoB;AAWlC,WAAS6V,EAAYra,GAAYsa,GAAWP,GAAQ;AAClD,IAAIO,EAAU,SACZA,IAAYnf,EAASmf,GAAW,SAASxpB,GAAU;AACjD,aAAIkG,EAAQlG,CAAQ,IACX,SAASiB,GAAO;AACrB,eAAO+J,EAAQ/J,GAAOjB,EAAS,WAAW,IAAIA,EAAS,CAAC,IAAIA,CAAQ;AAAA,MAC9E,IAEaA;AAAA,IACb,CAAK,IAEDwpB,IAAY,CAACtd,CAAQ;AAGvB,QAAIhM,IAAQ;AACZ,IAAAspB,IAAYnf,EAASmf,GAAWF,EAAU5c,CAAY,CAAC;AAEvD,QAAI5J,IAAS6N,EAAQzB,GAAY,SAASjO,GAAOX,GAAK4O,GAAY;AAChE,UAAIua,IAAWpf,EAASmf,GAAW,SAASxpB,GAAU;AACpD,eAAOA,EAASiB,CAAK;AAAA,MAC3B,CAAK;AACD,aAAO,EAAE,UAAYwoB,GAAU,OAAS,EAAEvpB,GAAO,OAASe,EAAO;AAAA,IACrE,CAAG;AAED,WAAOknB,EAAWrlB,GAAQ,SAAS/C,GAAQqC,GAAO;AAChD,aAAO4mB,EAAgBjpB,GAAQqC,GAAO6mB,CAAM;AAAA,IAChD,CAAG;AAAA,EACH;AAEA,SAAAS,KAAiBH;;;;;;AChDjB,MAAIlV,IAAc7T,GAAyB,GACvC+oB,IAAc3oB,GAAyB,GACvCmV,IAAWzU,GAAsB,GACjC6f,IAAiBrd,GAA4B,GA+B7C6lB,IAAS5T,EAAS,SAAS7G,GAAYsa,GAAW;AACpD,QAAIta,KAAc;AAChB,aAAO,CAAE;AAEX,QAAI7O,IAASmpB,EAAU;AACvB,WAAInpB,IAAS,KAAK8gB,EAAejS,GAAYsa,EAAU,CAAC,GAAGA,EAAU,CAAC,CAAC,IACrEA,IAAY,CAAE,IACLnpB,IAAS,KAAK8gB,EAAeqI,EAAU,CAAC,GAAGA,EAAU,CAAC,GAAGA,EAAU,CAAC,CAAC,MAC9EA,IAAY,CAACA,EAAU,CAAC,CAAC,IAEpBD,EAAYra,GAAYmF,EAAYmV,GAAW,CAAC,GAAG,EAAE;AAAA,EAC9D,CAAC;AAED,SAAAI,KAAiBD;;;;;;AC/CjB,MAAIjf,IAAWlK,GAAqB,GAGhCqpB,IAAY;AAmBhB,WAASC,EAASC,GAAQ;AACxB,QAAIC,IAAK,EAAEH;AACX,WAAOnf,EAASqf,CAAM,IAAIC;AAAA,EAC5B;AAEA,SAAAC,KAAiBH;;;;;;AClBjB,WAASI,EAAc9pB,GAAOoB,GAAQ2oB,GAAY;AAMhD,aALIjqB,IAAQ,IACRG,IAASD,EAAM,QACfgqB,IAAa5oB,EAAO,QACpBsB,IAAS,CAAE,GAER,EAAE5C,IAAQG,KAAQ;AACvB,UAAIY,IAAQf,IAAQkqB,IAAa5oB,EAAOtB,CAAK,IAAI;AACjD,MAAAiqB,EAAWrnB,GAAQ1C,EAAMF,CAAK,GAAGe,CAAK;AAAA,IAC1C;AACE,WAAO6B;AAAA,EACT;AAEA,SAAAunB,KAAiBH;;;;;;ACtBjB,MAAItD,IAAcpmB,GAAyB,GACvC0pB,IAAgBtpB,GAA2B;AAkB/C,WAAS0pB,EAAUlqB,GAAOoB,GAAQ;AAChC,WAAO0oB,EAAc9pB,KAAS,CAAA,GAAIoB,KAAU,CAAA,GAAIolB,CAAW;AAAA,EAC7D;AAEA,SAAA2D,KAAiBD;;;;;;ACrBjB,MAAIjS;AAEJ,MAAI,OAAOC,MAAY;AACrB,QAAI;AACF,MAAAD,IAAS;AAAA,QACP,WAAW7X,GAA2B;AAAA,QACtC,UAAUI,GAA0B;AAAA,QACpC,UAAUU,GAA0B;AAAA,QACpC,MAAMwC,GAAsB;AAAA,QAC5B,QAAQC,GAAwB;AAAA,QAChC,MAAMC,GAAsB;AAAA,QAC5B,SAASoC,GAAyB;AAAA,QAClC,SAASE,GAAyB;AAAA,QAClC,OAAOoN,GAAuB;AAAA,QAC9B,KAAMC,GAAqB;AAAA,QAC3B,aAAa4E,GAA6B;AAAA,QAC1C,MAAMC,GAAsB;AAAA,QAC5B,KAAKC,GAAqB;AAAA,QAC1B,WAAWC,GAA2B;AAAA,QACtC,KAAKC,GAAqB;AAAA,QAC1B,OAAOC,GAAuB;AAAA,QAC9B,KAAK4R,GAAqB;AAAA,QAC1B,OAAOC,GAAuB;AAAA,QAC9B,KAAKC,GAAqB;AAAA,QAC1B,MAAMC,GAAsB;AAAA,QAC5B,OAAOC,GAAuB;AAAA,QAC9B,QAAQC,GAAwB;AAAA,QAChC,QAAQC,GAAwB;AAAA,QAChC,UAAUC,GAA0B;AAAA,QACpC,QAAQC,GAAwB;AAAA,QAChC,WAAWC,GAA2B;AAAA,MACvC;AAAA,IACF,QAAW;AAAA,IAEd;AAGA,SAAK5S,MACHA,IAAS,OAAO,IAGlBQ,KAAiBR;;;;;UCtCjB6S,KAAiBC;AAEjB,WAASA,IAAO;AACd,QAAIC,IAAW,CAAE;AACjB,IAAAA,EAAS,QAAQA,EAAS,QAAQA,GAClC,KAAK,YAAYA;AAAA,EACnB;AAEA,EAAAD,EAAK,UAAU,UAAU,WAAW;AAClC,QAAIC,IAAW,KAAK,WAChB7O,IAAQ6O,EAAS;AACrB,QAAI7O,MAAU6O;AACZ,aAAAC,EAAO9O,CAAK,GACLA;AAAA,EAEV,GAED4O,EAAK,UAAU,UAAU,SAAS5O,GAAO;AACvC,QAAI6O,IAAW,KAAK;AACpB,IAAI7O,EAAM,SAASA,EAAM,SACvB8O,EAAO9O,CAAK,GAEdA,EAAM,QAAQ6O,EAAS,OACvBA,EAAS,MAAM,QAAQ7O,GACvB6O,EAAS,QAAQ7O,GACjBA,EAAM,QAAQ6O;AAAA,EACf,GAEDD,EAAK,UAAU,WAAW,WAAW;AAInC,aAHIG,IAAO,CAAE,GACTF,IAAW,KAAK,WAChBG,IAAOH,EAAS,OACbG,MAASH;AACd,MAAAE,EAAK,KAAK,KAAK,UAAUC,GAAMC,CAAc,CAAC,GAC9CD,IAAOA,EAAK;AAEd,WAAO,MAAMD,EAAK,KAAK,IAAI,IAAI;AAAA,EAChC;AAED,WAASD,EAAO9O,GAAO;AACrB,IAAAA,EAAM,MAAM,QAAQA,EAAM,OAC1BA,EAAM,MAAM,QAAQA,EAAM,OAC1B,OAAOA,EAAM,OACb,OAAOA,EAAM;AAAA,EACf;AAEA,WAASiP,EAAejQ,GAAG/B,GAAG;AAC5B,QAAI+B,MAAM,WAAWA,MAAM;AACzB,aAAO/B;AAAA,EAEX;;;;;;;ACvDA,MAAIV,IAAItY,EAAmB,GACvBwY,IAAQpY,EAAqB,EAAC,OAC9BuqB,IAAO7pB,GAAsB;AASjC,EAAAmqB,KAAiBC;AAEjB,MAAIC,IAAoB7S,EAAE,SAAS,CAAC;AAEpC,WAAS4S,EAAUzP,GAAG8B,GAAU;AAC9B,QAAI9B,EAAE,UAAW,KAAI;AACnB,aAAO,CAAE;AAEX,QAAI2P,IAAQC,EAAW5P,GAAG8B,KAAY4N,CAAiB,GACnDzN,IAAU4N,EAAYF,EAAM,OAAOA,EAAM,SAASA,EAAM,OAAO;AAGnE,WAAO9S,EAAE,QAAQA,EAAE,IAAIoF,GAAS,SAASvE,GAAG;AAC1C,aAAOsC,EAAE,SAAStC,EAAE,GAAGA,EAAE,CAAC;AAAA,IAC3B,CAAA,GAAG,EAAI;AAAA,EACV;AAEA,WAASmS,EAAY7P,GAAG8P,GAASC,GAAS;AAMxC,aALI9N,IAAU,CAAE,GACZqD,IAAUwK,EAAQA,EAAQ,SAAS,CAAC,GACpCE,IAAQF,EAAQ,CAAC,GAEjBxP,GACGN,EAAE,eAAa;AACpB,aAAQM,IAAQ0P,EAAM;AAAgB,QAAAC,EAAWjQ,GAAG8P,GAASC,GAASzP,CAAK;AAC3E,aAAQA,IAAQgF,EAAQ;AAAc,QAAA2K,EAAWjQ,GAAG8P,GAASC,GAASzP,CAAK;AAC3E,UAAIN,EAAE;AACJ,iBAASoB,IAAI0O,EAAQ,SAAS,GAAG1O,IAAI,GAAG,EAAEA;AAExC,cADAd,IAAQwP,EAAQ1O,CAAC,EAAE,QAAS,GACxBd,GAAO;AACT,YAAA2B,IAAUA,EAAQ,OAAOgO,EAAWjQ,GAAG8P,GAASC,GAASzP,GAAO,EAAI,CAAC;AACrE;AAAA,UACV;AAAA;AAAA,IAGA;AAEE,WAAO2B;AAAA,EACT;AAEA,WAASgO,EAAWjQ,GAAG8P,GAASC,GAASzP,GAAO4P,GAAqB;AACnE,QAAIjO,IAAUiO,IAAsB,CAAA,IAAK;AAEzC,WAAArT,EAAE,QAAQmD,EAAE,QAAQM,EAAM,CAAC,GAAG,SAASvB,GAAM;AAC3C,UAAIuD,IAAStC,EAAE,KAAKjB,CAAI,GACpBoR,IAASnQ,EAAE,KAAKjB,EAAK,CAAC;AAE1B,MAAImR,KACFjO,EAAQ,KAAK,EAAE,GAAGlD,EAAK,GAAG,GAAGA,EAAK,GAAG,GAGvCoR,EAAO,OAAO7N,GACd8N,EAAaN,GAASC,GAASI,CAAM;AAAA,IACzC,CAAG,GAEDtT,EAAE,QAAQmD,EAAE,SAASM,EAAM,CAAC,GAAG,SAASvB,GAAM;AAC5C,UAAIuD,IAAStC,EAAE,KAAKjB,CAAI,GACpBT,IAAIS,EAAK,GACTsD,IAASrC,EAAE,KAAK1B,CAAC;AACrB,MAAA+D,EAAO,MAASC,GAChB8N,EAAaN,GAASC,GAAS1N,CAAM;AAAA,IACzC,CAAG,GAEDrC,EAAE,WAAWM,EAAM,CAAC,GAEb2B;AAAA,EACT;AAEA,WAAS2N,EAAW5P,GAAG8B,GAAU;AAC/B,QAAIuO,IAAW,IAAItT,EAAO,GACtBuT,IAAQ,GACRC,IAAS;AAEb,IAAA1T,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAS,GAAG;AAC/B,MAAAqQ,EAAS,QAAQ,GAAG,EAAE,GAAM,IAAM,GAAG,KAAK,GAAG;AAAA,IACjD,CAAG,GAIDxT,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAI8S,IAAaH,EAAS,KAAK3S,EAAE,GAAGA,EAAE,CAAC,KAAK,GACxC4E,IAASR,EAASpE,CAAC,GACnBmH,IAAa2L,IAAalO;AAC9B,MAAA+N,EAAS,QAAQ3S,EAAE,GAAGA,EAAE,GAAGmH,CAAU,GACrC0L,IAAS,KAAK,IAAIA,GAAQF,EAAS,KAAK3S,EAAE,CAAC,EAAE,OAAO4E,CAAM,GAC1DgO,IAAS,KAAK,IAAIA,GAAQD,EAAS,KAAK3S,EAAE,CAAC,EAAE,MAAU4E,CAAM;AAAA,IACjE,CAAG;AAED,QAAIwN,IAAUjT,EAAE,MAAM0T,IAASD,IAAQ,CAAC,EAAE,IAAI,WAAW;AAAE,aAAO,IAAIpB,EAAI;AAAA,IAAG,CAAE,GAC3Ea,IAAUO,IAAQ;AAEtB,WAAAzT,EAAE,QAAQwT,EAAS,MAAO,GAAE,SAAS,GAAG;AACtC,MAAAD,EAAaN,GAASC,GAASM,EAAS,KAAK,CAAC,CAAC;AAAA,IACnD,CAAG,GAEM,EAAE,OAAOA,GAAU,SAASP,GAAS,SAASC,EAAS;AAAA,EAChE;AAEA,WAASK,EAAaN,GAASC,GAASzP,GAAO;AAC7C,IAAKA,EAAM,MAECA,EAAM,KAGhBwP,EAAQxP,EAAM,MAAMA,EAAM,KAAQyP,CAAO,EAAE,QAAQzP,CAAK,IAFxDwP,EAAQA,EAAQ,SAAS,CAAC,EAAE,QAAQxP,CAAK,IAFzCwP,EAAQ,CAAC,EAAE,QAAQxP,CAAK;AAAA,EAM5B;;;;;;;ACnHA,MAAIzD,IAAItY,EAAmB,GACvBkrB,IAAY9qB,GAAuB;AAEvC,EAAA8rB,KAAiB;AAAA,IACf,KAAKC;AAAA,IACL,MAAMC;AAAA,EACP;AAED,WAASD,EAAI1Q,GAAG;AACd,QAAI4Q,IAAO5Q,EAAE,MAAK,EAAG,cAAc,WAC/ByP,EAAUzP,GAAG8B,EAAS9B,CAAC,CAAC,IACxB6Q,EAAO7Q,CAAC;AACZ,IAAAnD,EAAE,QAAQ+T,GAAK,SAASlT,GAAG;AACzB,UAAIN,IAAQ4C,EAAE,KAAKtC,CAAC;AACpB,MAAAsC,EAAE,WAAWtC,CAAC,GACdN,EAAM,cAAcM,EAAE,MACtBN,EAAM,WAAW,IACjB4C,EAAE,QAAQtC,EAAE,GAAGA,EAAE,GAAGN,GAAOP,EAAE,SAAS,KAAK,CAAC;AAAA,IAChD,CAAG;AAED,aAASiF,EAAS9B,GAAG;AACnB,aAAO,SAAStC,GAAG;AACjB,eAAOsC,EAAE,KAAKtC,CAAC,EAAE;AAAA,MAClB;AAAA,IACL;AAAA,EACA;AAEA,WAASmT,EAAO7Q,GAAG;AACjB,QAAI4Q,IAAM,CAAE,GACRrqB,IAAQ,CAAE,GACVka,IAAU,CAAE;AAEhB,aAASG,EAAIrD,GAAG;AACd,MAAIV,EAAE,IAAI4D,GAASlD,CAAC,MAGpBkD,EAAQlD,CAAC,IAAI,IACbhX,EAAMgX,CAAC,IAAI,IACXV,EAAE,QAAQmD,EAAE,SAASzC,CAAC,GAAG,SAASG,GAAG;AACnC,QAAIb,EAAE,IAAItW,GAAOmX,EAAE,CAAC,IAClBkT,EAAI,KAAKlT,CAAC,IAEVkD,EAAIlD,EAAE,CAAC;AAAA,MAEf,CAAK,GACD,OAAOnX,EAAMgX,CAAC;AAAA,IAClB;AAEE,WAAAV,EAAE,QAAQmD,EAAE,MAAK,GAAIY,CAAG,GACjBgQ;AAAA,EACT;AAEA,WAASD,EAAK3Q,GAAG;AACf,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIN,IAAQ4C,EAAE,KAAKtC,CAAC;AACpB,UAAIN,EAAM,UAAU;AAClB,QAAA4C,EAAE,WAAWtC,CAAC;AAEd,YAAIoT,IAAc1T,EAAM;AACxB,eAAOA,EAAM,UACb,OAAOA,EAAM,aACb4C,EAAE,QAAQtC,EAAE,GAAGA,EAAE,GAAGN,GAAO0T,CAAW;AAAA,MAC5C;AAAA,IACA,CAAG;AAAA,EACH;;;;;;;AC9DA,MAAIjU,IAAItY,EAAmB,GACvBwY,IAAQpY,EAAqB,EAAC;AAElCosB,EAAAA,KAAiB;AAAA,IACf,cAAcC;AAAA,IACd,UAAUC;AAAA,IACV,oBAAoBC;AAAA,IACpB,kBAAkBC;AAAA,IAClB,oBAAoBC;AAAA,IACpB,eAAeC;AAAA,IACf,kBAAkBC;AAAA,IAClB,gBAAgBC;AAAA,IAChB,kBAAkBC;AAAA,IAClB,eAAeC;AAAA,IACf,SAASC;AAAA,IACT,WAAWC;AAAA,IACX,MAAMC;AAAA,IACN,QAAQC;AAAA,EACT;AAKD,WAASb,EAAahR,GAAGjT,GAAM+kB,GAAOvT,GAAM;AAC1C,QAAIhB;AACJ;AACE,MAAAA,IAAIV,EAAE,SAAS0B,CAAI;AAAA,WACZyB,EAAE,QAAQzC,CAAC;AAEpB,WAAAuU,EAAM,QAAQ/kB,GACdiT,EAAE,QAAQzC,GAAGuU,CAAK,GACXvU;AAAA,EACT;AAMA,WAAS0T,EAASjR,GAAG;AACnB,QAAI+R,IAAa,IAAIhV,EAAK,EAAG,SAASiD,EAAE,OAAO;AAC/C,WAAAnD,EAAE,QAAQmD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAAE,MAAAwU,EAAW,QAAQxU,GAAGyC,EAAE,KAAKzC,CAAC,CAAC;AAAA,IAAE,CAAE,GACtEV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIsU,IAAcD,EAAW,KAAKrU,EAAE,GAAGA,EAAE,CAAC,KAAK,EAAE,QAAQ,GAAG,QAAQ,EAAG,GACnEN,IAAQ4C,EAAE,KAAKtC,CAAC;AACpB,MAAAqU,EAAW,QAAQrU,EAAE,GAAGA,EAAE,GAAG;AAAA,QAC3B,QAAQsU,EAAY,SAAS5U,EAAM;AAAA,QACnC,QAAQ,KAAK,IAAI4U,EAAY,QAAQ5U,EAAM,MAAM;AAAA,MACvD,CAAK;AAAA,IACL,CAAG,GACM2U;AAAA,EACT;AAEA,WAASb,EAAmBlR,GAAG;AAC7B,QAAI+R,IAAa,IAAIhV,EAAM,EAAE,YAAYiD,EAAE,aAAc,EAAA,CAAE,EAAE,SAASA,EAAE,MAAK,CAAE;AAC/E,WAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,MAAKyC,EAAE,SAASzC,CAAC,EAAE,UACjBwU,EAAW,QAAQxU,GAAGyC,EAAE,KAAKzC,CAAC,CAAC;AAAA,IAErC,CAAG,GACDV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,MAAAqU,EAAW,QAAQrU,GAAGsC,EAAE,KAAKtC,CAAC,CAAC;AAAA,IACnC,CAAG,GACMqU;AAAA,EACT;AAEA,WAASZ,EAAiBnR,GAAG;AAC3B,QAAIiS,IAAYpV,EAAE,IAAImD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAC3C,UAAI2U,IAAO,CAAE;AACb,aAAArV,EAAE,QAAQmD,EAAE,SAASzC,CAAC,GAAG,SAASG,GAAG;AACnC,QAAAwU,EAAKxU,EAAE,CAAC,KAAKwU,EAAKxU,EAAE,CAAC,KAAK,KAAKsC,EAAE,KAAKtC,CAAC,EAAE;AAAA,MAC/C,CAAK,GACMwU;AAAA,IACX,CAAG;AACD,WAAOrV,EAAE,UAAUmD,EAAE,MAAK,GAAIiS,CAAS;AAAA,EACzC;AAEA,WAASb,EAAmBpR,GAAG;AAC7B,QAAIiS,IAAYpV,EAAE,IAAImD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAC3C,UAAIU,IAAQ,CAAE;AACd,aAAApB,EAAE,QAAQmD,EAAE,QAAQzC,CAAC,GAAG,SAASG,GAAG;AAClC,QAAAO,EAAMP,EAAE,CAAC,KAAKO,EAAMP,EAAE,CAAC,KAAK,KAAKsC,EAAE,KAAKtC,CAAC,EAAE;AAAA,MACjD,CAAK,GACMO;AAAA,IACX,CAAG;AACD,WAAOpB,EAAE,UAAUmD,EAAE,MAAK,GAAIiS,CAAS;AAAA,EACzC;AAMA,WAASZ,EAAcc,GAAMC,GAAO;AAClC,QAAIrR,IAAIoR,EAAK,GACTE,IAAIF,EAAK,GAITG,IAAKF,EAAM,IAAIrR,GACfwR,IAAKH,EAAM,IAAIC,GACf,IAAIF,EAAK,QAAQ,GACjBK,IAAIL,EAAK,SAAS;AAEtB,QAAI,CAACG,KAAM,CAACC;AACV,YAAM,IAAI,MAAM,2DAA2D;AAG7E,QAAIE,GAAIC;AACR,WAAI,KAAK,IAAIH,CAAE,IAAI,IAAI,KAAK,IAAID,CAAE,IAAIE,KAEhCD,IAAK,MACPC,IAAI,CAACA,IAEPC,IAAKD,IAAIF,IAAKC,GACdG,IAAKF,MAGDF,IAAK,MACP,IAAI,CAAC,IAEPG,IAAK,GACLC,IAAK,IAAIH,IAAKD,IAGT,EAAE,GAAGvR,IAAI0R,GAAI,GAAGJ,IAAIK,EAAI;AAAA,EACjC;AAMA,WAASpB,EAAiBtR,GAAG;AAC3B,QAAI2S,IAAW9V,EAAE,IAAIA,EAAE,MAAM6U,EAAQ1R,CAAC,IAAI,CAAC,GAAG,WAAW;AAAE,aAAO,CAAA;AAAA,IAAG,CAAE;AACvE,WAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC,GACfqV,IAAOxS,EAAK;AAChB,MAAKvD,EAAE,YAAY+V,CAAI,MACrBD,EAASC,CAAI,EAAExS,EAAK,KAAK,IAAI7C;AAAA,IAEnC,CAAG,GACMoV;AAAA,EACT;AAMA,WAASpB,EAAevR,GAAG;AACzB,QAAImB,IAAMtE,EAAE,IAAIA,EAAE,IAAImD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAAE,aAAOyC,EAAE,KAAKzC,CAAC,EAAE;AAAA,IAAK,CAAE,CAAC;AACxE,IAAAV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC;AACnB,MAAIV,EAAE,IAAIuD,GAAM,MAAM,MACpBA,EAAK,QAAQe;AAAA,IAEnB,CAAG;AAAA,EACH;AAEA,WAASqQ,EAAiBxR,GAAG;AAE3B,QAAI6S,IAAShW,EAAE,IAAIA,EAAE,IAAImD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAAE,aAAOyC,EAAE,KAAKzC,CAAC,EAAE;AAAA,IAAK,CAAE,CAAC,GAEvEuV,IAAS,CAAE;AACf,IAAAjW,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAIqV,IAAO5S,EAAE,KAAKzC,CAAC,EAAE,OAAOsV;AAC5B,MAAKC,EAAOF,CAAI,MACdE,EAAOF,CAAI,IAAI,CAAE,IAEnBE,EAAOF,CAAI,EAAE,KAAKrV,CAAC;AAAA,IACvB,CAAG;AAED,QAAIwV,IAAQ,GACRC,IAAiBhT,EAAE,MAAK,EAAG;AAC/B,IAAAnD,EAAE,QAAQiW,GAAQ,SAAStV,GAAI4D,GAAG;AAChC,MAAIvE,EAAE,YAAYW,CAAE,KAAK4D,IAAI4R,MAAmB,IAC9C,EAAED,IACOA,KACTlW,EAAE,QAAQW,GAAI,SAASD,GAAG;AAAE,QAAAyC,EAAE,KAAKzC,CAAC,EAAE,QAAQwV;AAAA,MAAM,CAAE;AAAA,IAE5D,CAAG;AAAA,EACH;AAEA,WAAStB,EAAczR,GAAG8N,GAAQ8E,GAAMzO,GAAO;AAC7C,QAAI/D,IAAO;AAAA,MACT,OAAO;AAAA,MACP,QAAQ;AAAA,IACT;AACD,WAAI,UAAU,UAAU,MACtBA,EAAK,OAAOwS,GACZxS,EAAK,QAAQ+D,IAER6M,EAAahR,GAAG,UAAUI,GAAM0N,CAAM;AAAA,EAC/C;AAEA,WAAS4D,EAAQ1R,GAAG;AAClB,WAAOnD,EAAE,IAAIA,EAAE,IAAImD,EAAE,MAAK,GAAI,SAASzC,GAAG;AACxC,UAAIqV,IAAO5S,EAAE,KAAKzC,CAAC,EAAE;AACrB,UAAI,CAACV,EAAE,YAAY+V,CAAI;AACrB,eAAOA;AAAA,IAEb,CAAG,CAAC;AAAA,EACJ;AAOA,WAASjB,EAAU1e,GAAYggB,GAAI;AACjC,QAAIpsB,IAAS,EAAE,KAAK,CAAA,GAAI,KAAK,CAAA,EAAI;AACjC,WAAAgW,EAAE,QAAQ5J,GAAY,SAASjO,GAAO;AACpC,MAAIiuB,EAAGjuB,CAAK,IACV6B,EAAO,IAAI,KAAK7B,CAAK,IAErB6B,EAAO,IAAI,KAAK7B,CAAK;AAAA,IAE3B,CAAG,GACM6B;AAAA,EACT;AAMA,WAAS+qB,EAAKrT,GAAM0U,GAAI;AACtB,QAAIpa,IAAQgE,EAAE,IAAK;AACnB,QAAI;AACF,aAAOoW,EAAI;AAAA,IACf,UAAY;AACR,cAAQ,IAAI1U,IAAO,aAAa1B,EAAE,IAAK,IAAGhE,KAAS,IAAI;AAAA,IAC3D;AAAA,EACA;AAEA,WAASgZ,EAAOtT,GAAM0U,GAAI;AACxB,WAAOA,EAAI;AAAA,EACb;;;;;;;AC3OA,MAAIpW,IAAItY,EAAmB,GACvBwsB,IAAOpsB,EAAiB;AAE5B,EAAAuuB,KAAiB;AAAA,IACf,KAAKxC;AAAA,IACL,MAAMC;AAAA,EACP;AAkBD,WAASD,EAAI1Q,GAAG;AACd,IAAAA,EAAE,QAAQ,cAAc,CAAE,GAC1BnD,EAAE,QAAQmD,EAAE,SAAS,SAASjB,GAAM;AAAE,MAAAoU,EAAcnT,GAAGjB,CAAI;AAAA,IAAE,CAAE;AAAA,EACjE;AAEA,WAASoU,EAAcnT,GAAGtC,GAAG;AAC3B,QAAIH,IAAIG,EAAE,GACN0V,IAAQpT,EAAE,KAAKzC,CAAC,EAAE,MAClBe,IAAIZ,EAAE,GACN2V,IAAQrT,EAAE,KAAK1B,CAAC,EAAE,MAClBC,IAAOb,EAAE,MACT4V,IAAYtT,EAAE,KAAKtC,CAAC,GACpB6V,IAAYD,EAAU;AAE1B,QAAID,MAAUD,IAAQ,GAEtB;AAAA,MAAApT,EAAE,WAAWtC,CAAC;AAEd,UAAI8V,GAAO1B,GAAO1Q;AAClB,WAAKA,IAAI,GAAG,EAAEgS,GAAOA,IAAQC,GAAO,EAAEjS,GAAG,EAAEgS;AACzC,QAAAE,EAAU,SAAS,CAAE,GACrBxB,IAAQ;AAAA,UACN,OAAO;AAAA,UAAG,QAAQ;AAAA,UAClB,WAAWwB;AAAA,UAAW,SAAS5V;AAAA,UAC/B,MAAM0V;AAAA,QACP,GACDI,IAAQzC,EAAK,aAAa/Q,GAAG,QAAQ8R,GAAO,IAAI,GAC5CsB,MAAUG,MACZzB,EAAM,QAAQwB,EAAU,OACxBxB,EAAM,SAASwB,EAAU,QACzBxB,EAAM,QAAQ,cACdA,EAAM,WAAWwB,EAAU,WAE7BtT,EAAE,QAAQzC,GAAGiW,GAAO,EAAE,QAAQF,EAAU,OAAQ,GAAE/U,CAAI,GAClD6C,MAAM,KACRpB,EAAE,MAAO,EAAC,YAAY,KAAKwT,CAAK,GAElCjW,IAAIiW;AAGN,MAAAxT,EAAE,QAAQzC,GAAGe,GAAG,EAAE,QAAQgV,EAAU,OAAQ,GAAE/U,CAAI;AAAA;AAAA,EACpD;AAEA,WAASoS,EAAK3Q,GAAG;AACf,IAAAnD,EAAE,QAAQmD,EAAE,MAAK,EAAG,aAAa,SAASzC,GAAG;AAC3C,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC,GACfkW,IAAYrT,EAAK,WACjB9B;AAEJ,WADA0B,EAAE,QAAQI,EAAK,SAASqT,CAAS,GAC1BrT,EAAK;AACV,QAAA9B,IAAI0B,EAAE,WAAWzC,CAAC,EAAE,CAAC,GACrByC,EAAE,WAAWzC,CAAC,GACdkW,EAAU,OAAO,KAAK,EAAE,GAAGrT,EAAK,GAAG,GAAGA,EAAK,GAAG,GAC1CA,EAAK,UAAU,iBACjBqT,EAAU,IAAIrT,EAAK,GACnBqT,EAAU,IAAIrT,EAAK,GACnBqT,EAAU,QAAQrT,EAAK,OACvBqT,EAAU,SAASrT,EAAK,SAE1B7C,IAAIe,GACJ8B,IAAOJ,EAAE,KAAKzC,CAAC;AAAA,IAErB,CAAG;AAAA,EACH;;;;;;;ACvFA,MAAIV,IAAItY,EAAoB;AAE5B,EAAAwsB,KAAiB;AAAA,IACf,aAAa2C;AAAA,IACb,OAAOC;AAAA,EACR;AAuBD,WAASD,EAAY1T,GAAG;AACtB,QAAIS,IAAU,CAAE;AAEhB,aAASG,EAAIrD,GAAG;AACd,UAAIH,IAAQ4C,EAAE,KAAKzC,CAAC;AACpB,UAAIV,EAAE,IAAI4D,GAASlD,CAAC;AAClB,eAAOH,EAAM;AAEf,MAAAqD,EAAQlD,CAAC,IAAI;AAEb,UAAIqV,IAAO/V,EAAE,IAAIA,EAAE,IAAImD,EAAE,SAASzC,CAAC,GAAG,SAASG,GAAG;AAChD,eAAOkD,EAAIlD,EAAE,CAAC,IAAIsC,EAAE,KAAKtC,CAAC,EAAE;AAAA,MAClC,CAAK,CAAC;AAEF,cAAIkV,MAAS,OAAO;AAAA,MAChBA,MAAS;AAAA,MACTA,MAAS,UACXA,IAAO,IAGDxV,EAAM,OAAOwV;AAAA,IACzB;AAEE,IAAA/V,EAAE,QAAQmD,EAAE,QAAO,GAAIY,CAAG;AAAA,EAC5B;AAMA,WAAS+S,EAAM3T,GAAGtC,GAAG;AACnB,WAAOsC,EAAE,KAAKtC,EAAE,CAAC,EAAE,OAAOsC,EAAE,KAAKtC,EAAE,CAAC,EAAE,OAAOsC,EAAE,KAAKtC,CAAC,EAAE;AAAA,EACzD;;;;;;;AC5DA,MAAIb,IAAItY,EAAoB,GACxBwY,IAAQpY,EAAsB,EAAC,OAC/BgvB,IAAQtuB,GAAiB,EAAC;AAE9B,EAAAuuB,KAAiBC;AA2BjB,WAASA,EAAa7T,GAAG;AACvB,QAAI8T,IAAI,IAAI/W,EAAM,EAAE,UAAU,GAAK,CAAE,GAGjClE,IAAQmH,EAAE,MAAK,EAAG,CAAC,GACnB5I,IAAO4I,EAAE,UAAW;AACxB,IAAA8T,EAAE,QAAQjb,GAAO,EAAE;AAGnB,aADIkG,GAAMgU,GACHgB,EAAUD,GAAG9T,CAAC,IAAI5I;AACvB,MAAA2H,IAAOiV,EAAiBF,GAAG9T,CAAC,GAC5B+S,IAAQe,EAAE,QAAQ/U,EAAK,CAAC,IAAI4U,EAAM3T,GAAGjB,CAAI,IAAI,CAAC4U,EAAM3T,GAAGjB,CAAI,GAC3DkV,EAAWH,GAAG9T,GAAG+S,CAAK;AAGxB,WAAOe;AAAA,EACT;AAMA,WAASC,EAAUD,GAAG9T,GAAG;AACvB,aAASY,EAAIrD,GAAG;AACd,MAAAV,EAAE,QAAQmD,EAAE,UAAUzC,CAAC,GAAG,SAASG,GAAG;AACpC,YAAIwW,IAAQxW,EAAE,GACZY,IAAKf,MAAM2W,IAASxW,EAAE,IAAIwW;AAC5B,QAAI,CAACJ,EAAE,QAAQxV,CAAC,KAAK,CAACqV,EAAM3T,GAAGtC,CAAC,MAC9BoW,EAAE,QAAQxV,GAAG,EAAE,GACfwV,EAAE,QAAQvW,GAAGe,GAAG,CAAA,CAAE,GAClBsC,EAAItC,CAAC;AAAA,MAEb,CAAK;AAAA,IACL;AAEE,WAAAzB,EAAE,QAAQiX,EAAE,MAAK,GAAIlT,CAAG,GACjBkT,EAAE,UAAW;AAAA,EACtB;AAMA,WAASE,EAAiBF,GAAG9T,GAAG;AAC9B,WAAOnD,EAAE,MAAMmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AACpC,UAAIoW,EAAE,QAAQpW,EAAE,CAAC,MAAMoW,EAAE,QAAQpW,EAAE,CAAC;AAClC,eAAOiW,EAAM3T,GAAGtC,CAAC;AAAA,IAEvB,CAAG;AAAA,EACH;AAEA,WAASuW,EAAWH,GAAG9T,GAAG+S,GAAO;AAC/B,IAAAlW,EAAE,QAAQiX,EAAE,MAAO,GAAE,SAASvW,GAAG;AAC/B,MAAAyC,EAAE,KAAKzC,CAAC,EAAE,QAAQwV;AAAA,IACtB,CAAG;AAAA,EACH;;;;;;;ACtFA,MAAIlW,IAAItY,EAAoB,GACxBsvB,IAAelvB,GAA0B,GACzCgvB,IAAQtuB,GAAiB,EAAC,OAC1B8uB,IAAW9uB,GAAiB,EAAC,aAC7Bof,IAAW5c,IAAuB,IAAI,UACtCyc,IAAYzc,IAAuB,IAAI,WACvCopB,IAAWnpB,EAAkB,EAAC;AAElC,EAAAssB,KAAiBC,GAGjBA,EAAe,mBAAmBC,GAClCD,EAAe,gBAAgBE,GAC/BF,EAAe,eAAeG,GAC9BH,EAAe,YAAYI,GAC3BJ,EAAe,YAAYK,GAC3BL,EAAe,gBAAgBM;AAmC/B,WAASN,EAAe,GAAG;AACzB,QAAIpD,EAAS,CAAC,GACdkD,EAAS,CAAC;AACV,QAAIL,IAAID,EAAa,CAAC;AACtB,IAAAS,EAAiBR,CAAC,GAClBS,EAAcT,GAAG,CAAC;AAGlB,aADIpW,GAAG/L,GACC+L,IAAI+W,EAAUX,CAAC;AACrB,MAAAniB,IAAI+iB,EAAUZ,GAAG,GAAGpW,CAAC,GACrBiX,EAAcb,GAAG,GAAGpW,GAAG/L,CAAC;AAAA,EAE5B;AAKA,WAAS4iB,EAAcT,GAAG9T,GAAG;AAC3B,QAAIxC,IAAK8G,EAAUwP,GAAGA,EAAE,MAAK,CAAE;AAC/B,IAAAtW,IAAKA,EAAG,MAAM,GAAGA,EAAG,SAAS,CAAC,GAC9BX,EAAE,QAAQW,GAAI,SAASD,GAAG;AACxB,MAAAqX,EAAed,GAAG9T,GAAGzC,CAAC;AAAA,IAC1B,CAAG;AAAA,EACH;AAEA,WAASqX,EAAed,GAAG9T,GAAGrC,GAAO;AACnC,QAAIkX,IAAWf,EAAE,KAAKnW,CAAK,GACvBC,IAASiX,EAAS;AACtB,IAAAf,EAAE,KAAKnW,GAAOC,CAAM,EAAE,WAAW4W,EAAaV,GAAG9T,GAAGrC,CAAK;AAAA,EAC3D;AAMA,WAAS6W,EAAaV,GAAG9T,GAAGrC,GAAO;AACjC,QAAIkX,IAAWf,EAAE,KAAKnW,CAAK,GACvBC,IAASiX,EAAS,QAElBC,IAAc,IAEdC,IAAY/U,EAAE,KAAKrC,GAAOC,CAAM,GAEhCoX,IAAW;AAEf,WAAKD,MACHD,IAAc,IACdC,IAAY/U,EAAE,KAAKpC,GAAQD,CAAK,IAGlCqX,IAAWD,EAAU,QAErBlY,EAAE,QAAQmD,EAAE,UAAUrC,CAAK,GAAG,SAASD,GAAG;AACxC,UAAIuX,IAAYvX,EAAE,MAAMC,GACtBxX,IAAQ8uB,IAAYvX,EAAE,IAAIA,EAAE;AAE9B,UAAIvX,MAAUyX,GAAQ;AACpB,YAAIsX,IAAeD,MAAcH,GAC/BK,IAAcnV,EAAE,KAAKtC,CAAC,EAAE;AAG1B,YADAsX,KAAYE,IAAeC,IAAc,CAACA,GACtCC,EAAWtB,GAAGnW,GAAOxX,CAAK,GAAG;AAC/B,cAAIkvB,IAAgBvB,EAAE,KAAKnW,GAAOxX,CAAK,EAAE;AACzC,UAAA6uB,KAAYE,IAAe,CAACG,IAAgBA;AAAA,QACpD;AAAA,MACA;AAAA,IACA,CAAG,GAEML;AAAA,EACT;AAEA,WAASV,EAAiBgB,GAAM9K,GAAM;AACpC,IAAI,UAAU,SAAS,MACrBA,IAAO8K,EAAK,MAAO,EAAC,CAAC,IAEvBC,EAAgBD,GAAM,IAAI,GAAG9K,CAAI;AAAA,EACnC;AAEA,WAAS+K,EAAgBD,GAAM7U,GAAS+U,GAASjY,GAAGK,GAAQ;AAC1D,QAAI6X,IAAMD,GACNpY,IAAQkY,EAAK,KAAK/X,CAAC;AAEvB,WAAAkD,EAAQlD,CAAC,IAAI,IACbV,EAAE,QAAQyY,EAAK,UAAU/X,CAAC,GAAG,SAASe,GAAG;AACvC,MAAKzB,EAAE,IAAI4D,GAASnC,CAAC,MACnBkX,IAAUD,EAAgBD,GAAM7U,GAAS+U,GAASlX,GAAGf,CAAC;AAAA,IAE5D,CAAG,GAEDH,EAAM,MAAMqY,GACZrY,EAAM,MAAMoY,KACR5X,IACFR,EAAM,SAASQ,IAGf,OAAOR,EAAM,QAGRoY;AAAA,EACT;AAEA,WAASf,EAAUa,GAAM;AACvB,WAAOzY,EAAE,KAAKyY,EAAK,MAAO,GAAE,SAAS5X,GAAG;AACtC,aAAO4X,EAAK,KAAK5X,CAAC,EAAE,WAAW;AAAA,IACnC,CAAG;AAAA,EACH;AAEA,WAASgX,EAAUZ,GAAG9T,GAAGjB,GAAM;AAC7B,QAAIxB,IAAIwB,EAAK,GACTT,IAAIS,EAAK;AAKb,IAAKiB,EAAE,QAAQzC,GAAGe,CAAC,MACjBf,IAAIwB,EAAK,GACTT,IAAIS,EAAK;AAGX,QAAI2W,IAAS5B,EAAE,KAAKvW,CAAC,GACjBoY,IAAS7B,EAAE,KAAKxV,CAAC,GACjBsX,IAAYF,GACZG,IAAO;AAIX,IAAIH,EAAO,MAAMC,EAAO,QACtBC,IAAYD,GACZE,IAAO;AAGT,QAAIC,IAAajZ,EAAE,OAAOmD,EAAE,MAAK,GAAI,SAASjB,GAAM;AAClD,aAAO8W,MAASE,EAAajC,GAAGA,EAAE,KAAK/U,EAAK,CAAC,GAAG6W,CAAS,KAClDC,MAASE,EAAajC,GAAGA,EAAE,KAAK/U,EAAK,CAAC,GAAG6W,CAAS;AAAA,IAC7D,CAAG;AAED,WAAO/Y,EAAE,MAAMiZ,GAAY,SAAS/W,GAAM;AAAE,aAAO4U,EAAM3T,GAAGjB,CAAI;AAAA,KAAI;AAAA,EACtE;AAEA,WAAS4V,EAAcb,GAAG9T,GAAGtC,GAAG/L,GAAG;AACjC,QAAI4L,IAAIG,EAAE,GACNY,IAAIZ,EAAE;AACV,IAAAoW,EAAE,WAAWvW,GAAGe,CAAC,GACjBwV,EAAE,QAAQniB,EAAE,GAAGA,EAAE,GAAG,EAAE,GACtB2iB,EAAiBR,CAAC,GAClBS,EAAcT,GAAG9T,CAAC,GAClBgW,EAAYlC,GAAG9T,CAAC;AAAA,EAClB;AAEA,WAASgW,EAAYlC,GAAG9T,GAAG;AACzB,QAAIwK,IAAO3N,EAAE,KAAKiX,EAAE,MAAO,GAAE,SAASvW,GAAG;AAAE,aAAO,CAACyC,EAAE,KAAKzC,CAAC,EAAE;AAAA,IAAO,CAAE,GAClEC,IAAKiH,EAASqP,GAAGtJ,CAAI;AACzB,IAAAhN,IAAKA,EAAG,MAAM,CAAC,GACfX,EAAE,QAAQW,GAAI,SAASD,GAAG;AACxB,UAAIK,IAASkW,EAAE,KAAKvW,CAAC,EAAE,QACrBwB,IAAOiB,EAAE,KAAKzC,GAAGK,CAAM,GACvBqY,IAAU;AAEZ,MAAKlX,MACHA,IAAOiB,EAAE,KAAKpC,GAAQL,CAAC,GACvB0Y,IAAU,KAGZjW,EAAE,KAAKzC,CAAC,EAAE,OAAOyC,EAAE,KAAKpC,CAAM,EAAE,QAAQqY,IAAUlX,EAAK,SAAS,CAACA,EAAK;AAAA,IAC1E,CAAG;AAAA,EACH;AAKA,WAASqW,EAAWE,GAAMrW,GAAG1B,GAAG;AAC9B,WAAO+X,EAAK,QAAQrW,GAAG1B,CAAC;AAAA,EAC1B;AAMA,WAASwY,EAAaT,GAAMI,GAAQQ,GAAW;AAC7C,WAAOA,EAAU,OAAOR,EAAO,OAAOA,EAAO,OAAOQ,EAAU;AAAA,EAChE;;;;;;;ACvOA,MAAIC,IAAW5xB,GAAiB,GAC5BmvB,IAAcyC,EAAS,aACvBtC,IAAelvB,GAA0B,GACzC0vB,IAAiBhvB,GAA4B;AAEjD,EAAA+wB,KAAiBxD;AAqBjB,WAASA,EAAK5S,GAAG;AACf,YAAOA,EAAE,MAAK,EAAG,QAAM;AAAA,MACvB,KAAK;AAAmB,QAAAqW,EAAqBrW,CAAC;AAAG;AAAA,MACjD,KAAK;AAAc,QAAAsW,EAAgBtW,CAAC;AAAG;AAAA,MACvC,KAAK;AAAgB,QAAAuW,EAAkBvW,CAAC;AAAG;AAAA,MAC3C;AAAS,QAAAqW,EAAqBrW,CAAC;AAAA,IACjC;AAAA,EACA;AAGA,MAAIuW,IAAoB7C;AAExB,WAAS4C,EAAgBtW,GAAG;AAC1B,IAAA0T,EAAY1T,CAAC,GACb6T,EAAa7T,CAAC;AAAA,EAChB;AAEA,WAASqW,EAAqBrW,GAAG;AAC/B,IAAAqU,EAAerU,CAAC;AAAA,EAClB;;;;;;;AC/CA,MAAInD,IAAItY,EAAmB;AAE3B,EAAAiyB,KAAiBC;AAEjB,WAASA,EAAkBzW,GAAG;AAC5B,QAAI0W,IAAgBpS,EAAUtE,CAAC;AAE/B,IAAAnD,EAAE,QAAQmD,EAAE,MAAK,EAAG,aAAa,SAASzC,GAAG;AAU3C,eATI6C,IAAOJ,EAAE,KAAKzC,CAAC,GACfoB,IAAUyB,EAAK,SACfuW,IAAWC,EAAS5W,GAAG0W,GAAe/X,EAAQ,GAAGA,EAAQ,CAAC,GAC1D3P,IAAO2nB,EAAS,MAChBE,IAAMF,EAAS,KACfG,IAAU,GACVC,IAAQ/nB,EAAK8nB,CAAO,GACpBE,IAAY,IAETzZ,MAAMoB,EAAQ,KAAG;AAGtB,YAFAyB,IAAOJ,EAAE,KAAKzC,CAAC,GAEXyZ,GAAW;AACb,kBAAQD,IAAQ/nB,EAAK8nB,CAAO,OAAOD,KAC5B7W,EAAE,KAAK+W,CAAK,EAAE,UAAU3W,EAAK;AAClC,YAAA0W;AAGF,UAAIC,MAAUF,MACZG,IAAY;AAAA,QAEtB;AAEM,YAAI,CAACA,GAAW;AACd,iBAAOF,IAAU9nB,EAAK,SAAS,KACxBgR,EAAE,KAAK+W,IAAQ/nB,EAAK8nB,IAAU,CAAC,CAAC,EAAE,WAAW1W,EAAK;AACvD,YAAA0W;AAEF,UAAAC,IAAQ/nB,EAAK8nB,CAAO;AAAA,QAC5B;AAEM,QAAA9W,EAAE,UAAUzC,GAAGwZ,CAAK,GACpBxZ,IAAIyC,EAAE,WAAWzC,CAAC,EAAE,CAAC;AAAA,MAC3B;AAAA,IACA,CAAG;AAAA,EACH;AAIA,WAASqZ,EAAS5W,GAAG0W,GAAenZ,GAAGe,GAAG;AACxC,QAAI2Y,IAAQ,CAAE,GACVC,IAAQ,CAAE,GACVzB,IAAM,KAAK,IAAIiB,EAAcnZ,CAAC,EAAE,KAAKmZ,EAAcpY,CAAC,EAAE,GAAG,GACzD6Y,IAAM,KAAK,IAAIT,EAAcnZ,CAAC,EAAE,KAAKmZ,EAAcpY,CAAC,EAAE,GAAG,GACzDV,GACAiZ;AAGJ,IAAAjZ,IAASL;AACT;AACE,MAAAK,IAASoC,EAAE,OAAOpC,CAAM,GACxBqZ,EAAM,KAAKrZ,CAAM;AAAA,WACVA,MACC8Y,EAAc9Y,CAAM,EAAE,MAAM6X,KAAO0B,IAAMT,EAAc9Y,CAAM,EAAE;AAKzE,SAJAiZ,IAAMjZ,GAGNA,IAASU,IACDV,IAASoC,EAAE,OAAOpC,CAAM,OAAOiZ;AACrC,MAAAK,EAAM,KAAKtZ,CAAM;AAGnB,WAAO,EAAE,MAAMqZ,EAAM,OAAOC,EAAM,QAAS,CAAA,GAAG,KAAKL,EAAK;AAAA,EAC1D;AAEA,WAASvS,EAAUtE,GAAG;AACpB,QAAInZ,IAAS,CAAE,GACXswB,IAAM;AAEV,aAASvW,EAAIrD,GAAG;AACd,UAAIkY,IAAM0B;AACV,MAAAta,EAAE,QAAQmD,EAAE,SAASzC,CAAC,GAAGqD,CAAG,GAC5B/Z,EAAO0W,CAAC,IAAI,EAAE,KAAKkY,GAAK,KAAK0B,IAAO;AAAA,IACxC;AACE,WAAAta,EAAE,QAAQmD,EAAE,SAAQ,GAAIY,CAAG,GAEpB/Z;AAAA,EACT;;;;;;;ACrFA,MAAIgW,IAAItY,EAAmB,GACvBwsB,IAAOpsB,EAAiB;AAE5B,EAAAyyB,KAAiB;AAAA,IACf,KAAK1G;AAAA,IACL,SAAS2G;AAAA,EACV;AAyBD,WAAS3G,EAAI1Q,GAAG;AACd,QAAIwK,IAAOuG,EAAK,aAAa/Q,GAAG,QAAQ,CAAE,GAAE,OAAO,GAC/CsX,IAASC,EAAWvX,CAAC,GACrBwX,IAAS3a,EAAE,IAAIA,EAAE,OAAOya,CAAM,CAAC,IAAI,GACnCG,IAAU,IAAID,IAAS;AAE3B,IAAAxX,EAAE,QAAQ,cAAcwK,GAGxB3N,EAAE,QAAQmD,EAAE,MAAK,GAAI,SAAStC,GAAG;AAAE,MAAAsC,EAAE,KAAKtC,CAAC,EAAE,UAAU+Z;AAAA,IAAQ,CAAE;AAGjE,QAAInV,IAASoV,EAAW1X,CAAC,IAAI;AAG7B,IAAAnD,EAAE,QAAQmD,EAAE,SAAU,GAAE,SAASrC,GAAO;AACtC,MAAAiD,EAAIZ,GAAGwK,GAAMiN,GAASnV,GAAQkV,GAAQF,GAAQ3Z,CAAK;AAAA,IACvD,CAAG,GAIDqC,EAAE,QAAQ,iBAAiByX;AAAA,EAC7B;AAEA,WAAS7W,EAAIZ,GAAGwK,GAAMiN,GAASnV,GAAQkV,GAAQF,GAAQ/Z,GAAG;AACxD,QAAIO,IAAWkC,EAAE,SAASzC,CAAC;AAC3B,QAAI,CAACO,EAAS,QAAQ;AACpB,MAAIP,MAAMiN,KACRxK,EAAE,QAAQwK,GAAMjN,GAAG,EAAE,QAAQ,GAAG,QAAQka,GAAS;AAEnD;AAAA,IACJ;AAEE,QAAIE,IAAM5G,EAAK,cAAc/Q,GAAG,KAAK,GACjC4X,IAAS7G,EAAK,cAAc/Q,GAAG,KAAK,GACpC5C,IAAQ4C,EAAE,KAAKzC,CAAC;AAEpB,IAAAyC,EAAE,UAAU2X,GAAKpa,CAAC,GAClBH,EAAM,YAAYua,GAClB3X,EAAE,UAAU4X,GAAQra,CAAC,GACrBH,EAAM,eAAewa,GAErB/a,EAAE,QAAQiB,GAAU,SAASH,GAAO;AAClC,MAAAiD,EAAIZ,GAAGwK,GAAMiN,GAASnV,GAAQkV,GAAQF,GAAQ3Z,CAAK;AAEnD,UAAIka,IAAY7X,EAAE,KAAKrC,CAAK,GACxBma,IAAWD,EAAU,YAAYA,EAAU,YAAYla,GACvDoa,IAAcF,EAAU,eAAeA,EAAU,eAAela,GAChEqa,IAAaH,EAAU,YAAYvV,IAAS,IAAIA,GAChD2V,IAASH,MAAaC,IAAc,IAAIP,IAASF,EAAO/Z,CAAC,IAAI;AAEjE,MAAAyC,EAAE,QAAQ2X,GAAKG,GAAU;AAAA,QACvB,QAAQE;AAAA,QACR,QAAQC;AAAA,QACR,aAAa;AAAA,MACnB,CAAK,GAEDjY,EAAE,QAAQ+X,GAAaH,GAAQ;AAAA,QAC7B,QAAQI;AAAA,QACR,QAAQC;AAAA,QACR,aAAa;AAAA,MACnB,CAAK;AAAA,IACL,CAAG,GAEIjY,EAAE,OAAOzC,CAAC,KACbyC,EAAE,QAAQwK,GAAMmN,GAAK,EAAE,QAAQ,GAAG,QAAQH,IAASF,EAAO/Z,CAAC,EAAC,CAAE;AAAA,EAElE;AAEA,WAASga,EAAWvX,GAAG;AACrB,QAAIsX,IAAS,CAAE;AACf,aAAS1W,EAAIrD,GAAGlF,GAAO;AACrB,UAAIyF,IAAWkC,EAAE,SAASzC,CAAC;AAC3B,MAAIO,KAAYA,EAAS,UACvBjB,EAAE,QAAQiB,GAAU,SAASH,GAAO;AAClC,QAAAiD,EAAIjD,GAAOtF,IAAQ,CAAC;AAAA,MAC5B,CAAO,GAEHif,EAAO/Z,CAAC,IAAIlF;AAAA,IAChB;AACE,WAAAwE,EAAE,QAAQmD,EAAE,YAAY,SAASzC,GAAG;AAAE,MAAAqD,EAAIrD,GAAG,CAAC;AAAA,IAAE,CAAE,GAC3C+Z;AAAA,EACT;AAEA,WAASI,EAAW1X,GAAG;AACrB,WAAOnD,EAAE,OAAOmD,EAAE,MAAK,GAAI,SAAS4C,GAAKlF,GAAG;AAC1C,aAAOkF,IAAM5C,EAAE,KAAKtC,CAAC,EAAE;AAAA,IACxB,GAAE,CAAC;AAAA,EACN;AAEA,WAAS2Z,EAAQrX,GAAG;AAClB,QAAIkY,IAAalY,EAAE,MAAO;AAC1B,IAAAA,EAAE,WAAWkY,EAAW,WAAW,GACnC,OAAOA,EAAW,aAClBrb,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,MAAIqB,EAAK,eACPiB,EAAE,WAAWtC,CAAC;AAAA,IAEpB,CAAG;AAAA,EACH;;;;;;;ACnIA,MAAIb,IAAItY,EAAmB,GACvBwsB,IAAOpsB,EAAiB;AAE5B,EAAAwzB,KAAiBC;AAEjB,WAASA,EAAkBpY,GAAG;AAC5B,aAASY,EAAIrD,GAAG;AACd,UAAIO,IAAWkC,EAAE,SAASzC,CAAC,GACvB6C,IAAOJ,EAAE,KAAKzC,CAAC;AAKnB,UAJIO,EAAS,UACXjB,EAAE,QAAQiB,GAAU8C,CAAG,GAGrB/D,EAAE,IAAIuD,GAAM,SAAS,GAAG;AAC1B,QAAAA,EAAK,aAAa,CAAE,GACpBA,EAAK,cAAc,CAAE;AACrB,iBAASwS,IAAOxS,EAAK,SAASsR,IAAUtR,EAAK,UAAU,GACrDwS,IAAOlB,GACP,EAAEkB;AACF,UAAAnB,EAAczR,GAAG,cAAc,OAAOzC,GAAG6C,GAAMwS,CAAI,GACnDnB,EAAczR,GAAG,eAAe,OAAOzC,GAAG6C,GAAMwS,CAAI;AAAA,MAE5D;AAAA,IACA;AAEE,IAAA/V,EAAE,QAAQmD,EAAE,SAAQ,GAAIY,CAAG;AAAA,EAC7B;AAEA,WAAS6Q,EAAczR,GAAGqY,GAAMvK,GAAQwK,GAAIC,GAAQ3F,GAAM;AACxD,QAAIxV,IAAQ,EAAE,OAAO,GAAG,QAAQ,GAAG,MAAMwV,GAAM,YAAYyF,EAAM,GAC7DG,IAAOD,EAAOF,CAAI,EAAEzF,IAAO,CAAC,GAC5BtD,IAAOyB,EAAK,aAAa/Q,GAAG,UAAU5C,GAAO0Q,CAAM;AACvD,IAAAyK,EAAOF,CAAI,EAAEzF,CAAI,IAAItD,GACrBtP,EAAE,UAAUsP,GAAMgJ,CAAE,GAChBE,KACFxY,EAAE,QAAQwY,GAAMlJ,GAAM,EAAE,QAAQ,GAAG;AAAA,EAEvC;;;;;;;ACnCA,MAAIzS,IAAItY,EAAmB;AAE3B,EAAAk0B,KAAiB;AAAA,IACf,QAAQC;AAAA,IACR,MAAM/H;AAAA,EACP;AAED,WAAS+H,EAAO1Y,GAAG;AACjB,QAAI2Y,IAAU3Y,EAAE,MAAK,EAAG,QAAQ,YAAa;AAC7C,KAAI2Y,MAAY,QAAQA,MAAY,SAClCC,EAAgB5Y,CAAC;AAAA,EAErB;AAEA,WAAS2Q,EAAK3Q,GAAG;AACf,QAAI2Y,IAAU3Y,EAAE,MAAK,EAAG,QAAQ,YAAa;AAC7C,KAAI2Y,MAAY,QAAQA,MAAY,SAClCE,EAAS7Y,CAAC,IAGR2Y,MAAY,QAAQA,MAAY,UAClCG,EAAO9Y,CAAC,GACR4Y,EAAgB5Y,CAAC;AAAA,EAErB;AAEA,WAAS4Y,EAAgB5Y,GAAG;AAC1B,IAAAnD,EAAE,QAAQmD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAAE,MAAAwb,EAAmB/Y,EAAE,KAAKzC,CAAC,CAAC;AAAA,IAAE,CAAE,GACnEV,EAAE,QAAQmD,EAAE,MAAK,GAAI,SAAStC,GAAG;AAAE,MAAAqb,EAAmB/Y,EAAE,KAAKtC,CAAC,CAAC;AAAA,IAAE,CAAE;AAAA,EACrE;AAEA,WAASqb,EAAmBjH,GAAO;AACjC,QAAIxT,IAAIwT,EAAM;AACd,IAAAA,EAAM,QAAQA,EAAM,QACpBA,EAAM,SAASxT;AAAA,EACjB;AAEA,WAASua,EAAS7Y,GAAG;AACnB,IAAAnD,EAAE,QAAQmD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAAE,MAAAyb,EAAYhZ,EAAE,KAAKzC,CAAC,CAAC;AAAA,IAAE,CAAE,GAE5DV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,MAAAb,EAAE,QAAQkC,EAAK,QAAQia,CAAW,GAC9Bnc,EAAE,IAAIkC,GAAM,GAAG,KACjBia,EAAYja,CAAI;AAAA,IAEtB,CAAG;AAAA,EACH;AAEA,WAASia,EAAYlH,GAAO;AAC1B,IAAAA,EAAM,IAAI,CAACA,EAAM;AAAA,EACnB;AAEA,WAASgH,EAAO9Y,GAAG;AACjB,IAAAnD,EAAE,QAAQmD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAAE,MAAA0b,EAAUjZ,EAAE,KAAKzC,CAAC,CAAC;AAAA,IAAE,CAAE,GAE1DV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,MAAAb,EAAE,QAAQkC,EAAK,QAAQka,CAAS,GAC5Bpc,EAAE,IAAIkC,GAAM,GAAG,KACjBka,EAAUla,CAAI;AAAA,IAEpB,CAAG;AAAA,EACH;AAEA,WAASka,EAAUnH,GAAO;AACxB,QAAI/Q,IAAI+Q,EAAM;AACd,IAAAA,EAAM,IAAIA,EAAM,GAChBA,EAAM,IAAI/Q;AAAA,EACZ;;;;;;;ACrEA,MAAIlE,IAAItY,EAAoB;AAE5B,EAAA20B,KAAiBC;AAajB,WAASA,EAAUnZ,GAAG;AACpB,QAAIS,IAAU,CAAE,GACZ2Y,IAAcvc,EAAE,OAAOmD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAChD,aAAO,CAACyC,EAAE,SAASzC,CAAC,EAAE;AAAA,IAC1B,CAAG,GACGmU,IAAU7U,EAAE,IAAIA,EAAE,IAAIuc,GAAa,SAAS7b,GAAG;AAAE,aAAOyC,EAAE,KAAKzC,CAAC,EAAE;AAAA,IAAK,CAAE,CAAC,GAC1EuV,IAASjW,EAAE,IAAIA,EAAE,MAAM6U,IAAU,CAAC,GAAG,WAAW;AAAE,aAAO,CAAA;AAAA,IAAG,CAAE;AAElE,aAAS9Q,EAAIrD,GAAG;AACd,UAAI,CAAAV,EAAE,IAAI4D,GAASlD,CAAC,GACpB;AAAA,QAAAkD,EAAQlD,CAAC,IAAI;AACb,YAAI6C,IAAOJ,EAAE,KAAKzC,CAAC;AACnB,QAAAuV,EAAO1S,EAAK,IAAI,EAAE,KAAK7C,CAAC,GACxBV,EAAE,QAAQmD,EAAE,WAAWzC,CAAC,GAAGqD,CAAG;AAAA;AAAA,IAClC;AAEE,QAAIyY,IAAYxc,EAAE,OAAOuc,GAAa,SAAS7b,GAAG;AAAE,aAAOyC,EAAE,KAAKzC,CAAC,EAAE;AAAA,IAAK,CAAE;AAC5E,WAAAV,EAAE,QAAQwc,GAAWzY,CAAG,GAEjBkS;AAAA,EACT;;;;;;;ACnCA,MAAIjW,IAAItY,EAAoB;AAE5B,EAAA+0B,KAAiBC;AAkBjB,WAASA,EAAWvZ,GAAG2S,GAAU;AAE/B,aADI6G,IAAK,GACApY,IAAI,GAAGA,IAAIuR,EAAS,QAAQ,EAAEvR;AACrC,MAAAoY,KAAMC,EAAmBzZ,GAAG2S,EAASvR,IAAE,CAAC,GAAGuR,EAASvR,CAAC,CAAC;AAExD,WAAOoY;AAAA,EACT;AAEA,WAASC,EAAmBzZ,GAAG0Z,GAAYC,GAAY;AAcrD,aAVIC,IAAW/c,EAAE;AAAA,MAAU8c;AAAA,MACzB9c,EAAE,IAAI8c,GAAY,SAAUpc,GAAG6D,GAAG;AAAE,eAAOA;AAAA,MAAE,CAAE;AAAA,IAAC,GAC9CyY,IAAehd,EAAE,QAAQA,EAAE,IAAI6c,GAAY,SAASnc,GAAG;AACzD,aAAOV,EAAE,OAAOA,EAAE,IAAImD,EAAE,SAASzC,CAAC,GAAG,SAASG,GAAG;AAC/C,eAAO,EAAE,KAAKkc,EAASlc,EAAE,CAAC,GAAG,QAAQsC,EAAE,KAAKtC,CAAC,EAAE,OAAQ;AAAA,MACxD,CAAA,GAAG,KAAK;AAAA,IACV,CAAA,GAAG,EAAI,GAGJoc,IAAa,GACVA,IAAaH,EAAW,SAAQ,CAAAG,MAAe;AACtD,QAAIC,IAAW,IAAID,IAAa;AAChC,IAAAA,KAAc;AACd,QAAIxE,IAAOzY,EAAE,IAAI,IAAI,MAAMkd,CAAQ,GAAG,WAAW;AAAE,aAAO;AAAA,KAAI,GAG1DP,IAAK;AACT,WAAA3c,EAAE,QAAQgd,EAAa,QAAQ,SAASvZ,GAAO;AAC7C,UAAIrc,IAAQqc,EAAM,MAAMwZ;AACxB,MAAAxE,EAAKrxB,CAAK,KAAKqc,EAAM;AAErB,eADI0Z,IAAY,GACT/1B,IAAQ;AACb,QAAIA,IAAQ,MACV+1B,KAAa1E,EAAKrxB,IAAQ,CAAC,IAE7BA,IAASA,IAAQ,KAAM,GACvBqxB,EAAKrxB,CAAK,KAAKqc,EAAM;AAEvB,MAAAkZ,KAAMlZ,EAAM,SAAS0Z;AAAA,IACzB,CAAG,CAAC,GAEKR;AAAA,EACT;;;;;;;AClEA,MAAI3c,IAAItY,EAAoB;AAE5B,EAAA01B,KAAiBC;AAEjB,WAASA,EAAWla,GAAGma,GAAS;AAC9B,WAAOtd,EAAE,IAAIsd,GAAS,SAAS5c,GAAG;AAChC,UAAI2B,IAAMc,EAAE,QAAQzC,CAAC;AACrB,UAAK2B,EAAI,QAEF;AACL,YAAIrY,IAASgW,EAAE,OAAOqC,GAAK,SAAS0D,GAAKlF,GAAG;AAC1C,cAAIqB,IAAOiB,EAAE,KAAKtC,CAAC,GACjB0c,IAAQpa,EAAE,KAAKtC,EAAE,CAAC;AACpB,iBAAO;AAAA,YACL,KAAKkF,EAAI,MAAO7D,EAAK,SAASqb,EAAM;AAAA,YACpC,QAAQxX,EAAI,SAAS7D,EAAK;AAAA,UAC3B;AAAA,QACF,GAAE,EAAE,KAAK,GAAG,QAAQ,EAAC,CAAE;AAExB,eAAO;AAAA,UACL,GAAGxB;AAAA,UACH,YAAY1W,EAAO,MAAMA,EAAO;AAAA,UAChC,QAAQA,EAAO;AAAA,QAChB;AAAA,MACP;AAhBM,eAAO,EAAE,GAAG0W,EAAG;AAAA,IAiBrB,CAAG;AAAA,EACH;;;;;;;ACxBA,MAAIV,IAAItY,EAAoB;AAE5B,EAAA81B,KAAiBC;AA2BjB,WAASA,EAAiBC,GAASC,GAAI;AACrC,QAAIC,IAAgB,CAAE;AACtB,IAAA5d,EAAE,QAAQ0d,GAAS,SAASja,GAAOc,GAAG;AACpC,UAAI1B,IAAM+a,EAAcna,EAAM,CAAC,IAAI;AAAA,QACjC,UAAU;AAAA,QACV,IAAM,CAAE;AAAA,QACR,KAAK,CAAE;AAAA,QACP,IAAI,CAACA,EAAM,CAAC;AAAA,QACZ,GAAGc;AAAA,MACJ;AACD,MAAKvE,EAAE,YAAYyD,EAAM,UAAU,MACjCZ,EAAI,aAAaY,EAAM,YACvBZ,EAAI,SAASY,EAAM;AAAA,IAEzB,CAAG,GAEDzD,EAAE,QAAQ2d,EAAG,MAAO,GAAE,SAAS9c,GAAG;AAChC,UAAIgd,IAASD,EAAc/c,EAAE,CAAC,GAC1Bid,IAASF,EAAc/c,EAAE,CAAC;AAC9B,MAAI,CAACb,EAAE,YAAY6d,CAAM,KAAK,CAAC7d,EAAE,YAAY8d,CAAM,MACjDA,EAAO,YACPD,EAAO,IAAI,KAAKD,EAAc/c,EAAE,CAAC,CAAC;AAAA,IAExC,CAAG;AAED,QAAIkd,IAAY/d,EAAE,OAAO4d,GAAe,SAASna,GAAO;AACtD,aAAO,CAACA,EAAM;AAAA,IAClB,CAAG;AAED,WAAOua,EAAmBD,CAAS;AAAA,EACrC;AAEA,WAASC,EAAmBD,GAAW;AACrC,QAAIL,IAAU,CAAE;AAEhB,aAASO,EAAS3Y,GAAQ;AACxB,aAAO,SAASgO,GAAQ;AACtB,QAAIA,EAAO,WAGPtT,EAAE,YAAYsT,EAAO,UAAU,KAC/BtT,EAAE,YAAYsF,EAAO,UAAU,KAC/BgO,EAAO,cAAchO,EAAO,eAC9B4Y,EAAa5Y,GAAQgO,CAAM;AAAA,MAE9B;AAAA,IACL;AAEE,aAAS6K,EAAU7Y,GAAQ;AACzB,aAAO,SAASE,GAAQ;AACtB,QAAAA,EAAO,GAAM,KAAKF,CAAM,GACpB,EAAEE,EAAO,aAAa,KACxBuY,EAAU,KAAKvY,CAAM;AAAA,MAExB;AAAA,IACL;AAEE,WAAOuY,EAAU,UAAQ;AACvB,UAAIta,IAAQsa,EAAU,IAAK;AAC3B,MAAAL,EAAQ,KAAKja,CAAK,GAClBzD,EAAE,QAAQyD,EAAM,GAAM,WAAWwa,EAASxa,CAAK,CAAC,GAChDzD,EAAE,QAAQyD,EAAM,KAAK0a,EAAU1a,CAAK,CAAC;AAAA,IACzC;AAEE,WAAOzD,EAAE;AAAA,MAAIA,EAAE,OAAO0d,GAAS,SAASja,GAAO;AAAE,eAAO,CAACA,EAAM;AAAA,MAAO,CAAE;AAAA,MACtE,SAASA,GAAO;AACd,eAAOzD,EAAE,KAAKyD,GAAO,CAAC,MAAM,KAAK,cAAc,QAAQ,CAAC;AAAA,MAC9D;AAAA,IAAK;AAAA,EAEL;AAEA,WAASya,EAAaE,GAAQvvB,GAAQ;AACpC,QAAIwvB,IAAM,GACN5Y,IAAS;AAEb,IAAI2Y,EAAO,WACTC,KAAOD,EAAO,aAAaA,EAAO,QAClC3Y,KAAU2Y,EAAO,SAGfvvB,EAAO,WACTwvB,KAAOxvB,EAAO,aAAaA,EAAO,QAClC4W,KAAU5W,EAAO,SAGnBuvB,EAAO,KAAKvvB,EAAO,GAAG,OAAOuvB,EAAO,EAAE,GACtCA,EAAO,aAAaC,IAAM5Y,GAC1B2Y,EAAO,SAAS3Y,GAChB2Y,EAAO,IAAI,KAAK,IAAIvvB,EAAO,GAAGuvB,EAAO,CAAC,GACtCvvB,EAAO,SAAS;AAAA,EAClB;;;;;;;ACzHA,MAAImR,IAAItY,EAAoB,GACxBwsB,IAAOpsB,EAAkB;AAE7B,EAAAw2B,KAAiBC;AAEjB,WAASA,EAAKb,GAASc,GAAW;AAChC,QAAIC,IAAQvK,EAAK,UAAUwJ,GAAS,SAASja,GAAO;AAClD,aAAOzD,EAAE,IAAIyD,GAAO,YAAY;AAAA,IACpC,CAAG,GACGib,IAAWD,EAAM,KACnBE,IAAa3e,EAAE,OAAOye,EAAM,KAAK,SAAShb,GAAO;AAAE,aAAO,CAACA,EAAM;AAAA,IAAE,CAAE,GACrE9C,IAAK,CAAE,GACP0d,IAAM,GACN5Y,IAAS,GACTmZ,IAAU;AAEZ,IAAAF,EAAS,KAAKG,EAAgB,CAAC,CAACL,CAAS,CAAC,GAE1CI,IAAUE,EAAkBne,GAAIge,GAAYC,CAAO,GAEnD5e,EAAE,QAAQ0e,GAAU,SAAUjb,GAAO;AACnC,MAAAmb,KAAWnb,EAAM,GAAG,QACpB9C,EAAG,KAAK8C,EAAM,EAAE,GAChB4a,KAAO5a,EAAM,aAAaA,EAAM,QAChCgC,KAAUhC,EAAM,QAChBmb,IAAUE,EAAkBne,GAAIge,GAAYC,CAAO;AAAA,IACvD,CAAG;AAED,QAAI50B,IAAS,EAAE,IAAIgW,EAAE,QAAQW,GAAI,EAAI,EAAG;AACxC,WAAI8E,MACFzb,EAAO,aAAaq0B,IAAM5Y,GAC1Bzb,EAAO,SAASyb,IAEXzb;AAAA,EACT;AAEA,WAAS80B,EAAkBne,GAAIge,GAAYv3B,GAAO;AAEhD,aADI0jB,GACG6T,EAAW,WAAW7T,IAAO9K,EAAE,KAAK2e,CAAU,GAAG,KAAKv3B;AAC3D,MAAAu3B,EAAW,IAAK,GAChBhe,EAAG,KAAKmK,EAAK,EAAE,GACf1jB;AAEF,WAAOA;AAAA,EACT;AAEA,WAASy3B,EAAgBE,GAAM;AAC7B,WAAO,SAASlB,GAAQC,GAAQ;AAC9B,aAAID,EAAO,aAAaC,EAAO,aACtB,KACED,EAAO,aAAaC,EAAO,aAC7B,IAGDiB,IAA6BjB,EAAO,IAAID,EAAO,IAAxCA,EAAO,IAAIC,EAAO;AAAA,IAClC;AAAA,EACH;;;;;;;ACxDA,MAAI9d,IAAItY,EAAoB,GACxB21B,IAAav1B,GAAuB,GACpC21B,IAAmBj1B,GAA8B,GACjD+1B,IAAOvzB,GAAiB;AAE5B,EAAAg0B,KAAiBC;AAEjB,WAASA,EAAa9b,GAAGzC,GAAGid,GAAIa,GAAW;AACzC,QAAIlB,IAAUna,EAAE,SAASzC,CAAC,GACtB6C,IAAOJ,EAAE,KAAKzC,CAAC,GACfwe,IAAK3b,IAAOA,EAAK,aAAa,QAC9B4b,IAAK5b,IAAOA,EAAK,cAAa,QAC9B6b,IAAY,CAAE;AAElB,IAAIF,MACF5B,IAAUtd,EAAE,OAAOsd,GAAS,SAAS7b,GAAG;AACtC,aAAOA,MAAMyd,KAAMzd,MAAM0d;AAAA,IAC/B,CAAK;AAGH,QAAIE,IAAchC,EAAWla,GAAGma,CAAO;AACvC,IAAAtd,EAAE,QAAQqf,GAAa,SAAS5b,GAAO;AACrC,UAAIN,EAAE,SAASM,EAAM,CAAC,EAAE,QAAQ;AAC9B,YAAI6b,IAAiBL,EAAa9b,GAAGM,EAAM,GAAGka,GAAIa,CAAS;AAC3D,QAAAY,EAAU3b,EAAM,CAAC,IAAI6b,GACjBtf,EAAE,IAAIsf,GAAgB,YAAY,KACpCC,EAAiB9b,GAAO6b,CAAc;AAAA,MAE9C;AAAA,IACA,CAAG;AAED,QAAI5B,IAAUD,EAAiB4B,GAAa1B,CAAE;AAC9C,IAAA6B,EAAgB9B,GAAS0B,CAAS;AAElC,QAAIp1B,IAASu0B,EAAKb,GAASc,CAAS;AAEpC,QAAIU,MACFl1B,EAAO,KAAKgW,EAAE,QAAQ,CAACkf,GAAIl1B,EAAO,IAAIm1B,CAAE,GAAG,EAAI,GAC3Chc,EAAE,aAAa+b,CAAE,EAAE,SAAQ;AAC7B,UAAIO,IAAStc,EAAE,KAAKA,EAAE,aAAa+b,CAAE,EAAE,CAAC,CAAC,GACvCQ,IAASvc,EAAE,KAAKA,EAAE,aAAagc,CAAE,EAAE,CAAC,CAAC;AACvC,MAAKnf,EAAE,IAAIhW,GAAQ,YAAY,MAC7BA,EAAO,aAAa,GACpBA,EAAO,SAAS,IAElBA,EAAO,cAAcA,EAAO,aAAaA,EAAO,SAC3By1B,EAAO,QAAQC,EAAO,UAAU11B,EAAO,SAAS,IACrEA,EAAO,UAAU;AAAA,IACvB;AAGE,WAAOA;AAAA,EACT;AAEA,WAASw1B,EAAgB9B,GAAS0B,GAAW;AAC3C,IAAApf,EAAE,QAAQ0d,GAAS,SAASja,GAAO;AACjC,MAAAA,EAAM,KAAKzD,EAAE,QAAQyD,EAAM,GAAG,IAAI,SAAS/C,GAAG;AAC5C,eAAI0e,EAAU1e,CAAC,IACN0e,EAAU1e,CAAC,EAAE,KAEfA;AAAA,MACR,CAAA,GAAG,EAAI;AAAA,IACZ,CAAG;AAAA,EACH;AAEA,WAAS6e,EAAiBnB,GAAQ90B,GAAO;AACvC,IAAK0W,EAAE,YAAYoe,EAAO,UAAU,KAMlCA,EAAO,aAAa90B,EAAM,YAC1B80B,EAAO,SAAS90B,EAAM,WANtB80B,EAAO,cAAcA,EAAO,aAAaA,EAAO,SAC3B90B,EAAM,aAAaA,EAAM,WACzB80B,EAAO,SAAS90B,EAAM,SAC3C80B,EAAO,UAAU90B,EAAM;AAAA,EAK3B;;;;;;;AC3EA,MAAI0W,IAAItY,EAAoB,GACxBwY,IAAQpY,EAAsB,EAAC;AAEnC,EAAA63B,KAAiBC;AAgCjB,WAASA,EAAgBzc,GAAG4S,GAAM8J,GAAc;AAC9C,QAAIlS,IAAOmS,EAAe3c,CAAC,GACzBnZ,IAAS,IAAIkW,EAAM,EAAE,UAAU,GAAM,CAAA,EAAE,SAAS,EAAE,MAAMyN,EAAM,CAAA,EAC3D,oBAAoB,SAASjN,GAAG;AAAE,aAAOyC,EAAE,KAAKzC,CAAC;AAAA,KAAI;AAE1D,WAAAV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC,GACjBK,IAASoC,EAAE,OAAOzC,CAAC;AAErB,OAAI6C,EAAK,SAASwS,KAAQxS,EAAK,WAAWwS,KAAQA,KAAQxS,EAAK,aAC7DvZ,EAAO,QAAQ0W,CAAC,GAChB1W,EAAO,UAAU0W,GAAGK,KAAU4M,CAAI,GAGlC3N,EAAE,QAAQmD,EAAE0c,CAAY,EAAEnf,CAAC,GAAG,SAASG,GAAG;AACxC,YAAIuB,IAAIvB,EAAE,MAAMH,IAAIG,EAAE,IAAIA,EAAE,GAC1BqB,IAAOlY,EAAO,KAAKoY,GAAG1B,CAAC,GACvB+E,IAAUzF,EAAE,YAAYkC,CAAI,IAAkB,IAAdA,EAAK;AACvC,QAAAlY,EAAO,QAAQoY,GAAG1B,GAAG,EAAE,QAAQyC,EAAE,KAAKtC,CAAC,EAAE,SAAS4E,EAAM,CAAE;AAAA,MAClE,CAAO,GAEGzF,EAAE,IAAIuD,GAAM,SAAS,KACvBvZ,EAAO,QAAQ0W,GAAG;AAAA,QAChB,YAAY6C,EAAK,WAAWwS,CAAI;AAAA,QAChC,aAAaxS,EAAK,YAAYwS,CAAI;AAAA,MAC5C,CAAS;AAAA,IAGT,CAAG,GAEM/rB;AAAA,EACT;AAEA,WAAS81B,EAAe3c,GAAG;AAEzB,aADIzC,GACGyC,EAAE,QAASzC,IAAIV,EAAE,SAAS,OAAO,KAAI;AAC5C,WAAOU;AAAA,EACT;;;;;;;ACxEA,MAAIV,IAAItY,EAAoB;AAE5B,EAAAq4B,KAAiBC;AAEjB,WAASA,EAAuB7c,GAAGwa,GAAIhd,GAAI;AACzC,QAAIgb,IAAO,CAAE,GACXsE;AAEF,IAAAjgB,EAAE,QAAQW,GAAI,SAASD,GAAG;AAIxB,eAHII,IAAQqC,EAAE,OAAOzC,CAAC,GACpBK,GACAmf,GACKpf,KAAO;AASZ,YARAC,IAASoC,EAAE,OAAOrC,CAAK,GACnBC,KACFmf,IAAYvE,EAAK5a,CAAM,GACvB4a,EAAK5a,CAAM,IAAID,MAEfof,IAAYD,GACZA,IAAWnf,IAETof,KAAaA,MAAcpf,GAAO;AACpC,UAAA6c,EAAG,QAAQuC,GAAWpf,CAAK;AAC3B;AAAA,QACR;AACM,QAAAA,IAAQC;AAAA,MACd;AAAA,IACA,CAAG;AAAA,EAyBH;;;;;;;AClDA,MAAIf,IAAItY,EAAoB,GACxB40B,IAAYx0B,GAAuB,GACnC40B,IAAal0B,GAAwB,GACrCy2B,IAAej0B,GAA0B,GACzC40B,IAAkB30B,GAA8B,GAChD+0B,IAAyB90B,GAAqC,GAC9DgV,IAAQ5S,EAAsB,EAAC,OAC/B4mB,IAAO1mB,EAAkB;AAE7B,EAAA2yB,KAAiB7Y;AAiBjB,WAASA,EAAMnE,GAAG;AAChB,QAAI0R,IAAUX,EAAK,QAAQ/Q,CAAC,GAC1Bid,IAAkBC,EAAiBld,GAAGnD,EAAE,MAAM,GAAG6U,IAAU,CAAC,GAAG,SAAS,GACxEyL,IAAgBD,EAAiBld,GAAGnD,EAAE,MAAM6U,IAAU,GAAG,IAAI,EAAE,GAAG,UAAU,GAE1EiB,IAAWwG,EAAUnZ,CAAC;AAC1B,IAAAod,EAAYpd,GAAG2S,CAAQ;AAKvB,aAHI0K,IAAS,OAAO,mBAClBC,GAEOlc,IAAI,GAAGmc,IAAW,GAAGA,IAAW,GAAG,EAAEnc,GAAG,EAAEmc,GAAU;AAC3D,MAAAC,EAAiBpc,IAAI,IAAI6b,IAAkBE,GAAe/b,IAAI,KAAK,CAAC,GAEpEuR,IAAW5B,EAAK,iBAAiB/Q,CAAC;AAClC,UAAIwZ,IAAKD,EAAWvZ,GAAG2S,CAAQ;AAC/B,MAAI6G,IAAK6D,MACPE,IAAW,GACXD,IAAOzgB,EAAE,UAAU8V,CAAQ,GAC3B0K,IAAS7D;AAAA,IAEf;AAEE,IAAA4D,EAAYpd,GAAGsd,CAAI;AAAA,EACrB;AAEA,WAASJ,EAAiBld,GAAGyd,GAAOf,GAAc;AAChD,WAAO7f,EAAE,IAAI4gB,GAAO,SAAS7K,GAAM;AACjC,aAAO6J,EAAgBzc,GAAG4S,GAAM8J,CAAY;AAAA,IAChD,CAAG;AAAA,EACH;AAEA,WAASc,EAAiBE,GAAarC,GAAW;AAChD,QAAIb,IAAK,IAAIzd,EAAO;AACpB,IAAAF,EAAE,QAAQ6gB,GAAa,SAASC,GAAI;AAClC,UAAInT,IAAOmT,EAAG,MAAK,EAAG,MAClBC,IAAS9B,EAAa6B,GAAInT,GAAMgQ,GAAIa,CAAS;AACjD,MAAAxe,EAAE,QAAQ+gB,EAAO,IAAI,SAASrgB,GAAG6D,GAAG;AAClC,QAAAuc,EAAG,KAAKpgB,CAAC,EAAE,QAAQ6D;AAAA,MACzB,CAAK,GACDyb,EAAuBc,GAAInD,GAAIoD,EAAO,EAAE;AAAA,IAC5C,CAAG;AAAA,EACH;AAEA,WAASR,EAAYpd,GAAG2S,GAAU;AAChC,IAAA9V,EAAE,QAAQ8V,GAAU,SAASkL,GAAO;AAClC,MAAAhhB,EAAE,QAAQghB,GAAO,SAAStgB,GAAG6D,GAAG;AAC9B,QAAApB,EAAE,KAAKzC,CAAC,EAAE,QAAQ6D;AAAA,MACxB,CAAK;AAAA,IACL,CAAG;AAAA,EACH;;;;;;;AC5EA,MAAIvE,IAAItY,EAAoB,GACxBwY,IAAQpY,EAAsB,EAAC,OAC/BosB,IAAO1rB,EAAkB;AAO7B,EAAAy4B,KAAiB;AAAA,IACf,WAAWC;AAAA,IACX,oBAAoBC;AAAA,IACpB,oBAAoBC;AAAA,IACpB,aAAaC;AAAA,IACb,aAAaC;AAAA,IACb,mBAAmBC;AAAA,IACnB,sBAAsBC;AAAA,IACtB,kBAAkBC;AAAA,IAClB,4BAA4BC;AAAA,IAC5B,SAASC;AAAA,EACV;AAmBD,WAASR,EAAmBhe,GAAG2S,GAAU;AACvC,QAAI8L,IAAY,CAAE;AAElB,aAASC,EAAWC,GAAWd,GAAO;AACpC,UAGEe,IAAK,GAGLC,IAAU,GACVC,IAAkBH,EAAU,QAC5BI,IAAWliB,EAAE,KAAKghB,CAAK;AAEzB,aAAAhhB,EAAE,QAAQghB,GAAO,SAAStgB,GAAG6D,GAAG;AAC9B,YAAI9C,IAAI0gB,EAA0Bhf,GAAGzC,CAAC,GACpC0hB,IAAK3gB,IAAI0B,EAAE,KAAK1B,CAAC,EAAE,QAAQwgB;AAE7B,SAAIxgB,KAAKf,MAAMwhB,OACbliB,EAAE,QAAQghB,EAAM,MAAMgB,GAASzd,IAAG,CAAC,GAAG,SAAS8d,GAAU;AACvD,UAAAriB,EAAE,QAAQmD,EAAE,aAAakf,CAAQ,GAAG,SAASjgB,GAAG;AAC9C,gBAAIkgB,KAASnf,EAAE,KAAKf,CAAC,GACnBmgB,KAAOD,GAAO;AAChB,aAAKC,KAAOR,KAAMK,IAAKG,OACnB,EAAED,GAAO,SAASnf,EAAE,KAAKkf,CAAQ,EAAE,UACrChB,EAAYO,GAAWxf,GAAGigB,CAAQ;AAAA,UAEhD,CAAW;AAAA,QACX,CAAS,GACDL,IAAUzd,IAAI,GACdwd,IAAKK;AAAA,MAEb,CAAK,GAEMpB;AAAA,IACX;AAEE,WAAAhhB,EAAE,OAAO8V,GAAU+L,CAAU,GACtBD;AAAA,EACT;AAEA,WAASR,EAAmBje,GAAG2S,GAAU;AACvC,QAAI8L,IAAY,CAAE;AAElB,aAASY,EAAKC,GAAO1F,GAAU2F,GAAUC,GAAiBC,GAAiB;AACzE,UAAIliB;AACJ,MAAAV,EAAE,QAAQA,EAAE,MAAM+c,GAAU2F,CAAQ,GAAG,SAASne,GAAG;AACjD,QAAA7D,IAAI+hB,EAAMle,CAAC,GACPpB,EAAE,KAAKzC,CAAC,EAAE,SACZV,EAAE,QAAQmD,EAAE,aAAazC,CAAC,GAAG,SAAS0B,GAAG;AACvC,cAAIygB,IAAQ1f,EAAE,KAAKf,CAAC;AACpB,UAAIygB,EAAM,UACLA,EAAM,QAAQF,KAAmBE,EAAM,QAAQD,MAClDvB,EAAYO,GAAWxf,GAAG1B,CAAC;AAAA,QAEvC,CAAS;AAAA,MAET,CAAK;AAAA,IACL;AAGE,aAASmhB,EAAWiB,GAAOL,GAAO;AAChC,UAAIM,IAAe,IACjBC,GACAjG,IAAW;AAEb,aAAA/c,EAAE,QAAQyiB,GAAO,SAAS/hB,GAAGuiB,GAAgB;AAC3C,YAAI9f,EAAE,KAAKzC,CAAC,EAAE,UAAU,UAAU;AAChC,cAAIwiB,IAAe/f,EAAE,aAAazC,CAAC;AACnC,UAAIwiB,EAAa,WACfF,IAAe7f,EAAE,KAAK+f,EAAa,CAAC,CAAC,EAAE,OACvCV,EAAKC,GAAO1F,GAAUkG,GAAgBF,GAAcC,CAAY,GAChEjG,IAAWkG,GACXF,IAAeC;AAAA,QAEzB;AACM,QAAAR,EAAKC,GAAO1F,GAAU0F,EAAM,QAAQO,GAAcF,EAAM,MAAM;AAAA,MACpE,CAAK,GAEML;AAAA,IACX;AAEE,WAAAziB,EAAE,OAAO8V,GAAU+L,CAAU,GACtBD;AAAA,EACT;AAEA,WAASO,EAA0Bhf,GAAGzC,GAAG;AACvC,QAAIyC,EAAE,KAAKzC,CAAC,EAAE;AACZ,aAAOV,EAAE,KAAKmD,EAAE,aAAazC,CAAC,GAAG,SAAS0B,GAAG;AAC3C,eAAOe,EAAE,KAAKf,CAAC,EAAE;AAAA,MACvB,CAAK;AAAA,EAEL;AAEA,WAASif,EAAYO,GAAWlhB,GAAGe,GAAG;AACpC,QAAIf,IAAIe,GAAG;AACT,UAAIoB,IAAMnC;AACV,MAAAA,IAAIe,GACJA,IAAIoB;AAAA,IACR;AAEE,QAAIsgB,IAAavB,EAAUlhB,CAAC;AAC5B,IAAKyiB,MACHvB,EAAUlhB,CAAC,IAAIyiB,IAAa,CAAE,IAEhCA,EAAW1hB,CAAC,IAAI;AAAA,EAClB;AAEA,WAAS6f,EAAYM,GAAWlhB,GAAGe,GAAG;AACpC,QAAIf,IAAIe,GAAG;AACT,UAAIoB,IAAMnC;AACV,MAAAA,IAAIe,GACJA,IAAIoB;AAAA,IACR;AACE,WAAO7C,EAAE,IAAI4hB,EAAUlhB,CAAC,GAAGe,CAAC;AAAA,EAC9B;AAUA,WAAS8f,EAAkBpe,GAAG2S,GAAU8L,GAAWwB,GAAY;AAC7D,QAAIzV,IAAO,CAAE,GACX0V,IAAQ,CAAE,GACVC,IAAM,CAAE;AAKV,WAAAtjB,EAAE,QAAQ8V,GAAU,SAASkL,GAAO;AAClC,MAAAhhB,EAAE,QAAQghB,GAAO,SAAStgB,GAAG4G,GAAO;AAClC,QAAAqG,EAAKjN,CAAC,IAAIA,GACV2iB,EAAM3iB,CAAC,IAAIA,GACX4iB,EAAI5iB,CAAC,IAAI4G;AAAA,MACf,CAAK;AAAA,IACL,CAAG,GAEDtH,EAAE,QAAQ8V,GAAU,SAASkL,GAAO;AAClC,UAAIuC,IAAU;AACd,MAAAvjB,EAAE,QAAQghB,GAAO,SAAStgB,GAAG;AAC3B,YAAI8iB,IAAKJ,EAAW1iB,CAAC;AACrB,YAAI8iB,EAAG,QAAQ;AACb,UAAAA,IAAKxjB,EAAE,OAAOwjB,GAAI,SAAS/hB,GAAG;AAAE,mBAAO6hB,EAAI7hB,CAAC;AAAA,WAAI;AAEhD,mBADIgiB,KAAMD,EAAG,SAAS,KAAK,GAClBjf,IAAI,KAAK,MAAMkf,CAAE,GAAGC,IAAK,KAAK,KAAKD,CAAE,GAAGlf,KAAKmf,GAAI,EAAEnf,GAAG;AAC7D,gBAAI9C,IAAI+hB,EAAGjf,CAAC;AACZ,YAAI8e,EAAM3iB,CAAC,MAAMA,KACb6iB,IAAUD,EAAI7hB,CAAC,KACf,CAAC6f,EAAYM,GAAWlhB,GAAGe,CAAC,MAC9B4hB,EAAM5hB,CAAC,IAAIf,GACX2iB,EAAM3iB,CAAC,IAAIiN,EAAKjN,CAAC,IAAIiN,EAAKlM,CAAC,GAC3B8hB,IAAUD,EAAI7hB,CAAC;AAAA,UAE3B;AAAA,QACA;AAAA,MACA,CAAK;AAAA,IACL,CAAG,GAEM,EAAE,MAAMkM,GAAM,OAAO0V,EAAO;AAAA,EACrC;AAEA,WAAS7B,EAAqBre,GAAG2S,GAAUnI,GAAM0V,GAAOM,GAAY;AAMlE,QAAIC,IAAK,CAAE,GACTC,IAASC,EAAgB3gB,GAAG2S,GAAUnI,GAAMgW,CAAU,GACtDI,IAAaJ,IAAa,eAAe;AAE3C,aAASK,EAAQC,GAAWC,GAAe;AAIzC,eAHIx6B,IAAQm6B,EAAO,MAAO,GACtBM,IAAOz6B,EAAM,IAAK,GAClBka,IAAU,CAAE,GACTugB;AACL,QAAIvgB,EAAQugB,CAAI,IACdF,EAAUE,CAAI,KAEdvgB,EAAQugB,CAAI,IAAI,IAChBz6B,EAAM,KAAKy6B,CAAI,GACfz6B,IAAQA,EAAM,OAAOw6B,EAAcC,CAAI,CAAC,IAG1CA,IAAOz6B,EAAM,IAAK;AAAA,IAExB;AAGE,aAAS06B,EAAMD,GAAM;AACnB,MAAAP,EAAGO,CAAI,IAAIN,EAAO,QAAQM,CAAI,EAAE,OAAO,SAASpe,GAAKlF,GAAG;AACtD,eAAO,KAAK,IAAIkF,GAAK6d,EAAG/iB,EAAE,CAAC,IAAIgjB,EAAO,KAAKhjB,CAAC,CAAC;AAAA,MAC9C,GAAE,CAAC;AAAA,IACR;AAGE,aAASwjB,EAAMF,GAAM;AACnB,UAAI7f,IAAMuf,EAAO,SAASM,CAAI,EAAE,OAAO,SAASpe,GAAKlF,GAAG;AACtD,eAAO,KAAK,IAAIkF,GAAK6d,EAAG/iB,EAAE,CAAC,IAAIgjB,EAAO,KAAKhjB,CAAC,CAAC;AAAA,MACnD,GAAO,OAAO,iBAAiB,GAEvB0C,IAAOJ,EAAE,KAAKghB,CAAI;AACtB,MAAI7f,MAAQ,OAAO,qBAAqBf,EAAK,eAAewgB,MAC1DH,EAAGO,CAAI,IAAI,KAAK,IAAIP,EAAGO,CAAI,GAAG7f,CAAG;AAAA,IAEvC;AAEE,WAAA0f,EAAQI,GAAOP,EAAO,aAAa,KAAKA,CAAM,CAAC,GAC/CG,EAAQK,GAAOR,EAAO,WAAW,KAAKA,CAAM,CAAC,GAG7C7jB,EAAE,QAAQqjB,GAAO,SAAS3iB,GAAG;AAC3B,MAAAkjB,EAAGljB,CAAC,IAAIkjB,EAAGjW,EAAKjN,CAAC,CAAC;AAAA,IACtB,CAAG,GAEMkjB;AAAA,EACT;AAGA,WAASE,EAAgB3gB,GAAG2S,GAAUnI,GAAMgW,GAAY;AACtD,QAAIW,IAAa,IAAIpkB,EAAO,GAC1Bmb,IAAalY,EAAE,MAAO,GACtBohB,IAAQC,EAAInJ,EAAW,SAASA,EAAW,SAASsI,CAAU;AAEhE,WAAA3jB,EAAE,QAAQ8V,GAAU,SAASkL,GAAO;AAClC,UAAI5e;AACJ,MAAApC,EAAE,QAAQghB,GAAO,SAAStgB,GAAG;AAC3B,YAAI+jB,IAAQ9W,EAAKjN,CAAC;AAElB,YADA4jB,EAAW,QAAQG,CAAK,GACpBriB,GAAG;AACL,cAAIsiB,IAAQ/W,EAAKvL,CAAC,GAChBuiB,IAAUL,EAAW,KAAKI,GAAOD,CAAK;AACxC,UAAAH,EAAW,QAAQI,GAAOD,GAAO,KAAK,IAAIF,EAAMphB,GAAGzC,GAAG0B,CAAC,GAAGuiB,KAAW,CAAC,CAAC;AAAA,QAC/E;AACM,QAAAviB,IAAI1B;AAAA,MACV,CAAK;AAAA,IACL,CAAG,GAEM4jB;AAAA,EACT;AAKA,WAAS5C,EAA2Bve,GAAGyhB,GAAK;AAC1C,WAAO5kB,EAAE,MAAMA,EAAE,OAAO4kB,CAAG,GAAG,SAAUhB,GAAI;AAC1C,UAAIvY,IAAM,OAAO,mBACb/G,IAAM,OAAO;AAEjB,aAAAtE,EAAE,MAAM4jB,GAAI,SAAU1f,GAAGxD,GAAG;AAC1B,YAAImkB,IAAYC,EAAM3hB,GAAGzC,CAAC,IAAI;AAE9B,QAAA2K,IAAM,KAAK,IAAInH,IAAI2gB,GAAWxZ,CAAG,GACjC/G,IAAM,KAAK,IAAIJ,IAAI2gB,GAAWvgB,CAAG;AAAA,MACvC,CAAK,GAEM+G,IAAM/G;AAAA,IACjB,CAAG;AAAA,EACH;AASA,WAASmd,EAAiBmD,GAAKG,GAAS;AACtC,QAAIC,IAAchlB,EAAE,OAAO+kB,CAAO,GAChCE,IAAajlB,EAAE,IAAIglB,CAAW,GAC9BE,IAAallB,EAAE,IAAIglB,CAAW;AAEhC,IAAAhlB,EAAE,QAAQ,CAAC,KAAK,GAAG,GAAG,SAASmlB,GAAM;AACnC,MAAAnlB,EAAE,QAAQ,CAAC,KAAK,GAAG,GAAG,SAASolB,GAAO;AACpC,YAAIC,IAAYF,IAAOC,GACrBxB,IAAKgB,EAAIS,CAAS,GAClBnP;AACF,YAAI0N,MAAOmB,GAEX;AAAA,cAAIO,IAAStlB,EAAE,OAAO4jB,CAAE;AACxB,UAAA1N,IAAQkP,MAAU,MAAMH,IAAajlB,EAAE,IAAIslB,CAAM,IAAIJ,IAAallB,EAAE,IAAIslB,CAAM,GAE1EpP,MACF0O,EAAIS,CAAS,IAAIrlB,EAAE,UAAU4jB,GAAI,SAAS1f,GAAG;AAAE,mBAAOA,IAAIgS;AAAA,UAAM,CAAE;AAAA;AAAA,MAE1E,CAAK;AAAA,IACL,CAAG;AAAA,EACH;AAEA,WAASyL,EAAQiD,GAAKvB,GAAO;AAC3B,WAAOrjB,EAAE,UAAU4kB,EAAI,IAAI,SAASW,GAAQ7kB,GAAG;AAC7C,UAAI2iB;AACF,eAAOuB,EAAIvB,EAAM,YAAa,CAAA,EAAE3iB,CAAC;AAEjC,UAAIkjB,IAAK5jB,EAAE,OAAOA,EAAE,IAAI4kB,GAAKlkB,CAAC,CAAC;AAC/B,cAAQkjB,EAAG,CAAC,IAAIA,EAAG,CAAC,KAAK;AAAA,IAE/B,CAAG;AAAA,EACH;AAEA,WAAS1C,EAAU/d,GAAG;AACpB,QAAI2S,IAAW5B,EAAK,iBAAiB/Q,CAAC,GAClCye,IAAY5hB,EAAE;AAAA,MAChBmhB,EAAmBhe,GAAG2S,CAAQ;AAAA,MAC9BsL,EAAmBje,GAAG2S,CAAQ;AAAA,IAAC,GAE7B8O,IAAM,CAAE,GACRY;AACJ,IAAAxlB,EAAE,QAAQ,CAAC,KAAK,GAAG,GAAG,SAASmlB,GAAM;AACnC,MAAAK,IAAmBL,MAAS,MAAMrP,IAAW9V,EAAE,OAAO8V,CAAQ,EAAE,QAAS,GACzE9V,EAAE,QAAQ,CAAC,KAAK,GAAG,GAAG,SAASolB,GAAO;AACpC,QAAIA,MAAU,QACZI,IAAmBxlB,EAAE,IAAIwlB,GAAkB,SAASC,GAAO;AACzD,iBAAOzlB,EAAE,OAAOylB,CAAK,EAAE,QAAS;AAAA,QAC1C,CAAS;AAGH,YAAIrC,KAAc+B,MAAS,MAAMhiB,EAAE,eAAeA,EAAE,YAAY,KAAKA,CAAC,GAClEkgB,IAAQ9B,EAAkBpe,GAAGqiB,GAAkB5D,GAAWwB,CAAU,GACpEQ,IAAKpC;AAAA,UAAqBre;AAAA,UAAGqiB;AAAA,UAC/BnC,EAAM;AAAA,UAAMA,EAAM;AAAA,UAAO+B,MAAU;AAAA,QAAG;AACxC,QAAIA,MAAU,QACZxB,IAAK5jB,EAAE,UAAU4jB,GAAI,SAAS1f,GAAG;AAAE,iBAAO,CAACA;AAAA,SAAI,IAEjD0gB,EAAIO,IAAOC,CAAK,IAAIxB;AAAA,MAC1B,CAAK;AAAA,IACL,CAAG;AAED,QAAI8B,IAAgBhE,EAA2Bve,GAAGyhB,CAAG;AACrD,WAAAnD,EAAiBmD,GAAKc,CAAa,GAC5B/D,EAAQiD,GAAKzhB,EAAE,MAAK,EAAG,KAAK;AAAA,EACrC;AAEA,WAASqhB,EAAI5J,GAAS+K,GAAShC,GAAY;AACzC,WAAO,SAASxgB,GAAGzC,GAAG,GAAG;AACvB,UAAImY,IAAS1V,EAAE,KAAKzC,CAAC,GACjBoY,IAAS3V,EAAE,KAAK,CAAC,GACjBkb,IAAM,GACNnI;AAGJ,UADAmI,KAAOxF,EAAO,QAAQ,GAClB7Y,EAAE,IAAI6Y,GAAQ,UAAU;AAC1B,gBAAQA,EAAO,SAAS,YAAa,GAAA;AAAA,UACrC,KAAK;AAAK,YAAA3C,IAAQ,CAAC2C,EAAO,QAAQ;AAAG;AAAA,UACrC,KAAK;AAAK,YAAA3C,IAAQ2C,EAAO,QAAQ;AAAG;AAAA,QAC1C;AAWI,UATI3C,MACFmI,KAAOsF,IAAazN,IAAQ,CAACA,IAE/BA,IAAQ,GAERmI,MAAQxF,EAAO,QAAQ8M,IAAU/K,KAAW,GAC5CyD,MAAQvF,EAAO,QAAQ6M,IAAU/K,KAAW,GAE5CyD,KAAOvF,EAAO,QAAQ,GAClB9Y,EAAE,IAAI8Y,GAAQ,UAAU;AAC1B,gBAAQA,EAAO,SAAS,YAAa,GAAA;AAAA,UACrC,KAAK;AAAK,YAAA5C,IAAQ4C,EAAO,QAAQ;AAAG;AAAA,UACpC,KAAK;AAAK,YAAA5C,IAAQ,CAAC4C,EAAO,QAAQ;AAAG;AAAA,QAC3C;AAEI,aAAI5C,MACFmI,KAAOsF,IAAazN,IAAQ,CAACA,IAE/BA,IAAQ,GAEDmI;AAAA,IACR;AAAA,EACH;AAEA,WAASyG,EAAM3hB,GAAGzC,GAAG;AACnB,WAAOyC,EAAE,KAAKzC,CAAC,EAAE;AAAA,EACnB;;;;;;;AChaA,MAAIV,IAAItY,EAAoB,GACxBwsB,IAAOpsB,EAAkB,GACzBo5B,IAAY14B,GAAe,EAAC;AAEhC,EAAAo9B,KAAiBC;AAEjB,WAASA,EAAS1iB,GAAG;AACnB,IAAAA,IAAI+Q,EAAK,mBAAmB/Q,CAAC,GAE7B2iB,EAAU3iB,CAAC,GACXnD,EAAE,QAAQkhB,EAAU/d,CAAC,GAAG,SAASe,GAAGxD,GAAG;AACrC,MAAAyC,EAAE,KAAKzC,CAAC,EAAE,IAAIwD;AAAA,IAClB,CAAG;AAAA,EACH;AAEA,WAAS4hB,EAAU3iB,GAAG;AACpB,QAAI2S,IAAW5B,EAAK,iBAAiB/Q,CAAC,GAClC4iB,IAAU5iB,EAAE,MAAK,EAAG,SACpB6iB,IAAQ;AACZ,IAAAhmB,EAAE,QAAQ8V,GAAU,SAASkL,GAAO;AAClC,UAAIiF,IAAYjmB,EAAE,IAAIA,EAAE,IAAIghB,GAAO,SAAStgB,GAAG;AAAE,eAAOyC,EAAE,KAAKzC,CAAC,EAAE;AAAA,MAAO,CAAE,CAAC;AAC5E,MAAAV,EAAE,QAAQghB,GAAO,SAAStgB,GAAG;AAC3B,QAAAyC,EAAE,KAAKzC,CAAC,EAAE,IAAIslB,IAAQC,IAAY;AAAA,MACxC,CAAK,GACDD,KAASC,IAAYF;AAAA,IACzB,CAAG;AAAA,EACH;;;;;;;AC1BA,MAAI/lB,IAAItY,EAAmB,GACvBksB,IAAU9rB,GAAoB,GAC9BuuB,IAAY7tB,GAAsB,GAClCutB,IAAO/qB,GAAiB,GACxB0pB,IAAiBzpB,EAAiB,EAAC,gBACnC2uB,IAAoB1uB,GAAgC,GACpDypB,IAAmB1pB,EAAiB,EAAC,kBACrCsvB,IAAejtB,GAA0B,GACzCiuB,IAAoB/tB,GAAgC,GACpDouB,IAAmBhhB,GAA8B,GACjD0M,IAAQzM,GAAkB,GAC1BgrB,IAAWpmB,GAAqB,GAChCyU,IAAOjpB,EAAiB,GACxBiV,IAAQR,EAAqB,EAAC;AAElC,EAAAwmB,KAAiBC;AAEjB,WAASA,EAAOhjB,GAAG7C,GAAM;AACvB,QAAIyU,IAAOzU,KAAQA,EAAK,cAAc4T,EAAK,OAAOA,EAAK;AACvD,IAAAa,EAAK,UAAU,WAAW;AACxB,UAAIqR,IACFrR,EAAK,sBAAsB,WAAW;AAAE,eAAOsR,EAAiBljB,CAAC;AAAA,OAAI;AACvE,MAAA4R,EAAK,eAAsB,WAAW;AAAE,QAAAuR,EAAUF,GAAarR,CAAI;AAAA,OAAI,GACvEA,EAAK,sBAAsB,WAAW;AAAE,QAAAwR,EAAiBpjB,GAAGijB,CAAW;AAAA,OAAI;AAAA,IAC/E,CAAG;AAAA,EACH;AAEA,WAASE,EAAUnjB,GAAG4R,GAAM;AAC1B,IAAAA,EAAK,8BAA8B,WAAW;AAAE,MAAAyR,EAAuBrjB,CAAC;AAAA,IAAE,CAAE,GAC5E4R,EAAK,uBAA8B,WAAW;AAAE,MAAA0R,EAAgBtjB,CAAC;AAAA,IAAE,CAAE,GACrE4R,EAAK,eAA8B,WAAW;AAAE,MAAAnB,EAAQ,IAAIzQ,CAAC;AAAA,KAAI,GACjE4R,EAAK,wBAA8B,WAAW;AAAE,MAAAwF,EAAa,IAAIpX,CAAC;AAAA,KAAI,GACtE4R,EAAK,YAA8B,WAAW;AAAE,MAAAgB,EAAK7B,EAAK,mBAAmB/Q,CAAC,CAAC;AAAA,KAAI,GACnF4R,EAAK,8BAA8B,WAAW;AAAE,MAAA2R,EAAuBvjB,CAAC;AAAA,IAAE,CAAE,GAC5E4R,EAAK,wBAA8B,WAAW;AAAE,MAAAJ,EAAiBxR,CAAC;AAAA,IAAE,CAAE,GACtE4R,EAAK,4BAA8B,WAAW;AAAE,MAAAwF,EAAa,QAAQpX,CAAC;AAAA,KAAI,GAC1E4R,EAAK,sBAA8B,WAAW;AAAE,MAAAL,EAAevR,CAAC;AAAA,IAAE,CAAE,GACpE4R,EAAK,wBAA8B,WAAW;AAAE,MAAA4R,EAAiBxjB,CAAC;AAAA,IAAE,CAAE,GACtE4R,EAAK,8BAA8B,WAAW;AAAE,MAAA6R,EAAuBzjB,CAAC;AAAA,IAAE,CAAE,GAC5E4R,EAAK,qBAA8B,WAAW;AAAE,MAAAsB,EAAU,IAAIlT,CAAC;AAAA,KAAI,GACnE4R,EAAK,yBAA8B,WAAW;AAAE,MAAA6E,EAAkBzW,CAAC;AAAA,IAAE,CAAE,GACvE4R,EAAK,yBAA8B,WAAW;AAAE,MAAAwG,EAAkBpY,CAAC;AAAA,IAAE,CAAE,GACvE4R,EAAK,aAA8B,WAAW;AAAE,MAAAzN,EAAMnE,CAAC;AAAA,IAAE,CAAE,GAC3D4R,EAAK,uBAA8B,WAAW;AAAE,MAAA8R,EAAgB1jB,CAAC;AAAA,IAAE,CAAE,GACrE4R,EAAK,8BAA8B,WAAW;AAAE,MAAA6G,EAAiB,OAAOzY,CAAC;AAAA,KAAI,GAC7E4R,EAAK,gBAA8B,WAAW;AAAE,MAAA8Q,EAAS1iB,CAAC;AAAA,IAAE,CAAE,GAC9D4R,EAAK,yBAA8B,WAAW;AAAE,MAAA+R,EAAkB3jB,CAAC;AAAA,IAAE,CAAE,GACvE4R,EAAK,yBAA8B,WAAW;AAAE,MAAAgS,GAAkB5jB,CAAC;AAAA,IAAE,CAAE,GACvE4R,EAAK,sBAA8B,WAAW;AAAE,MAAAsB,EAAU,KAAKlT,CAAC;AAAA,KAAI,GACpE4R,EAAK,4BAA8B,WAAW;AAAE,MAAAiS,EAAqB7jB,CAAC;AAAA,IAAE,CAAE,GAC1E4R,EAAK,4BAA8B,WAAW;AAAE,MAAA6G,EAAiB,KAAKzY,CAAC;AAAA,KAAI,GAC3E4R,EAAK,sBAA8B,WAAW;AAAE,MAAAkS,EAAe9jB,CAAC;AAAA,IAAE,CAAE,GACpE4R,EAAK,4BAA8B,WAAW;AAAE,MAAAmS,EAAqB/jB,CAAC;AAAA,IAAE,CAAE,GAC1E4R,EAAK,qBAA8B,WAAW;AAAE,MAAAoS,GAA8BhkB,CAAC;AAAA,IAAE,CAAE,GACnF4R,EAAK,oBAA8B,WAAW;AAAE,MAAAnB,EAAQ,KAAKzQ,CAAC;AAAA,KAAI;AAAA,EACpE;AAQA,WAASojB,EAAiBa,GAAYhB,GAAa;AACjD,IAAApmB,EAAE,QAAQonB,EAAW,MAAO,GAAE,SAAS1mB,GAAG;AACxC,UAAI2mB,IAAaD,EAAW,KAAK1mB,CAAC,GAC9B4mB,IAAclB,EAAY,KAAK1lB,CAAC;AAEpC,MAAI2mB,MACFA,EAAW,IAAIC,EAAY,GAC3BD,EAAW,IAAIC,EAAY,GAEvBlB,EAAY,SAAS1lB,CAAC,EAAE,WAC1B2mB,EAAW,QAAQC,EAAY,OAC/BD,EAAW,SAASC,EAAY;AAAA,IAGxC,CAAG,GAEDtnB,EAAE,QAAQonB,EAAW,MAAO,GAAE,SAASvmB,GAAG;AACxC,UAAIwmB,IAAaD,EAAW,KAAKvmB,CAAC,GAC9BymB,IAAclB,EAAY,KAAKvlB,CAAC;AAEpC,MAAAwmB,EAAW,SAASC,EAAY,QAC5BtnB,EAAE,IAAIsnB,GAAa,GAAG,MACxBD,EAAW,IAAIC,EAAY,GAC3BD,EAAW,IAAIC,EAAY;AAAA,IAEjC,CAAG,GAEDF,EAAW,MAAK,EAAG,QAAQhB,EAAY,MAAO,EAAC,OAC/CgB,EAAW,MAAK,EAAG,SAAShB,EAAY,MAAO,EAAC;AAAA,EAClD;AAEA,MAAImB,IAAgB,CAAC,WAAW,WAAW,WAAW,WAAW,SAAS,GACtEC,IAAgB,EAAE,SAAS,IAAI,SAAS,IAAI,SAAS,IAAI,SAAS,KAAM,GACxEC,IAAa,CAAC,aAAa,UAAU,WAAW,OAAO,GACvDC,IAAe,CAAC,SAAS,QAAQ,GACjCC,IAAe,EAAE,OAAO,GAAG,QAAQ,EAAG,GACtCC,IAAe,CAAC,UAAU,UAAU,SAAS,UAAU,aAAa,GACpEC,IAAe;AAAA,IACjB,QAAQ;AAAA,IAAG,QAAQ;AAAA,IAAG,OAAO;AAAA,IAAG,QAAQ;AAAA,IACxC,aAAa;AAAA,IAAI,UAAU;AAAA,EAC5B,GACGC,IAAY,CAAC,UAAU;AAQ3B,WAASzB,EAAiBe,GAAY;AACpC,QAAIjkB,IAAI,IAAIjD,EAAM,EAAE,YAAY,IAAM,UAAU,IAAM,GAClDD,IAAQ8nB,EAAaX,EAAW,MAAK,CAAE;AAE3C,WAAAjkB,EAAE,SAASnD,EAAE;AAAA,MAAM,CAAE;AAAA,MACnBwnB;AAAA,MACAQ,EAAkB/nB,GAAOsnB,CAAa;AAAA,MACtCvnB,EAAE,KAAKC,GAAOwnB,CAAU;AAAA,IAAC,CAAC,GAE5BznB,EAAE,QAAQonB,EAAW,MAAO,GAAE,SAAS1mB,GAAG;AACxC,UAAI6C,IAAOwkB,EAAaX,EAAW,KAAK1mB,CAAC,CAAC;AAC1C,MAAAyC,EAAE,QAAQzC,GAAGV,EAAE,SAASgoB,EAAkBzkB,GAAMmkB,CAAY,GAAGC,CAAY,CAAC,GAC5ExkB,EAAE,UAAUzC,GAAG0mB,EAAW,OAAO1mB,CAAC,CAAC;AAAA,IACvC,CAAG,GAEDV,EAAE,QAAQonB,EAAW,MAAO,GAAE,SAASvmB,GAAG;AACxC,UAAIqB,IAAO6lB,EAAaX,EAAW,KAAKvmB,CAAC,CAAC;AAC1C,MAAAsC,EAAE,QAAQtC,GAAGb,EAAE;AAAA,QAAM,CAAE;AAAA,QACrB6nB;AAAA,QACAG,EAAkB9lB,GAAM0lB,CAAY;AAAA,QACpC5nB,EAAE,KAAKkC,GAAM4lB,CAAS;AAAA,MAAC,CAAC;AAAA,IAC9B,CAAG,GAEM3kB;AAAA,EACT;AAUA,WAASqjB,EAAuBrjB,GAAG;AACjC,QAAIlD,IAAQkD,EAAE,MAAO;AACrB,IAAAlD,EAAM,WAAW,GACjBD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,MAAAqB,EAAK,UAAU,GACXA,EAAK,SAAS,YAAW,MAAO,QAC9BjC,EAAM,YAAY,QAAQA,EAAM,YAAY,OAC9CiC,EAAK,SAASA,EAAK,cAEnBA,EAAK,UAAUA,EAAK;AAAA,IAG5B,CAAG;AAAA,EACH;AAQA,WAASwkB,EAAuBvjB,GAAG;AACjC,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,UAAIqB,EAAK,SAASA,EAAK,QAAQ;AAC7B,YAAIxB,IAAIyC,EAAE,KAAKtC,EAAE,CAAC,GACdY,IAAI0B,EAAE,KAAKtC,EAAE,CAAC,GACdN,IAAQ,EAAE,OAAOkB,EAAE,OAAOf,EAAE,QAAQ,IAAIA,EAAE,MAAM,GAAGG,EAAG;AAC1D,QAAAqT,EAAK,aAAa/Q,GAAG,cAAc5C,GAAO,KAAK;AAAA,MACrD;AAAA,IACA,CAAG;AAAA,EACH;AAEA,WAASomB,EAAiBxjB,GAAG;AAC3B,QAAI0R,IAAU;AACd,IAAA7U,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC;AACnB,MAAI6C,EAAK,cACPA,EAAK,UAAUJ,EAAE,KAAKI,EAAK,SAAS,EAAE,MACtCA,EAAK,UAAUJ,EAAE,KAAKI,EAAK,YAAY,EAAE,MACzCsR,IAAU7U,EAAE,IAAI6U,GAAStR,EAAK,OAAO;AAAA,IAE3C,CAAG,GACDJ,EAAE,QAAQ,UAAU0R;AAAA,EACtB;AAEA,WAAS+R,EAAuBzjB,GAAG;AACjC,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC;AACnB,MAAI6C,EAAK,UAAU,iBACjBJ,EAAE,KAAKI,EAAK,CAAC,EAAE,YAAYA,EAAK,MAChCJ,EAAE,WAAWzC,CAAC;AAAA,IAEpB,CAAG;AAAA,EACH;AAEA,WAASumB,EAAe9jB,GAAG;AACzB,QAAI8kB,IAAO,OAAO,mBACdC,IAAO,GACPC,IAAO,OAAO,mBACdC,IAAO,GACP/M,IAAalY,EAAE,MAAO,GACtBklB,IAAUhN,EAAW,WAAW,GAChCiN,IAAUjN,EAAW,WAAW;AAEpC,aAASkN,GAAYtT,GAAO;AAC1B,UAAI/Q,IAAI+Q,EAAM,GACVO,KAAIP,EAAM,GACVxT,KAAIwT,EAAM,OACVU,KAAIV,EAAM;AACd,MAAAgT,IAAO,KAAK,IAAIA,GAAM/jB,IAAIzC,KAAI,CAAC,GAC/BymB,IAAO,KAAK,IAAIA,GAAMhkB,IAAIzC,KAAI,CAAC,GAC/B0mB,IAAO,KAAK,IAAIA,GAAM3S,KAAIG,KAAI,CAAC,GAC/ByS,IAAO,KAAK,IAAIA,GAAM5S,KAAIG,KAAI,CAAC;AAAA,IACnC;AAEE,IAAA3V,EAAE,QAAQmD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAAE,MAAA6nB,GAAYplB,EAAE,KAAKzC,CAAC,CAAC;AAAA,IAAE,CAAE,GAC5DV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,MAAIb,EAAE,IAAIkC,GAAM,GAAG,KACjBqmB,GAAYrmB,CAAI;AAAA,IAEtB,CAAG,GAED+lB,KAAQI,GACRF,KAAQG,GAERtoB,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC;AACnB,MAAA6C,EAAK,KAAK0kB,GACV1kB,EAAK,KAAK4kB;AAAA,IACd,CAAG,GAEDnoB,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,MAAAb,EAAE,QAAQkC,EAAK,QAAQ,SAASsmB,IAAG;AACjC,QAAAA,GAAE,KAAKP,GACPO,GAAE,KAAKL;AAAA,MACb,CAAK,GACGnoB,EAAE,IAAIkC,GAAM,GAAG,MAAKA,EAAK,KAAK+lB,IAC9BjoB,EAAE,IAAIkC,GAAM,GAAG,MAAKA,EAAK,KAAKimB;AAAA,IACtC,CAAG,GAED9M,EAAW,QAAQ6M,IAAOD,IAAOI,GACjChN,EAAW,SAAS+M,IAAOD,IAAOG;AAAA,EACpC;AAEA,WAASpB,EAAqB/jB,GAAG;AAC/B,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC,GACf4nB,IAAQtlB,EAAE,KAAKtC,EAAE,CAAC,GAClB6nB,IAAQvlB,EAAE,KAAKtC,EAAE,CAAC,GAClB8nB,GAAIC;AACR,MAAK1mB,EAAK,UAKRymB,IAAKzmB,EAAK,OAAO,CAAC,GAClB0mB,IAAK1mB,EAAK,OAAOA,EAAK,OAAO,SAAS,CAAC,MALvCA,EAAK,SAAS,CAAE,GAChBymB,IAAKD,GACLE,IAAKH,IAKPvmB,EAAK,OAAO,QAAQgS,EAAK,cAAcuU,GAAOE,CAAE,CAAC,GACjDzmB,EAAK,OAAO,KAAKgS,EAAK,cAAcwU,GAAOE,CAAE,CAAC;AAAA,IAClD,CAAG;AAAA,EACH;AAEA,WAAS5B,EAAqB7jB,GAAG;AAC/B,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,UAAIb,EAAE,IAAIkC,GAAM,GAAG;AAIjB,iBAHIA,EAAK,aAAa,OAAOA,EAAK,aAAa,SAC7CA,EAAK,SAASA,EAAK,cAEbA,EAAK,UAAQ;AAAA,UACrB,KAAK;AAAK,YAAAA,EAAK,KAAKA,EAAK,QAAQ,IAAIA,EAAK;AAAa;AAAA,UACvD,KAAK;AAAK,YAAAA,EAAK,KAAKA,EAAK,QAAQ,IAAIA,EAAK;AAAa;AAAA,QAC7D;AAAA,IAEA,CAAG;AAAA,EACH;AAEA,WAASilB,GAA8BhkB,GAAG;AACxC,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,MAAIqB,EAAK,YACPA,EAAK,OAAO,QAAS;AAAA,IAE3B,CAAG;AAAA,EACH;AAEA,WAAS6kB,GAAkB5jB,GAAG;AAC5B,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAIyC,EAAE,SAASzC,CAAC,EAAE,QAAQ;AACxB,YAAI6C,IAAOJ,EAAE,KAAKzC,CAAC,GACfuW,IAAI9T,EAAE,KAAKI,EAAK,SAAS,GACzBslB,IAAI1lB,EAAE,KAAKI,EAAK,YAAY,GAC5BiB,IAAIrB,EAAE,KAAKnD,EAAE,KAAKuD,EAAK,UAAU,CAAC,GAClCkB,IAAItB,EAAE,KAAKnD,EAAE,KAAKuD,EAAK,WAAW,CAAC;AAEvC,QAAAA,EAAK,QAAQ,KAAK,IAAIkB,EAAE,IAAID,EAAE,CAAC,GAC/BjB,EAAK,SAAS,KAAK,IAAIslB,EAAE,IAAI5R,EAAE,CAAC,GAChC1T,EAAK,IAAIiB,EAAE,IAAIjB,EAAK,QAAQ,GAC5BA,EAAK,IAAI0T,EAAE,IAAI1T,EAAK,SAAS;AAAA,MACnC;AAAA,IACA,CAAG,GAEDvD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,MAAIyC,EAAE,KAAKzC,CAAC,EAAE,UAAU,YACtByC,EAAE,WAAWzC,CAAC;AAAA,IAEpB,CAAG;AAAA,EACH;AAEA,WAAS+lB,EAAgBtjB,GAAG;AAC1B,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIA,EAAE,MAAMA,EAAE,GAAG;AACf,YAAI0C,IAAOJ,EAAE,KAAKtC,EAAE,CAAC;AACrB,QAAK0C,EAAK,cACRA,EAAK,YAAY,CAAE,IAErBA,EAAK,UAAU,KAAK,EAAE,GAAG1C,GAAG,OAAOsC,EAAE,KAAKtC,CAAC,GAAG,GAC9CsC,EAAE,WAAWtC,CAAC;AAAA,MACpB;AAAA,IACA,CAAG;AAAA,EACH;AAEA,WAASgmB,EAAgB1jB,GAAG;AAC1B,QAAI8S,IAAS/B,EAAK,iBAAiB/Q,CAAC;AACpC,IAAAnD,EAAE,QAAQiW,GAAQ,SAAS+K,GAAO;AAChC,UAAI8H,IAAa;AACjB,MAAA9oB,EAAE,QAAQghB,GAAO,SAAStgB,GAAG6D,GAAG;AAC9B,YAAIhB,IAAOJ,EAAE,KAAKzC,CAAC;AACnB,QAAA6C,EAAK,QAAQgB,IAAIukB,GACjB9oB,EAAE,QAAQuD,EAAK,WAAW,SAASwlB,GAAU;AAC3C,UAAA7U,EAAK,aAAa/Q,GAAG,YAAY;AAAA,YAC/B,OAAO4lB,EAAS,MAAM;AAAA,YACtB,QAAQA,EAAS,MAAM;AAAA,YACvB,MAAMxlB,EAAK;AAAA,YACX,OAAOgB,IAAK,EAAEukB;AAAA,YACd,GAAGC,EAAS;AAAA,YACZ,OAAOA,EAAS;AAAA,UACjB,GAAE,KAAK;AAAA,QAChB,CAAO,GACD,OAAOxlB,EAAK;AAAA,MAClB,CAAK;AAAA,IACL,CAAG;AAAA,EACH;AAEA,WAASujB,EAAkB3jB,GAAG;AAC5B,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC;AACnB,UAAI6C,EAAK,UAAU,YAAY;AAC7B,YAAIylB,IAAW7lB,EAAE,KAAKI,EAAK,EAAE,CAAC,GAC1BW,IAAI8kB,EAAS,IAAIA,EAAS,QAAQ,GAClCxT,IAAIwT,EAAS,GACbvT,IAAKlS,EAAK,IAAIW,GACdwR,IAAKsT,EAAS,SAAS;AAC3B,QAAA7lB,EAAE,QAAQI,EAAK,GAAGA,EAAK,KAAK,GAC5BJ,EAAE,WAAWzC,CAAC,GACd6C,EAAK,MAAM,SAAS;AAAA,UAClB,EAAE,GAAGW,IAAI,IAAIuR,IAAK,GAAG,GAAGD,IAAIE,EAAI;AAAA,UAChC,EAAE,GAAGxR,IAAI,IAAIuR,IAAK,GAAG,GAAGD,IAAIE,EAAI;AAAA,UAChC,EAAE,GAAGxR,IAAQuR,GAAQ,GAAGD,EAAG;AAAA,UAC3B,EAAE,GAAGtR,IAAI,IAAIuR,IAAK,GAAG,GAAGD,IAAIE,EAAI;AAAA,UAChC,EAAE,GAAGxR,IAAI,IAAIuR,IAAK,GAAG,GAAGD,IAAIE,EAAE;AAAA,QAC/B,GACDnS,EAAK,MAAM,IAAIA,EAAK,GACpBA,EAAK,MAAM,IAAIA,EAAK;AAAA,MAC1B;AAAA,IACA,CAAG;AAAA,EACH;AAEA,WAASykB,EAAkBiB,GAAKhU,GAAO;AACrC,WAAOjV,EAAE,UAAUA,EAAE,KAAKipB,GAAKhU,CAAK,GAAG,MAAM;AAAA,EAC/C;AAEA,WAAS8S,EAAa9S,GAAO;AAC3B,QAAIiU,IAAW,CAAE;AACjB,WAAAlpB,EAAE,QAAQiV,GAAO,SAASvU,GAAG+B,GAAG;AAC9B,MAAAymB,EAASzmB,EAAE,YAAa,CAAA,IAAI/B;AAAA,IAChC,CAAG,GACMwoB;AAAA,EACT;;;;;;;ACvYA,MAAIlpB,IAAItY,EAAmB,GACvBwsB,IAAOpsB,EAAiB,GACxBoY,IAAQ1X,EAAqB,EAAC;AAElC,EAAA2gC,KAAiB;AAAA,IACf,eAAeC;AAAA,EAChB;AAGD,WAASA,EAAcjmB,GAAG;AACxB,QAAIkmB,IAAcnV,EAAK,iBAAiB/Q,CAAC,GAErCwS,IAAI,IAAIzV,EAAM,EAAE,UAAU,IAAM,YAAY,GAAM,CAAA,EAAE,SAAS,EAAE;AAEnE,WAAAF,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,MAAAiV,EAAE,QAAQjV,GAAG,EAAE,OAAOA,EAAC,CAAE,GACzBiV,EAAE,UAAUjV,GAAG,UAAUyC,EAAE,KAAKzC,CAAC,EAAE,IAAI;AAAA,IAC3C,CAAG,GAEDV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,MAAA8U,EAAE,QAAQ9U,EAAE,GAAGA,EAAE,GAAG,CAAA,GAAIA,EAAE,IAAI;AAAA,IAClC,CAAG,GAEDb,EAAE,QAAQqpB,GAAa,SAASrI,GAAOzc,GAAG;AACxC,UAAI+kB,IAAS,UAAU/kB;AACvB,MAAAoR,EAAE,QAAQ2T,GAAQ,EAAE,MAAM,OAAM,CAAE,GAClCtpB,EAAE,OAAOghB,GAAO,SAAS5e,GAAG1B,GAAG;AAC7B,eAAAiV,EAAE,QAAQvT,GAAG1B,GAAG,EAAE,OAAO,SAAS,GAC3BA;AAAA,MACb,CAAK;AAAA,IACL,CAAG,GAEMiV;AAAA,EACT;;;;;wBCjCA7S,KAAiB;;;;wBCsBjBymB,KAAiB;AAAA,IACf,UAAU7hC,EAAyB;AAAA,IAEnC,QAAQI,GAAuB;AAAA,IAC/B,OAAOU,GAAsB;AAAA,IAC7B,MAAM;AAAA,MACJ,MAAMwC,EAAqB,EAAC;AAAA,MAC5B,QAAQA,EAAA,EAAsB;AAAA,IAC/B;AAAA,IACD,SAASC,GAAA;AAAA,EACV;;;;;;;;AChCD,MAAIyD,IAAchH,GAAyB;AA8B3C,WAAS8hC,EAAQrhC,GAAOmB,GAAO;AAC7B,WAAOoF,EAAYvG,GAAOmB,CAAK;AAAA,EACjC;AAEA,SAAAmgC,KAAiBD;;;mCC3BXE,KAAoB;AAoDV,SAAAC,GAAiBC,GAAmBC,GAA8B;AAC9E,QAAM,EAAC,UAAAC,EAAA,IAAYC,GAAWH,CAAS,GAEjCrjB,IAAQ,CAAC;AAEJ,aAAArE,KAAQ4nB,EAAS;AACpB,QAAA5nB,EAAK,WAAW2nB,GAAS;AACzB,MAAAtjB,EAAM,KAAKrE,CAAI;AACf,YAAM8nB,IAAgBL,GAAiBC,GAAW1nB,EAAK,MAAM;AACzD,MAAA8nB,EAAc,SAAS,KACjBzjB,EAAA,KAAK,GAAGyjB,CAAa;AAAA,IAC/B;AAID,SAAAzjB;AACX;AAEgB,SAAA0jB,GAAeL,GAAmBC,GAA8B;AAC5E,QAAM,EAAC,UAAAC,EAAA,IAAYC,GAAWH,CAAS,GAEjCrjB,IAAQ,CAAC;AAEJ,aAAArE,KAAQ4nB,EAAS;AACpB,QAAA5nB,EAAK,WAAW2nB,GAAS;AACzB,MAAAtjB,EAAM,KAAKrE,CAAI;AACf,YAAM8nB,IAAgBC,GAAeL,GAAW1nB,EAAK,MAAM;AACvD,MAAA8nB,EAAc,SAAS,KACjBzjB,EAAA,KAAK,GAAGyjB,CAAa;AAAA,IAC/B;AAID,SAAAzjB;AACX;AAEgB,SAAA2jB,GAAiBN,GAAmBC,GAA4C;AAC5F,QAAM,EAAC,UAAAC,GAAU,UAAAK,MAAYJ,GAAWH,CAAS,GAE3CQ,IAAYD,EAASN,CAAO,GAC5BtjB,IAAmC6jB,IAAY,CAACA,CAAS,IAAI,CAAC;AAEzD,aAAAloB,KAAQ4nB,EAAS;AACpB,QAAA5nB,EAAK,WAAW2nB,GAAS;AACnB,MAAAtjB,EAAA,KAAKrE,EAAK,UAAU;AAC1B,YAAM8nB,IAAgBE,GAAiBN,GAAW1nB,EAAK,MAAM;AACzD,MAAA8nB,EAAc,SAAS,KACjBzjB,EAAA,KAAK,GAAGyjB,CAAa;AAAA,IAC/B;AAID,SAAAzjB;AACX;AAEgB,SAAA8jB,GAAeT,GAAmBC,GAAiB;AAC/D,QAAM,EAAC,UAAAC,GAAU,UAAAK,MAAYJ,GAAWH,CAAS,GAE3CrjB,IAAQ,CAAC4jB,EAASN,CAAO,CAAC;AAErB,aAAA3nB,KAAQ4nB,EAAS;AACpB,QAAA5nB,EAAK,WAAW2nB,GAAS;AACnB,MAAAtjB,EAAA,KAAKrE,EAAK,UAAU;AAC1B,YAAM8nB,IAAgBK,GAAeT,GAAW1nB,EAAK,MAAM;AACvD,MAAA8nB,EAAc,SAAS,KACjBzjB,EAAA,KAAK,GAAGyjB,CAAa;AAAA,IAC/B;AAID,SAAAzjB;AACX;AAEgB,SAAA+jB,GAAeV,GAAmBC,GAAiB;AACxD,SAAA;AAAA,IACH,GAAGF,GAAiBC,GAAWC,CAAO;AAAA,IACtC,GAAGK,GAAiBN,GAAWC,CAAO;AAAA,IACtC,GAAGI,GAAeL,GAAWC,CAAO;AAAA,IACpC,GAAGQ,GAAeT,GAAWC,CAAO;AAAA,EACxC;AACJ;AAEO,SAASU,GACZC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACF;AACQ,QAAAC,IAAa,IAAIxB,GAAM,SAAS,MAAM,EAAC,UAAU,IAAK;AACjD,EAAAwB,EAAA,oBAAoB,OAAO,CAAA,EAAG,GACzCA,EAAW,SAAS,EAAC,SAASL,IAAe,OAAO,MAAK;AAE9C,aAAAnnB,KAAQinB,EAAU;AACzB,IAAKC,EAAY,SAASlnB,EAAK,GAAG,KACnBwnB,EAAA,QAAQxnB,EAAK,KAAK;AAAA,MACzB,OAAOynB,GAAaznB,CAAI;AAAA,MACxB,QAAQ0nB,GAAc1nB,CAAI;AAAA,IAAA,CAC7B;AAIT,aAAW2nB,KAAWV,EAAU,YAAY,CAAA,GAAI;AAC5C,UAAMX,IAAUqB,EAAQ,QAAQ,IAAI,QAAQ3kC,IAAgB,EAAE;AAE1D,QAAAokC,EAAwB,SAASO,EAAQ,QAAQ,GAAG,KACpDL,EAAU,IAAIhB,CAAO,GACvB;AACE,YAAMtmB,IAAO,EAAC,KAAKsmB,GAAS,MAAM,mBAAkB;AACpD,MAAAkB,EAAW,QAAQlB,GAAS;AAAA,QACxB,OAAOmB,GAAaznB,CAAI;AAAA,QACxB,QAAQ0nB,GAAc1nB,CAAI;AAAA,MAAA,CAC7B,GACDunB,EAAc,KAAKvnB,CAAI;AACvB;AAAA,IAAA;AAEJ,QAAI,CAACqnB,EAAaM,EAAQ,QAAQ,GAAG,GAAG;AACpC,MAAAH,EAAW,QAAQG,EAAQ,QAAQ,KAAK,EAAC,iBAAiB,OAAM;AAEhE,iBAAW3nB,KAAQ2nB,EAAQ,SAAS,CAAA;AAChC,QAAKT,EAAY,SAASlnB,CAAI,KAC1BwnB,EAAW,UAAUxnB,GAAM2nB,EAAQ,QAAQ,GAAG;AAAA,IAEtD;AAEJ,QAAIA,EAAQ,SAAS;AACjB,YAAMC,IAAYP,EAAaM,EAAQ,QAAQ,GAAG,IAC5CN,EAAaM,EAAQ,QAAQ,GAAG,IAChCA,EAAQ,QAAQ;AACtB,MAAKT,EAAY,SAASU,CAAS,KACpBJ,EAAA;AAAA,QACPI;AAAA,QACAD,EAAQ,QAAQA,EAAQ,QAAQ,SAAS,CAAC;AAAA,MAC9C;AAAA,IACJ;AAAA,EACJ;AAGJ,aAAWhpB,KAAQsoB,EAAU,SAAS,CAAA,GAAI;AACtC,UAAMY,IAAUC;AAAA,MACZnpB,EAAK;AAAA,MACLA,EAAK;AAAA,MACL0oB;AAAA,MACAH;AAAA,IACJ;AACA,IAAIW,KACAL,EAAW,QAAQK,EAAQ,QAAQA,EAAQ,MAAM;AAAA,EACrD;AAGJ,SAAA7B,GAAM,OAAOwB,CAAU,GAChBA;AACX;AAEgB,SAAAO,GAAgBC,GAK7BxqB,GAKA;AACC,QAAM8kB,IAAW,EAAC,GAAG0F,EAAE,IAAIA,EAAE,QAAQ,GAAG,GAAGA,EAAE,IAAIA,EAAE,SAAS,EAAC;AAG7D,MAAIxqB,GAAQ;AACF,UAAAyqB,IAAiBF,GAAgBvqB,CAAM;AACpC,IAAA8kB,EAAA,IAAIA,EAAS,IAAI2F,EAAe,GAChC3F,EAAA,IAAIA,EAAS,IAAI2F,EAAe;AAAA,EAAA;AAEtC,SAAA3F;AACX;AAEO,SAASmF,GAAaznB,GAAmB;AAC5C,SAAOkoB,GAAWloB,CAAI,KAAKmoB,GAAcnoB,CAAI,IACvC7c,GAAW,aACVilC,GAAmBpoB,CAAI,IACpB7c,GAAW,0BACXA,GAAW;AACzB;AAEO,SAASukC,GAAc1nB,GAAmB;AAC7C,SAAOkoB,GAAWloB,CAAI,KAAKmoB,GAAcnoB,CAAI,IACvC7c,GAAW,cACVilC,GAAmBpoB,CAAI,IACpB7c,GAAW,2BACXA,GAAW;AACzB;AAEO,SAAS+kC,GAAWloB,GAAmB;AACnC,SAAA,CAAC,aAAa,oBAAoB,EAAE,KAAK,CAAC0T,MAAM1T,EAAK,KAAK,SAAS0T,CAAC,CAAC;AAChF;AAEO,SAASyU,GAAcnoB,GAAmB;AACtC,SAAAA,EAAK,KAAK,SAAS,cAAc;AAC5C;AAEO,SAASooB,GAAmBpoB,GAAmB;AAClD,SAAOA,EAAK,SAAS;AACzB;AAEO,SAAS8nB,GAAmBx8B,GAAgBuvB,GAAgBwM,GAA4BH,GAAuB;AAClH,QAAMmB,IAAYhB,EAAa/7B,CAAM,IAAI+7B,EAAa/7B,CAAM,IAAIA,GAC1Dg9B,IAAYjB,EAAaxM,CAAM,IAAIwM,EAAaxM,CAAM,IAAIA;AAG5D,SAAAwN,MAAcC,KACdpB,EAAY,SAASmB,CAAS,KAC9BnB,EAAY,SAASoB,CAAS,IAEvB,OAEJ,EAAC,QAAQA,GAAW,QAAQD,EAAS;AAChD;AAEO,SAASE,GAAWC,GAAmB;AACpC,QAAA;AAAA,IACF,UAAAjC;AAAA,IACA,UAAAkC;AAAA,IACA,aAAAC;AAAA,IACA,aAAAC;AAAA,IACA,aAAAC;AAAA,IACA,wBAAAC;AAAA,EAAA,IACArC,GAAWgC,CAAS;AACxB,EAAAG,EAAYpC,EAAS,KAAK,GAC1BqC,EAAYH,EAAS,KAAK,GAC1BI,EAAuBH,EAAY,KAAK;AAC5C;AAEO,SAASI,GAAcx9B,GAAgB;AACnC,SAAAA,IAASy9B,GAAiBz9B,CAAM,IAAI;AAC/C;AAEgB,SAAA09B,GAAUhpB,GAAmBsnB,GAAwB;AAKjE,SAJItnB,EAAK,QAAQmmB,MAIbgC,GAAcnoB,CAAI,KAAKooB,GAAmBpoB,CAAI,IACvC,YAGPA,EAAK,KAAK,SAAS,kBAAkB,IAC9B,YAGPA,EAAK,cAAc,UACZ,WAGPA,EAAK,cAAc,YACZ,YAGPsnB,EAAU,IAAItnB,EAAK,GAAG,IACf,SAGJ;AACX;AAEO,SAASipB,GAAQtqB,GACpBuqB,GACAC,GACAC,GAA+B;;AAkB3B,MAfAA,EAAoB;AAAA,IAChB,CAAC1b,MACG/O,EAAK,OAAO,WAAW+O,CAAM,KAAK/O,EAAK,OAAO,WAAW+O,CAAM;AAAA,EAAA,KAOvEyb,EAAqB,SAASxqB,EAAK,MAAM,KAMzCA,EAAK,OAAO,WAAWwnB,EAAiB,KACxCxnB,EAAK,OAAO,WAAWwnB,EAAiB;AAEjC;AAGX,QAAMkD,IAAiB1qB,EAAK,OAAO,MAAM,GAAG;AAC5C,EAAA0qB,EAAe,IAAI;AACb,QAAAC,IAAuBD,EAAe,KAAK,GAAG,GAC9CE,IAAoBp3B,GAAM,aAAam3B,CAAoB,GAG3DE,IAAaN,EAAUvqB,EAAK,MAAM;AACxC,MACI6qB,EAAW,KAAK,SAAS,iBAAiB,OAC1CC,KAAAn4B,KAAAH,IAAA+3B,EAAUI,CAAoB,MAA9B,gBAAAn4B,EAAiC,SAAjC,gBAAAG,EAAuC,SAAvC,QAAAm4B,EAA6C,SAAS;AAE/C;AAMX,MAAID,EAAW,KAAK,SAAS,kBAAkB;AACpC,WAAA,CAACD,GAAmB,QAAQ;AAGvC,QAAMG,IACFR,EAAUvqB,EAAK,MAAM,EAAE,KAAK,SAAS,iBAAiB;AAE1D,MAAI,CAAC+qB,KAAwBF,EAAW,KAAK,SAAS,iBAAiB;AACnE,WAAO,CAACr3B,GAAM,aAAawM,EAAK,MAAM,GAAG,OAAO;AAIpD,MAAI+qB,GAAsB;AACtB,UAAMC,IAAiBhrB,EAAK,OAAO,MAAM,GAAG;AAC5C,WAAO,CAACgrB,EAAeA,EAAe,SAAS,CAAC,GAAG,OAAO;AAAA,EAAA;AAG9D,SAAO,CAACx3B,GAAM,aAAawM,EAAK,MAAM,GAAG,QAAQ;AACrD;AAEgB,SAAAirB,GAAajrB,GAAiBuqB,GAAwCW,GAA2C;AACvH,QAAAC,IAAqB,CAACC,MAAsC;;AACxD,UAAAC,IAAWD,EAAO,MAAM,GAAG;AACjC,aAAS/oB,IAAI,GAAGA,KAAKgpB,EAAS,QAAQhpB,KAAK;AACvC,YAAMipB,IAAYD,EAAS,MAAM,GAAGhpB,CAAC,EAAE,KAAK,GAAG,GACzCkpB,KAAa/4B,IAAA04B,EAAiBI,CAAS,MAA1B,gBAAA94B,EAA6B;AAChD,UAAI+4B,EAAmB,QAAAA;AAAA,IAAA;AAEpB,aAAA54B,IAAA43B,EAAUa,CAAM,MAAhB,gBAAAz4B,EAAmB,eAAc;AAAA,EAC5C,GAEM64B,IAAmBL,EAAmBnrB,EAAK,MAAM,GACjDyrB,IAAmBN,EAAmBnrB,EAAK,MAAM;AAEvD,SAAO,CAACwrB,GAAkBC,CAAgB,EAAE;AAAA,IAAS;AAAA;AAAA,EAAgB,IAAI,WACnE,CAACD,GAAkBC,CAAgB,EAAE;AAAA,IAAS;AAAA;AAAA,MAAsB,YAChE;AACd;AAEO,SAASC,GACZC,GACAC,GACAC,GACAvD,GACAwD,GACAvD,GACAC,GACAE,GACAC,GACAC,GACAmD,GACAC,GACAC,GACoB;;AACpB,QAAMC,IAAqB,CAAC,GAEtBzD,IAA0B,CAACpkC,KAAiBmjC,EAAiB;AAEnE,MAAI,CAACc,KAAcwD,KAAc,CAAC3B,GAAc2B,CAAU,GAAI;AAC1D,IAAAI,EAAS,KAAK;AAAA,MACV,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,UAAU,EAAC,GAAG,GAAG,GAAG,EAAC;AAAA,MACrB,OAAO;AAAA,QACH,OAAO;AAAA,QACP,QAAQ;AAAA,MACZ;AAAA,MACA,gBAAgB1D,IAAe2D,EAAS,QAAQA,EAAS;AAAA,MACzD,gBAAgB3D,IAAe2D,EAAS,OAAOA,EAAS;AAAA,MACxD,YAAY;AAAA,MACZ,WAAW;AAAA,IAAA,CACd,GACDD,EAAS,KAAK;AAAA,MACV,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,UAAU1D,IAAe,EAAC,GAAG,IAAI,GAAG,EAAC,IAAI,EAAC,GAAG,GAAG,GAAG,GAAE;AAAA,MACrD,OAAO;AAAA,QACH,OAAO;AAAA,QACP,QAAQ;AAAA,MACZ;AAAA,MACA,gBAAgBA,IAAe2D,EAAS,QAAQA,EAAS;AAAA,MACzD,gBAAgB3D,IAAe2D,EAAS,OAAOA,EAAS;AAAA,MACxD,YAAY;AAAA,MACZ,WAAW;AAAA,IAAA,CACd,GACDD,EAAS,KAAK;AAAA,MACV,IAAI;AAAA,MACJ,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,QACF,MAAM;AAAA,UACF,UAAU;AAAA,YACN,cAAc;AAAA,UAAA;AAAA,QAEtB;AAAA,QACA,YAAY;AAAA,QACZ,UAAU;AAAA,QACV,OAAO;AAAA,MAAA;AAAA,IACX,CACH;AAED;AAAA,EAAA;AAGJ,QAAMrD,IAAaR;AAAA,IACfC;AAAA,IACAC;AAAA,IACAC;AAAA,IACAC;AAAA,IACAC;AAAA,IACAC;AAAA,IACAC;AAAA,EACJ,GAEMsC,IAA4C,CAAC,GAC7CkB,IAAW9D,EAAU,YAAY,CAAC,GAClC+D,IAAcD,EAAS,IAAI,CAACE,MAAMA,EAAE,OAAO,GAC3C7B,IAAsB4B,EACvB,OAAO,CAACC,MAAMA,EAAE,KAAK,SAAS,qBAAqB,CAAC,EACpD,IAAI,CAACA,MAAMA,EAAE,SAAS,GAAG,GAExB/B,IAAY,OAAO;AAAA,IACrBjC,EAAU,MAAM,OAAOM,CAAa,EAAE,IAAI,CAACvnB,MAAS,CAACA,EAAK,KAAKA,CAAI,CAAC;AAAA,EACxE;AACA,aAAW2nB,KAAWoD;AAClB,QACI,CAAC1D,EAAaM,EAAQ,QAAQ,GAAG,KACjC,CAACL,EAAU,IAAIK,EAAQ,QAAQ,GAAG,GACpC;AACE,QACIr2B,KAAAH,IAAAw2B,EAAQ,QAAQ,aAAhB,gBAAAx2B,EAA0B,SAA1B,gBAAAG,EAAgC,UAChC,oCAEA83B,EAAoB,KAAKzB,EAAQ,QAAQ,SAAS,GAAG;AAG9C,iBAAArB,KAAWqB,EAAQ;AACT,QAAAkC,EAAAvD,CAAO,IAAIqB,EAAQ;AAGlC,YAAAuD,IAAavD,EAAQ,QAAQ,KAC7BwD,IAAY3D,EAAW,KAAK0D,CAAU,GACtCE,IAAazD,EAAQ,UACrBA,EAAQ,QAAQA,EAAQ,QAAQ,SAAS,CAAC,IAC1C,QAEA0D,IAAeC,GAAoB3D,EAAQ,OAAO;AAExD,MAAAkD,EAAS,KAAK;AAAA,QACV,IAAIK;AAAA,QACJ,MAAM;AAAA,QACN,YAAAE;AAAA,QACA,UAAUrD;AAAA,UACNoD;AAAA,UACAC,IAAa5D,EAAW,KAAK4D,CAAU,IAAI;AAAA,QAC/C;AAAA,QACA,OAAO;AAAA,UACH,OACIF,MAAe/E,MAAqBgB,IAC9BhkC,GAAW,wBAAwB,OACnCgoC,EAAU,QAAQ;AAAA,UAC5B,QACID,MAAe/E,MAAqB,CAACgB,IAC/BhkC,GAAW,yBAAyB,OACpCgoC,EAAU,SAAS;AAAA,QACjC;AAAA,QACA,MAAM;AAAA,UACF,aAAa;AAAA,UACb,OAAOE;AAAA,UACP,UAAU1D,EAAQ,QAAQ;AAAA,UAC1B,QAAQA,EAAQ,QAAQ,WAClBuB,EAAUvB,EAAQ,QAAQ,SAAS,GAAG,EAAE,SACxC;AAAA,QACV;AAAA,QACA,OAAO,eAAe0D,CAAY;AAAA,MAAA,CAC9B;AAAA,IAAA;AAIhB,aAAWrrB,KAAQinB,EAAU,MAAM,OAAOM,CAAa;AACnD,QAAI,CAACL,EAAY,SAASlnB,EAAK,GAAG,GAAG;AACjC,YAAMmrB,IAAY3D,EAAW,KAAKxnB,EAAK,GAAG;AAC1C,UAAIurB,IAAW;AACX,MAAAC,GAAmBxrB,CAAI,IACZurB,IAAA,QACJvrB,EAAK,KAAK,SAAS,cAAc,IAC7BurB,IAAA,YACJvrB,EAAK,SAAS,uBACVurB,IAAA;AAGT,YAAAE,IAAQzC,GAAUhpB,GAAMsnB,CAAS,GAGjCoE,IACFhB,OACAiB,KAAAlC,IAAAzpB,EAAK,SAAL,gBAAAypB,EAAW,SAAX,gBAAAkC,EAAiB,SAAS,SAC1BvC,EAAoB;AAAA,QAAK,CAAC1b,MACtB1N,EAAK,IAAI,WAAW0N,IAAS,GAAG;AAAA,MACpC;AACJ,MAAAmd,EAAS,KAAK;AAAA,QACV,IAAI7qB,EAAK;AAAA,QACT,MAAMurB;AAAA,QACN,UAAUxD;AAAA,UACNoD;AAAA,UACAtB,EAAiB7pB,EAAK,GAAG,IACnBwnB,EAAW,KAAKqC,EAAiB7pB,EAAK,GAAG,EAAE,GAAG,IAC9C;AAAA,QACV;AAAA,QACA,OAAO;AAAA,UACH,OAAOynB,GAAaznB,CAAI,IAAI;AAAA,UAC5B,QAAQ0nB,GAAc1nB,CAAI,IAAI;AAAA,QAClC;AAAA,QACA,gBAAgBmnB,IAAe2D,EAAS,QAAQA,EAAS;AAAA,QACzD,gBAAgB3D,IAAe2D,EAAS,OAAOA,EAAS;AAAA,QACxD,YAAYjB,EAAiB7pB,EAAK,GAAG,IAC/B6pB,EAAiB7pB,EAAK,GAAG,EAAE,MAC3B;AAAA,QACN,WAAWurB,MAAa,SAAS,CAACG,IAAiB;AAAA,QACnD,MAAM;AAAA,UACF,MAAA1rB;AAAA,UACA,QAAQ6pB,EAAiB7pB,EAAK,GAAG,IAAI6pB,EAAiB7pB,EAAK,GAAG,IAAI;AAAA,UAClE,aACI4rB,KAAAC,KAAAC,IAAAjC,EAAiB7pB,EAAK,GAAG,MAAzB,gBAAA8rB,EAA4B,aAA5B,gBAAAD,EAAsC,SAAtC,gBAAAD,EAA4C,cAC5CpB;AAAA,UACJ,UACIuB,KAAAC,KAAAC,IAAApC,EAAiB7pB,EAAK,GAAG,MAAzB,gBAAAisB,EAA4B,aAA5B,gBAAAD,EAAsC,SAAtC,gBAAAD,EAA4C,WAAUxB;AAAA,UAC1D,cACI2B,KAAArC,EAAiB7pB,EAAK,GAAG,MAAzB,gBAAAksB,GAA4B,SAAQlpC,KAAiBgd,EAAK,OAC1D,CAACA,EAAK,KAAK,SAAS,kBAAkB;AAAA,UAC1C,OAAAyrB;AAAA,UACA,YAAYU;AAAA,YACRnsB;AAAA,YACA6pB;AAAA,YACAxC;AAAA,YACAuD;AAAA,UACJ;AAAA,UACA,YAAYc;AAAA,UACZ,eAAetD,GAAmBpoB,CAAI,IAChC,mBACA;AAAA,UACN,aAAaA,EAAK;AAAA,UAClB,QAAQA,EAAK;AAAA,QACjB;AAAA,QACA,OACIA,EAAK,SAAS,qBACR,eAAeyrB,CAAK,oBACpB;AAAA,MAAA,CACb;AAAA,IAAA;AAIT,QAAMW,IAA0BpB,EAC3B,OAAO,CAACC,MAAMA,EAAE,QAAQ,EACxB,IAAI,CAACA,MAAMA,EAAE,SAAS,GAAG,GACxBlsB,IAAQkoB,EAAU,SAAS,CAAC;AAElC,aAAWtoB,KAAQI,GAAO;AACtB,UAAM8oB,IAAUC;AAAA,MACZnpB,EAAK;AAAA,MACLA,EAAK;AAAA,MACL0oB;AAAA,MACAH;AAAA,IACJ;AACA,QAAIW,GAAS;AACT,YAAMwE,IAAYzC,GAAajrB,GAAMuqB,GAAWW,CAAgB;AAChE,MAAAgB,EAAS,KAAK;AAAA,QACV,IAAIhD,EAAQ,SAAS,MAAMA,EAAQ;AAAA,QACnC,QAAQA,EAAQ;AAAA,QAChB,QAAQA,EAAQ;AAAA,QAChB,MAAM;AAAA,QACN,WAAW2D,GAAmBtC,EAAUrB,EAAQ,MAAM,CAAC,IACjD,KACA;AAAA,UACE,IAAI,aAAaqB,EAAUrB,EAAQ,MAAM,EAAE,cAAayE,KAAApD,EAAUrB,EAAQ,MAAM,EAAE,eAA1B,gBAAAyE,GAAsC,sBAAsB;AAAA,UACpH,MAAMC,GAAW;AAAA,UACjB,OAAOF,IAAY,mBAAmBA,CAAS,MAAM;AAAA,QACzD;AAAA,QACJ,MAAM;AAAA,UACF,SACI,CAAC3B,KACDC,KACA1B;AAAA,YACItqB;AAAA,YACAuqB;AAAA,YACAkD;AAAA,YACAhD;AAAA,UACJ;AAAA,UACJ,eACIF,EAAUvqB,EAAK,MAAM,EAAE,KAAK,SAAS,cAAc,KACnDuqB,EAAUvqB,EAAK,MAAM,EAAE,KAAK,SAAS,cAAc,KACnDA,EAAK,OAAO,WAAWwnB,EAAiB;AAAA,UAC5C,OAAOkG;AAAA,UACP,QAAS1tB,EAAa;AAAA,QAC1B;AAAA,QACA,OAAO;AAAA,UACH,QAAQ;AAAA,QAAA;AAAA,MACZ,CACH;AAAA,IAAA;AAAA,EACL;AAGG,SAAAksB;AACX;AAEO,SAASW,GAAmBxrB,GAAmB;AAClD,SAAO,CAAC,oBAAoB,uBAAuB,8BAA8B,iBAAiB,EAAE;AAAA,IAAK,CAACwsB,MACtGxsB,EAAK,KAAK,SAASwsB,CAAC;AAAA,EACxB;AACJ;AAEO,SAASlB,GAAoB3D,GAAkB;AAC9C,SAAAA,EAAQ,QAAQ3kC,KAAiBmjC,KAC1B,YAGPwB,EAAQ,KAAK,SAAS,qBAAqB,IACpC,YAGPA,EAAQ,eAAe,UAChB,WAGJ;AACX;AAEO,SAASwE,GACZnsB,GACA6pB,GACAxC,GACAuD,GACF;;AAKM,SAJA,OAAO,OAAOvD,CAAY,EAAE,SAASrnB,EAAK,GAAG,KAI7CooB,GAAmBpoB,CAAI,IAChB,KAIPA,EAAK,KAAK,SAAS,kBAAkB,OACrC1O,KAAAH,IAAA04B,EAAiB7pB,EAAK,GAAG,MAAzB,gBAAA7O,EAA4B,QAA5B,gBAAAG,EAAiC,QAAQtO,IAAgB,SACzDgd,EAAK,OACL4qB;AAER;AAKO,SAAS6B,GAAa/vB,GAAkB;AAE3C,QAAMgwB,IADWhwB,EAAM,MAAM,IAAI,CAACsD,MAASA,EAAK,GAAG,EACzB,OAAO,CAAC2sB,MACvB,CAACjwB,EAAM,MAAM,KAAK,CAACiC,MAASA,EAAK,WAAWguB,CAAG,CACzD;AACM,SAAAjwB,EAAM,MAAM,OAAO,CAACsD,MAAS0sB,EAAS,SAAS1sB,EAAK,GAAG,CAAC;AACnE;AAQgB,SAAA4sB,GAAoBlwB,GAAkB4pB,GAAkB;AACpE,MAAKA;AAGE,WAAA5pB,EAAM,MAAM,OAAO,CAACiC,MAASA,EAAK,WAAW2nB,KAAW3nB,EAAK,MAAM;AAC9E;AASgB,SAAAkuB,GAAiBnwB,GAAkBowB,GAA0B;AACzE,MAAI/tB,GAAoBguB,GAA8BC,IAAqB,CAACF,EAAY,GAAG;AAExF,KAAA;AAIK,QAFI/tB,IAAAiuB,EAAS,QAAQ,CAACL,MAAQC,GAAoBlwB,GAAOiwB,CAAG,CAAC,EAAE,OAAO,OAAO,GAE7E5tB,EAAM,WAAW;AACjB,aAAO,CAAC;AAEZ,IAAAiuB,IAAWjuB,EAAM,IAAI,CAACJ,MAASA,EAAK,MAAM,GAC1BouB,IAAArwB,EAAM,MAAM,OAAO,CAACsD,MAASgtB,EAAS,SAAShtB,EAAK,GAAG,KAAKA,EAAK,IAAI;AAAA,EAAA,SAChF,CAAC+sB,EAAc;AAEjB,SAAAA;AACX;AASgB,SAAAE,GAAkCC,GAA0BC,GAAyBC,GAAiB;AAClH,MAAI,CAACA;AACM,WAAA;AAGP,MAAAC,IAAwBZ,GAAaS,CAAa,GAClDI,IAAuBb,GAAaU,CAAY;AAGhD,MAAAE,EAAsB,WAAWC,EAAqB;AAC/C,WAAA;AAIX,MAAIC,IAAY;AAIb,KAAA;AAIK,QAHJD,IAAuBA,EAAqB,QAAQ,CAACttB,MAAS6sB,GAAiBM,GAAcntB,CAAI,CAAC,GAG9FstB,EAAqB,KAAK,CAACttB,MAAcA,EAAK,KAAK,OAAOotB,CAAM;AACzD,aAAA;AAKP,QAFJC,IAAwBA,EAAsB,QAAQ,CAACrtB,MAAS6sB,GAAiBK,GAAeltB,CAAI,CAAC,GAEjGqtB,EAAsB,WAAWC,EAAqB;AAC/C,aAAA;AAGX,eAAWE,KAAmBF,GAAsB;AAC1C,YAAAG,IAAeJ,EAAsB,KAAK,CAACK,MAAA;;AAAa,iBAAAv8B,IAAAu8B,EAAS,SAAT,gBAAAv8B,EAAe,UAAOG,IAAAk8B,EAAgB,SAAhB,gBAAAl8B,EAAsB;AAAA,OAAE,GACtGq8B,KAAgBF,KAAA,gBAAAA,EAAc,SAA+B,CAAC,GAC9DG,IAAmBJ,EAAgB,QAA+B,CAAC;AASzE,UANI,CAACC,KACE,OAAO,KAAKE,CAAa,EAAE,WAAW,OAAO,KAAKC,CAAgB,EAAE,UAKvE,CAAC3H,GAAQ0H,GAAeC,CAAgB;AACjC,eAAA;AAAA,IACX;AAAA,EAEJ,SACKP,EAAsB,UAAUC,EAAqB,UAAUC,MAAc;AAEtF,SAAIA,KAAa,KACb,QAAQ,KAAK,iFAAiF,GACvF,MAGJ;AACX;AAKA,MAAeM,KAAA;AAAA,EACX,oBAAArC;AAAA,EACA,qBAAAF;AAAA,EACA,kBAAAa;AAAA,EACA,eAAA9B;AAAA,EACA,oBAAArD;AAAA,EACA,iBAAAe;AAAA,EACA,cAAAN;AAAA,EACA,eAAAC;AAAA,EACA,YAAAQ;AAAA,EACA,eAAAC;AAAA,EACA,oBAAAC;AAAA,EACA,oBAAAN;AAAA,EACA,YAAAS;AAAA,EACA,eAAAO;AAAA,EACA,WAAAE;AAAA,EACA,SAAAC;AAAA,EACA,cAAAW;AAAA,EACA,kBAAAxD;AAAA,EACA,gBAAAM;AAAA,EACA,kBAAAC;AAAA,EACA,gBAAAG;AAAA,EACA,gBAAAC;AACJ;","x_google_ignoreList":[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184]}
1	+ {"version":3,"file":"VueFlowUtils-5yCq2fSo.js","sources":["../src/utils/constants.ts","../node_modules/lodash/_createBaseFor.js","../node_modules/lodash/_baseFor.js","../node_modules/lodash/_baseForOwn.js","../node_modules/lodash/_setCacheAdd.js","../node_modules/lodash/_setCacheHas.js","../node_modules/lodash/_SetCache.js","../node_modules/lodash/_arraySome.js","../node_modules/lodash/_cacheHas.js","../node_modules/lodash/_equalArrays.js","../node_modules/lodash/_mapToArray.js","../node_modules/lodash/_setToArray.js","../node_modules/lodash/_equalByTag.js","../node_modules/lodash/_equalObjects.js","../node_modules/lodash/_baseIsEqualDeep.js","../node_modules/lodash/_baseIsEqual.js","../node_modules/lodash/_baseIsMatch.js","../node_modules/lodash/_isStrictComparable.js","../node_modules/lodash/_getMatchData.js","../node_modules/lodash/_matchesStrictComparable.js","../node_modules/lodash/_baseMatches.js","../node_modules/lodash/isSymbol.js","../node_modules/lodash/_isKey.js","../node_modules/lodash/memoize.js","../node_modules/lodash/_memoizeCapped.js","../node_modules/lodash/_stringToPath.js","../node_modules/lodash/_arrayMap.js","../node_modules/lodash/_baseToString.js","../node_modules/lodash/toString.js","../node_modules/lodash/_castPath.js","../node_modules/lodash/_toKey.js","../node_modules/lodash/_baseGet.js","../node_modules/lodash/get.js","../node_modules/lodash/_baseHasIn.js","../node_modules/lodash/_hasPath.js","../node_modules/lodash/hasIn.js","../node_modules/lodash/_baseMatchesProperty.js","../node_modules/lodash/identity.js","../node_modules/lodash/_baseProperty.js","../node_modules/lodash/_basePropertyDeep.js","../node_modules/lodash/property.js","../node_modules/lodash/_baseIteratee.js","../node_modules/lodash/mapValues.js","../src/utils/Utils.ts","../node_modules/lodash/clone.js","../node_modules/lodash/constant.js","../node_modules/lodash/_createBaseEach.js","../node_modules/lodash/_baseEach.js","../node_modules/lodash/_castFunction.js","../node_modules/lodash/forEach.js","../node_modules/lodash/each.js","../node_modules/lodash/_baseFilter.js","../node_modules/lodash/filter.js","../node_modules/lodash/_baseHas.js","../node_modules/lodash/has.js","../node_modules/lodash/isEmpty.js","../node_modules/lodash/isUndefined.js","../node_modules/lodash/_baseMap.js","../node_modules/lodash/map.js","../node_modules/lodash/_arrayReduce.js","../node_modules/lodash/_baseReduce.js","../node_modules/lodash/reduce.js","../node_modules/lodash/isString.js","../node_modules/lodash/_asciiSize.js","../node_modules/lodash/_hasUnicode.js","../node_modules/lodash/_unicodeSize.js","../node_modules/lodash/_stringSize.js","../node_modules/lodash/size.js","../node_modules/lodash/transform.js","../node_modules/lodash/_isFlattenable.js","../node_modules/lodash/_baseFlatten.js","../node_modules/lodash/_apply.js","../node_modules/lodash/_overRest.js","../node_modules/lodash/_baseSetToString.js","../node_modules/lodash/_shortOut.js","../node_modules/lodash/_setToString.js","../node_modules/lodash/_baseRest.js","../node_modules/lodash/_baseFindIndex.js","../node_modules/lodash/_baseIsNaN.js","../node_modules/lodash/_strictIndexOf.js","../node_modules/lodash/_baseIndexOf.js","../node_modules/lodash/_arrayIncludes.js","../node_modules/lodash/_arrayIncludesWith.js","../node_modules/lodash/noop.js","../node_modules/lodash/_createSet.js","../node_modules/lodash/_baseUniq.js","../node_modules/lodash/isArrayLikeObject.js","../node_modules/lodash/union.js","../node_modules/lodash/_baseValues.js","../node_modules/lodash/values.js","../node_modules/graphlib/lib/lodash.js","../node_modules/graphlib/lib/graph.js","../node_modules/graphlib/lib/version.js","../node_modules/graphlib/lib/index.js","../node_modules/graphlib/lib/json.js","../node_modules/graphlib/lib/alg/components.js","../node_modules/graphlib/lib/data/priority-queue.js","../node_modules/graphlib/lib/alg/dijkstra.js","../node_modules/graphlib/lib/alg/dijkstra-all.js","../node_modules/graphlib/lib/alg/tarjan.js","../node_modules/graphlib/lib/alg/find-cycles.js","../node_modules/graphlib/lib/alg/floyd-warshall.js","../node_modules/graphlib/lib/alg/topsort.js","../node_modules/graphlib/lib/alg/is-acyclic.js","../node_modules/graphlib/lib/alg/dfs.js","../node_modules/graphlib/lib/alg/postorder.js","../node_modules/graphlib/lib/alg/preorder.js","../node_modules/graphlib/lib/alg/prim.js","../node_modules/graphlib/lib/alg/index.js","../node_modules/graphlib/index.js","../node_modules/dagre/lib/graphlib.js","../node_modules/lodash/_isIterateeCall.js","../node_modules/lodash/defaults.js","../node_modules/lodash/_createFind.js","../node_modules/lodash/_trimmedEndIndex.js","../node_modules/lodash/_baseTrim.js","../node_modules/lodash/toNumber.js","../node_modules/lodash/toFinite.js","../node_modules/lodash/toInteger.js","../node_modules/lodash/findIndex.js","../node_modules/lodash/find.js","../node_modules/lodash/flatten.js","../node_modules/lodash/forIn.js","../node_modules/lodash/last.js","../node_modules/lodash/_baseExtremum.js","../node_modules/lodash/_baseGt.js","../node_modules/lodash/max.js","../node_modules/lodash/_assignMergeValue.js","../node_modules/lodash/isPlainObject.js","../node_modules/lodash/_safeGet.js","../node_modules/lodash/toPlainObject.js","../node_modules/lodash/_baseMergeDeep.js","../node_modules/lodash/_baseMerge.js","../node_modules/lodash/_createAssigner.js","../node_modules/lodash/merge.js","../node_modules/lodash/_baseLt.js","../node_modules/lodash/min.js","../node_modules/lodash/minBy.js","../node_modules/lodash/now.js","../node_modules/lodash/_baseSet.js","../node_modules/lodash/_basePickBy.js","../node_modules/lodash/_basePick.js","../node_modules/lodash/_flatRest.js","../node_modules/lodash/pick.js","../node_modules/lodash/_baseRange.js","../node_modules/lodash/_createRange.js","../node_modules/lodash/range.js","../node_modules/lodash/_baseSortBy.js","../node_modules/lodash/_compareAscending.js","../node_modules/lodash/_compareMultiple.js","../node_modules/lodash/_baseOrderBy.js","../node_modules/lodash/sortBy.js","../node_modules/lodash/uniqueId.js","../node_modules/lodash/_baseZipObject.js","../node_modules/lodash/zipObject.js","../node_modules/dagre/lib/lodash.js","../node_modules/dagre/lib/data/list.js","../node_modules/dagre/lib/greedy-fas.js","../node_modules/dagre/lib/acyclic.js","../node_modules/dagre/lib/util.js","../node_modules/dagre/lib/normalize.js","../node_modules/dagre/lib/rank/util.js","../node_modules/dagre/lib/rank/feasible-tree.js","../node_modules/dagre/lib/rank/network-simplex.js","../node_modules/dagre/lib/rank/index.js","../node_modules/dagre/lib/parent-dummy-chains.js","../node_modules/dagre/lib/nesting-graph.js","../node_modules/dagre/lib/add-border-segments.js","../node_modules/dagre/lib/coordinate-system.js","../node_modules/dagre/lib/order/init-order.js","../node_modules/dagre/lib/order/cross-count.js","../node_modules/dagre/lib/order/barycenter.js","../node_modules/dagre/lib/order/resolve-conflicts.js","../node_modules/dagre/lib/order/sort.js","../node_modules/dagre/lib/order/sort-subgraph.js","../node_modules/dagre/lib/order/build-layer-graph.js","../node_modules/dagre/lib/order/add-subgraph-constraints.js","../node_modules/dagre/lib/order/index.js","../node_modules/dagre/lib/position/bk.js","../node_modules/dagre/lib/position/index.js","../node_modules/dagre/lib/layout.js","../node_modules/dagre/lib/debug.js","../node_modules/dagre/lib/version.js","../node_modules/dagre/index.js","../node_modules/lodash/isEqual.js","../src/utils/VueFlowUtils.ts"],"sourcesContent":["export const SECTIONS = {\n TASKS: \"TASKS\",\n TRIGGERS: \"TRIGGERS\",\n TASK_RUNNERS: \"TASK_RUNNERS\",\n} as const;\n\nexport const EVENTS = {\n EDIT: \"edit\",\n DELETE: \"delete\",\n SHOW_DESCRIPTION: \"showDescription\",\n COLLAPSE: \"collapse\",\n EXPAND: \"expand\",\n OPEN_LINK: \"openLink\",\n ADD_TASK: \"addTask\",\n SHOW_LOGS: \"showLogs\",\n MOUSE_OVER: \"mouseover\",\n MOUSE_LEAVE: \"mouseleave\",\n ADD_ERROR: \"addError\",\n EXPAND_DEPENDENCIES: \"expandDependencies\",\n SHOW_CONDITION: \"showCondition\",\n RUN_TASK: \"runTask\",\n} as const;\n\nexport const CLUSTER_PREFIX = \"cluster_\";\n\nexport const stateGlobalChartTypes = {\n EXECUTIONS: \"executions\",\n TASKRUNS: \"taskruns\",\n} as const;\n\nexport const logDisplayTypes = {\n ALL: \"all\",\n ERROR: \"error\",\n HIDDEN: \"hidden\",\n DEFAULT: \"all\",\n} as const;\n\nexport const NODE_SIZES = {\n TASK_WIDTH: 184,\n TASK_HEIGHT: 44,\n TRIGGER_WIDTH: 184,\n TRIGGER_HEIGHT: 44,\n DOT_WIDTH: 5,\n DOT_HEIGHT: 5,\n COLLAPSED_CLUSTER_WIDTH: 150,\n COLLAPSED_CLUSTER_HEIGHT: 44,\n TRIGGER_CLUSTER_WIDTH: 350,\n TRIGGER_CLUSTER_HEIGHT: 180,\n} as const;\n\nexport const editorViewTypes = {\n STORAGE_KEY: \"view-type\",\n SOURCE: \"source\",\n SOURCE_TOPOLOGY: \"source-topology\",\n SOURCE_DOC: \"source-doc\",\n TOPOLOGY: \"topology\",\n SOURCE_BLUEPRINTS: \"source-blueprints\",\n} as const;\n\nexport const storageKeys = {\n DISPLAY_EXECUTIONS_COLUMNS: \"displayExecutionsColumns\",\n DISPLAY_FLOW_EXECUTIONS_COLUMNS: \"displayFlowExecutionsColumns\",\n SELECTED_TENANT: \"selectedTenant\",\n EXECUTE_FLOW_BEHAVIOUR: \"executeFlowBehaviour\",\n SHOW_CHART: \"showChart\",\n SHOW_FLOWS_CHART: \"showFlowsChart\",\n SHOW_LOGS_CHART: \"showLogsChart\",\n DEFAULT_NAMESPACE: \"defaultNamespace\",\n LATEST_NAMESPACE: \"latestNamespace\",\n PAGINATION_SIZE: \"paginationSize\",\n IMPERSONATE: \"impersonate\",\n EDITOR_VIEW_TYPE: \"editorViewType\",\n} as const;\n\nexport const executeFlowBehaviours = {\n SAME_TAB: \"same tab\",\n NEW_TAB: \"new tab\",\n} as const;\n\nexport const stateDisplayValues = {\n INPROGRESS: \"IN-PROGRESS\",\n} as const;\n","/*\n Creates a base function for methods like `_.forIn` and `_.forOwn`.\n \n @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n /\nfunction createBaseFor(fromRight) {\n return function(object, iteratee, keysFunc) {\n var index = -1,\n iterable = Object(object),\n props = keysFunc(object),\n length = props.length;\n\n while (length--) {\n var key = props[fromRight ? length : ++index];\n if (iteratee(iterable[key], key, iterable) === false) {\n break;\n }\n }\n return object;\n };\n}\n\nmodule.exports = createBaseFor;\n","var createBaseFor = require('./_createBaseFor');\n\n/\n The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n \n @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n /\nvar baseFor = createBaseFor();\n\nmodule.exports = baseFor;\n","var baseFor = require('./_baseFor'),\n keys = require('./keys');\n\n/\n The base implementation of `_.forOwn` without support for iteratee shorthands.\n \n @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n /\nfunction baseForOwn(object, iteratee) {\n return object && baseFor(object, iteratee, keys);\n}\n\nmodule.exports = baseForOwn;\n","/* Used to stand-in for `undefined` hash values. /\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/\n Adds `value` to the array cache.\n \n @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {} value The value to cache.\n @returns {Object} Returns the cache instance.\n /\nfunction setCacheAdd(value) {\n this.__data__.set(value, HASH_UNDEFINED);\n return this;\n}\n\nmodule.exports = setCacheAdd;\n","/\n Checks if `value` is in the array cache.\n \n @private\n * @name has\n * @memberOf SetCache\n * @param {} value The value to search for.\n @returns {number} Returns `true` if `value` is found, else `false`.\n /\nfunction setCacheHas(value) {\n return this.__data__.has(value);\n}\n\nmodule.exports = setCacheHas;\n","var MapCache = require('./_MapCache'),\n setCacheAdd = require('./_setCacheAdd'),\n setCacheHas = require('./_setCacheHas');\n\n/\n \n * Creates an array cache object to store unique values.\n \n @private\n * @constructor\n * @param {Array} [values] The values to cache.\n /\nfunction SetCache(values) {\n var index = -1,\n length = values == null ? 0 : values.length;\n\n this.__data__ = new MapCache;\n while (++index < length) {\n this.add(values[index]);\n }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nmodule.exports = SetCache;\n","/\n A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n /\nfunction arraySome(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (predicate(array[index], index, array)) {\n return true;\n }\n }\n return false;\n}\n\nmodule.exports = arraySome;\n","/\n Checks if a `cache` value for `key` exists.\n \n @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n /\nfunction cacheHas(cache, key) {\n return cache.has(key);\n}\n\nmodule.exports = cacheHas;\n","var SetCache = require('./_SetCache'),\n arraySome = require('./_arraySome'),\n cacheHas = require('./_cacheHas');\n\n/* Used to compose bitmasks for value comparisons. /\nvar COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n/\n A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n \n @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n /\nfunction equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n arrLength = array.length,\n othLength = other.length;\n\n if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n return false;\n }\n // Check that cyclic values are equal.\n var arrStacked = stack.get(array);\n var othStacked = stack.get(other);\n if (arrStacked && othStacked) {\n return arrStacked == other && othStacked == array;\n }\n var index = -1,\n result = true,\n seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n stack.set(array, other);\n stack.set(other, array);\n\n // Ignore non-index properties.\n while (++index < arrLength) {\n var arrValue = array[index],\n othValue = other[index];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, arrValue, index, other, array, stack)\n : customizer(arrValue, othValue, index, array, other, stack);\n }\n if (compared !== undefined) {\n if (compared) {\n continue;\n }\n result = false;\n break;\n }\n // Recursively compare arrays (susceptible to call stack limits).\n if (seen) {\n if (!arraySome(other, function(othValue, othIndex) {\n if (!cacheHas(seen, othIndex) &&\n (arrValue === othValue \|\| equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n return seen.push(othIndex);\n }\n })) {\n result = false;\n break;\n }\n } else if (!(\n arrValue === othValue \|\|\n equalFunc(arrValue, othValue, bitmask, customizer, stack)\n )) {\n result = false;\n break;\n }\n }\n stack['delete'](array);\n stack['delete'](other);\n return result;\n}\n\nmodule.exports = equalArrays;\n","/\n Converts `map` to its key-value pairs.\n \n @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n /\nfunction mapToArray(map) {\n var index = -1,\n result = Array(map.size);\n\n map.forEach(function(value, key) {\n result[++index] = [key, value];\n });\n return result;\n}\n\nmodule.exports = mapToArray;\n","/\n Converts `set` to an array of its values.\n \n @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n /\nfunction setToArray(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = value;\n });\n return result;\n}\n\nmodule.exports = setToArray;\n","var Symbol = require('./_Symbol'),\n Uint8Array = require('./_Uint8Array'),\n eq = require('./eq'),\n equalArrays = require('./_equalArrays'),\n mapToArray = require('./_mapToArray'),\n setToArray = require('./_setToArray');\n\n/* Used to compose bitmasks for value comparisons. /\nvar COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n/* `Object#toString` result references. /\nvar boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n errorTag = '[object Error]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]';\n\n/* Used to convert symbols to primitives and strings. /\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/\n A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n \n Note: This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n \n @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n /\nfunction equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n switch (tag) {\n case dataViewTag:\n if ((object.byteLength != other.byteLength) \|\|\n (object.byteOffset != other.byteOffset)) {\n return false;\n }\n object = object.buffer;\n other = other.buffer;\n\n case arrayBufferTag:\n if ((object.byteLength != other.byteLength) \|\|\n !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n return false;\n }\n return true;\n\n case boolTag:\n case dateTag:\n case numberTag:\n // Coerce booleans to `1` or `0` and dates to milliseconds.\n // Invalid dates are coerced to `NaN`.\n return eq(+object, +other);\n\n case errorTag:\n return object.name == other.name && object.message == other.message;\n\n case regexpTag:\n case stringTag:\n // Coerce regexes to strings and treat strings, primitives and objects,\n // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n // for more details.\n return object == (other + '');\n\n case mapTag:\n var convert = mapToArray;\n\n case setTag:\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n convert \|\| (convert = setToArray);\n\n if (object.size != other.size && !isPartial) {\n return false;\n }\n // Assume cyclic values are equal.\n var stacked = stack.get(object);\n if (stacked) {\n return stacked == other;\n }\n bitmask \|= COMPARE_UNORDERED_FLAG;\n\n // Recursively compare objects (susceptible to call stack limits).\n stack.set(object, other);\n var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n stack['delete'](object);\n return result;\n\n case symbolTag:\n if (symbolValueOf) {\n return symbolValueOf.call(object) == symbolValueOf.call(other);\n }\n }\n return false;\n}\n\nmodule.exports = equalByTag;\n","var getAllKeys = require('./_getAllKeys');\n\n/* Used to compose bitmasks for value comparisons. /\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n \n @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n /\nfunction equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n objProps = getAllKeys(object),\n objLength = objProps.length,\n othProps = getAllKeys(other),\n othLength = othProps.length;\n\n if (objLength != othLength && !isPartial) {\n return false;\n }\n var index = objLength;\n while (index--) {\n var key = objProps[index];\n if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n return false;\n }\n }\n // Check that cyclic values are equal.\n var objStacked = stack.get(object);\n var othStacked = stack.get(other);\n if (objStacked && othStacked) {\n return objStacked == other && othStacked == object;\n }\n var result = true;\n stack.set(object, other);\n stack.set(other, object);\n\n var skipCtor = isPartial;\n while (++index < objLength) {\n key = objProps[index];\n var objValue = object[key],\n othValue = other[key];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, objValue, key, other, object, stack)\n : customizer(objValue, othValue, key, object, other, stack);\n }\n // Recursively compare objects (susceptible to call stack limits).\n if (!(compared === undefined\n ? (objValue === othValue \|\| equalFunc(objValue, othValue, bitmask, customizer, stack))\n : compared\n )) {\n result = false;\n break;\n }\n skipCtor \|\| (skipCtor = key == 'constructor');\n }\n if (result && !skipCtor) {\n var objCtor = object.constructor,\n othCtor = other.constructor;\n\n // Non `Object` object instances with different constructors are not equal.\n if (objCtor != othCtor &&\n ('constructor' in object && 'constructor' in other) &&\n !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n result = false;\n }\n }\n stack['delete'](object);\n stack['delete'](other);\n return result;\n}\n\nmodule.exports = equalObjects;\n","var Stack = require('./_Stack'),\n equalArrays = require('./_equalArrays'),\n equalByTag = require('./_equalByTag'),\n equalObjects = require('./_equalObjects'),\n getTag = require('./_getTag'),\n isArray = require('./isArray'),\n isBuffer = require('./isBuffer'),\n isTypedArray = require('./isTypedArray');\n\n/* Used to compose bitmasks for value comparisons. /\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/* `Object#toString` result references. /\nvar argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n objectTag = '[object Object]';\n\n/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n \n @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n /\nfunction baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n var objIsArr = isArray(object),\n othIsArr = isArray(other),\n objTag = objIsArr ? arrayTag : getTag(object),\n othTag = othIsArr ? arrayTag : getTag(other);\n\n objTag = objTag == argsTag ? objectTag : objTag;\n othTag = othTag == argsTag ? objectTag : othTag;\n\n var objIsObj = objTag == objectTag,\n othIsObj = othTag == objectTag,\n isSameTag = objTag == othTag;\n\n if (isSameTag && isBuffer(object)) {\n if (!isBuffer(other)) {\n return false;\n }\n objIsArr = true;\n objIsObj = false;\n }\n if (isSameTag && !objIsObj) {\n stack \|\| (stack = new Stack);\n return (objIsArr \|\| isTypedArray(object))\n ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n }\n if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n if (objIsWrapped \|\| othIsWrapped) {\n var objUnwrapped = objIsWrapped ? object.value() : object,\n othUnwrapped = othIsWrapped ? other.value() : other;\n\n stack \|\| (stack = new Stack);\n return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n }\n }\n if (!isSameTag) {\n return false;\n }\n stack \|\| (stack = new Stack);\n return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n}\n\nmodule.exports = baseIsEqualDeep;\n","var baseIsEqualDeep = require('./_baseIsEqualDeep'),\n isObjectLike = require('./isObjectLike');\n\n/\n The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n \n @private\n * @param {} value The value to compare.\n @param {} other The other value to compare.\n @param {boolean} bitmask The bitmask flags.\n * 1 - Unordered comparison\n * 2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n /\nfunction baseIsEqual(value, other, bitmask, customizer, stack) {\n if (value === other) {\n return true;\n }\n if (value == null \|\| other == null \|\| (!isObjectLike(value) && !isObjectLike(other))) {\n return value !== value && other !== other;\n }\n return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n}\n\nmodule.exports = baseIsEqual;\n","var Stack = require('./_Stack'),\n baseIsEqual = require('./_baseIsEqual');\n\n/* Used to compose bitmasks for value comparisons. /\nvar COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n/\n The base implementation of `_.isMatch` without support for iteratee shorthands.\n \n @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n /\nfunction baseIsMatch(object, source, matchData, customizer) {\n var index = matchData.length,\n length = index,\n noCustomizer = !customizer;\n\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (index--) {\n var data = matchData[index];\n if ((noCustomizer && data[2])\n ? data[1] !== object[data[0]]\n : !(data[0] in object)\n ) {\n return false;\n }\n }\n while (++index < length) {\n data = matchData[index];\n var key = data[0],\n objValue = object[key],\n srcValue = data[1];\n\n if (noCustomizer && data[2]) {\n if (objValue === undefined && !(key in object)) {\n return false;\n }\n } else {\n var stack = new Stack;\n if (customizer) {\n var result = customizer(objValue, srcValue, key, object, source, stack);\n }\n if (!(result === undefined\n ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG \| COMPARE_UNORDERED_FLAG, customizer, stack)\n : result\n )) {\n return false;\n }\n }\n }\n return true;\n}\n\nmodule.exports = baseIsMatch;\n","var isObject = require('./isObject');\n\n/\n Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` if suitable for strict\n * equality comparisons, else `false`.\n /\nfunction isStrictComparable(value) {\n return value === value && !isObject(value);\n}\n\nmodule.exports = isStrictComparable;\n","var isStrictComparable = require('./_isStrictComparable'),\n keys = require('./keys');\n\n/\n Gets the property names, values, and compare flags of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n /\nfunction getMatchData(object) {\n var result = keys(object),\n length = result.length;\n\n while (length--) {\n var key = result[length],\n value = object[key];\n\n result[length] = [key, value, isStrictComparable(value)];\n }\n return result;\n}\n\nmodule.exports = getMatchData;\n","/\n A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n \n @private\n * @param {string} key The key of the property to get.\n * @param {} srcValue The value to match.\n @returns {Function} Returns the new spec function.\n /\nfunction matchesStrictComparable(key, srcValue) {\n return function(object) {\n if (object == null) {\n return false;\n }\n return object[key] === srcValue &&\n (srcValue !== undefined \|\| (key in Object(object)));\n };\n}\n\nmodule.exports = matchesStrictComparable;\n","var baseIsMatch = require('./_baseIsMatch'),\n getMatchData = require('./_getMatchData'),\n matchesStrictComparable = require('./_matchesStrictComparable');\n\n/\n The base implementation of `_.matches` which doesn't clone `source`.\n \n @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n /\nfunction baseMatches(source) {\n var matchData = getMatchData(source);\n if (matchData.length == 1 && matchData[0][2]) {\n return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n }\n return function(object) {\n return object === source \|\| baseIsMatch(object, source, matchData);\n };\n}\n\nmodule.exports = baseMatches;\n","var baseGetTag = require('./_baseGetTag'),\n isObjectLike = require('./isObjectLike');\n\n/* `Object#toString` result references. /\nvar symbolTag = '[object Symbol]';\n\n/\n Checks if `value` is classified as a `Symbol` primitive or object.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n \n _.isSymbol(Symbol.iterator);\n * // => true\n \n _.isSymbol('abc');\n * // => false\n /\nfunction isSymbol(value) {\n return typeof value == 'symbol' \|\|\n (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nmodule.exports = isSymbol;\n","var isArray = require('./isArray'),\n isSymbol = require('./isSymbol');\n\n/* Used to match property names within property paths. /\nvar reIsDeepProp = /\\.\|\\[(?:[^[\\]]\|([\"'])(?:(?!\\1)[^\\\\]\|\\\\.)?\\1)\\]/,\n reIsPlainProp = /^\\w$/;\n\n/*\n Checks if `value` is a property name and not a property path.\n \n @private\n * @param {} value The value to check.\n @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n /\nfunction isKey(value, object) {\n if (isArray(value)) {\n return false;\n }\n var type = typeof value;\n if (type == 'number' \|\| type == 'symbol' \|\| type == 'boolean' \|\|\n value == null \|\| isSymbol(value)) {\n return true;\n }\n return reIsPlainProp.test(value) \|\| !reIsDeepProp.test(value) \|\|\n (object != null && value in Object(object));\n}\n\nmodule.exports = isKey;\n","var MapCache = require('./_MapCache');\n\n/* Error message constants. /\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/\n Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n \n Note: The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n \n var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n \n var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n \n values(other);\n * // => [3, 4]\n \n object.a = 2;\n * values(object);\n * // => [1, 2]\n \n // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n \n // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n /\nfunction memoize(func, resolver) {\n if (typeof func != 'function' \|\| (resolver != null && typeof resolver != 'function')) {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var memoized = function() {\n var args = arguments,\n key = resolver ? resolver.apply(this, args) : args[0],\n cache = memoized.cache;\n\n if (cache.has(key)) {\n return cache.get(key);\n }\n var result = func.apply(this, args);\n memoized.cache = cache.set(key, result) \|\| cache;\n return result;\n };\n memoized.cache = new (memoize.Cache \|\| MapCache);\n return memoized;\n}\n\n// Expose `MapCache`.\nmemoize.Cache = MapCache;\n\nmodule.exports = memoize;\n","var memoize = require('./memoize');\n\n/* Used as the maximum memoize cache size. /\nvar MAX_MEMOIZE_SIZE = 500;\n\n/\n A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n \n @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n /\nfunction memoizeCapped(func) {\n var result = memoize(func, function(key) {\n if (cache.size === MAX_MEMOIZE_SIZE) {\n cache.clear();\n }\n return key;\n });\n\n var cache = result.cache;\n return result;\n}\n\nmodule.exports = memoizeCapped;\n","var memoizeCapped = require('./_memoizeCapped');\n\n/* Used to match property names within property paths. /\nvar rePropName = /[^.[\\]]+\|\\[(?:(-?\\d+(?:\\.\\d+)?)\|([\"'])((?:(?!\\2)[^\\\\]\|\\\\.)?)\\2)\\]\|(?=(?:\\.\|\\[\\])(?:\\.\|\\[\\]\|$))/g;\n\n/** Used to match backslashes in property paths. /\nvar reEscapeChar = /\\\$\\\$?/g;\n\n/\n Converts `string` to a property path array.\n \n @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n /\nvar stringToPath = memoizeCapped(function(string) {\n var result = [];\n if (string.charCodeAt(0) === 46 / . /) {\n result.push('');\n }\n string.replace(rePropName, function(match, number, quote, subString) {\n result.push(quote ? subString.replace(reEscapeChar, '$1') : (number \|\| match));\n });\n return result;\n});\n\nmodule.exports = stringToPath;\n","/\n A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n /\nfunction arrayMap(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iteratee(array[index], index, array);\n }\n return result;\n}\n\nmodule.exports = arrayMap;\n","var Symbol = require('./_Symbol'),\n arrayMap = require('./_arrayMap'),\n isArray = require('./isArray'),\n isSymbol = require('./isSymbol');\n\n/* Used as references for various `Number` constants. /\nvar INFINITY = 1 / 0;\n\n/* Used to convert symbols to primitives and strings. /\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/\n The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n \n @private\n * @param {} value The value to process.\n @returns {string} Returns the string.\n /\nfunction baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isArray(value)) {\n // Recursively convert values (susceptible to call stack limits).\n return arrayMap(value, baseToString) + '';\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = baseToString;\n","var baseToString = require('./_baseToString');\n\n/\n Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to convert.\n @returns {string} Returns the converted string.\n * @example\n \n _.toString(null);\n * // => ''\n \n _.toString(-0);\n * // => '-0'\n \n _.toString([1, 2, 3]);\n * // => '1,2,3'\n /\nfunction toString(value) {\n return value == null ? '' : baseToString(value);\n}\n\nmodule.exports = toString;\n","var isArray = require('./isArray'),\n isKey = require('./_isKey'),\n stringToPath = require('./_stringToPath'),\n toString = require('./toString');\n\n/\n Casts `value` to a path array if it's not one.\n \n @private\n * @param {} value The value to inspect.\n @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n /\nfunction castPath(value, object) {\n if (isArray(value)) {\n return value;\n }\n return isKey(value, object) ? [value] : stringToPath(toString(value));\n}\n\nmodule.exports = castPath;\n","var isSymbol = require('./isSymbol');\n\n/* Used as references for various `Number` constants. /\nvar INFINITY = 1 / 0;\n\n/\n Converts `value` to a string key if it's not a string or symbol.\n \n @private\n * @param {} value The value to inspect.\n @returns {string\|symbol} Returns the key.\n /\nfunction toKey(value) {\n if (typeof value == 'string' \|\| isSymbol(value)) {\n return value;\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = toKey;\n","var castPath = require('./_castPath'),\n toKey = require('./_toKey');\n\n/\n The base implementation of `_.get` without support for default values.\n \n @private\n * @param {Object} object The object to query.\n * @param {Array\|string} path The path of the property to get.\n * @returns {} Returns the resolved value.\n /\nfunction baseGet(object, path) {\n path = castPath(path, object);\n\n var index = 0,\n length = path.length;\n\n while (object != null && index < length) {\n object = object[toKey(path[index++])];\n }\n return (index && index == length) ? object : undefined;\n}\n\nmodule.exports = baseGet;\n","var baseGet = require('./_baseGet');\n\n/*\n Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n \n @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array\|string} path The path of the property to get.\n * @param {} [defaultValue] The value returned for `undefined` resolved values.\n @returns {} Returns the resolved value.\n @example\n \n var object = { 'a': [{ 'b': { 'c': 3 } }] };\n \n _.get(object, 'a[0].b.c');\n * // => 3\n \n _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n \n _.get(object, 'a.b.c', 'default');\n * // => 'default'\n /\nfunction get(object, path, defaultValue) {\n var result = object == null ? undefined : baseGet(object, path);\n return result === undefined ? defaultValue : result;\n}\n\nmodule.exports = get;\n","/\n The base implementation of `_.hasIn` without support for deep paths.\n \n @private\n * @param {Object} [object] The object to query.\n * @param {Array\|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n /\nfunction baseHasIn(object, key) {\n return object != null && key in Object(object);\n}\n\nmodule.exports = baseHasIn;\n","var castPath = require('./_castPath'),\n isArguments = require('./isArguments'),\n isArray = require('./isArray'),\n isIndex = require('./_isIndex'),\n isLength = require('./isLength'),\n toKey = require('./_toKey');\n\n/\n Checks if `path` exists on `object`.\n \n @private\n * @param {Object} object The object to query.\n * @param {Array\|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n /\nfunction hasPath(object, path, hasFunc) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n result = false;\n\n while (++index < length) {\n var key = toKey(path[index]);\n if (!(result = object != null && hasFunc(object, key))) {\n break;\n }\n object = object[key];\n }\n if (result \|\| ++index != length) {\n return result;\n }\n length = object == null ? 0 : object.length;\n return !!length && isLength(length) && isIndex(key, length) &&\n (isArray(object) \|\| isArguments(object));\n}\n\nmodule.exports = hasPath;\n","var baseHasIn = require('./_baseHasIn'),\n hasPath = require('./_hasPath');\n\n/\n Checks if `path` is a direct or inherited property of `object`.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array\|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n \n var object = _.create({ 'a': _.create({ 'b': 2 }) });\n \n _.hasIn(object, 'a');\n * // => true\n \n _.hasIn(object, 'a.b');\n * // => true\n \n _.hasIn(object, ['a', 'b']);\n * // => true\n \n _.hasIn(object, 'b');\n * // => false\n /\nfunction hasIn(object, path) {\n return object != null && hasPath(object, path, baseHasIn);\n}\n\nmodule.exports = hasIn;\n","var baseIsEqual = require('./_baseIsEqual'),\n get = require('./get'),\n hasIn = require('./hasIn'),\n isKey = require('./_isKey'),\n isStrictComparable = require('./_isStrictComparable'),\n matchesStrictComparable = require('./_matchesStrictComparable'),\n toKey = require('./_toKey');\n\n/* Used to compose bitmasks for value comparisons. /\nvar COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n/\n The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n \n @private\n * @param {string} path The path of the property to get.\n * @param {} srcValue The value to match.\n @returns {Function} Returns the new spec function.\n /\nfunction baseMatchesProperty(path, srcValue) {\n if (isKey(path) && isStrictComparable(srcValue)) {\n return matchesStrictComparable(toKey(path), srcValue);\n }\n return function(object) {\n var objValue = get(object, path);\n return (objValue === undefined && objValue === srcValue)\n ? hasIn(object, path)\n : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG \| COMPARE_UNORDERED_FLAG);\n };\n}\n\nmodule.exports = baseMatchesProperty;\n","/\n This method returns the first argument it receives.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {} value Any value.\n @returns {} Returns `value`.\n @example\n \n var object = { 'a': 1 };\n \n console.log(_.identity(object) === object);\n * // => true\n /\nfunction identity(value) {\n return value;\n}\n\nmodule.exports = identity;\n","/\n The base implementation of `_.property` without support for deep paths.\n \n @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n /\nfunction baseProperty(key) {\n return function(object) {\n return object == null ? undefined : object[key];\n };\n}\n\nmodule.exports = baseProperty;\n","var baseGet = require('./_baseGet');\n\n/\n A specialized version of `baseProperty` which supports deep paths.\n \n @private\n * @param {Array\|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n /\nfunction basePropertyDeep(path) {\n return function(object) {\n return baseGet(object, path);\n };\n}\n\nmodule.exports = basePropertyDeep;\n","var baseProperty = require('./_baseProperty'),\n basePropertyDeep = require('./_basePropertyDeep'),\n isKey = require('./_isKey'),\n toKey = require('./_toKey');\n\n/\n Creates a function that returns the value at `path` of a given object.\n \n @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {Array\|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n * @example\n \n var objects = [\n * { 'a': { 'b': 2 } },\n * { 'a': { 'b': 1 } }\n * ];\n \n _.map(objects, _.property('a.b'));\n * // => [2, 1]\n \n _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n * // => [1, 2]\n /\nfunction property(path) {\n return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n}\n\nmodule.exports = property;\n","var baseMatches = require('./_baseMatches'),\n baseMatchesProperty = require('./_baseMatchesProperty'),\n identity = require('./identity'),\n isArray = require('./isArray'),\n property = require('./property');\n\n/\n The base implementation of `_.iteratee`.\n \n @private\n * @param {} [value=_.identity] The value to convert to an iteratee.\n @returns {Function} Returns the iteratee.\n /\nfunction baseIteratee(value) {\n // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n if (typeof value == 'function') {\n return value;\n }\n if (value == null) {\n return identity;\n }\n if (typeof value == 'object') {\n return isArray(value)\n ? baseMatchesProperty(value[0], value[1])\n : baseMatches(value);\n }\n return property(value);\n}\n\nmodule.exports = baseIteratee;\n","var baseAssignValue = require('./_baseAssignValue'),\n baseForOwn = require('./_baseForOwn'),\n baseIteratee = require('./_baseIteratee');\n\n/\n Creates an object with the same keys as `object` and values generated\n * by running each own enumerable string keyed property of `object` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, key, object).\n \n @static\n * @memberOf _\n * @since 2.4.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapKeys\n * @example\n \n var users = {\n * 'fred': { 'user': 'fred', 'age': 40 },\n * 'pebbles': { 'user': 'pebbles', 'age': 1 }\n * };\n \n _.mapValues(users, function(o) { return o.age; });\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n \n // The `_.property` iteratee shorthand.\n * _.mapValues(users, 'age');\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n /\nfunction mapValues(object, iteratee) {\n var result = {};\n iteratee = baseIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, key, iteratee(value, key, object));\n });\n return result;\n}\n\nmodule.exports = mapValues;\n","import {getCurrentInstance} from \"vue\";\nimport humanizeDuration, {type Options as HumanizeDurationOptions,} from \"humanize-duration\";\nimport moment from \"moment\";\nimport momentTz from \"moment-timezone\";\n\nconst humanizeDurationLanguages = {\n en: {\n y: () => \"y\",\n mo: () => \"mo\",\n w: () => \"w\",\n d: () => \"d\",\n h: () => \"h\",\n m: () => \"m\",\n s: () => \"s\",\n ms: () => \"ms\",\n },\n fr: {\n y: () => \"a\",\n mo: () => \"mo\",\n w: () => \"se\",\n d: () => \"j\",\n h: () => \"h\",\n m: () => \"m\",\n s: () => \"s\",\n ms: () => \"ms\",\n },\n};\n\nexport const DATE_FORMAT_STORAGE_KEY = \"dateFormat\";\nexport const TIMEZONE_STORAGE_KEY = \"timezone\";\n\n\nexport const capitalize = (str: string) => str.charAt(0).toUpperCase() + str.slice(1)\n\nexport const dateFilter = (dateString: string, format?: string) => {\n const currentLocale = getCurrentInstance()?.appContext.config.globalProperties.$moment().locale();\n const momentInstance = getCurrentInstance()?.appContext.config.globalProperties.$moment(dateString).locale(currentLocale);\n let f;\n if (format === \"iso\") {\n f = \"YYYY-MM-DD HH:mm:ss.SSS\";\n } else {\n f = format ?? localStorage.getItem(DATE_FORMAT_STORAGE_KEY) ?? \"llll\";\n }\n // Apply timezone and format using the correct locale\n return momentInstance\n .tz(localStorage.getItem(TIMEZONE_STORAGE_KEY) ?? momentTz.tz.guess())\n .format(f);\n }\n\nexport function splitFirst(str: string, separator: string) {\n return str.split(separator).slice(1).join(separator);\n}\n\nexport function duration(isoString: string) {\n return (\n moment.duration(isoString, moment.ISO_8601 as any).asMilliseconds() / 1000\n );\n}\n\nexport function humanDuration(\n value: number \| string,\n options?: HumanizeDurationOptions & { languages?: any }\n) {\n options = options \|\| {maxDecimalPoints: 2};\n options.spacer = \"\";\n options.language = localStorage.getItem(\"lang\") \|\| \"en\";\n options.languages = humanizeDurationLanguages;\n options.largest = 2;\n\n if (typeof value !== \"number\") {\n value = duration(value);\n }\n\n return humanizeDuration(value 1000, options).replace(\n /\\.([0-9])s$/i,\n \".$10s\"\n );\n}\n\nexport function afterLastDot(str: string) {\n return str.split(\".\").pop();\n}\n\nexport function distinctFilter(value: any, index: number, array: any[]) {\n return array.indexOf(value) === index;\n}\n\nexport default {\n capitalize,\n dateFilter,\n splitFirst,\n duration,\n humanDuration,\n afterLastDot,\n distinctFilter\n};\n","var baseClone = require('./_baseClone');\n\n/** Used to compose bitmasks for cloning. /\nvar CLONE_SYMBOLS_FLAG = 4;\n\n/\n Creates a shallow clone of `value`.\n \n Note: This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to clone.\n @returns {} Returns the cloned value.\n @see _.cloneDeep\n * @example\n \n var objects = [{ 'a': 1 }, { 'b': 2 }];\n \n var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n /\nfunction clone(value) {\n return baseClone(value, CLONE_SYMBOLS_FLAG);\n}\n\nmodule.exports = clone;\n","/\n Creates a function that returns `value`.\n \n @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {} value The value to return from the new function.\n @returns {Function} Returns the new constant function.\n * @example\n \n var objects = _.times(2, _.constant({ 'a': 1 }));\n \n console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n \n console.log(objects[0] === objects[1]);\n * // => true\n /\nfunction constant(value) {\n return function() {\n return value;\n };\n}\n\nmodule.exports = constant;\n","var isArrayLike = require('./isArrayLike');\n\n/\n Creates a `baseEach` or `baseEachRight` function.\n \n @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n /\nfunction createBaseEach(eachFunc, fromRight) {\n return function(collection, iteratee) {\n if (collection == null) {\n return collection;\n }\n if (!isArrayLike(collection)) {\n return eachFunc(collection, iteratee);\n }\n var length = collection.length,\n index = fromRight ? length : -1,\n iterable = Object(collection);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (iteratee(iterable[index], index, iterable) === false) {\n break;\n }\n }\n return collection;\n };\n}\n\nmodule.exports = createBaseEach;\n","var baseForOwn = require('./_baseForOwn'),\n createBaseEach = require('./_createBaseEach');\n\n/\n The base implementation of `_.forEach` without support for iteratee shorthands.\n \n @private\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array\|Object} Returns `collection`.\n /\nvar baseEach = createBaseEach(baseForOwn);\n\nmodule.exports = baseEach;\n","var identity = require('./identity');\n\n/\n Casts `value` to `identity` if it's not a function.\n \n @private\n * @param {} value The value to inspect.\n @returns {Function} Returns cast function.\n /\nfunction castFunction(value) {\n return typeof value == 'function' ? value : identity;\n}\n\nmodule.exports = castFunction;\n","var arrayEach = require('./_arrayEach'),\n baseEach = require('./_baseEach'),\n castFunction = require('./_castFunction'),\n isArray = require('./isArray');\n\n/\n Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index\|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n \n Note: As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array\|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n \n _.forEach([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `1` then `2`.\n \n _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n /\nfunction forEach(collection, iteratee) {\n var func = isArray(collection) ? arrayEach : baseEach;\n return func(collection, castFunction(iteratee));\n}\n\nmodule.exports = forEach;\n","module.exports = require('./forEach');\n","var baseEach = require('./_baseEach');\n\n/\n The base implementation of `_.filter` without support for iteratee shorthands.\n \n @private\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n /\nfunction baseFilter(collection, predicate) {\n var result = [];\n baseEach(collection, function(value, index, collection) {\n if (predicate(value, index, collection)) {\n result.push(value);\n }\n });\n return result;\n}\n\nmodule.exports = baseFilter;\n","var arrayFilter = require('./_arrayFilter'),\n baseFilter = require('./_baseFilter'),\n baseIteratee = require('./_baseIteratee'),\n isArray = require('./isArray');\n\n/\n Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index\|key, collection).\n \n Note: Unlike `_.remove`, this method returns a new array.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n \n var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n \n _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n \n // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n \n // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n \n // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n \n // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n /\nfunction filter(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, baseIteratee(predicate, 3));\n}\n\nmodule.exports = filter;\n","/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n The base implementation of `_.has` without support for deep paths.\n \n @private\n * @param {Object} [object] The object to query.\n * @param {Array\|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n /\nfunction baseHas(object, key) {\n return object != null && hasOwnProperty.call(object, key);\n}\n\nmodule.exports = baseHas;\n","var baseHas = require('./_baseHas'),\n hasPath = require('./_hasPath');\n\n/\n Checks if `path` is a direct property of `object`.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array\|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n \n var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n \n _.has(object, 'a');\n * // => true\n \n _.has(object, 'a.b');\n * // => true\n \n _.has(object, ['a', 'b']);\n * // => true\n \n _.has(other, 'a');\n * // => false\n /\nfunction has(object, path) {\n return object != null && hasPath(object, path, baseHas);\n}\n\nmodule.exports = has;\n","var baseKeys = require('./_baseKeys'),\n getTag = require('./_getTag'),\n isArguments = require('./isArguments'),\n isArray = require('./isArray'),\n isArrayLike = require('./isArrayLike'),\n isBuffer = require('./isBuffer'),\n isPrototype = require('./_isPrototype'),\n isTypedArray = require('./isTypedArray');\n\n/* `Object#toString` result references. /\nvar mapTag = '[object Map]',\n setTag = '[object Set]';\n\n/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n Checks if `value` is an empty object, collection, map, or set.\n \n Objects are considered empty if they have no own enumerable string keyed\n * properties.\n \n Array-like values such as `arguments` objects, arrays, buffers, strings, or\n * jQuery-like collections are considered empty if they have a `length` of `0`.\n * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is empty, else `false`.\n * @example\n \n _.isEmpty(null);\n * // => true\n \n _.isEmpty(true);\n * // => true\n \n _.isEmpty(1);\n * // => true\n \n _.isEmpty([1, 2, 3]);\n * // => false\n \n _.isEmpty({ 'a': 1 });\n * // => false\n /\nfunction isEmpty(value) {\n if (value == null) {\n return true;\n }\n if (isArrayLike(value) &&\n (isArray(value) \|\| typeof value == 'string' \|\| typeof value.splice == 'function' \|\|\n isBuffer(value) \|\| isTypedArray(value) \|\| isArguments(value))) {\n return !value.length;\n }\n var tag = getTag(value);\n if (tag == mapTag \|\| tag == setTag) {\n return !value.size;\n }\n if (isPrototype(value)) {\n return !baseKeys(value).length;\n }\n for (var key in value) {\n if (hasOwnProperty.call(value, key)) {\n return false;\n }\n }\n return true;\n}\n\nmodule.exports = isEmpty;\n","/\n Checks if `value` is `undefined`.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n * @example\n \n _.isUndefined(void 0);\n * // => true\n \n _.isUndefined(null);\n * // => false\n /\nfunction isUndefined(value) {\n return value === undefined;\n}\n\nmodule.exports = isUndefined;\n","var baseEach = require('./_baseEach'),\n isArrayLike = require('./isArrayLike');\n\n/\n The base implementation of `_.map` without support for iteratee shorthands.\n \n @private\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n /\nfunction baseMap(collection, iteratee) {\n var index = -1,\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value, key, collection) {\n result[++index] = iteratee(value, key, collection);\n });\n return result;\n}\n\nmodule.exports = baseMap;\n","var arrayMap = require('./_arrayMap'),\n baseIteratee = require('./_baseIteratee'),\n baseMap = require('./_baseMap'),\n isArray = require('./isArray');\n\n/\n Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index\|key, collection).\n \n Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n \n The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n \n function square(n) {\n * return n * n;\n * }\n \n _.map([4, 8], square);\n * // => [16, 64]\n \n _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n \n var users = [\n * { 'user': 'barney' },\n * { 'user': 'fred' }\n * ];\n \n // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n /\nfunction map(collection, iteratee) {\n var func = isArray(collection) ? arrayMap : baseMap;\n return func(collection, baseIteratee(iteratee, 3));\n}\n\nmodule.exports = map;\n","/\n A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {} [accumulator] The initial value.\n @param {boolean} [initAccum] Specify using the first element of `array` as\n * the initial value.\n * @returns {} Returns the accumulated value.\n /\nfunction arrayReduce(array, iteratee, accumulator, initAccum) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n if (initAccum && length) {\n accumulator = array[++index];\n }\n while (++index < length) {\n accumulator = iteratee(accumulator, array[index], index, array);\n }\n return accumulator;\n}\n\nmodule.exports = arrayReduce;\n","/*\n The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n \n @private\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {} accumulator The initial value.\n @param {boolean} initAccum Specify using the first or last element of\n * `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {} Returns the accumulated value.\n /\nfunction baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n eachFunc(collection, function(value, index, collection) {\n accumulator = initAccum\n ? (initAccum = false, value)\n : iteratee(accumulator, value, index, collection);\n });\n return accumulator;\n}\n\nmodule.exports = baseReduce;\n","var arrayReduce = require('./_arrayReduce'),\n baseEach = require('./_baseEach'),\n baseIteratee = require('./_baseIteratee'),\n baseReduce = require('./_baseReduce'),\n isArray = require('./isArray');\n\n/*\n Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index\|key, collection).\n \n Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n \n The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {} [accumulator] The initial value.\n @returns {} Returns the accumulated value.\n @see _.reduceRight\n * @example\n \n _.reduce([1, 2], function(sum, n) {\n * return sum + n;\n * }, 0);\n * // => 3\n \n _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] \|\| (result[value] = [])).push(key);\n * return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n /\nfunction reduce(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduce : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, baseIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n}\n\nmodule.exports = reduce;\n","var baseGetTag = require('./_baseGetTag'),\n isArray = require('./isArray'),\n isObjectLike = require('./isObjectLike');\n\n/* `Object#toString` result references. /\nvar stringTag = '[object String]';\n\n/\n Checks if `value` is classified as a `String` primitive or object.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n \n _.isString('abc');\n * // => true\n \n _.isString(1);\n * // => false\n /\nfunction isString(value) {\n return typeof value == 'string' \|\|\n (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n}\n\nmodule.exports = isString;\n","var baseProperty = require('./_baseProperty');\n\n/\n Gets the size of an ASCII `string`.\n \n @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n /\nvar asciiSize = baseProperty('length');\n\nmodule.exports = asciiSize;\n","/* Used to compose unicode character classes. /\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n rsComboMarksRange = '\\\\u0300-\\\\u036f',\n reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/* Used to compose unicode capture groups. /\nvar rsZWJ = '\\\\u200d';\n\n/* Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). /\nvar reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']');\n\n/\n Checks if `string` contains Unicode symbols.\n \n @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n /\nfunction hasUnicode(string) {\n return reHasUnicode.test(string);\n}\n\nmodule.exports = hasUnicode;\n","/* Used to compose unicode character classes. /\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n rsComboMarksRange = '\\\\u0300-\\\\u036f',\n reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/* Used to compose unicode capture groups. /\nvar rsAstral = '[' + rsAstralRange + ']',\n rsCombo = '[' + rsComboRange + ']',\n rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n rsModifier = '(?:' + rsCombo + '\|' + rsFitz + ')',\n rsNonAstral = '[^' + rsAstralRange + ']',\n rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n rsZWJ = '\\\\u200d';\n\n/* Used to compose unicode regexes. /\nvar reOptMod = rsModifier + '?',\n rsOptVar = '[' + rsVarRange + ']?',\n rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('\|') + ')' + rsOptVar + reOptMod + ')',\n rsSeq = rsOptVar + reOptMod + rsOptJoin,\n rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('\|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). /\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')\|' + rsSymbol + rsSeq, 'g');\n\n/\n Gets the size of a Unicode `string`.\n \n @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n /\nfunction unicodeSize(string) {\n var result = reUnicode.lastIndex = 0;\n while (reUnicode.test(string)) {\n ++result;\n }\n return result;\n}\n\nmodule.exports = unicodeSize;\n","var asciiSize = require('./_asciiSize'),\n hasUnicode = require('./_hasUnicode'),\n unicodeSize = require('./_unicodeSize');\n\n/\n Gets the number of symbols in `string`.\n \n @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n /\nfunction stringSize(string) {\n return hasUnicode(string)\n ? unicodeSize(string)\n : asciiSize(string);\n}\n\nmodule.exports = stringSize;\n","var baseKeys = require('./_baseKeys'),\n getTag = require('./_getTag'),\n isArrayLike = require('./isArrayLike'),\n isString = require('./isString'),\n stringSize = require('./_stringSize');\n\n/* `Object#toString` result references. /\nvar mapTag = '[object Map]',\n setTag = '[object Set]';\n\n/\n Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object\|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n \n _.size([1, 2, 3]);\n * // => 3\n \n _.size({ 'a': 1, 'b': 2 });\n * // => 2\n \n _.size('pebbles');\n * // => 7\n /\nfunction size(collection) {\n if (collection == null) {\n return 0;\n }\n if (isArrayLike(collection)) {\n return isString(collection) ? stringSize(collection) : collection.length;\n }\n var tag = getTag(collection);\n if (tag == mapTag \|\| tag == setTag) {\n return collection.size;\n }\n return baseKeys(collection).length;\n}\n\nmodule.exports = size;\n","var arrayEach = require('./_arrayEach'),\n baseCreate = require('./_baseCreate'),\n baseForOwn = require('./_baseForOwn'),\n baseIteratee = require('./_baseIteratee'),\n getPrototype = require('./_getPrototype'),\n isArray = require('./isArray'),\n isBuffer = require('./isBuffer'),\n isFunction = require('./isFunction'),\n isObject = require('./isObject'),\n isTypedArray = require('./isTypedArray');\n\n/\n An alternative to `_.reduce`; this method transforms `object` to a new\n * `accumulator` object which is the result of running each of its own\n * enumerable string keyed properties thru `iteratee`, with each invocation\n * potentially mutating the `accumulator` object. If `accumulator` is not\n * provided, a new object with the same `[[Prototype]]` will be used. The\n * iteratee is invoked with four arguments: (accumulator, value, key, object).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n \n @static\n * @memberOf _\n * @since 1.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {} [accumulator] The custom accumulator value.\n @returns {} Returns the accumulated value.\n @example\n \n _.transform([2, 3, 4], function(result, n) {\n * result.push(n = n);\n return n % 2 == 0;\n * }, []);\n * // => [4, 9]\n \n _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] \|\| (result[value] = [])).push(key);\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] }\n /\nfunction transform(object, iteratee, accumulator) {\n var isArr = isArray(object),\n isArrLike = isArr \|\| isBuffer(object) \|\| isTypedArray(object);\n\n iteratee = baseIteratee(iteratee, 4);\n if (accumulator == null) {\n var Ctor = object && object.constructor;\n if (isArrLike) {\n accumulator = isArr ? new Ctor : [];\n }\n else if (isObject(object)) {\n accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n }\n else {\n accumulator = {};\n }\n }\n (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n return iteratee(accumulator, value, index, object);\n });\n return accumulator;\n}\n\nmodule.exports = transform;\n","var Symbol = require('./_Symbol'),\n isArguments = require('./isArguments'),\n isArray = require('./isArray');\n\n/* Built-in value references. /\nvar spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/\n Checks if `value` is a flattenable `arguments` object or array.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n /\nfunction isFlattenable(value) {\n return isArray(value) \|\| isArguments(value) \|\|\n !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\nmodule.exports = isFlattenable;\n","var arrayPush = require('./_arrayPush'),\n isFlattenable = require('./_isFlattenable');\n\n/\n The base implementation of `_.flatten` with support for restricting flattening.\n \n @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n /\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n var index = -1,\n length = array.length;\n\n predicate \|\| (predicate = isFlattenable);\n result \|\| (result = []);\n\n while (++index < length) {\n var value = array[index];\n if (depth > 0 && predicate(value)) {\n if (depth > 1) {\n // Recursively flatten arrays (susceptible to call stack limits).\n baseFlatten(value, depth - 1, predicate, isStrict, result);\n } else {\n arrayPush(result, value);\n }\n } else if (!isStrict) {\n result[result.length] = value;\n }\n }\n return result;\n}\n\nmodule.exports = baseFlatten;\n","/\n A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n \n @private\n * @param {Function} func The function to invoke.\n * @param {} thisArg The `this` binding of `func`.\n @param {Array} args The arguments to invoke `func` with.\n * @returns {} Returns the result of `func`.\n /\nfunction apply(func, thisArg, args) {\n switch (args.length) {\n case 0: return func.call(thisArg);\n case 1: return func.call(thisArg, args[0]);\n case 2: return func.call(thisArg, args[0], args[1]);\n case 3: return func.call(thisArg, args[0], args[1], args[2]);\n }\n return func.apply(thisArg, args);\n}\n\nmodule.exports = apply;\n","var apply = require('./_apply');\n\n/* Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeMax = Math.max;\n\n/\n A specialized version of `baseRest` which transforms the rest array.\n \n @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n /\nfunction overRest(func, start, transform) {\n start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n return function() {\n var args = arguments,\n index = -1,\n length = nativeMax(args.length - start, 0),\n array = Array(length);\n\n while (++index < length) {\n array[index] = args[start + index];\n }\n index = -1;\n var otherArgs = Array(start + 1);\n while (++index < start) {\n otherArgs[index] = args[index];\n }\n otherArgs[start] = transform(array);\n return apply(func, this, otherArgs);\n };\n}\n\nmodule.exports = overRest;\n","var constant = require('./constant'),\n defineProperty = require('./_defineProperty'),\n identity = require('./identity');\n\n/\n The base implementation of `setToString` without support for hot loop shorting.\n \n @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n /\nvar baseSetToString = !defineProperty ? identity : function(func, string) {\n return defineProperty(func, 'toString', {\n 'configurable': true,\n 'enumerable': false,\n 'value': constant(string),\n 'writable': true\n });\n};\n\nmodule.exports = baseSetToString;\n","/* Used to detect hot functions by number of calls within a span of milliseconds. /\nvar HOT_COUNT = 800,\n HOT_SPAN = 16;\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeNow = Date.now;\n\n/\n Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n \n @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n /\nfunction shortOut(func) {\n var count = 0,\n lastCalled = 0;\n\n return function() {\n var stamp = nativeNow(),\n remaining = HOT_SPAN - (stamp - lastCalled);\n\n lastCalled = stamp;\n if (remaining > 0) {\n if (++count >= HOT_COUNT) {\n return arguments[0];\n }\n } else {\n count = 0;\n }\n return func.apply(undefined, arguments);\n };\n}\n\nmodule.exports = shortOut;\n","var baseSetToString = require('./_baseSetToString'),\n shortOut = require('./_shortOut');\n\n/\n Sets the `toString` method of `func` to return `string`.\n \n @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n /\nvar setToString = shortOut(baseSetToString);\n\nmodule.exports = setToString;\n","var identity = require('./identity'),\n overRest = require('./_overRest'),\n setToString = require('./_setToString');\n\n/\n The base implementation of `_.rest` which doesn't validate or coerce arguments.\n \n @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n /\nfunction baseRest(func, start) {\n return setToString(overRest(func, start, identity), func + '');\n}\n\nmodule.exports = baseRest;\n","/\n The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n var length = array.length,\n index = fromIndex + (fromRight ? 1 : -1);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (predicate(array[index], index, array)) {\n return index;\n }\n }\n return -1;\n}\n\nmodule.exports = baseFindIndex;\n","/\n The base implementation of `_.isNaN` without support for number objects.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n /\nfunction baseIsNaN(value) {\n return value !== value;\n}\n\nmodule.exports = baseIsNaN;\n","/\n A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {} value The value to search for.\n @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction strictIndexOf(array, value, fromIndex) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (array[index] === value) {\n return index;\n }\n }\n return -1;\n}\n\nmodule.exports = strictIndexOf;\n","var baseFindIndex = require('./_baseFindIndex'),\n baseIsNaN = require('./_baseIsNaN'),\n strictIndexOf = require('./_strictIndexOf');\n\n/\n The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {} value The value to search for.\n @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction baseIndexOf(array, value, fromIndex) {\n return value === value\n ? strictIndexOf(array, value, fromIndex)\n : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nmodule.exports = baseIndexOf;\n","var baseIndexOf = require('./_baseIndexOf');\n\n/\n A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n \n @private\n * @param {Array} [array] The array to inspect.\n * @param {} target The value to search for.\n @returns {boolean} Returns `true` if `target` is found, else `false`.\n /\nfunction arrayIncludes(array, value) {\n var length = array == null ? 0 : array.length;\n return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nmodule.exports = arrayIncludes;\n","/\n This function is like `arrayIncludes` except that it accepts a comparator.\n \n @private\n * @param {Array} [array] The array to inspect.\n * @param {} target The value to search for.\n @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n /\nfunction arrayIncludesWith(array, value, comparator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (comparator(value, array[index])) {\n return true;\n }\n }\n return false;\n}\n\nmodule.exports = arrayIncludesWith;\n","/\n This method returns `undefined`.\n \n @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n \n _.times(2, _.noop);\n * // => [undefined, undefined]\n /\nfunction noop() {\n // No operation performed.\n}\n\nmodule.exports = noop;\n","var Set = require('./_Set'),\n noop = require('./noop'),\n setToArray = require('./_setToArray');\n\n/* Used as references for various `Number` constants. /\nvar INFINITY = 1 / 0;\n\n/\n Creates a set object of `values`.\n \n @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n /\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n return new Set(values);\n};\n\nmodule.exports = createSet;\n","var SetCache = require('./_SetCache'),\n arrayIncludes = require('./_arrayIncludes'),\n arrayIncludesWith = require('./_arrayIncludesWith'),\n cacheHas = require('./_cacheHas'),\n createSet = require('./_createSet'),\n setToArray = require('./_setToArray');\n\n/* Used as the size to enable large array optimizations. /\nvar LARGE_ARRAY_SIZE = 200;\n\n/\n The base implementation of `_.uniqBy` without support for iteratee shorthands.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n /\nfunction baseUniq(array, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n length = array.length,\n isCommon = true,\n result = [],\n seen = result;\n\n if (comparator) {\n isCommon = false;\n includes = arrayIncludesWith;\n }\n else if (length >= LARGE_ARRAY_SIZE) {\n var set = iteratee ? null : createSet(array);\n if (set) {\n return setToArray(set);\n }\n isCommon = false;\n includes = cacheHas;\n seen = new SetCache;\n }\n else {\n seen = iteratee ? [] : result;\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator \|\| value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var seenIndex = seen.length;\n while (seenIndex--) {\n if (seen[seenIndex] === computed) {\n continue outer;\n }\n }\n if (iteratee) {\n seen.push(computed);\n }\n result.push(value);\n }\n else if (!includes(seen, computed, comparator)) {\n if (seen !== result) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n}\n\nmodule.exports = baseUniq;\n","var isArrayLike = require('./isArrayLike'),\n isObjectLike = require('./isObjectLike');\n\n/\n This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an array-like object,\n * else `false`.\n * @example\n \n _.isArrayLikeObject([1, 2, 3]);\n * // => true\n \n _.isArrayLikeObject(document.body.children);\n * // => true\n \n _.isArrayLikeObject('abc');\n * // => false\n \n _.isArrayLikeObject(_.noop);\n * // => false\n /\nfunction isArrayLikeObject(value) {\n return isObjectLike(value) && isArrayLike(value);\n}\n\nmodule.exports = isArrayLikeObject;\n","var baseFlatten = require('./_baseFlatten'),\n baseRest = require('./_baseRest'),\n baseUniq = require('./_baseUniq'),\n isArrayLikeObject = require('./isArrayLikeObject');\n\n/\n Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n \n _.union([2], [1, 2]);\n * // => [2, 1]\n /\nvar union = baseRest(function(arrays) {\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n});\n\nmodule.exports = union;\n","var arrayMap = require('./_arrayMap');\n\n/\n The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n \n @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n /\nfunction baseValues(object, props) {\n return arrayMap(props, function(key) {\n return object[key];\n });\n}\n\nmodule.exports = baseValues;\n","var baseValues = require('./_baseValues'),\n keys = require('./keys');\n\n/\n Creates an array of the own enumerable string keyed property values of `object`.\n \n Note: Non-object values are coerced to objects.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n \n function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n \n Foo.prototype.c = 3;\n \n _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n \n _.values('hi');\n * // => ['h', 'i']\n /\nfunction values(object) {\n return object == null ? [] : baseValues(object, keys(object));\n}\n\nmodule.exports = values;\n","/ global window /\n\nvar lodash;\n\nif (typeof require === \"function\") {\n try {\n lodash = {\n clone: require(\"lodash/clone\"),\n constant: require(\"lodash/constant\"),\n each: require(\"lodash/each\"),\n filter: require(\"lodash/filter\"),\n has: require(\"lodash/has\"),\n isArray: require(\"lodash/isArray\"),\n isEmpty: require(\"lodash/isEmpty\"),\n isFunction: require(\"lodash/isFunction\"),\n isUndefined: require(\"lodash/isUndefined\"),\n keys: require(\"lodash/keys\"),\n map: require(\"lodash/map\"),\n reduce: require(\"lodash/reduce\"),\n size: require(\"lodash/size\"),\n transform: require(\"lodash/transform\"),\n union: require(\"lodash/union\"),\n values: require(\"lodash/values\")\n };\n } catch (e) {\n // continue regardless of error\n }\n}\n\nif (!lodash) {\n lodash = window._;\n}\n\nmodule.exports = lodash;\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = Graph;\n\nvar DEFAULT_EDGE_NAME = \"\\x00\";\nvar GRAPH_NODE = \"\\x00\";\nvar EDGE_KEY_DELIM = \"\\x01\";\n\n// Implementation notes:\n//\n// Node id query functions should return string ids for the nodes\n// * Edge id query functions should return an \"edgeObj\", edge object, that is\n// composed of enough information to uniquely identify an edge: {v, w, name}.\n// * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n// reference edges. This is because we need a performant way to look these\n// edges up and, object properties, which have string keys, are the closest\n// we're going to get to a performant hashtable in JavaScript.\n\nfunction Graph(opts) {\n this._isDirected = _.has(opts, \"directed\") ? opts.directed : true;\n this._isMultigraph = _.has(opts, \"multigraph\") ? opts.multigraph : false;\n this._isCompound = _.has(opts, \"compound\") ? opts.compound : false;\n\n // Label for the graph itself\n this._label = undefined;\n\n // Defaults to be set when creating a new node\n this._defaultNodeLabelFn = _.constant(undefined);\n\n // Defaults to be set when creating a new edge\n this._defaultEdgeLabelFn = _.constant(undefined);\n\n // v -> label\n this._nodes = {};\n\n if (this._isCompound) {\n // v -> parent\n this._parent = {};\n\n // v -> children\n this._children = {};\n this._children[GRAPH_NODE] = {};\n }\n\n // v -> edgeObj\n this._in = {};\n\n // u -> v -> Number\n this._preds = {};\n\n // v -> edgeObj\n this._out = {};\n\n // v -> w -> Number\n this._sucs = {};\n\n // e -> edgeObj\n this._edgeObjs = {};\n\n // e -> label\n this._edgeLabels = {};\n}\n\n/* Number of nodes in the graph. Should only be changed by the implementation. /\nGraph.prototype._nodeCount = 0;\n\n/ Number of edges in the graph. Should only be changed by the implementation. /\nGraph.prototype._edgeCount = 0;\n\n\n/ === Graph functions ========= /\n\nGraph.prototype.isDirected = function() {\n return this._isDirected;\n};\n\nGraph.prototype.isMultigraph = function() {\n return this._isMultigraph;\n};\n\nGraph.prototype.isCompound = function() {\n return this._isCompound;\n};\n\nGraph.prototype.setGraph = function(label) {\n this._label = label;\n return this;\n};\n\nGraph.prototype.graph = function() {\n return this._label;\n};\n\n\n/ === Node functions ========== /\n\nGraph.prototype.setDefaultNodeLabel = function(newDefault) {\n if (!_.isFunction(newDefault)) {\n newDefault = _.constant(newDefault);\n }\n this._defaultNodeLabelFn = newDefault;\n return this;\n};\n\nGraph.prototype.nodeCount = function() {\n return this._nodeCount;\n};\n\nGraph.prototype.nodes = function() {\n return _.keys(this._nodes);\n};\n\nGraph.prototype.sources = function() {\n var self = this;\n return _.filter(this.nodes(), function(v) {\n return _.isEmpty(self._in[v]);\n });\n};\n\nGraph.prototype.sinks = function() {\n var self = this;\n return _.filter(this.nodes(), function(v) {\n return _.isEmpty(self._out[v]);\n });\n};\n\nGraph.prototype.setNodes = function(vs, value) {\n var args = arguments;\n var self = this;\n _.each(vs, function(v) {\n if (args.length > 1) {\n self.setNode(v, value);\n } else {\n self.setNode(v);\n }\n });\n return this;\n};\n\nGraph.prototype.setNode = function(v, value) {\n if (_.has(this._nodes, v)) {\n if (arguments.length > 1) {\n this._nodes[v] = value;\n }\n return this;\n }\n\n this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);\n if (this._isCompound) {\n this._parent[v] = GRAPH_NODE;\n this._children[v] = {};\n this._children[GRAPH_NODE][v] = true;\n }\n this._in[v] = {};\n this._preds[v] = {};\n this._out[v] = {};\n this._sucs[v] = {};\n ++this._nodeCount;\n return this;\n};\n\nGraph.prototype.node = function(v) {\n return this._nodes[v];\n};\n\nGraph.prototype.hasNode = function(v) {\n return _.has(this._nodes, v);\n};\n\nGraph.prototype.removeNode = function(v) {\n var self = this;\n if (_.has(this._nodes, v)) {\n var removeEdge = function(e) { self.removeEdge(self._edgeObjs[e]); };\n delete this._nodes[v];\n if (this._isCompound) {\n this._removeFromParentsChildList(v);\n delete this._parent[v];\n _.each(this.children(v), function(child) {\n self.setParent(child);\n });\n delete this._children[v];\n }\n _.each(_.keys(this._in[v]), removeEdge);\n delete this._in[v];\n delete this._preds[v];\n _.each(_.keys(this._out[v]), removeEdge);\n delete this._out[v];\n delete this._sucs[v];\n --this._nodeCount;\n }\n return this;\n};\n\nGraph.prototype.setParent = function(v, parent) {\n if (!this._isCompound) {\n throw new Error(\"Cannot set parent in a non-compound graph\");\n }\n\n if (_.isUndefined(parent)) {\n parent = GRAPH_NODE;\n } else {\n // Coerce parent to string\n parent += \"\";\n for (var ancestor = parent;\n !_.isUndefined(ancestor);\n ancestor = this.parent(ancestor)) {\n if (ancestor === v) {\n throw new Error(\"Setting \" + parent+ \" as parent of \" + v +\n \" would create a cycle\");\n }\n }\n\n this.setNode(parent);\n }\n\n this.setNode(v);\n this._removeFromParentsChildList(v);\n this._parent[v] = parent;\n this._children[parent][v] = true;\n return this;\n};\n\nGraph.prototype._removeFromParentsChildList = function(v) {\n delete this._children[this._parent[v]][v];\n};\n\nGraph.prototype.parent = function(v) {\n if (this._isCompound) {\n var parent = this._parent[v];\n if (parent !== GRAPH_NODE) {\n return parent;\n }\n }\n};\n\nGraph.prototype.children = function(v) {\n if (_.isUndefined(v)) {\n v = GRAPH_NODE;\n }\n\n if (this._isCompound) {\n var children = this._children[v];\n if (children) {\n return _.keys(children);\n }\n } else if (v === GRAPH_NODE) {\n return this.nodes();\n } else if (this.hasNode(v)) {\n return [];\n }\n};\n\nGraph.prototype.predecessors = function(v) {\n var predsV = this._preds[v];\n if (predsV) {\n return _.keys(predsV);\n }\n};\n\nGraph.prototype.successors = function(v) {\n var sucsV = this._sucs[v];\n if (sucsV) {\n return _.keys(sucsV);\n }\n};\n\nGraph.prototype.neighbors = function(v) {\n var preds = this.predecessors(v);\n if (preds) {\n return _.union(preds, this.successors(v));\n }\n};\n\nGraph.prototype.isLeaf = function (v) {\n var neighbors;\n if (this.isDirected()) {\n neighbors = this.successors(v);\n } else {\n neighbors = this.neighbors(v);\n }\n return neighbors.length === 0;\n};\n\nGraph.prototype.filterNodes = function(filter) {\n var copy = new this.constructor({\n directed: this._isDirected,\n multigraph: this._isMultigraph,\n compound: this._isCompound\n });\n\n copy.setGraph(this.graph());\n\n var self = this;\n _.each(this._nodes, function(value, v) {\n if (filter(v)) {\n copy.setNode(v, value);\n }\n });\n\n _.each(this._edgeObjs, function(e) {\n if (copy.hasNode(e.v) && copy.hasNode(e.w)) {\n copy.setEdge(e, self.edge(e));\n }\n });\n\n var parents = {};\n function findParent(v) {\n var parent = self.parent(v);\n if (parent === undefined \|\| copy.hasNode(parent)) {\n parents[v] = parent;\n return parent;\n } else if (parent in parents) {\n return parents[parent];\n } else {\n return findParent(parent);\n }\n }\n\n if (this._isCompound) {\n _.each(copy.nodes(), function(v) {\n copy.setParent(v, findParent(v));\n });\n }\n\n return copy;\n};\n\n/ === Edge functions ========== /\n\nGraph.prototype.setDefaultEdgeLabel = function(newDefault) {\n if (!_.isFunction(newDefault)) {\n newDefault = _.constant(newDefault);\n }\n this._defaultEdgeLabelFn = newDefault;\n return this;\n};\n\nGraph.prototype.edgeCount = function() {\n return this._edgeCount;\n};\n\nGraph.prototype.edges = function() {\n return _.values(this._edgeObjs);\n};\n\nGraph.prototype.setPath = function(vs, value) {\n var self = this;\n var args = arguments;\n _.reduce(vs, function(v, w) {\n if (args.length > 1) {\n self.setEdge(v, w, value);\n } else {\n self.setEdge(v, w);\n }\n return w;\n });\n return this;\n};\n\n/\n * setEdge(v, w, [value, [name]])\n * setEdge({ v, w, [name] }, [value])\n /\nGraph.prototype.setEdge = function() {\n var v, w, name, value;\n var valueSpecified = false;\n var arg0 = arguments[0];\n\n if (typeof arg0 === \"object\" && arg0 !== null && \"v\" in arg0) {\n v = arg0.v;\n w = arg0.w;\n name = arg0.name;\n if (arguments.length === 2) {\n value = arguments[1];\n valueSpecified = true;\n }\n } else {\n v = arg0;\n w = arguments[1];\n name = arguments[3];\n if (arguments.length > 2) {\n value = arguments[2];\n valueSpecified = true;\n }\n }\n\n v = \"\" + v;\n w = \"\" + w;\n if (!_.isUndefined(name)) {\n name = \"\" + name;\n }\n\n var e = edgeArgsToId(this._isDirected, v, w, name);\n if (_.has(this._edgeLabels, e)) {\n if (valueSpecified) {\n this._edgeLabels[e] = value;\n }\n return this;\n }\n\n if (!_.isUndefined(name) && !this._isMultigraph) {\n throw new Error(\"Cannot set a named edge when isMultigraph = false\");\n }\n\n // It didn't exist, so we need to create it.\n // First ensure the nodes exist.\n this.setNode(v);\n this.setNode(w);\n\n this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);\n\n var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);\n // Ensure we add undirected edges in a consistent way.\n v = edgeObj.v;\n w = edgeObj.w;\n\n Object.freeze(edgeObj);\n this._edgeObjs[e] = edgeObj;\n incrementOrInitEntry(this._preds[w], v);\n incrementOrInitEntry(this._sucs[v], w);\n this._in[w][e] = edgeObj;\n this._out[v][e] = edgeObj;\n this._edgeCount++;\n return this;\n};\n\nGraph.prototype.edge = function(v, w, name) {\n var e = (arguments.length === 1\n ? edgeObjToId(this._isDirected, arguments[0])\n : edgeArgsToId(this._isDirected, v, w, name));\n return this._edgeLabels[e];\n};\n\nGraph.prototype.hasEdge = function(v, w, name) {\n var e = (arguments.length === 1\n ? edgeObjToId(this._isDirected, arguments[0])\n : edgeArgsToId(this._isDirected, v, w, name));\n return _.has(this._edgeLabels, e);\n};\n\nGraph.prototype.removeEdge = function(v, w, name) {\n var e = (arguments.length === 1\n ? edgeObjToId(this._isDirected, arguments[0])\n : edgeArgsToId(this._isDirected, v, w, name));\n var edge = this._edgeObjs[e];\n if (edge) {\n v = edge.v;\n w = edge.w;\n delete this._edgeLabels[e];\n delete this._edgeObjs[e];\n decrementOrRemoveEntry(this._preds[w], v);\n decrementOrRemoveEntry(this._sucs[v], w);\n delete this._in[w][e];\n delete this._out[v][e];\n this._edgeCount--;\n }\n return this;\n};\n\nGraph.prototype.inEdges = function(v, u) {\n var inV = this._in[v];\n if (inV) {\n var edges = _.values(inV);\n if (!u) {\n return edges;\n }\n return _.filter(edges, function(edge) { return edge.v === u; });\n }\n};\n\nGraph.prototype.outEdges = function(v, w) {\n var outV = this._out[v];\n if (outV) {\n var edges = _.values(outV);\n if (!w) {\n return edges;\n }\n return _.filter(edges, function(edge) { return edge.w === w; });\n }\n};\n\nGraph.prototype.nodeEdges = function(v, w) {\n var inEdges = this.inEdges(v, w);\n if (inEdges) {\n return inEdges.concat(this.outEdges(v, w));\n }\n};\n\nfunction incrementOrInitEntry(map, k) {\n if (map[k]) {\n map[k]++;\n } else {\n map[k] = 1;\n }\n}\n\nfunction decrementOrRemoveEntry(map, k) {\n if (!--map[k]) { delete map[k]; }\n}\n\nfunction edgeArgsToId(isDirected, v_, w_, name) {\n var v = \"\" + v_;\n var w = \"\" + w_;\n if (!isDirected && v > w) {\n var tmp = v;\n v = w;\n w = tmp;\n }\n return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +\n (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);\n}\n\nfunction edgeArgsToObj(isDirected, v_, w_, name) {\n var v = \"\" + v_;\n var w = \"\" + w_;\n if (!isDirected && v > w) {\n var tmp = v;\n v = w;\n w = tmp;\n }\n var edgeObj = { v: v, w: w };\n if (name) {\n edgeObj.name = name;\n }\n return edgeObj;\n}\n\nfunction edgeObjToId(isDirected, edgeObj) {\n return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);\n}\n","module.exports = '2.1.8';\n","// Includes only the \"core\" of graphlib\nmodule.exports = {\n Graph: require(\"./graph\"),\n version: require(\"./version\")\n};\n","var _ = require(\"./lodash\");\nvar Graph = require(\"./graph\");\n\nmodule.exports = {\n write: write,\n read: read\n};\n\nfunction write(g) {\n var json = {\n options: {\n directed: g.isDirected(),\n multigraph: g.isMultigraph(),\n compound: g.isCompound()\n },\n nodes: writeNodes(g),\n edges: writeEdges(g)\n };\n if (!_.isUndefined(g.graph())) {\n json.value = _.clone(g.graph());\n }\n return json;\n}\n\nfunction writeNodes(g) {\n return _.map(g.nodes(), function(v) {\n var nodeValue = g.node(v);\n var parent = g.parent(v);\n var node = { v: v };\n if (!_.isUndefined(nodeValue)) {\n node.value = nodeValue;\n }\n if (!_.isUndefined(parent)) {\n node.parent = parent;\n }\n return node;\n });\n}\n\nfunction writeEdges(g) {\n return _.map(g.edges(), function(e) {\n var edgeValue = g.edge(e);\n var edge = { v: e.v, w: e.w };\n if (!_.isUndefined(e.name)) {\n edge.name = e.name;\n }\n if (!_.isUndefined(edgeValue)) {\n edge.value = edgeValue;\n }\n return edge;\n });\n}\n\nfunction read(json) {\n var g = new Graph(json.options).setGraph(json.value);\n _.each(json.nodes, function(entry) {\n g.setNode(entry.v, entry.value);\n if (entry.parent) {\n g.setParent(entry.v, entry.parent);\n }\n });\n _.each(json.edges, function(entry) {\n g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n });\n return g;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = components;\n\nfunction components(g) {\n var visited = {};\n var cmpts = [];\n var cmpt;\n\n function dfs(v) {\n if (_.has(visited, v)) return;\n visited[v] = true;\n cmpt.push(v);\n _.each(g.successors(v), dfs);\n _.each(g.predecessors(v), dfs);\n }\n\n _.each(g.nodes(), function(v) {\n cmpt = [];\n dfs(v);\n if (cmpt.length) {\n cmpts.push(cmpt);\n }\n });\n\n return cmpts;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = PriorityQueue;\n\n/\n A min-priority queue data structure. This algorithm is derived from Cormen,\n * et al., \"Introduction to Algorithms\". The basic idea of a min-priority\n * queue is that you can efficiently (in O(1) time) get the smallest key in\n * the queue. Adding and removing elements takes O(log n) time. A key can\n * have its priority decreased in O(log n) time.\n /\nfunction PriorityQueue() {\n this._arr = [];\n this._keyIndices = {};\n}\n\n/\n Returns the number of elements in the queue. Takes `O(1)` time.\n /\nPriorityQueue.prototype.size = function() {\n return this._arr.length;\n};\n\n/\n Returns the keys that are in the queue. Takes `O(n)` time.\n /\nPriorityQueue.prototype.keys = function() {\n return this._arr.map(function(x) { return x.key; });\n};\n\n/\n Returns `true` if key is in the queue and `false` if not.\n /\nPriorityQueue.prototype.has = function(key) {\n return _.has(this._keyIndices, key);\n};\n\n/\n Returns the priority for key. If key is not present in the queue\n * then this function returns `undefined`. Takes `O(1)` time.\n \n @param {Object} key\n /\nPriorityQueue.prototype.priority = function(key) {\n var index = this._keyIndices[key];\n if (index !== undefined) {\n return this._arr[index].priority;\n }\n};\n\n/\n Returns the key for the minimum element in this queue. If the queue is\n * empty this function throws an Error. Takes `O(1)` time.\n /\nPriorityQueue.prototype.min = function() {\n if (this.size() === 0) {\n throw new Error(\"Queue underflow\");\n }\n return this._arr[0].key;\n};\n\n/\n Inserts a new key into the priority queue. If the key already exists in\n * the queue this function returns `false`; otherwise it will return `true`.\n * Takes `O(n)` time.\n \n @param {Object} key the key to add\n * @param {Number} priority the initial priority for the key\n /\nPriorityQueue.prototype.add = function(key, priority) {\n var keyIndices = this._keyIndices;\n key = String(key);\n if (!_.has(keyIndices, key)) {\n var arr = this._arr;\n var index = arr.length;\n keyIndices[key] = index;\n arr.push({key: key, priority: priority});\n this._decrease(index);\n return true;\n }\n return false;\n};\n\n/\n Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n /\nPriorityQueue.prototype.removeMin = function() {\n this._swap(0, this._arr.length - 1);\n var min = this._arr.pop();\n delete this._keyIndices[min.key];\n this._heapify(0);\n return min.key;\n};\n\n/\n Decreases the priority for key to priority. If the new priority is\n * greater than the previous priority, this function will throw an Error.\n \n @param {Object} key the key for which to raise priority\n * @param {Number} priority the new priority for the key\n /\nPriorityQueue.prototype.decrease = function(key, priority) {\n var index = this._keyIndices[key];\n if (priority > this._arr[index].priority) {\n throw new Error(\"New priority is greater than current priority. \" +\n \"Key: \" + key + \" Old: \" + this._arr[index].priority + \" New: \" + priority);\n }\n this._arr[index].priority = priority;\n this._decrease(index);\n};\n\nPriorityQueue.prototype._heapify = function(i) {\n var arr = this._arr;\n var l = 2 i;\n var r = l + 1;\n var largest = i;\n if (l < arr.length) {\n largest = arr[l].priority < arr[largest].priority ? l : largest;\n if (r < arr.length) {\n largest = arr[r].priority < arr[largest].priority ? r : largest;\n }\n if (largest !== i) {\n this._swap(i, largest);\n this._heapify(largest);\n }\n }\n};\n\nPriorityQueue.prototype._decrease = function(index) {\n var arr = this._arr;\n var priority = arr[index].priority;\n var parent;\n while (index !== 0) {\n parent = index >> 1;\n if (arr[parent].priority < priority) {\n break;\n }\n this._swap(index, parent);\n index = parent;\n }\n};\n\nPriorityQueue.prototype._swap = function(i, j) {\n var arr = this._arr;\n var keyIndices = this._keyIndices;\n var origArrI = arr[i];\n var origArrJ = arr[j];\n arr[i] = origArrJ;\n arr[j] = origArrI;\n keyIndices[origArrJ.key] = i;\n keyIndices[origArrI.key] = j;\n};\n","var _ = require(\"../lodash\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = dijkstra;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction dijkstra(g, source, weightFn, edgeFn) {\n return runDijkstra(g, String(source),\n weightFn \|\| DEFAULT_WEIGHT_FUNC,\n edgeFn \|\| function(v) { return g.outEdges(v); });\n}\n\nfunction runDijkstra(g, source, weightFn, edgeFn) {\n var results = {};\n var pq = new PriorityQueue();\n var v, vEntry;\n\n var updateNeighbors = function(edge) {\n var w = edge.v !== v ? edge.v : edge.w;\n var wEntry = results[w];\n var weight = weightFn(edge);\n var distance = vEntry.distance + weight;\n\n if (weight < 0) {\n throw new Error(\"dijkstra does not allow negative edge weights. \" +\n \"Bad edge: \" + edge + \" Weight: \" + weight);\n }\n\n if (distance < wEntry.distance) {\n wEntry.distance = distance;\n wEntry.predecessor = v;\n pq.decrease(w, distance);\n }\n };\n\n g.nodes().forEach(function(v) {\n var distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n results[v] = { distance: distance };\n pq.add(v, distance);\n });\n\n while (pq.size() > 0) {\n v = pq.removeMin();\n vEntry = results[v];\n if (vEntry.distance === Number.POSITIVE_INFINITY) {\n break;\n }\n\n edgeFn(v).forEach(updateNeighbors);\n }\n\n return results;\n}\n","var dijkstra = require(\"./dijkstra\");\nvar _ = require(\"../lodash\");\n\nmodule.exports = dijkstraAll;\n\nfunction dijkstraAll(g, weightFunc, edgeFunc) {\n return _.transform(g.nodes(), function(acc, v) {\n acc[v] = dijkstra(g, v, weightFunc, edgeFunc);\n }, {});\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = tarjan;\n\nfunction tarjan(g) {\n var index = 0;\n var stack = [];\n var visited = {}; // node id -> { onStack, lowlink, index }\n var results = [];\n\n function dfs(v) {\n var entry = visited[v] = {\n onStack: true,\n lowlink: index,\n index: index++\n };\n stack.push(v);\n\n g.successors(v).forEach(function(w) {\n if (!_.has(visited, w)) {\n dfs(w);\n entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);\n } else if (visited[w].onStack) {\n entry.lowlink = Math.min(entry.lowlink, visited[w].index);\n }\n });\n\n if (entry.lowlink === entry.index) {\n var cmpt = [];\n var w;\n do {\n w = stack.pop();\n visited[w].onStack = false;\n cmpt.push(w);\n } while (v !== w);\n results.push(cmpt);\n }\n }\n\n g.nodes().forEach(function(v) {\n if (!_.has(visited, v)) {\n dfs(v);\n }\n });\n\n return results;\n}\n","var _ = require(\"../lodash\");\nvar tarjan = require(\"./tarjan\");\n\nmodule.exports = findCycles;\n\nfunction findCycles(g) {\n return _.filter(tarjan(g), function(cmpt) {\n return cmpt.length > 1 \|\| (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n });\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = floydWarshall;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction floydWarshall(g, weightFn, edgeFn) {\n return runFloydWarshall(g,\n weightFn \|\| DEFAULT_WEIGHT_FUNC,\n edgeFn \|\| function(v) { return g.outEdges(v); });\n}\n\nfunction runFloydWarshall(g, weightFn, edgeFn) {\n var results = {};\n var nodes = g.nodes();\n\n nodes.forEach(function(v) {\n results[v] = {};\n results[v][v] = { distance: 0 };\n nodes.forEach(function(w) {\n if (v !== w) {\n results[v][w] = { distance: Number.POSITIVE_INFINITY };\n }\n });\n edgeFn(v).forEach(function(edge) {\n var w = edge.v === v ? edge.w : edge.v;\n var d = weightFn(edge);\n results[v][w] = { distance: d, predecessor: v };\n });\n });\n\n nodes.forEach(function(k) {\n var rowK = results[k];\n nodes.forEach(function(i) {\n var rowI = results[i];\n nodes.forEach(function(j) {\n var ik = rowI[k];\n var kj = rowK[j];\n var ij = rowI[j];\n var altDistance = ik.distance + kj.distance;\n if (altDistance < ij.distance) {\n ij.distance = altDistance;\n ij.predecessor = kj.predecessor;\n }\n });\n });\n });\n\n return results;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = topsort;\ntopsort.CycleException = CycleException;\n\nfunction topsort(g) {\n var visited = {};\n var stack = {};\n var results = [];\n\n function visit(node) {\n if (_.has(stack, node)) {\n throw new CycleException();\n }\n\n if (!_.has(visited, node)) {\n stack[node] = true;\n visited[node] = true;\n _.each(g.predecessors(node), visit);\n delete stack[node];\n results.push(node);\n }\n }\n\n _.each(g.sinks(), visit);\n\n if (_.size(visited) !== g.nodeCount()) {\n throw new CycleException();\n }\n\n return results;\n}\n\nfunction CycleException() {}\nCycleException.prototype = new Error(); // must be an instance of Error to pass testing","var topsort = require(\"./topsort\");\n\nmodule.exports = isAcyclic;\n\nfunction isAcyclic(g) {\n try {\n topsort(g);\n } catch (e) {\n if (e instanceof topsort.CycleException) {\n return false;\n }\n throw e;\n }\n return true;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = dfs;\n\n/\n A helper that preforms a pre- or post-order traversal on the input graph\n * and returns the nodes in the order they were visited. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n \n Order must be one of \"pre\" or \"post\".\n /\nfunction dfs(g, vs, order) {\n if (!_.isArray(vs)) {\n vs = [vs];\n }\n\n var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);\n\n var acc = [];\n var visited = {};\n _.each(vs, function(v) {\n if (!g.hasNode(v)) {\n throw new Error(\"Graph does not have node: \" + v);\n }\n\n doDfs(g, v, order === \"post\", visited, navigation, acc);\n });\n return acc;\n}\n\nfunction doDfs(g, v, postorder, visited, navigation, acc) {\n if (!_.has(visited, v)) {\n visited[v] = true;\n\n if (!postorder) { acc.push(v); }\n _.each(navigation(v), function(w) {\n doDfs(g, w, postorder, visited, navigation, acc);\n });\n if (postorder) { acc.push(v); }\n }\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = postorder;\n\nfunction postorder(g, vs) {\n return dfs(g, vs, \"post\");\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = preorder;\n\nfunction preorder(g, vs) {\n return dfs(g, vs, \"pre\");\n}\n","var _ = require(\"../lodash\");\nvar Graph = require(\"../graph\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = prim;\n\nfunction prim(g, weightFunc) {\n var result = new Graph();\n var parents = {};\n var pq = new PriorityQueue();\n var v;\n\n function updateNeighbors(edge) {\n var w = edge.v === v ? edge.w : edge.v;\n var pri = pq.priority(w);\n if (pri !== undefined) {\n var edgeWeight = weightFunc(edge);\n if (edgeWeight < pri) {\n parents[w] = v;\n pq.decrease(w, edgeWeight);\n }\n }\n }\n\n if (g.nodeCount() === 0) {\n return result;\n }\n\n _.each(g.nodes(), function(v) {\n pq.add(v, Number.POSITIVE_INFINITY);\n result.setNode(v);\n });\n\n // Start from an arbitrary node\n pq.decrease(g.nodes()[0], 0);\n\n var init = false;\n while (pq.size() > 0) {\n v = pq.removeMin();\n if (_.has(parents, v)) {\n result.setEdge(v, parents[v]);\n } else if (init) {\n throw new Error(\"Input graph is not connected: \" + g);\n } else {\n init = true;\n }\n\n g.nodeEdges(v).forEach(updateNeighbors);\n }\n\n return result;\n}\n","module.exports = {\n components: require(\"./components\"),\n dijkstra: require(\"./dijkstra\"),\n dijkstraAll: require(\"./dijkstra-all\"),\n findCycles: require(\"./find-cycles\"),\n floydWarshall: require(\"./floyd-warshall\"),\n isAcyclic: require(\"./is-acyclic\"),\n postorder: require(\"./postorder\"),\n preorder: require(\"./preorder\"),\n prim: require(\"./prim\"),\n tarjan: require(\"./tarjan\"),\n topsort: require(\"./topsort\")\n};\n","/\n Copyright (c) 2014, Chris Pettitt\n * All rights reserved.\n \n Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n \n 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n \n 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n \n 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n \n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n /\n\nvar lib = require(\"./lib\");\n\nmodule.exports = {\n Graph: lib.Graph,\n json: require(\"./lib/json\"),\n alg: require(\"./lib/alg\"),\n version: lib.version\n};\n","/ global window /\n\nvar graphlib;\n\nif (typeof require === \"function\") {\n try {\n graphlib = require(\"graphlib\");\n } catch (e) {\n // continue regardless of error\n }\n}\n\nif (!graphlib) {\n graphlib = window.graphlib;\n}\n\nmodule.exports = graphlib;\n","var eq = require('./eq'),\n isArrayLike = require('./isArrayLike'),\n isIndex = require('./_isIndex'),\n isObject = require('./isObject');\n\n/\n Checks if the given arguments are from an iteratee call.\n \n @private\n * @param {} value The potential iteratee value argument.\n @param {} index The potential iteratee index or key argument.\n @param {} object The potential iteratee object argument.\n @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n * else `false`.\n /\nfunction isIterateeCall(value, index, object) {\n if (!isObject(object)) {\n return false;\n }\n var type = typeof index;\n if (type == 'number'\n ? (isArrayLike(object) && isIndex(index, object.length))\n : (type == 'string' && index in object)\n ) {\n return eq(object[index], value);\n }\n return false;\n}\n\nmodule.exports = isIterateeCall;\n","var baseRest = require('./_baseRest'),\n eq = require('./eq'),\n isIterateeCall = require('./_isIterateeCall'),\n keysIn = require('./keysIn');\n\n/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n \n Note: This method mutates `object`.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n \n _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n /\nvar defaults = baseRest(function(object, sources) {\n object = Object(object);\n\n var index = -1;\n var length = sources.length;\n var guard = length > 2 ? sources[2] : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n length = 1;\n }\n\n while (++index < length) {\n var source = sources[index];\n var props = keysIn(source);\n var propsIndex = -1;\n var propsLength = props.length;\n\n while (++propsIndex < propsLength) {\n var key = props[propsIndex];\n var value = object[key];\n\n if (value === undefined \|\|\n (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n object[key] = source[key];\n }\n }\n }\n\n return object;\n});\n\nmodule.exports = defaults;\n","var baseIteratee = require('./_baseIteratee'),\n isArrayLike = require('./isArrayLike'),\n keys = require('./keys');\n\n/\n Creates a `_.find` or `_.findLast` function.\n \n @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n /\nfunction createFind(findIndexFunc) {\n return function(collection, predicate, fromIndex) {\n var iterable = Object(collection);\n if (!isArrayLike(collection)) {\n var iteratee = baseIteratee(predicate, 3);\n collection = keys(collection);\n predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n }\n var index = findIndexFunc(collection, predicate, fromIndex);\n return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n };\n}\n\nmodule.exports = createFind;\n","/* Used to match a single whitespace character. /\nvar reWhitespace = /\\s/;\n\n/\n Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n \n @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n /\nfunction trimmedEndIndex(string) {\n var index = string.length;\n\n while (index-- && reWhitespace.test(string.charAt(index))) {}\n return index;\n}\n\nmodule.exports = trimmedEndIndex;\n","var trimmedEndIndex = require('./_trimmedEndIndex');\n\n/* Used to match leading whitespace. /\nvar reTrimStart = /^\\s+/;\n\n/\n The base implementation of `_.trim`.\n \n @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n /\nfunction baseTrim(string) {\n return string\n ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n : string;\n}\n\nmodule.exports = baseTrim;\n","var baseTrim = require('./_baseTrim'),\n isObject = require('./isObject'),\n isSymbol = require('./isSymbol');\n\n/* Used as references for various `Number` constants. /\nvar NAN = 0 / 0;\n\n/* Used to detect bad signed hexadecimal string values. /\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/* Used to detect binary string values. /\nvar reIsBinary = /^0b[01]+$/i;\n\n/* Used to detect octal string values. /\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/* Built-in method references without a dependency on `root`. /\nvar freeParseInt = parseInt;\n\n/\n Converts `value` to a number.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to process.\n @returns {number} Returns the number.\n * @example\n \n _.toNumber(3.2);\n * // => 3.2\n \n _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n \n _.toNumber(Infinity);\n * // => Infinity\n \n _.toNumber('3.2');\n * // => 3.2\n /\nfunction toNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n if (isObject(value)) {\n var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n value = isObject(other) ? (other + '') : other;\n }\n if (typeof value != 'string') {\n return value === 0 ? value : +value;\n }\n value = baseTrim(value);\n var isBinary = reIsBinary.test(value);\n return (isBinary \|\| reIsOctal.test(value))\n ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = toNumber;\n","var toNumber = require('./toNumber');\n\n/* Used as references for various `Number` constants. /\nvar INFINITY = 1 / 0,\n MAX_INTEGER = 1.7976931348623157e+308;\n\n/\n Converts `value` to a finite number.\n \n @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {} value The value to convert.\n @returns {number} Returns the converted number.\n * @example\n \n _.toFinite(3.2);\n * // => 3.2\n \n _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n \n _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n \n _.toFinite('3.2');\n * // => 3.2\n /\nfunction toFinite(value) {\n if (!value) {\n return value === 0 ? value : 0;\n }\n value = toNumber(value);\n if (value === INFINITY \|\| value === -INFINITY) {\n var sign = (value < 0 ? -1 : 1);\n return sign MAX_INTEGER;\n }\n return value === value ? value : 0;\n}\n\nmodule.exports = toFinite;\n","var toFinite = require('./toFinite');\n\n/*\n Converts `value` to an integer.\n \n Note: This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to convert.\n @returns {number} Returns the converted integer.\n * @example\n \n _.toInteger(3.2);\n * // => 3\n \n _.toInteger(Number.MIN_VALUE);\n * // => 0\n \n _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n \n _.toInteger('3.2');\n * // => 3\n /\nfunction toInteger(value) {\n var result = toFinite(value),\n remainder = result % 1;\n\n return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nmodule.exports = toInteger;\n","var baseFindIndex = require('./_baseFindIndex'),\n baseIteratee = require('./_baseIteratee'),\n toInteger = require('./toInteger');\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeMax = Math.max;\n\n/\n This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n \n @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n \n var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n \n _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n \n // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n \n // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n \n // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n /\nfunction findIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseFindIndex(array, baseIteratee(predicate, 3), index);\n}\n\nmodule.exports = findIndex;\n","var createFind = require('./_createFind'),\n findIndex = require('./findIndex');\n\n/\n Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index\|key, collection).\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {} Returns the matched element, else `undefined`.\n @example\n \n var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false },\n * { 'user': 'pebbles', 'age': 1, 'active': true }\n * ];\n \n _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n \n // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n \n // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n \n // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n /\nvar find = createFind(findIndex);\n\nmodule.exports = find;\n","var baseFlatten = require('./_baseFlatten');\n\n/\n Flattens `array` a single level deep.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n \n _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n /\nfunction flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n}\n\nmodule.exports = flatten;\n","var baseFor = require('./_baseFor'),\n castFunction = require('./_castFunction'),\n keysIn = require('./keysIn');\n\n/\n Iterates over own and inherited enumerable string keyed properties of an\n * object and invokes `iteratee` for each property. The iteratee is invoked\n * with three arguments: (value, key, object). Iteratee functions may exit\n * iteration early by explicitly returning `false`.\n \n @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forInRight\n * @example\n \n function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n \n Foo.prototype.c = 3;\n \n _.forIn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n /\nfunction forIn(object, iteratee) {\n return object == null\n ? object\n : baseFor(object, castFunction(iteratee), keysIn);\n}\n\nmodule.exports = forIn;\n","/\n Gets the last element of `array`.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {} Returns the last element of `array`.\n @example\n \n _.last([1, 2, 3]);\n * // => 3\n /\nfunction last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n}\n\nmodule.exports = last;\n","var isSymbol = require('./isSymbol');\n\n/\n The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n \n @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {} Returns the extremum value.\n /\nfunction baseExtremum(array, iteratee, comparator) {\n var index = -1,\n length = array.length;\n\n while (++index < length) {\n var value = array[index],\n current = iteratee(value);\n\n if (current != null && (computed === undefined\n ? (current === current && !isSymbol(current))\n : comparator(current, computed)\n )) {\n var computed = current,\n result = value;\n }\n }\n return result;\n}\n\nmodule.exports = baseExtremum;\n","/*\n The base implementation of `_.gt` which doesn't coerce arguments.\n \n @private\n * @param {} value The value to compare.\n @param {} other The other value to compare.\n @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n /\nfunction baseGt(value, other) {\n return value > other;\n}\n\nmodule.exports = baseGt;\n","var baseExtremum = require('./_baseExtremum'),\n baseGt = require('./_baseGt'),\n identity = require('./identity');\n\n/\n Computes the maximum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {} Returns the maximum value.\n @example\n \n _.max([4, 2, 8, 6]);\n * // => 8\n \n _.max([]);\n * // => undefined\n /\nfunction max(array) {\n return (array && array.length)\n ? baseExtremum(array, identity, baseGt)\n : undefined;\n}\n\nmodule.exports = max;\n","var baseAssignValue = require('./_baseAssignValue'),\n eq = require('./eq');\n\n/\n This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n \n @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {} value The value to assign.\n /\nfunction assignMergeValue(object, key, value) {\n if ((value !== undefined && !eq(object[key], value)) \|\|\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n}\n\nmodule.exports = assignMergeValue;\n","var baseGetTag = require('./_baseGetTag'),\n getPrototype = require('./_getPrototype'),\n isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. /\nvar objectTag = '[object Object]';\n\n/* Used for built-in method references. /\nvar funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n/* Used to resolve the decompiled source of functions. /\nvar funcToString = funcProto.toString;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/* Used to infer the `Object` constructor. /\nvar objectCtorString = funcToString.call(Object);\n\n/\n Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n \n @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n \n function Foo() {\n * this.a = 1;\n * }\n \n _.isPlainObject(new Foo);\n * // => false\n \n _.isPlainObject([1, 2, 3]);\n * // => false\n \n _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n \n _.isPlainObject(Object.create(null));\n * // => true\n /\nfunction isPlainObject(value) {\n if (!isObjectLike(value) \|\| baseGetTag(value) != objectTag) {\n return false;\n }\n var proto = getPrototype(value);\n if (proto === null) {\n return true;\n }\n var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n funcToString.call(Ctor) == objectCtorString;\n}\n\nmodule.exports = isPlainObject;\n","/\n Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n \n @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {} Returns the property value.\n /\nfunction safeGet(object, key) {\n if (key === 'constructor' && typeof object[key] === 'function') {\n return;\n }\n\n if (key == '__proto__') {\n return;\n }\n\n return object[key];\n}\n\nmodule.exports = safeGet;\n","var copyObject = require('./_copyObject'),\n keysIn = require('./keysIn');\n\n/*\n Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n \n @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {} value The value to convert.\n @returns {Object} Returns the converted plain object.\n * @example\n \n function Foo() {\n * this.b = 2;\n * }\n \n Foo.prototype.c = 3;\n \n _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n \n _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n /\nfunction toPlainObject(value) {\n return copyObject(value, keysIn(value));\n}\n\nmodule.exports = toPlainObject;\n","var assignMergeValue = require('./_assignMergeValue'),\n cloneBuffer = require('./_cloneBuffer'),\n cloneTypedArray = require('./_cloneTypedArray'),\n copyArray = require('./_copyArray'),\n initCloneObject = require('./_initCloneObject'),\n isArguments = require('./isArguments'),\n isArray = require('./isArray'),\n isArrayLikeObject = require('./isArrayLikeObject'),\n isBuffer = require('./isBuffer'),\n isFunction = require('./isFunction'),\n isObject = require('./isObject'),\n isPlainObject = require('./isPlainObject'),\n isTypedArray = require('./isTypedArray'),\n safeGet = require('./_safeGet'),\n toPlainObject = require('./toPlainObject');\n\n/\n A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n \n @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n /\nfunction baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n var objValue = safeGet(object, key),\n srcValue = safeGet(source, key),\n stacked = stack.get(srcValue);\n\n if (stacked) {\n assignMergeValue(object, key, stacked);\n return;\n }\n var newValue = customizer\n ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n : undefined;\n\n var isCommon = newValue === undefined;\n\n if (isCommon) {\n var isArr = isArray(srcValue),\n isBuff = !isArr && isBuffer(srcValue),\n isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n newValue = srcValue;\n if (isArr \|\| isBuff \|\| isTyped) {\n if (isArray(objValue)) {\n newValue = objValue;\n }\n else if (isArrayLikeObject(objValue)) {\n newValue = copyArray(objValue);\n }\n else if (isBuff) {\n isCommon = false;\n newValue = cloneBuffer(srcValue, true);\n }\n else if (isTyped) {\n isCommon = false;\n newValue = cloneTypedArray(srcValue, true);\n }\n else {\n newValue = [];\n }\n }\n else if (isPlainObject(srcValue) \|\| isArguments(srcValue)) {\n newValue = objValue;\n if (isArguments(objValue)) {\n newValue = toPlainObject(objValue);\n }\n else if (!isObject(objValue) \|\| isFunction(objValue)) {\n newValue = initCloneObject(srcValue);\n }\n }\n else {\n isCommon = false;\n }\n }\n if (isCommon) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, newValue);\n mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n stack['delete'](srcValue);\n }\n assignMergeValue(object, key, newValue);\n}\n\nmodule.exports = baseMergeDeep;\n","var Stack = require('./_Stack'),\n assignMergeValue = require('./_assignMergeValue'),\n baseFor = require('./_baseFor'),\n baseMergeDeep = require('./_baseMergeDeep'),\n isObject = require('./isObject'),\n keysIn = require('./keysIn'),\n safeGet = require('./_safeGet');\n\n/\n The base implementation of `_.merge` without support for multiple sources.\n \n @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n /\nfunction baseMerge(object, source, srcIndex, customizer, stack) {\n if (object === source) {\n return;\n }\n baseFor(source, function(srcValue, key) {\n stack \|\| (stack = new Stack);\n if (isObject(srcValue)) {\n baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n }\n else {\n var newValue = customizer\n ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n : undefined;\n\n if (newValue === undefined) {\n newValue = srcValue;\n }\n assignMergeValue(object, key, newValue);\n }\n }, keysIn);\n}\n\nmodule.exports = baseMerge;\n","var baseRest = require('./_baseRest'),\n isIterateeCall = require('./_isIterateeCall');\n\n/\n Creates a function like `_.assign`.\n \n @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n /\nfunction createAssigner(assigner) {\n return baseRest(function(object, sources) {\n var index = -1,\n length = sources.length,\n customizer = length > 1 ? sources[length - 1] : undefined,\n guard = length > 2 ? sources[2] : undefined;\n\n customizer = (assigner.length > 3 && typeof customizer == 'function')\n ? (length--, customizer)\n : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n customizer = length < 3 ? undefined : customizer;\n length = 1;\n }\n object = Object(object);\n while (++index < length) {\n var source = sources[index];\n if (source) {\n assigner(object, source, index, customizer);\n }\n }\n return object;\n });\n}\n\nmodule.exports = createAssigner;\n","var baseMerge = require('./_baseMerge'),\n createAssigner = require('./_createAssigner');\n\n/\n This method is like `_.assign` except that it recursively merges own and\n * inherited enumerable string keyed properties of source objects into the\n * destination object. Source properties that resolve to `undefined` are\n * skipped if a destination value exists. Array and plain object properties\n * are merged recursively. Other objects and value types are overridden by\n * assignment. Source objects are applied from left to right. Subsequent\n * sources overwrite property assignments of previous sources.\n \n Note: This method mutates `object`.\n \n @static\n * @memberOf _\n * @since 0.5.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @example\n \n var object = {\n * 'a': [{ 'b': 2 }, { 'd': 4 }]\n * };\n \n var other = {\n * 'a': [{ 'c': 3 }, { 'e': 5 }]\n * };\n \n _.merge(object, other);\n * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n /\nvar merge = createAssigner(function(object, source, srcIndex) {\n baseMerge(object, source, srcIndex);\n});\n\nmodule.exports = merge;\n","/\n The base implementation of `_.lt` which doesn't coerce arguments.\n \n @private\n * @param {} value The value to compare.\n @param {} other The other value to compare.\n @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n /\nfunction baseLt(value, other) {\n return value < other;\n}\n\nmodule.exports = baseLt;\n","var baseExtremum = require('./_baseExtremum'),\n baseLt = require('./_baseLt'),\n identity = require('./identity');\n\n/\n Computes the minimum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {} Returns the minimum value.\n @example\n \n _.min([4, 2, 8, 6]);\n * // => 2\n \n _.min([]);\n * // => undefined\n /\nfunction min(array) {\n return (array && array.length)\n ? baseExtremum(array, identity, baseLt)\n : undefined;\n}\n\nmodule.exports = min;\n","var baseExtremum = require('./_baseExtremum'),\n baseIteratee = require('./_baseIteratee'),\n baseLt = require('./_baseLt');\n\n/\n This method is like `_.min` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {} Returns the minimum value.\n @example\n \n var objects = [{ 'n': 1 }, { 'n': 2 }];\n \n _.minBy(objects, function(o) { return o.n; });\n * // => { 'n': 1 }\n \n // The `_.property` iteratee shorthand.\n * _.minBy(objects, 'n');\n * // => { 'n': 1 }\n /\nfunction minBy(array, iteratee) {\n return (array && array.length)\n ? baseExtremum(array, baseIteratee(iteratee, 2), baseLt)\n : undefined;\n}\n\nmodule.exports = minBy;\n","var root = require('./_root');\n\n/\n Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n \n @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n \n _.defer(function(stamp) {\n * console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n /\nvar now = function() {\n return root.Date.now();\n};\n\nmodule.exports = now;\n","var assignValue = require('./_assignValue'),\n castPath = require('./_castPath'),\n isIndex = require('./_isIndex'),\n isObject = require('./isObject'),\n toKey = require('./_toKey');\n\n/\n The base implementation of `_.set`.\n \n @private\n * @param {Object} object The object to modify.\n * @param {Array\|string} path The path of the property to set.\n * @param {} value The value to set.\n @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n /\nfunction baseSet(object, path, value, customizer) {\n if (!isObject(object)) {\n return object;\n }\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n lastIndex = length - 1,\n nested = object;\n\n while (nested != null && ++index < length) {\n var key = toKey(path[index]),\n newValue = value;\n\n if (key === '__proto__' \|\| key === 'constructor' \|\| key === 'prototype') {\n return object;\n }\n\n if (index != lastIndex) {\n var objValue = nested[key];\n newValue = customizer ? customizer(objValue, key, nested) : undefined;\n if (newValue === undefined) {\n newValue = isObject(objValue)\n ? objValue\n : (isIndex(path[index + 1]) ? [] : {});\n }\n }\n assignValue(nested, key, newValue);\n nested = nested[key];\n }\n return object;\n}\n\nmodule.exports = baseSet;\n","var baseGet = require('./_baseGet'),\n baseSet = require('./_baseSet'),\n castPath = require('./_castPath');\n\n/\n The base implementation of `_.pickBy` without support for iteratee shorthands.\n \n @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n /\nfunction basePickBy(object, paths, predicate) {\n var index = -1,\n length = paths.length,\n result = {};\n\n while (++index < length) {\n var path = paths[index],\n value = baseGet(object, path);\n\n if (predicate(value, path)) {\n baseSet(result, castPath(path, object), value);\n }\n }\n return result;\n}\n\nmodule.exports = basePickBy;\n","var basePickBy = require('./_basePickBy'),\n hasIn = require('./hasIn');\n\n/\n The base implementation of `_.pick` without support for individual\n * property identifiers.\n \n @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n /\nfunction basePick(object, paths) {\n return basePickBy(object, paths, function(value, path) {\n return hasIn(object, path);\n });\n}\n\nmodule.exports = basePick;\n","var flatten = require('./flatten'),\n overRest = require('./_overRest'),\n setToString = require('./_setToString');\n\n/\n A specialized version of `baseRest` which flattens the rest array.\n \n @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n /\nfunction flatRest(func) {\n return setToString(overRest(func, undefined, flatten), func + '');\n}\n\nmodule.exports = flatRest;\n","var basePick = require('./_basePick'),\n flatRest = require('./_flatRest');\n\n/\n Creates an object composed of the picked `object` properties.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string\|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n \n var object = { 'a': 1, 'b': '2', 'c': 3 };\n \n _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n /\nvar pick = flatRest(function(object, paths) {\n return object == null ? {} : basePick(object, paths);\n});\n\nmodule.exports = pick;\n","/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeCeil = Math.ceil,\n nativeMax = Math.max;\n\n/\n The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n \n @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n /\nfunction baseRange(start, end, step, fromRight) {\n var index = -1,\n length = nativeMax(nativeCeil((end - start) / (step \|\| 1)), 0),\n result = Array(length);\n\n while (length--) {\n result[fromRight ? length : ++index] = start;\n start += step;\n }\n return result;\n}\n\nmodule.exports = baseRange;\n","var baseRange = require('./_baseRange'),\n isIterateeCall = require('./_isIterateeCall'),\n toFinite = require('./toFinite');\n\n/\n Creates a `_.range` or `_.rangeRight` function.\n \n @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n /\nfunction createRange(fromRight) {\n return function(start, end, step) {\n if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n end = step = undefined;\n }\n // Ensure the sign of `-0` is preserved.\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n return baseRange(start, end, step, fromRight);\n };\n}\n\nmodule.exports = createRange;\n","var createRange = require('./_createRange');\n\n/\n Creates an array of numbers (positive and/or negative) progressing from\n * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n * `start` is specified without an `end` or `step`. If `end` is not specified,\n * it's set to `start` with `start` then set to `0`.\n \n Note: JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @param {number} [step=1] The value to increment or decrement by.\n * @returns {Array} Returns the range of numbers.\n * @see _.inRange, _.rangeRight\n * @example\n \n _.range(4);\n * // => [0, 1, 2, 3]\n \n _.range(-4);\n * // => [0, -1, -2, -3]\n \n _.range(1, 5);\n * // => [1, 2, 3, 4]\n \n _.range(0, 20, 5);\n * // => [0, 5, 10, 15]\n \n _.range(0, -4, -1);\n * // => [0, -1, -2, -3]\n \n _.range(1, 4, 0);\n * // => [1, 1, 1]\n \n _.range(0);\n * // => []\n /\nvar range = createRange();\n\nmodule.exports = range;\n","/\n The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n \n @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n /\nfunction baseSortBy(array, comparer) {\n var length = array.length;\n\n array.sort(comparer);\n while (length--) {\n array[length] = array[length].value;\n }\n return array;\n}\n\nmodule.exports = baseSortBy;\n","var isSymbol = require('./isSymbol');\n\n/\n Compares values to sort them in ascending order.\n \n @private\n * @param {} value The value to compare.\n @param {} other The other value to compare.\n @returns {number} Returns the sort order indicator for `value`.\n /\nfunction compareAscending(value, other) {\n if (value !== other) {\n var valIsDefined = value !== undefined,\n valIsNull = value === null,\n valIsReflexive = value === value,\n valIsSymbol = isSymbol(value);\n\n var othIsDefined = other !== undefined,\n othIsNull = other === null,\n othIsReflexive = other === other,\n othIsSymbol = isSymbol(other);\n\n if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) \|\|\n (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) \|\|\n (valIsNull && othIsDefined && othIsReflexive) \|\|\n (!valIsDefined && othIsReflexive) \|\|\n !valIsReflexive) {\n return 1;\n }\n if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) \|\|\n (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) \|\|\n (othIsNull && valIsDefined && valIsReflexive) \|\|\n (!othIsDefined && valIsReflexive) \|\|\n !othIsReflexive) {\n return -1;\n }\n }\n return 0;\n}\n\nmodule.exports = compareAscending;\n","var compareAscending = require('./_compareAscending');\n\n/\n Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n \n If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n \n @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]\|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n /\nfunction compareMultiple(object, other, orders) {\n var index = -1,\n objCriteria = object.criteria,\n othCriteria = other.criteria,\n length = objCriteria.length,\n ordersLength = orders.length;\n\n while (++index < length) {\n var result = compareAscending(objCriteria[index], othCriteria[index]);\n if (result) {\n if (index >= ordersLength) {\n return result;\n }\n var order = orders[index];\n return result (order == 'desc' ? -1 : 1);\n }\n }\n // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n // that causes it, under certain circumstances, to provide the same value for\n // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n // for more details.\n //\n // This also ensures a stable sort in V8 and other engines.\n // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n return object.index - other.index;\n}\n\nmodule.exports = compareMultiple;\n","var arrayMap = require('./_arrayMap'),\n baseGet = require('./_baseGet'),\n baseIteratee = require('./_baseIteratee'),\n baseMap = require('./_baseMap'),\n baseSortBy = require('./_baseSortBy'),\n baseUnary = require('./_baseUnary'),\n compareMultiple = require('./_compareMultiple'),\n identity = require('./identity'),\n isArray = require('./isArray');\n\n/*\n The base implementation of `_.orderBy` without param guards.\n \n @private\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function[]\|Object[]\|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n /\nfunction baseOrderBy(collection, iteratees, orders) {\n if (iteratees.length) {\n iteratees = arrayMap(iteratees, function(iteratee) {\n if (isArray(iteratee)) {\n return function(value) {\n return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n }\n }\n return iteratee;\n });\n } else {\n iteratees = [identity];\n }\n\n var index = -1;\n iteratees = arrayMap(iteratees, baseUnary(baseIteratee));\n\n var result = baseMap(collection, function(value, key, collection) {\n var criteria = arrayMap(iteratees, function(iteratee) {\n return iteratee(value);\n });\n return { 'criteria': criteria, 'index': ++index, 'value': value };\n });\n\n return baseSortBy(result, function(object, other) {\n return compareMultiple(object, other, orders);\n });\n}\n\nmodule.exports = baseOrderBy;\n","var baseFlatten = require('./_baseFlatten'),\n baseOrderBy = require('./_baseOrderBy'),\n baseRest = require('./_baseRest'),\n isIterateeCall = require('./_isIterateeCall');\n\n/\n Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {...(Function\|Function[])} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n \n var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 30 },\n * { 'user': 'barney', 'age': 34 }\n * ];\n \n _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n \n _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n /\nvar sortBy = baseRest(function(collection, iteratees) {\n if (collection == null) {\n return [];\n }\n var length = iteratees.length;\n if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n iteratees = [];\n } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n iteratees = [iteratees[0]];\n }\n return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n});\n\nmodule.exports = sortBy;\n","var toString = require('./toString');\n\n/* Used to generate unique IDs. /\nvar idCounter = 0;\n\n/\n Generates a unique ID. If `prefix` is given, the ID is appended to it.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {string} [prefix=''] The value to prefix the ID with.\n * @returns {string} Returns the unique ID.\n * @example\n \n _.uniqueId('contact_');\n * // => 'contact_104'\n \n _.uniqueId();\n * // => '105'\n /\nfunction uniqueId(prefix) {\n var id = ++idCounter;\n return toString(prefix) + id;\n}\n\nmodule.exports = uniqueId;\n","/\n This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n \n @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n /\nfunction baseZipObject(props, values, assignFunc) {\n var index = -1,\n length = props.length,\n valsLength = values.length,\n result = {};\n\n while (++index < length) {\n var value = index < valsLength ? values[index] : undefined;\n assignFunc(result, props[index], value);\n }\n return result;\n}\n\nmodule.exports = baseZipObject;\n","var assignValue = require('./_assignValue'),\n baseZipObject = require('./_baseZipObject');\n\n/\n This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n \n @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n \n _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n /\nfunction zipObject(props, values) {\n return baseZipObject(props \|\| [], values \|\| [], assignValue);\n}\n\nmodule.exports = zipObject;\n","/ global window /\n\nvar lodash;\n\nif (typeof require === \"function\") {\n try {\n lodash = {\n cloneDeep: require(\"lodash/cloneDeep\"),\n constant: require(\"lodash/constant\"),\n defaults: require(\"lodash/defaults\"),\n each: require(\"lodash/each\"),\n filter: require(\"lodash/filter\"),\n find: require(\"lodash/find\"),\n flatten: require(\"lodash/flatten\"),\n forEach: require(\"lodash/forEach\"),\n forIn: require(\"lodash/forIn\"),\n has: require(\"lodash/has\"),\n isUndefined: require(\"lodash/isUndefined\"),\n last: require(\"lodash/last\"),\n map: require(\"lodash/map\"),\n mapValues: require(\"lodash/mapValues\"),\n max: require(\"lodash/max\"),\n merge: require(\"lodash/merge\"),\n min: require(\"lodash/min\"),\n minBy: require(\"lodash/minBy\"),\n now: require(\"lodash/now\"),\n pick: require(\"lodash/pick\"),\n range: require(\"lodash/range\"),\n reduce: require(\"lodash/reduce\"),\n sortBy: require(\"lodash/sortBy\"),\n uniqueId: require(\"lodash/uniqueId\"),\n values: require(\"lodash/values\"),\n zipObject: require(\"lodash/zipObject\"),\n };\n } catch (e) {\n // continue regardless of error\n }\n}\n\nif (!lodash) {\n lodash = window._;\n}\n\nmodule.exports = lodash;\n","/\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n /\n\nmodule.exports = List;\n\nfunction List() {\n var sentinel = {};\n sentinel._next = sentinel._prev = sentinel;\n this._sentinel = sentinel;\n}\n\nList.prototype.dequeue = function() {\n var sentinel = this._sentinel;\n var entry = sentinel._prev;\n if (entry !== sentinel) {\n unlink(entry);\n return entry;\n }\n};\n\nList.prototype.enqueue = function(entry) {\n var sentinel = this._sentinel;\n if (entry._prev && entry._next) {\n unlink(entry);\n }\n entry._next = sentinel._next;\n sentinel._next._prev = entry;\n sentinel._next = entry;\n entry._prev = sentinel;\n};\n\nList.prototype.toString = function() {\n var strs = [];\n var sentinel = this._sentinel;\n var curr = sentinel._prev;\n while (curr !== sentinel) {\n strs.push(JSON.stringify(curr, filterOutLinks));\n curr = curr._prev;\n }\n return \"[\" + strs.join(\", \") + \"]\";\n};\n\nfunction unlink(entry) {\n entry._prev._next = entry._next;\n entry._next._prev = entry._prev;\n delete entry._next;\n delete entry._prev;\n}\n\nfunction filterOutLinks(k, v) {\n if (k !== \"_next\" && k !== \"_prev\") {\n return v;\n }\n}\n","var _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\nvar List = require(\"./data/list\");\n\n/\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n /\nmodule.exports = greedyFAS;\n\nvar DEFAULT_WEIGHT_FN = _.constant(1);\n\nfunction greedyFAS(g, weightFn) {\n if (g.nodeCount() <= 1) {\n return [];\n }\n var state = buildState(g, weightFn \|\| DEFAULT_WEIGHT_FN);\n var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n // Expand multi-edges\n return _.flatten(_.map(results, function(e) {\n return g.outEdges(e.v, e.w);\n }), true);\n}\n\nfunction doGreedyFAS(g, buckets, zeroIdx) {\n var results = [];\n var sources = buckets[buckets.length - 1];\n var sinks = buckets[0];\n\n var entry;\n while (g.nodeCount()) {\n while ((entry = sinks.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n if (g.nodeCount()) {\n for (var i = buckets.length - 2; i > 0; --i) {\n entry = buckets[i].dequeue();\n if (entry) {\n results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n break;\n }\n }\n }\n }\n\n return results;\n}\n\nfunction removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n var results = collectPredecessors ? [] : undefined;\n\n _.forEach(g.inEdges(entry.v), function(edge) {\n var weight = g.edge(edge);\n var uEntry = g.node(edge.v);\n\n if (collectPredecessors) {\n results.push({ v: edge.v, w: edge.w });\n }\n\n uEntry.out -= weight;\n assignBucket(buckets, zeroIdx, uEntry);\n });\n\n _.forEach(g.outEdges(entry.v), function(edge) {\n var weight = g.edge(edge);\n var w = edge.w;\n var wEntry = g.node(w);\n wEntry[\"in\"] -= weight;\n assignBucket(buckets, zeroIdx, wEntry);\n });\n\n g.removeNode(entry.v);\n\n return results;\n}\n\nfunction buildState(g, weightFn) {\n var fasGraph = new Graph();\n var maxIn = 0;\n var maxOut = 0;\n\n _.forEach(g.nodes(), function(v) {\n fasGraph.setNode(v, { v: v, \"in\": 0, out: 0 });\n });\n\n // Aggregate weights on nodes, but also sum the weights across multi-edges\n // into a single edge for the fasGraph.\n _.forEach(g.edges(), function(e) {\n var prevWeight = fasGraph.edge(e.v, e.w) \|\| 0;\n var weight = weightFn(e);\n var edgeWeight = prevWeight + weight;\n fasGraph.setEdge(e.v, e.w, edgeWeight);\n maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);\n maxIn = Math.max(maxIn, fasGraph.node(e.w)[\"in\"] += weight);\n });\n\n var buckets = _.range(maxOut + maxIn + 3).map(function() { return new List(); });\n var zeroIdx = maxIn + 1;\n\n _.forEach(fasGraph.nodes(), function(v) {\n assignBucket(buckets, zeroIdx, fasGraph.node(v));\n });\n\n return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };\n}\n\nfunction assignBucket(buckets, zeroIdx, entry) {\n if (!entry.out) {\n buckets[0].enqueue(entry);\n } else if (!entry[\"in\"]) {\n buckets[buckets.length - 1].enqueue(entry);\n } else {\n buckets[entry.out - entry[\"in\"] + zeroIdx].enqueue(entry);\n }\n}\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar greedyFAS = require(\"./greedy-fas\");\n\nmodule.exports = {\n run: run,\n undo: undo\n};\n\nfunction run(g) {\n var fas = (g.graph().acyclicer === \"greedy\"\n ? greedyFAS(g, weightFn(g))\n : dfsFAS(g));\n _.forEach(fas, function(e) {\n var label = g.edge(e);\n g.removeEdge(e);\n label.forwardName = e.name;\n label.reversed = true;\n g.setEdge(e.w, e.v, label, _.uniqueId(\"rev\"));\n });\n\n function weightFn(g) {\n return function(e) {\n return g.edge(e).weight;\n };\n }\n}\n\nfunction dfsFAS(g) {\n var fas = [];\n var stack = {};\n var visited = {};\n\n function dfs(v) {\n if (_.has(visited, v)) {\n return;\n }\n visited[v] = true;\n stack[v] = true;\n _.forEach(g.outEdges(v), function(e) {\n if (_.has(stack, e.w)) {\n fas.push(e);\n } else {\n dfs(e.w);\n }\n });\n delete stack[v];\n }\n\n _.forEach(g.nodes(), dfs);\n return fas;\n}\n\nfunction undo(g) {\n _.forEach(g.edges(), function(e) {\n var label = g.edge(e);\n if (label.reversed) {\n g.removeEdge(e);\n\n var forwardName = label.forwardName;\n delete label.reversed;\n delete label.forwardName;\n g.setEdge(e.w, e.v, label, forwardName);\n }\n });\n}\n","/ eslint \"no-console\": off /\n\n\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n addDummyNode: addDummyNode,\n simplify: simplify,\n asNonCompoundGraph: asNonCompoundGraph,\n successorWeights: successorWeights,\n predecessorWeights: predecessorWeights,\n intersectRect: intersectRect,\n buildLayerMatrix: buildLayerMatrix,\n normalizeRanks: normalizeRanks,\n removeEmptyRanks: removeEmptyRanks,\n addBorderNode: addBorderNode,\n maxRank: maxRank,\n partition: partition,\n time: time,\n notime: notime\n};\n\n/\n * Adds a dummy node to the graph and return v.\n /\nfunction addDummyNode(g, type, attrs, name) {\n var v;\n do {\n v = _.uniqueId(name);\n } while (g.hasNode(v));\n\n attrs.dummy = type;\n g.setNode(v, attrs);\n return v;\n}\n\n/\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n /\nfunction simplify(g) {\n var simplified = new Graph().setGraph(g.graph());\n _.forEach(g.nodes(), function(v) { simplified.setNode(v, g.node(v)); });\n _.forEach(g.edges(), function(e) {\n var simpleLabel = simplified.edge(e.v, e.w) \|\| { weight: 0, minlen: 1 };\n var label = g.edge(e);\n simplified.setEdge(e.v, e.w, {\n weight: simpleLabel.weight + label.weight,\n minlen: Math.max(simpleLabel.minlen, label.minlen)\n });\n });\n return simplified;\n}\n\nfunction asNonCompoundGraph(g) {\n var simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());\n _.forEach(g.nodes(), function(v) {\n if (!g.children(v).length) {\n simplified.setNode(v, g.node(v));\n }\n });\n _.forEach(g.edges(), function(e) {\n simplified.setEdge(e, g.edge(e));\n });\n return simplified;\n}\n\nfunction successorWeights(g) {\n var weightMap = _.map(g.nodes(), function(v) {\n var sucs = {};\n _.forEach(g.outEdges(v), function(e) {\n sucs[e.w] = (sucs[e.w] \|\| 0) + g.edge(e).weight;\n });\n return sucs;\n });\n return _.zipObject(g.nodes(), weightMap);\n}\n\nfunction predecessorWeights(g) {\n var weightMap = _.map(g.nodes(), function(v) {\n var preds = {};\n _.forEach(g.inEdges(v), function(e) {\n preds[e.v] = (preds[e.v] \|\| 0) + g.edge(e).weight;\n });\n return preds;\n });\n return _.zipObject(g.nodes(), weightMap);\n}\n\n/\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n /\nfunction intersectRect(rect, point) {\n var x = rect.x;\n var y = rect.y;\n\n // Rectangle intersection algorithm from:\n // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n var dx = point.x - x;\n var dy = point.y - y;\n var w = rect.width / 2;\n var h = rect.height / 2;\n\n if (!dx && !dy) {\n throw new Error(\"Not possible to find intersection inside of the rectangle\");\n }\n\n var sx, sy;\n if (Math.abs(dy) w > Math.abs(dx) * h) {\n // Intersection is top or bottom of rect.\n if (dy < 0) {\n h = -h;\n }\n sx = h * dx / dy;\n sy = h;\n } else {\n // Intersection is left or right of rect.\n if (dx < 0) {\n w = -w;\n }\n sx = w;\n sy = w * dy / dx;\n }\n\n return { x: x + sx, y: y + sy };\n}\n\n/\n Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * function will produce a matrix with the ids of each node.\n /\nfunction buildLayerMatrix(g) {\n var layering = _.map(_.range(maxRank(g) + 1), function() { return []; });\n _.forEach(g.nodes(), function(v) {\n var node = g.node(v);\n var rank = node.rank;\n if (!_.isUndefined(rank)) {\n layering[rank][node.order] = v;\n }\n });\n return layering;\n}\n\n/\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n /\nfunction normalizeRanks(g) {\n var min = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n _.forEach(g.nodes(), function(v) {\n var node = g.node(v);\n if (_.has(node, \"rank\")) {\n node.rank -= min;\n }\n });\n}\n\nfunction removeEmptyRanks(g) {\n // Ranks may not start at 0, so we need to offset them\n var offset = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n\n var layers = [];\n _.forEach(g.nodes(), function(v) {\n var rank = g.node(v).rank - offset;\n if (!layers[rank]) {\n layers[rank] = [];\n }\n layers[rank].push(v);\n });\n\n var delta = 0;\n var nodeRankFactor = g.graph().nodeRankFactor;\n _.forEach(layers, function(vs, i) {\n if (_.isUndefined(vs) && i % nodeRankFactor !== 0) {\n --delta;\n } else if (delta) {\n _.forEach(vs, function(v) { g.node(v).rank += delta; });\n }\n });\n}\n\nfunction addBorderNode(g, prefix, rank, order) {\n var node = {\n width: 0,\n height: 0\n };\n if (arguments.length >= 4) {\n node.rank = rank;\n node.order = order;\n }\n return addDummyNode(g, \"border\", node, prefix);\n}\n\nfunction maxRank(g) {\n return _.max(_.map(g.nodes(), function(v) {\n var rank = g.node(v).rank;\n if (!_.isUndefined(rank)) {\n return rank;\n }\n }));\n}\n\n/\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * function returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n /\nfunction partition(collection, fn) {\n var result = { lhs: [], rhs: [] };\n _.forEach(collection, function(value) {\n if (fn(value)) {\n result.lhs.push(value);\n } else {\n result.rhs.push(value);\n }\n });\n return result;\n}\n\n/\n * Returns a new function that wraps `fn` with a timer. The wrapper logs the\n * time it takes to execute the function.\n /\nfunction time(name, fn) {\n var start = _.now();\n try {\n return fn();\n } finally {\n console.log(name + \" time: \" + (_.now() - start) + \"ms\");\n }\n}\n\nfunction notime(name, fn) {\n return fn();\n}\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = {\n run: run,\n undo: undo\n};\n\n/\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n \n Pre-conditions:\n \n 1. The input graph is a DAG.\n * 2. Each node in the graph has a \"rank\" property.\n \n Post-condition:\n \n 1. All edges in the graph have a length of 1.\n * 2. Dummy nodes are added where edges have been split into segments.\n * 3. The graph is augmented with a \"dummyChains\" attribute which contains\n * the first dummy in each chain of dummy nodes produced.\n /\nfunction run(g) {\n g.graph().dummyChains = [];\n _.forEach(g.edges(), function(edge) { normalizeEdge(g, edge); });\n}\n\nfunction normalizeEdge(g, e) {\n var v = e.v;\n var vRank = g.node(v).rank;\n var w = e.w;\n var wRank = g.node(w).rank;\n var name = e.name;\n var edgeLabel = g.edge(e);\n var labelRank = edgeLabel.labelRank;\n\n if (wRank === vRank + 1) return;\n\n g.removeEdge(e);\n\n var dummy, attrs, i;\n for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n edgeLabel.points = [];\n attrs = {\n width: 0, height: 0,\n edgeLabel: edgeLabel, edgeObj: e,\n rank: vRank\n };\n dummy = util.addDummyNode(g, \"edge\", attrs, \"_d\");\n if (vRank === labelRank) {\n attrs.width = edgeLabel.width;\n attrs.height = edgeLabel.height;\n attrs.dummy = \"edge-label\";\n attrs.labelpos = edgeLabel.labelpos;\n }\n g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n if (i === 0) {\n g.graph().dummyChains.push(dummy);\n }\n v = dummy;\n }\n\n g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n}\n\nfunction undo(g) {\n _.forEach(g.graph().dummyChains, function(v) {\n var node = g.node(v);\n var origLabel = node.edgeLabel;\n var w;\n g.setEdge(node.edgeObj, origLabel);\n while (node.dummy) {\n w = g.successors(v)[0];\n g.removeNode(v);\n origLabel.points.push({ x: node.x, y: node.y });\n if (node.dummy === \"edge-label\") {\n origLabel.x = node.x;\n origLabel.y = node.y;\n origLabel.width = node.width;\n origLabel.height = node.height;\n }\n v = w;\n node = g.node(v);\n }\n });\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = {\n longestPath: longestPath,\n slack: slack\n};\n\n/\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n \n This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n \n Pre-conditions:\n \n 1. Input graph is a DAG.\n * 2. Input graph node labels can be assigned properties.\n \n Post-conditions:\n \n 1. Each node will be assign an (unnormalized) \"rank\" property.\n /\nfunction longestPath(g) {\n var visited = {};\n\n function dfs(v) {\n var label = g.node(v);\n if (_.has(visited, v)) {\n return label.rank;\n }\n visited[v] = true;\n\n var rank = _.min(_.map(g.outEdges(v), function(e) {\n return dfs(e.w) - g.edge(e).minlen;\n }));\n\n if (rank === Number.POSITIVE_INFINITY \|\| // return value of _.map([]) for Lodash 3\n rank === undefined \|\| // return value of _.map([]) for Lodash 4\n rank === null) { // return value of _.map([null])\n rank = 0;\n }\n\n return (label.rank = rank);\n }\n\n _.forEach(g.sources(), dfs);\n}\n\n/\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n /\nfunction slack(g, e) {\n return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\nvar slack = require(\"./util\").slack;\n\nmodule.exports = feasibleTree;\n\n/\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n \n The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n \n Pre-conditions:\n \n 1. Graph must be a DAG.\n * 2. Graph must be connected.\n * 3. Graph must have at least one node.\n * 5. Graph nodes must have been previously assigned a \"rank\" property that\n * respects the \"minlen\" property of incident edges.\n * 6. Graph edges must have a \"minlen\" property.\n \n Post-conditions:\n \n - Graph nodes will have their rank adjusted to ensure that all edges are\n * tight.\n \n Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n /\nfunction feasibleTree(g) {\n var t = new Graph({ directed: false });\n\n // Choose arbitrary node from which to start our tree\n var start = g.nodes()[0];\n var size = g.nodeCount();\n t.setNode(start, {});\n\n var edge, delta;\n while (tightTree(t, g) < size) {\n edge = findMinSlackEdge(t, g);\n delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);\n shiftRanks(t, g, delta);\n }\n\n return t;\n}\n\n/\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n /\nfunction tightTree(t, g) {\n function dfs(v) {\n _.forEach(g.nodeEdges(v), function(e) {\n var edgeV = e.v,\n w = (v === edgeV) ? e.w : edgeV;\n if (!t.hasNode(w) && !slack(g, e)) {\n t.setNode(w, {});\n t.setEdge(v, w, {});\n dfs(w);\n }\n });\n }\n\n _.forEach(t.nodes(), dfs);\n return t.nodeCount();\n}\n\n/\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n /\nfunction findMinSlackEdge(t, g) {\n return _.minBy(g.edges(), function(e) {\n if (t.hasNode(e.v) !== t.hasNode(e.w)) {\n return slack(g, e);\n }\n });\n}\n\nfunction shiftRanks(t, g, delta) {\n _.forEach(t.nodes(), function(v) {\n g.node(v).rank += delta;\n });\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar feasibleTree = require(\"./feasible-tree\");\nvar slack = require(\"./util\").slack;\nvar initRank = require(\"./util\").longestPath;\nvar preorder = require(\"../graphlib\").alg.preorder;\nvar postorder = require(\"../graphlib\").alg.postorder;\nvar simplify = require(\"../util\").simplify;\n\nmodule.exports = networkSimplex;\n\n// Expose some internals for testing purposes\nnetworkSimplex.initLowLimValues = initLowLimValues;\nnetworkSimplex.initCutValues = initCutValues;\nnetworkSimplex.calcCutValue = calcCutValue;\nnetworkSimplex.leaveEdge = leaveEdge;\nnetworkSimplex.enterEdge = enterEdge;\nnetworkSimplex.exchangeEdges = exchangeEdges;\n\n/\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n \n Preconditions:\n \n 1. The input graph must be a DAG.\n * 2. All nodes in the graph must have an object value.\n * 3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n \n Postconditions:\n \n 1. All nodes in the graph will have an assigned \"rank\" attribute that has\n * been optimized by the network simplex algorithm. Ranks start at 0.\n \n \n * A rough sketch of the algorithm is as follows:\n \n 1. Assign initial ranks to each node. We use the longest path algorithm,\n * which assigns ranks to the lowest position possible. In general this\n * leads to very wide bottom ranks and unnecessarily long edges.\n * 2. Construct a feasible tight tree. A tight tree is one such that all\n * edges in the tree have no slack (difference between length of edge\n * and minlen for the edge). This by itself greatly improves the assigned\n * rankings by shorting edges.\n * 3. Iteratively find edges that have negative cut values. Generally a\n * negative cut value indicates that the edge could be removed and a new\n * tree edge could be added to produce a more compact graph.\n \n Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n /\nfunction networkSimplex(g) {\n g = simplify(g);\n initRank(g);\n var t = feasibleTree(g);\n initLowLimValues(t);\n initCutValues(t, g);\n\n var e, f;\n while ((e = leaveEdge(t))) {\n f = enterEdge(t, g, e);\n exchangeEdges(t, g, e, f);\n }\n}\n\n/\n * Initializes cut values for all edges in the tree.\n /\nfunction initCutValues(t, g) {\n var vs = postorder(t, t.nodes());\n vs = vs.slice(0, vs.length - 1);\n _.forEach(vs, function(v) {\n assignCutValue(t, g, v);\n });\n}\n\nfunction assignCutValue(t, g, child) {\n var childLab = t.node(child);\n var parent = childLab.parent;\n t.edge(child, parent).cutvalue = calcCutValue(t, g, child);\n}\n\n/\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n /\nfunction calcCutValue(t, g, child) {\n var childLab = t.node(child);\n var parent = childLab.parent;\n // True if the child is on the tail end of the edge in the directed graph\n var childIsTail = true;\n // The graph's view of the tree edge we're inspecting\n var graphEdge = g.edge(child, parent);\n // The accumulated cut value for the edge between this node and its parent\n var cutValue = 0;\n\n if (!graphEdge) {\n childIsTail = false;\n graphEdge = g.edge(parent, child);\n }\n\n cutValue = graphEdge.weight;\n\n _.forEach(g.nodeEdges(child), function(e) {\n var isOutEdge = e.v === child,\n other = isOutEdge ? e.w : e.v;\n\n if (other !== parent) {\n var pointsToHead = isOutEdge === childIsTail,\n otherWeight = g.edge(e).weight;\n\n cutValue += pointsToHead ? otherWeight : -otherWeight;\n if (isTreeEdge(t, child, other)) {\n var otherCutValue = t.edge(child, other).cutvalue;\n cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n }\n }\n });\n\n return cutValue;\n}\n\nfunction initLowLimValues(tree, root) {\n if (arguments.length < 2) {\n root = tree.nodes()[0];\n }\n dfsAssignLowLim(tree, {}, 1, root);\n}\n\nfunction dfsAssignLowLim(tree, visited, nextLim, v, parent) {\n var low = nextLim;\n var label = tree.node(v);\n\n visited[v] = true;\n _.forEach(tree.neighbors(v), function(w) {\n if (!_.has(visited, w)) {\n nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);\n }\n });\n\n label.low = low;\n label.lim = nextLim++;\n if (parent) {\n label.parent = parent;\n } else {\n // TODO should be able to remove this when we incrementally update low lim\n delete label.parent;\n }\n\n return nextLim;\n}\n\nfunction leaveEdge(tree) {\n return _.find(tree.edges(), function(e) {\n return tree.edge(e).cutvalue < 0;\n });\n}\n\nfunction enterEdge(t, g, edge) {\n var v = edge.v;\n var w = edge.w;\n\n // For the rest of this function we assume that v is the tail and w is the\n // head, so if we don't have this edge in the graph we should flip it to\n // match the correct orientation.\n if (!g.hasEdge(v, w)) {\n v = edge.w;\n w = edge.v;\n }\n\n var vLabel = t.node(v);\n var wLabel = t.node(w);\n var tailLabel = vLabel;\n var flip = false;\n\n // If the root is in the tail of the edge then we need to flip the logic that\n // checks for the head and tail nodes in the candidates function below.\n if (vLabel.lim > wLabel.lim) {\n tailLabel = wLabel;\n flip = true;\n }\n\n var candidates = _.filter(g.edges(), function(edge) {\n return flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n flip !== isDescendant(t, t.node(edge.w), tailLabel);\n });\n\n return _.minBy(candidates, function(edge) { return slack(g, edge); });\n}\n\nfunction exchangeEdges(t, g, e, f) {\n var v = e.v;\n var w = e.w;\n t.removeEdge(v, w);\n t.setEdge(f.v, f.w, {});\n initLowLimValues(t);\n initCutValues(t, g);\n updateRanks(t, g);\n}\n\nfunction updateRanks(t, g) {\n var root = _.find(t.nodes(), function(v) { return !g.node(v).parent; });\n var vs = preorder(t, root);\n vs = vs.slice(1);\n _.forEach(vs, function(v) {\n var parent = t.node(v).parent,\n edge = g.edge(v, parent),\n flipped = false;\n\n if (!edge) {\n edge = g.edge(parent, v);\n flipped = true;\n }\n\n g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);\n });\n}\n\n/\n * Returns true if the edge is in the tree.\n /\nfunction isTreeEdge(tree, u, v) {\n return tree.hasEdge(u, v);\n}\n\n/\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n /\nfunction isDescendant(tree, vLabel, rootLabel) {\n return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;\n}\n","\"use strict\";\n\nvar rankUtil = require(\"./util\");\nvar longestPath = rankUtil.longestPath;\nvar feasibleTree = require(\"./feasible-tree\");\nvar networkSimplex = require(\"./network-simplex\");\n\nmodule.exports = rank;\n\n/\n * Assigns a rank to each node in the input graph that respects the \"minlen\"\n * constraint specified on edges between nodes.\n \n This basic structure is derived from Gansner, et al., \"A Technique for\n * Drawing Directed Graphs.\"\n \n Pre-conditions:\n \n 1. Graph must be a connected DAG\n * 2. Graph nodes must be objects\n * 3. Graph edges must have \"weight\" and \"minlen\" attributes\n \n Post-conditions:\n \n 1. Graph nodes will have a \"rank\" attribute based on the results of the\n * algorithm. Ranks can start at any index (including negative), we'll\n * fix them up later.\n /\nfunction rank(g) {\n switch(g.graph().ranker) {\n case \"network-simplex\": networkSimplexRanker(g); break;\n case \"tight-tree\": tightTreeRanker(g); break;\n case \"longest-path\": longestPathRanker(g); break;\n default: networkSimplexRanker(g);\n }\n}\n\n// A fast and simple ranker, but results are far from optimal.\nvar longestPathRanker = longestPath;\n\nfunction tightTreeRanker(g) {\n longestPath(g);\n feasibleTree(g);\n}\n\nfunction networkSimplexRanker(g) {\n networkSimplex(g);\n}\n","var _ = require(\"./lodash\");\n\nmodule.exports = parentDummyChains;\n\nfunction parentDummyChains(g) {\n var postorderNums = postorder(g);\n\n _.forEach(g.graph().dummyChains, function(v) {\n var node = g.node(v);\n var edgeObj = node.edgeObj;\n var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n var path = pathData.path;\n var lca = pathData.lca;\n var pathIdx = 0;\n var pathV = path[pathIdx];\n var ascending = true;\n\n while (v !== edgeObj.w) {\n node = g.node(v);\n\n if (ascending) {\n while ((pathV = path[pathIdx]) !== lca &&\n g.node(pathV).maxRank < node.rank) {\n pathIdx++;\n }\n\n if (pathV === lca) {\n ascending = false;\n }\n }\n\n if (!ascending) {\n while (pathIdx < path.length - 1 &&\n g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {\n pathIdx++;\n }\n pathV = path[pathIdx];\n }\n\n g.setParent(v, pathV);\n v = g.successors(v)[0];\n }\n });\n}\n\n// Find a path from v to w through the lowest common ancestor (LCA). Return the\n// full path and the LCA.\nfunction findPath(g, postorderNums, v, w) {\n var vPath = [];\n var wPath = [];\n var low = Math.min(postorderNums[v].low, postorderNums[w].low);\n var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n var parent;\n var lca;\n\n // Traverse up from v to find the LCA\n parent = v;\n do {\n parent = g.parent(parent);\n vPath.push(parent);\n } while (parent &&\n (postorderNums[parent].low > low \|\| lim > postorderNums[parent].lim));\n lca = parent;\n\n // Traverse from w to LCA\n parent = w;\n while ((parent = g.parent(parent)) !== lca) {\n wPath.push(parent);\n }\n\n return { path: vPath.concat(wPath.reverse()), lca: lca };\n}\n\nfunction postorder(g) {\n var result = {};\n var lim = 0;\n\n function dfs(v) {\n var low = lim;\n _.forEach(g.children(v), dfs);\n result[v] = { low: low, lim: lim++ };\n }\n _.forEach(g.children(), dfs);\n\n return result;\n}\n","var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = {\n run: run,\n cleanup: cleanup\n};\n\n/\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundries, and ensures that the graph is connected.\n \n In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n \n Preconditions:\n \n 1. Input graph is a DAG\n * 2. Nodes in the input graph has a minlen attribute\n \n Postconditions:\n \n 1. Input graph is connected.\n * 2. Dummy nodes are added for the tops and bottoms of subgraphs.\n * 3. The minlen attribute for nodes is adjusted to ensure nodes do not\n * get placed on the same rank as subgraph border nodes.\n \n The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n /\nfunction run(g) {\n var root = util.addDummyNode(g, \"root\", {}, \"_root\");\n var depths = treeDepths(g);\n var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array\n var nodeSep = 2 height + 1;\n\n g.graph().nestingRoot = root;\n\n // Multiply minlen by nodeSep to align nodes on non-border ranks.\n _.forEach(g.edges(), function(e) { g.edge(e).minlen = nodeSep; });\n\n // Calculate a weight that is sufficient to keep subgraphs vertically compact\n var weight = sumWeights(g) + 1;\n\n // Create border nodes and link them up\n _.forEach(g.children(), function(child) {\n dfs(g, root, nodeSep, weight, height, depths, child);\n });\n\n // Save the multiplier for node layers for later removal of empty border\n // layers.\n g.graph().nodeRankFactor = nodeSep;\n}\n\nfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n var children = g.children(v);\n if (!children.length) {\n if (v !== root) {\n g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n }\n return;\n }\n\n var top = util.addBorderNode(g, \"_bt\");\n var bottom = util.addBorderNode(g, \"_bb\");\n var label = g.node(v);\n\n g.setParent(top, v);\n label.borderTop = top;\n g.setParent(bottom, v);\n label.borderBottom = bottom;\n\n _.forEach(children, function(child) {\n dfs(g, root, nodeSep, weight, height, depths, child);\n\n var childNode = g.node(child);\n var childTop = childNode.borderTop ? childNode.borderTop : child;\n var childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n var thisWeight = childNode.borderTop ? weight : 2 weight;\n var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n g.setEdge(top, childTop, {\n weight: thisWeight,\n minlen: minlen,\n nestingEdge: true\n });\n\n g.setEdge(childBottom, bottom, {\n weight: thisWeight,\n minlen: minlen,\n nestingEdge: true\n });\n });\n\n if (!g.parent(v)) {\n g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n }\n}\n\nfunction treeDepths(g) {\n var depths = {};\n function dfs(v, depth) {\n var children = g.children(v);\n if (children && children.length) {\n _.forEach(children, function(child) {\n dfs(child, depth + 1);\n });\n }\n depths[v] = depth;\n }\n _.forEach(g.children(), function(v) { dfs(v, 1); });\n return depths;\n}\n\nfunction sumWeights(g) {\n return _.reduce(g.edges(), function(acc, e) {\n return acc + g.edge(e).weight;\n }, 0);\n}\n\nfunction cleanup(g) {\n var graphLabel = g.graph();\n g.removeNode(graphLabel.nestingRoot);\n delete graphLabel.nestingRoot;\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n if (edge.nestingEdge) {\n g.removeEdge(e);\n }\n });\n}\n","var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = addBorderSegments;\n\nfunction addBorderSegments(g) {\n function dfs(v) {\n var children = g.children(v);\n var node = g.node(v);\n if (children.length) {\n _.forEach(children, dfs);\n }\n\n if (_.has(node, \"minRank\")) {\n node.borderLeft = [];\n node.borderRight = [];\n for (var rank = node.minRank, maxRank = node.maxRank + 1;\n rank < maxRank;\n ++rank) {\n addBorderNode(g, \"borderLeft\", \"_bl\", v, node, rank);\n addBorderNode(g, \"borderRight\", \"_br\", v, node, rank);\n }\n }\n }\n\n _.forEach(g.children(), dfs);\n}\n\nfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n var label = { width: 0, height: 0, rank: rank, borderType: prop };\n var prev = sgNode[prop][rank - 1];\n var curr = util.addDummyNode(g, \"border\", label, prefix);\n sgNode[prop][rank] = curr;\n g.setParent(curr, sg);\n if (prev) {\n g.setEdge(prev, curr, { weight: 1 });\n }\n}\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = {\n adjust: adjust,\n undo: undo\n};\n\nfunction adjust(g) {\n var rankDir = g.graph().rankdir.toLowerCase();\n if (rankDir === \"lr\" \|\| rankDir === \"rl\") {\n swapWidthHeight(g);\n }\n}\n\nfunction undo(g) {\n var rankDir = g.graph().rankdir.toLowerCase();\n if (rankDir === \"bt\" \|\| rankDir === \"rl\") {\n reverseY(g);\n }\n\n if (rankDir === \"lr\" \|\| rankDir === \"rl\") {\n swapXY(g);\n swapWidthHeight(g);\n }\n}\n\nfunction swapWidthHeight(g) {\n _.forEach(g.nodes(), function(v) { swapWidthHeightOne(g.node(v)); });\n _.forEach(g.edges(), function(e) { swapWidthHeightOne(g.edge(e)); });\n}\n\nfunction swapWidthHeightOne(attrs) {\n var w = attrs.width;\n attrs.width = attrs.height;\n attrs.height = w;\n}\n\nfunction reverseY(g) {\n _.forEach(g.nodes(), function(v) { reverseYOne(g.node(v)); });\n\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n _.forEach(edge.points, reverseYOne);\n if (_.has(edge, \"y\")) {\n reverseYOne(edge);\n }\n });\n}\n\nfunction reverseYOne(attrs) {\n attrs.y = -attrs.y;\n}\n\nfunction swapXY(g) {\n _.forEach(g.nodes(), function(v) { swapXYOne(g.node(v)); });\n\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n _.forEach(edge.points, swapXYOne);\n if (_.has(edge, \"x\")) {\n swapXYOne(edge);\n }\n });\n}\n\nfunction swapXYOne(attrs) {\n var x = attrs.x;\n attrs.x = attrs.y;\n attrs.y = x;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = initOrder;\n\n/\n Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n \n This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n \n Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n /\nfunction initOrder(g) {\n var visited = {};\n var simpleNodes = _.filter(g.nodes(), function(v) {\n return !g.children(v).length;\n });\n var maxRank = _.max(_.map(simpleNodes, function(v) { return g.node(v).rank; }));\n var layers = _.map(_.range(maxRank + 1), function() { return []; });\n\n function dfs(v) {\n if (_.has(visited, v)) return;\n visited[v] = true;\n var node = g.node(v);\n layers[node.rank].push(v);\n _.forEach(g.successors(v), dfs);\n }\n\n var orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v).rank; });\n _.forEach(orderedVs, dfs);\n\n return layers;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = crossCount;\n\n/\n * A function that takes a layering (an array of layers, each with an array of\n * ordererd nodes) and a graph and returns a weighted crossing count.\n \n Pre-conditions:\n \n 1. Input graph must be simple (not a multigraph), directed, and include\n * only simple edges.\n * 2. Edges in the input graph must have assigned weights.\n \n Post-conditions:\n \n 1. The graph and layering matrix are left unchanged.\n \n This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n /\nfunction crossCount(g, layering) {\n var cc = 0;\n for (var i = 1; i < layering.length; ++i) {\n cc += twoLayerCrossCount(g, layering[i-1], layering[i]);\n }\n return cc;\n}\n\nfunction twoLayerCrossCount(g, northLayer, southLayer) {\n // Sort all of the edges between the north and south layers by their position\n // in the north layer and then the south. Map these edges to the position of\n // their head in the south layer.\n var southPos = _.zipObject(southLayer,\n _.map(southLayer, function (v, i) { return i; }));\n var southEntries = _.flatten(_.map(northLayer, function(v) {\n return _.sortBy(_.map(g.outEdges(v), function(e) {\n return { pos: southPos[e.w], weight: g.edge(e).weight };\n }), \"pos\");\n }), true);\n\n // Build the accumulator tree\n var firstIndex = 1;\n while (firstIndex < southLayer.length) firstIndex <<= 1;\n var treeSize = 2 firstIndex - 1;\n firstIndex -= 1;\n var tree = _.map(new Array(treeSize), function() { return 0; });\n\n // Calculate the weighted crossings\n var cc = 0;\n _.forEach(southEntries.forEach(function(entry) {\n var index = entry.pos + firstIndex;\n tree[index] += entry.weight;\n var weightSum = 0;\n while (index > 0) {\n if (index % 2) {\n weightSum += tree[index + 1];\n }\n index = (index - 1) >> 1;\n tree[index] += entry.weight;\n }\n cc += entry.weight * weightSum;\n }));\n\n return cc;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = barycenter;\n\nfunction barycenter(g, movable) {\n return _.map(movable, function(v) {\n var inV = g.inEdges(v);\n if (!inV.length) {\n return { v: v };\n } else {\n var result = _.reduce(inV, function(acc, e) {\n var edge = g.edge(e),\n nodeU = g.node(e.v);\n return {\n sum: acc.sum + (edge.weight * nodeU.order),\n weight: acc.weight + edge.weight\n };\n }, { sum: 0, weight: 0 });\n\n return {\n v: v,\n barycenter: result.sum / result.weight,\n weight: result.weight\n };\n }\n });\n}\n\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = resolveConflicts;\n\n/\n Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n \n This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n \n Pre-conditions:\n \n 1. Each entry has the form {v, barycenter, weight}, or if the node has\n * no barycenter, then {v}.\n \n Returns:\n \n A new list of entries of the form {vs, i, barycenter, weight}. The list\n * `vs` may either be a singleton or it may be an aggregation of nodes\n * ordered such that they do not violate constraints from the constraint\n * graph. The property `i` is the lowest original index of any of the\n * elements in `vs`.\n /\nfunction resolveConflicts(entries, cg) {\n var mappedEntries = {};\n _.forEach(entries, function(entry, i) {\n var tmp = mappedEntries[entry.v] = {\n indegree: 0,\n \"in\": [],\n out: [],\n vs: [entry.v],\n i: i\n };\n if (!_.isUndefined(entry.barycenter)) {\n tmp.barycenter = entry.barycenter;\n tmp.weight = entry.weight;\n }\n });\n\n _.forEach(cg.edges(), function(e) {\n var entryV = mappedEntries[e.v];\n var entryW = mappedEntries[e.w];\n if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {\n entryW.indegree++;\n entryV.out.push(mappedEntries[e.w]);\n }\n });\n\n var sourceSet = _.filter(mappedEntries, function(entry) {\n return !entry.indegree;\n });\n\n return doResolveConflicts(sourceSet);\n}\n\nfunction doResolveConflicts(sourceSet) {\n var entries = [];\n\n function handleIn(vEntry) {\n return function(uEntry) {\n if (uEntry.merged) {\n return;\n }\n if (_.isUndefined(uEntry.barycenter) \|\|\n _.isUndefined(vEntry.barycenter) \|\|\n uEntry.barycenter >= vEntry.barycenter) {\n mergeEntries(vEntry, uEntry);\n }\n };\n }\n\n function handleOut(vEntry) {\n return function(wEntry) {\n wEntry[\"in\"].push(vEntry);\n if (--wEntry.indegree === 0) {\n sourceSet.push(wEntry);\n }\n };\n }\n\n while (sourceSet.length) {\n var entry = sourceSet.pop();\n entries.push(entry);\n _.forEach(entry[\"in\"].reverse(), handleIn(entry));\n _.forEach(entry.out, handleOut(entry));\n }\n\n return _.map(_.filter(entries, function(entry) { return !entry.merged; }),\n function(entry) {\n return _.pick(entry, [\"vs\", \"i\", \"barycenter\", \"weight\"]);\n });\n\n}\n\nfunction mergeEntries(target, source) {\n var sum = 0;\n var weight = 0;\n\n if (target.weight) {\n sum += target.barycenter target.weight;\n weight += target.weight;\n }\n\n if (source.weight) {\n sum += source.barycenter * source.weight;\n weight += source.weight;\n }\n\n target.vs = source.vs.concat(target.vs);\n target.barycenter = sum / weight;\n target.weight = weight;\n target.i = Math.min(source.i, target.i);\n source.merged = true;\n}\n","var _ = require(\"../lodash\");\nvar util = require(\"../util\");\n\nmodule.exports = sort;\n\nfunction sort(entries, biasRight) {\n var parts = util.partition(entries, function(entry) {\n return _.has(entry, \"barycenter\");\n });\n var sortable = parts.lhs,\n unsortable = _.sortBy(parts.rhs, function(entry) { return -entry.i; }),\n vs = [],\n sum = 0,\n weight = 0,\n vsIndex = 0;\n\n sortable.sort(compareWithBias(!!biasRight));\n\n vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n _.forEach(sortable, function (entry) {\n vsIndex += entry.vs.length;\n vs.push(entry.vs);\n sum += entry.barycenter * entry.weight;\n weight += entry.weight;\n vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n });\n\n var result = { vs: _.flatten(vs, true) };\n if (weight) {\n result.barycenter = sum / weight;\n result.weight = weight;\n }\n return result;\n}\n\nfunction consumeUnsortable(vs, unsortable, index) {\n var last;\n while (unsortable.length && (last = _.last(unsortable)).i <= index) {\n unsortable.pop();\n vs.push(last.vs);\n index++;\n }\n return index;\n}\n\nfunction compareWithBias(bias) {\n return function(entryV, entryW) {\n if (entryV.barycenter < entryW.barycenter) {\n return -1;\n } else if (entryV.barycenter > entryW.barycenter) {\n return 1;\n }\n\n return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n };\n}\n","var _ = require(\"../lodash\");\nvar barycenter = require(\"./barycenter\");\nvar resolveConflicts = require(\"./resolve-conflicts\");\nvar sort = require(\"./sort\");\n\nmodule.exports = sortSubgraph;\n\nfunction sortSubgraph(g, v, cg, biasRight) {\n var movable = g.children(v);\n var node = g.node(v);\n var bl = node ? node.borderLeft : undefined;\n var br = node ? node.borderRight: undefined;\n var subgraphs = {};\n\n if (bl) {\n movable = _.filter(movable, function(w) {\n return w !== bl && w !== br;\n });\n }\n\n var barycenters = barycenter(g, movable);\n _.forEach(barycenters, function(entry) {\n if (g.children(entry.v).length) {\n var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n subgraphs[entry.v] = subgraphResult;\n if (_.has(subgraphResult, \"barycenter\")) {\n mergeBarycenters(entry, subgraphResult);\n }\n }\n });\n\n var entries = resolveConflicts(barycenters, cg);\n expandSubgraphs(entries, subgraphs);\n\n var result = sort(entries, biasRight);\n\n if (bl) {\n result.vs = _.flatten([bl, result.vs, br], true);\n if (g.predecessors(bl).length) {\n var blPred = g.node(g.predecessors(bl)[0]),\n brPred = g.node(g.predecessors(br)[0]);\n if (!_.has(result, \"barycenter\")) {\n result.barycenter = 0;\n result.weight = 0;\n }\n result.barycenter = (result.barycenter * result.weight +\n blPred.order + brPred.order) / (result.weight + 2);\n result.weight += 2;\n }\n }\n\n return result;\n}\n\nfunction expandSubgraphs(entries, subgraphs) {\n _.forEach(entries, function(entry) {\n entry.vs = _.flatten(entry.vs.map(function(v) {\n if (subgraphs[v]) {\n return subgraphs[v].vs;\n }\n return v;\n }), true);\n });\n}\n\nfunction mergeBarycenters(target, other) {\n if (!_.isUndefined(target.barycenter)) {\n target.barycenter = (target.barycenter * target.weight +\n other.barycenter * other.weight) /\n (target.weight + other.weight);\n target.weight += other.weight;\n } else {\n target.barycenter = other.barycenter;\n target.weight = other.weight;\n }\n}\n","var _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\n\nmodule.exports = buildLayerGraph;\n\n/\n Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n \n Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n \n Pre-conditions:\n \n 1. Input graph is a DAG\n * 2. Base nodes in the input graph have a rank attribute\n * 3. Subgraph nodes in the input graph has minRank and maxRank attributes\n * 4. Edges have an assigned weight\n \n Post-conditions:\n \n 1. Output graph has all nodes in the movable rank with preserved\n * hierarchy.\n * 2. Root nodes in the movable layer are made children of the node\n * indicated by the root attribute of the graph.\n * 3. Non-movable nodes incident on movable nodes, selected by the\n * relationship parameter, are included in the graph (without hierarchy).\n * 4. Edges incident on movable nodes, selected by the relationship\n * parameter, are added to the output graph.\n * 5. The weights for copied edges are aggregated as need, since the output\n * graph is not a multi-graph.\n /\nfunction buildLayerGraph(g, rank, relationship) {\n var root = createRootNode(g),\n result = new Graph({ compound: true }).setGraph({ root: root })\n .setDefaultNodeLabel(function(v) { return g.node(v); });\n\n _.forEach(g.nodes(), function(v) {\n var node = g.node(v),\n parent = g.parent(v);\n\n if (node.rank === rank \|\| node.minRank <= rank && rank <= node.maxRank) {\n result.setNode(v);\n result.setParent(v, parent \|\| root);\n\n // This assumes we have only short edges!\n _.forEach(g[relationship](v), function(e) {\n var u = e.v === v ? e.w : e.v,\n edge = result.edge(u, v),\n weight = !_.isUndefined(edge) ? edge.weight : 0;\n result.setEdge(u, v, { weight: g.edge(e).weight + weight });\n });\n\n if (_.has(node, \"minRank\")) {\n result.setNode(v, {\n borderLeft: node.borderLeft[rank],\n borderRight: node.borderRight[rank]\n });\n }\n }\n });\n\n return result;\n}\n\nfunction createRootNode(g) {\n var v;\n while (g.hasNode((v = _.uniqueId(\"_root\"))));\n return v;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = addSubgraphConstraints;\n\nfunction addSubgraphConstraints(g, cg, vs) {\n var prev = {},\n rootPrev;\n\n _.forEach(vs, function(v) {\n var child = g.parent(v),\n parent,\n prevChild;\n while (child) {\n parent = g.parent(child);\n if (parent) {\n prevChild = prev[parent];\n prev[parent] = child;\n } else {\n prevChild = rootPrev;\n rootPrev = child;\n }\n if (prevChild && prevChild !== child) {\n cg.setEdge(prevChild, child);\n return;\n }\n child = parent;\n }\n });\n\n /\n function dfs(v) {\n var children = v ? g.children(v) : g.children();\n if (children.length) {\n var min = Number.POSITIVE_INFINITY,\n subgraphs = [];\n _.each(children, function(child) {\n var childMin = dfs(child);\n if (g.children(child).length) {\n subgraphs.push({ v: child, order: childMin });\n }\n min = Math.min(min, childMin);\n });\n _.reduce(_.sortBy(subgraphs, \"order\"), function(prev, curr) {\n cg.setEdge(prev.v, curr.v);\n return curr;\n });\n return min;\n }\n return g.node(v).order;\n }\n dfs(undefined);\n /\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar initOrder = require(\"./init-order\");\nvar crossCount = require(\"./cross-count\");\nvar sortSubgraph = require(\"./sort-subgraph\");\nvar buildLayerGraph = require(\"./build-layer-graph\");\nvar addSubgraphConstraints = require(\"./add-subgraph-constraints\");\nvar Graph = require(\"../graphlib\").Graph;\nvar util = require(\"../util\");\n\nmodule.exports = order;\n\n/\n * Applies heuristics to minimize edge crossings in the graph and sets the best\n * order solution as an order attribute on each node.\n \n Pre-conditions:\n \n 1. Graph must be DAG\n * 2. Graph nodes must be objects with a \"rank\" attribute\n * 3. Graph edges must have the \"weight\" attribute\n \n Post-conditions:\n \n 1. Graph nodes will have an \"order\" attribute based on the results of the\n * algorithm.\n /\nfunction order(g) {\n var maxRank = util.maxRank(g),\n downLayerGraphs = buildLayerGraphs(g, _.range(1, maxRank + 1), \"inEdges\"),\n upLayerGraphs = buildLayerGraphs(g, _.range(maxRank - 1, -1, -1), \"outEdges\");\n\n var layering = initOrder(g);\n assignOrder(g, layering);\n\n var bestCC = Number.POSITIVE_INFINITY,\n best;\n\n for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);\n\n layering = util.buildLayerMatrix(g);\n var cc = crossCount(g, layering);\n if (cc < bestCC) {\n lastBest = 0;\n best = _.cloneDeep(layering);\n bestCC = cc;\n }\n }\n\n assignOrder(g, best);\n}\n\nfunction buildLayerGraphs(g, ranks, relationship) {\n return _.map(ranks, function(rank) {\n return buildLayerGraph(g, rank, relationship);\n });\n}\n\nfunction sweepLayerGraphs(layerGraphs, biasRight) {\n var cg = new Graph();\n _.forEach(layerGraphs, function(lg) {\n var root = lg.graph().root;\n var sorted = sortSubgraph(lg, root, cg, biasRight);\n _.forEach(sorted.vs, function(v, i) {\n lg.node(v).order = i;\n });\n addSubgraphConstraints(lg, cg, sorted.vs);\n });\n}\n\nfunction assignOrder(g, layering) {\n _.forEach(layering, function(layer) {\n _.forEach(layer, function(v, i) {\n g.node(v).order = i;\n });\n });\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\nvar util = require(\"../util\");\n\n/\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n /\n\nmodule.exports = {\n positionX: positionX,\n findType1Conflicts: findType1Conflicts,\n findType2Conflicts: findType2Conflicts,\n addConflict: addConflict,\n hasConflict: hasConflict,\n verticalAlignment: verticalAlignment,\n horizontalCompaction: horizontalCompaction,\n alignCoordinates: alignCoordinates,\n findSmallestWidthAlignment: findSmallestWidthAlignment,\n balance: balance\n};\n\n/\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n \n This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n \n This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n /\nfunction findType1Conflicts(g, layering) {\n var conflicts = {};\n\n function visitLayer(prevLayer, layer) {\n var\n // last visited node in the previous layer that is incident on an inner\n // segment.\n k0 = 0,\n // Tracks the last node in this layer scanned for crossings with a type-1\n // segment.\n scanPos = 0,\n prevLayerLength = prevLayer.length,\n lastNode = _.last(layer);\n\n _.forEach(layer, function(v, i) {\n var w = findOtherInnerSegmentNode(g, v),\n k1 = w ? g.node(w).order : prevLayerLength;\n\n if (w \|\| v === lastNode) {\n _.forEach(layer.slice(scanPos, i +1), function(scanNode) {\n _.forEach(g.predecessors(scanNode), function(u) {\n var uLabel = g.node(u),\n uPos = uLabel.order;\n if ((uPos < k0 \|\| k1 < uPos) &&\n !(uLabel.dummy && g.node(scanNode).dummy)) {\n addConflict(conflicts, u, scanNode);\n }\n });\n });\n scanPos = i + 1;\n k0 = k1;\n }\n });\n\n return layer;\n }\n\n _.reduce(layering, visitLayer);\n return conflicts;\n}\n\nfunction findType2Conflicts(g, layering) {\n var conflicts = {};\n\n function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n var v;\n _.forEach(_.range(southPos, southEnd), function(i) {\n v = south[i];\n if (g.node(v).dummy) {\n _.forEach(g.predecessors(v), function(u) {\n var uNode = g.node(u);\n if (uNode.dummy &&\n (uNode.order < prevNorthBorder \|\| uNode.order > nextNorthBorder)) {\n addConflict(conflicts, u, v);\n }\n });\n }\n });\n }\n\n\n function visitLayer(north, south) {\n var prevNorthPos = -1,\n nextNorthPos,\n southPos = 0;\n\n _.forEach(south, function(v, southLookahead) {\n if (g.node(v).dummy === \"border\") {\n var predecessors = g.predecessors(v);\n if (predecessors.length) {\n nextNorthPos = g.node(predecessors[0]).order;\n scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\n southPos = southLookahead;\n prevNorthPos = nextNorthPos;\n }\n }\n scan(south, southPos, south.length, nextNorthPos, north.length);\n });\n\n return south;\n }\n\n _.reduce(layering, visitLayer);\n return conflicts;\n}\n\nfunction findOtherInnerSegmentNode(g, v) {\n if (g.node(v).dummy) {\n return _.find(g.predecessors(v), function(u) {\n return g.node(u).dummy;\n });\n }\n}\n\nfunction addConflict(conflicts, v, w) {\n if (v > w) {\n var tmp = v;\n v = w;\n w = tmp;\n }\n\n var conflictsV = conflicts[v];\n if (!conflictsV) {\n conflicts[v] = conflictsV = {};\n }\n conflictsV[w] = true;\n}\n\nfunction hasConflict(conflicts, v, w) {\n if (v > w) {\n var tmp = v;\n v = w;\n w = tmp;\n }\n return _.has(conflicts[v], w);\n}\n\n/\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n /\nfunction verticalAlignment(g, layering, conflicts, neighborFn) {\n var root = {},\n align = {},\n pos = {};\n\n // We cache the position here based on the layering because the graph and\n // layering may be out of sync. The layering matrix is manipulated to\n // generate different extreme alignments.\n _.forEach(layering, function(layer) {\n _.forEach(layer, function(v, order) {\n root[v] = v;\n align[v] = v;\n pos[v] = order;\n });\n });\n\n _.forEach(layering, function(layer) {\n var prevIdx = -1;\n _.forEach(layer, function(v) {\n var ws = neighborFn(v);\n if (ws.length) {\n ws = _.sortBy(ws, function(w) { return pos[w]; });\n var mp = (ws.length - 1) / 2;\n for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n var w = ws[i];\n if (align[v] === v &&\n prevIdx < pos[w] &&\n !hasConflict(conflicts, v, w)) {\n align[w] = v;\n align[v] = root[v] = root[w];\n prevIdx = pos[w];\n }\n }\n }\n });\n });\n\n return { root: root, align: align };\n}\n\nfunction horizontalCompaction(g, layering, root, align, reverseSep) {\n // This portion of the algorithm differs from BK due to a number of problems.\n // Instead of their algorithm we construct a new block graph and do two\n // sweeps. The first sweep places blocks with the smallest possible\n // coordinates. The second sweep removes unused space by moving blocks to the\n // greatest coordinates without violating separation.\n var xs = {},\n blockG = buildBlockGraph(g, layering, root, reverseSep),\n borderType = reverseSep ? \"borderLeft\" : \"borderRight\";\n\n function iterate(setXsFunc, nextNodesFunc) {\n var stack = blockG.nodes();\n var elem = stack.pop();\n var visited = {};\n while (elem) {\n if (visited[elem]) {\n setXsFunc(elem);\n } else {\n visited[elem] = true;\n stack.push(elem);\n stack = stack.concat(nextNodesFunc(elem));\n }\n\n elem = stack.pop();\n }\n }\n\n // First pass, assign smallest coordinates\n function pass1(elem) {\n xs[elem] = blockG.inEdges(elem).reduce(function(acc, e) {\n return Math.max(acc, xs[e.v] + blockG.edge(e));\n }, 0);\n }\n\n // Second pass, assign greatest coordinates\n function pass2(elem) {\n var min = blockG.outEdges(elem).reduce(function(acc, e) {\n return Math.min(acc, xs[e.w] - blockG.edge(e));\n }, Number.POSITIVE_INFINITY);\n\n var node = g.node(elem);\n if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {\n xs[elem] = Math.max(xs[elem], min);\n }\n }\n\n iterate(pass1, blockG.predecessors.bind(blockG));\n iterate(pass2, blockG.successors.bind(blockG));\n\n // Assign x coordinates to all nodes\n _.forEach(align, function(v) {\n xs[v] = xs[root[v]];\n });\n\n return xs;\n}\n\n\nfunction buildBlockGraph(g, layering, root, reverseSep) {\n var blockGraph = new Graph(),\n graphLabel = g.graph(),\n sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n\n _.forEach(layering, function(layer) {\n var u;\n _.forEach(layer, function(v) {\n var vRoot = root[v];\n blockGraph.setNode(vRoot);\n if (u) {\n var uRoot = root[u],\n prevMax = blockGraph.edge(uRoot, vRoot);\n blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax \|\| 0));\n }\n u = v;\n });\n });\n\n return blockGraph;\n}\n\n/\n * Returns the alignment that has the smallest width of the given alignments.\n /\nfunction findSmallestWidthAlignment(g, xss) {\n return _.minBy(_.values(xss), function (xs) {\n var max = Number.NEGATIVE_INFINITY;\n var min = Number.POSITIVE_INFINITY;\n\n _.forIn(xs, function (x, v) {\n var halfWidth = width(g, v) / 2;\n\n max = Math.max(x + halfWidth, max);\n min = Math.min(x - halfWidth, min);\n });\n\n return max - min;\n });\n}\n\n/\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n /\nfunction alignCoordinates(xss, alignTo) {\n var alignToVals = _.values(alignTo),\n alignToMin = _.min(alignToVals),\n alignToMax = _.max(alignToVals);\n\n _.forEach([\"u\", \"d\"], function(vert) {\n _.forEach([\"l\", \"r\"], function(horiz) {\n var alignment = vert + horiz,\n xs = xss[alignment],\n delta;\n if (xs === alignTo) return;\n\n var xsVals = _.values(xs);\n delta = horiz === \"l\" ? alignToMin - _.min(xsVals) : alignToMax - _.max(xsVals);\n\n if (delta) {\n xss[alignment] = _.mapValues(xs, function(x) { return x + delta; });\n }\n });\n });\n}\n\nfunction balance(xss, align) {\n return _.mapValues(xss.ul, function(ignore, v) {\n if (align) {\n return xss[align.toLowerCase()][v];\n } else {\n var xs = _.sortBy(_.map(xss, v));\n return (xs[1] + xs[2]) / 2;\n }\n });\n}\n\nfunction positionX(g) {\n var layering = util.buildLayerMatrix(g);\n var conflicts = _.merge(\n findType1Conflicts(g, layering),\n findType2Conflicts(g, layering));\n\n var xss = {};\n var adjustedLayering;\n _.forEach([\"u\", \"d\"], function(vert) {\n adjustedLayering = vert === \"u\" ? layering : _.values(layering).reverse();\n _.forEach([\"l\", \"r\"], function(horiz) {\n if (horiz === \"r\") {\n adjustedLayering = _.map(adjustedLayering, function(inner) {\n return _.values(inner).reverse();\n });\n }\n\n var neighborFn = (vert === \"u\" ? g.predecessors : g.successors).bind(g);\n var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);\n var xs = horizontalCompaction(g, adjustedLayering,\n align.root, align.align, horiz === \"r\");\n if (horiz === \"r\") {\n xs = _.mapValues(xs, function(x) { return -x; });\n }\n xss[vert + horiz] = xs;\n });\n });\n\n var smallestWidth = findSmallestWidthAlignment(g, xss);\n alignCoordinates(xss, smallestWidth);\n return balance(xss, g.graph().align);\n}\n\nfunction sep(nodeSep, edgeSep, reverseSep) {\n return function(g, v, w) {\n var vLabel = g.node(v);\n var wLabel = g.node(w);\n var sum = 0;\n var delta;\n\n sum += vLabel.width / 2;\n if (_.has(vLabel, \"labelpos\")) {\n switch (vLabel.labelpos.toLowerCase()) {\n case \"l\": delta = -vLabel.width / 2; break;\n case \"r\": delta = vLabel.width / 2; break;\n }\n }\n if (delta) {\n sum += reverseSep ? delta : -delta;\n }\n delta = 0;\n\n sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n\n sum += wLabel.width / 2;\n if (_.has(wLabel, \"labelpos\")) {\n switch (wLabel.labelpos.toLowerCase()) {\n case \"l\": delta = wLabel.width / 2; break;\n case \"r\": delta = -wLabel.width / 2; break;\n }\n }\n if (delta) {\n sum += reverseSep ? delta : -delta;\n }\n delta = 0;\n\n return sum;\n };\n}\n\nfunction width(g, v) {\n return g.node(v).width;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar util = require(\"../util\");\nvar positionX = require(\"./bk\").positionX;\n\nmodule.exports = position;\n\nfunction position(g) {\n g = util.asNonCompoundGraph(g);\n\n positionY(g);\n _.forEach(positionX(g), function(x, v) {\n g.node(v).x = x;\n });\n}\n\nfunction positionY(g) {\n var layering = util.buildLayerMatrix(g);\n var rankSep = g.graph().ranksep;\n var prevY = 0;\n _.forEach(layering, function(layer) {\n var maxHeight = _.max(_.map(layer, function(v) { return g.node(v).height; }));\n _.forEach(layer, function(v) {\n g.node(v).y = prevY + maxHeight / 2;\n });\n prevY += maxHeight + rankSep;\n });\n}\n\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar acyclic = require(\"./acyclic\");\nvar normalize = require(\"./normalize\");\nvar rank = require(\"./rank\");\nvar normalizeRanks = require(\"./util\").normalizeRanks;\nvar parentDummyChains = require(\"./parent-dummy-chains\");\nvar removeEmptyRanks = require(\"./util\").removeEmptyRanks;\nvar nestingGraph = require(\"./nesting-graph\");\nvar addBorderSegments = require(\"./add-border-segments\");\nvar coordinateSystem = require(\"./coordinate-system\");\nvar order = require(\"./order\");\nvar position = require(\"./position\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = layout;\n\nfunction layout(g, opts) {\n var time = opts && opts.debugTiming ? util.time : util.notime;\n time(\"layout\", function() {\n var layoutGraph = \n time(\" buildLayoutGraph\", function() { return buildLayoutGraph(g); });\n time(\" runLayout\", function() { runLayout(layoutGraph, time); });\n time(\" updateInputGraph\", function() { updateInputGraph(g, layoutGraph); });\n });\n}\n\nfunction runLayout(g, time) {\n time(\" makeSpaceForEdgeLabels\", function() { makeSpaceForEdgeLabels(g); });\n time(\" removeSelfEdges\", function() { removeSelfEdges(g); });\n time(\" acyclic\", function() { acyclic.run(g); });\n time(\" nestingGraph.run\", function() { nestingGraph.run(g); });\n time(\" rank\", function() { rank(util.asNonCompoundGraph(g)); });\n time(\" injectEdgeLabelProxies\", function() { injectEdgeLabelProxies(g); });\n time(\" removeEmptyRanks\", function() { removeEmptyRanks(g); });\n time(\" nestingGraph.cleanup\", function() { nestingGraph.cleanup(g); });\n time(\" normalizeRanks\", function() { normalizeRanks(g); });\n time(\" assignRankMinMax\", function() { assignRankMinMax(g); });\n time(\" removeEdgeLabelProxies\", function() { removeEdgeLabelProxies(g); });\n time(\" normalize.run\", function() { normalize.run(g); });\n time(\" parentDummyChains\", function() { parentDummyChains(g); });\n time(\" addBorderSegments\", function() { addBorderSegments(g); });\n time(\" order\", function() { order(g); });\n time(\" insertSelfEdges\", function() { insertSelfEdges(g); });\n time(\" adjustCoordinateSystem\", function() { coordinateSystem.adjust(g); });\n time(\" position\", function() { position(g); });\n time(\" positionSelfEdges\", function() { positionSelfEdges(g); });\n time(\" removeBorderNodes\", function() { removeBorderNodes(g); });\n time(\" normalize.undo\", function() { normalize.undo(g); });\n time(\" fixupEdgeLabelCoords\", function() { fixupEdgeLabelCoords(g); });\n time(\" undoCoordinateSystem\", function() { coordinateSystem.undo(g); });\n time(\" translateGraph\", function() { translateGraph(g); });\n time(\" assignNodeIntersects\", function() { assignNodeIntersects(g); });\n time(\" reversePoints\", function() { reversePointsForReversedEdges(g); });\n time(\" acyclic.undo\", function() { acyclic.undo(g); });\n}\n\n/\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n /\nfunction updateInputGraph(inputGraph, layoutGraph) {\n _.forEach(inputGraph.nodes(), function(v) {\n var inputLabel = inputGraph.node(v);\n var layoutLabel = layoutGraph.node(v);\n\n if (inputLabel) {\n inputLabel.x = layoutLabel.x;\n inputLabel.y = layoutLabel.y;\n\n if (layoutGraph.children(v).length) {\n inputLabel.width = layoutLabel.width;\n inputLabel.height = layoutLabel.height;\n }\n }\n });\n\n _.forEach(inputGraph.edges(), function(e) {\n var inputLabel = inputGraph.edge(e);\n var layoutLabel = layoutGraph.edge(e);\n\n inputLabel.points = layoutLabel.points;\n if (_.has(layoutLabel, \"x\")) {\n inputLabel.x = layoutLabel.x;\n inputLabel.y = layoutLabel.y;\n }\n });\n\n inputGraph.graph().width = layoutGraph.graph().width;\n inputGraph.graph().height = layoutGraph.graph().height;\n}\n\nvar graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\nvar graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\nvar graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\nvar nodeNumAttrs = [\"width\", \"height\"];\nvar nodeDefaults = { width: 0, height: 0 };\nvar edgeNumAttrs = [\"minlen\", \"weight\", \"width\", \"height\", \"labeloffset\"];\nvar edgeDefaults = {\n minlen: 1, weight: 1, width: 0, height: 0,\n labeloffset: 10, labelpos: \"r\"\n};\nvar edgeAttrs = [\"labelpos\"];\n\n/\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n /\nfunction buildLayoutGraph(inputGraph) {\n var g = new Graph({ multigraph: true, compound: true });\n var graph = canonicalize(inputGraph.graph());\n\n g.setGraph(_.merge({},\n graphDefaults,\n selectNumberAttrs(graph, graphNumAttrs),\n _.pick(graph, graphAttrs)));\n\n _.forEach(inputGraph.nodes(), function(v) {\n var node = canonicalize(inputGraph.node(v));\n g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));\n g.setParent(v, inputGraph.parent(v));\n });\n\n _.forEach(inputGraph.edges(), function(e) {\n var edge = canonicalize(inputGraph.edge(e));\n g.setEdge(e, _.merge({},\n edgeDefaults,\n selectNumberAttrs(edge, edgeNumAttrs),\n _.pick(edge, edgeAttrs)));\n });\n\n return g;\n}\n\n/\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n \n We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n /\nfunction makeSpaceForEdgeLabels(g) {\n var graph = g.graph();\n graph.ranksep /= 2;\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n edge.minlen = 2;\n if (edge.labelpos.toLowerCase() !== \"c\") {\n if (graph.rankdir === \"TB\" \|\| graph.rankdir === \"BT\") {\n edge.width += edge.labeloffset;\n } else {\n edge.height += edge.labeloffset;\n }\n }\n });\n}\n\n/\n Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n /\nfunction injectEdgeLabelProxies(g) {\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n if (edge.width && edge.height) {\n var v = g.node(e.v);\n var w = g.node(e.w);\n var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };\n util.addDummyNode(g, \"edge-proxy\", label, \"_ep\");\n }\n });\n}\n\nfunction assignRankMinMax(g) {\n var maxRank = 0;\n _.forEach(g.nodes(), function(v) {\n var node = g.node(v);\n if (node.borderTop) {\n node.minRank = g.node(node.borderTop).rank;\n node.maxRank = g.node(node.borderBottom).rank;\n maxRank = _.max(maxRank, node.maxRank);\n }\n });\n g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g) {\n _.forEach(g.nodes(), function(v) {\n var node = g.node(v);\n if (node.dummy === \"edge-proxy\") {\n g.edge(node.e).labelRank = node.rank;\n g.removeNode(v);\n }\n });\n}\n\nfunction translateGraph(g) {\n var minX = Number.POSITIVE_INFINITY;\n var maxX = 0;\n var minY = Number.POSITIVE_INFINITY;\n var maxY = 0;\n var graphLabel = g.graph();\n var marginX = graphLabel.marginx \|\| 0;\n var marginY = graphLabel.marginy \|\| 0;\n\n function getExtremes(attrs) {\n var x = attrs.x;\n var y = attrs.y;\n var w = attrs.width;\n var h = attrs.height;\n minX = Math.min(minX, x - w / 2);\n maxX = Math.max(maxX, x + w / 2);\n minY = Math.min(minY, y - h / 2);\n maxY = Math.max(maxY, y + h / 2);\n }\n\n _.forEach(g.nodes(), function(v) { getExtremes(g.node(v)); });\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n if (_.has(edge, \"x\")) {\n getExtremes(edge);\n }\n });\n\n minX -= marginX;\n minY -= marginY;\n\n _.forEach(g.nodes(), function(v) {\n var node = g.node(v);\n node.x -= minX;\n node.y -= minY;\n });\n\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n _.forEach(edge.points, function(p) {\n p.x -= minX;\n p.y -= minY;\n });\n if (_.has(edge, \"x\")) { edge.x -= minX; }\n if (_.has(edge, \"y\")) { edge.y -= minY; }\n });\n\n graphLabel.width = maxX - minX + marginX;\n graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g) {\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n var nodeV = g.node(e.v);\n var nodeW = g.node(e.w);\n var p1, p2;\n if (!edge.points) {\n edge.points = [];\n p1 = nodeW;\n p2 = nodeV;\n } else {\n p1 = edge.points[0];\n p2 = edge.points[edge.points.length - 1];\n }\n edge.points.unshift(util.intersectRect(nodeV, p1));\n edge.points.push(util.intersectRect(nodeW, p2));\n });\n}\n\nfunction fixupEdgeLabelCoords(g) {\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n if (_.has(edge, \"x\")) {\n if (edge.labelpos === \"l\" \|\| edge.labelpos === \"r\") {\n edge.width -= edge.labeloffset;\n }\n switch (edge.labelpos) {\n case \"l\": edge.x -= edge.width / 2 + edge.labeloffset; break;\n case \"r\": edge.x += edge.width / 2 + edge.labeloffset; break;\n }\n }\n });\n}\n\nfunction reversePointsForReversedEdges(g) {\n _.forEach(g.edges(), function(e) {\n var edge = g.edge(e);\n if (edge.reversed) {\n edge.points.reverse();\n }\n });\n}\n\nfunction removeBorderNodes(g) {\n _.forEach(g.nodes(), function(v) {\n if (g.children(v).length) {\n var node = g.node(v);\n var t = g.node(node.borderTop);\n var b = g.node(node.borderBottom);\n var l = g.node(_.last(node.borderLeft));\n var r = g.node(_.last(node.borderRight));\n\n node.width = Math.abs(r.x - l.x);\n node.height = Math.abs(b.y - t.y);\n node.x = l.x + node.width / 2;\n node.y = t.y + node.height / 2;\n }\n });\n\n _.forEach(g.nodes(), function(v) {\n if (g.node(v).dummy === \"border\") {\n g.removeNode(v);\n }\n });\n}\n\nfunction removeSelfEdges(g) {\n _.forEach(g.edges(), function(e) {\n if (e.v === e.w) {\n var node = g.node(e.v);\n if (!node.selfEdges) {\n node.selfEdges = [];\n }\n node.selfEdges.push({ e: e, label: g.edge(e) });\n g.removeEdge(e);\n }\n });\n}\n\nfunction insertSelfEdges(g) {\n var layers = util.buildLayerMatrix(g);\n _.forEach(layers, function(layer) {\n var orderShift = 0;\n _.forEach(layer, function(v, i) {\n var node = g.node(v);\n node.order = i + orderShift;\n _.forEach(node.selfEdges, function(selfEdge) {\n util.addDummyNode(g, \"selfedge\", {\n width: selfEdge.label.width,\n height: selfEdge.label.height,\n rank: node.rank,\n order: i + (++orderShift),\n e: selfEdge.e,\n label: selfEdge.label\n }, \"_se\");\n });\n delete node.selfEdges;\n });\n });\n}\n\nfunction positionSelfEdges(g) {\n _.forEach(g.nodes(), function(v) {\n var node = g.node(v);\n if (node.dummy === \"selfedge\") {\n var selfNode = g.node(node.e.v);\n var x = selfNode.x + selfNode.width / 2;\n var y = selfNode.y;\n var dx = node.x - x;\n var dy = selfNode.height / 2;\n g.setEdge(node.e, node.label);\n g.removeNode(v);\n node.label.points = [\n { x: x + 2 dx / 3, y: y - dy },\n { x: x + 5 * dx / 6, y: y - dy },\n { x: x + dx , y: y },\n { x: x + 5 * dx / 6, y: y + dy },\n { x: x + 2 * dx / 3, y: y + dy }\n ];\n node.label.x = node.x;\n node.label.y = node.y;\n }\n });\n}\n\nfunction selectNumberAttrs(obj, attrs) {\n return _.mapValues(_.pick(obj, attrs), Number);\n}\n\nfunction canonicalize(attrs) {\n var newAttrs = {};\n _.forEach(attrs, function(v, k) {\n newAttrs[k.toLowerCase()] = v;\n });\n return newAttrs;\n}\n","var _ = require(\"./lodash\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n debugOrdering: debugOrdering\n};\n\n/* istanbul ignore next /\nfunction debugOrdering(g) {\n var layerMatrix = util.buildLayerMatrix(g);\n\n var h = new Graph({ compound: true, multigraph: true }).setGraph({});\n\n _.forEach(g.nodes(), function(v) {\n h.setNode(v, { label: v });\n h.setParent(v, \"layer\" + g.node(v).rank);\n });\n\n _.forEach(g.edges(), function(e) {\n h.setEdge(e.v, e.w, {}, e.name);\n });\n\n _.forEach(layerMatrix, function(layer, i) {\n var layerV = \"layer\" + i;\n h.setNode(layerV, { rank: \"same\" });\n _.reduce(layer, function(u, v) {\n h.setEdge(u, v, { style: \"invis\" });\n return v;\n });\n });\n\n return h;\n}\n","module.exports = \"0.8.5\";\n","/\nCopyright (c) 2012-2014 Chris Pettitt\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n/\n\nmodule.exports = {\n graphlib: require(\"./lib/graphlib\"),\n\n layout: require(\"./lib/layout\"),\n debug: require(\"./lib/debug\"),\n util: {\n time: require(\"./lib/util\").time,\n notime: require(\"./lib/util\").notime\n },\n version: require(\"./lib/version\")\n};\n","var baseIsEqual = require('./_baseIsEqual');\n\n/\n Performs a deep comparison between two values to determine if they are\n * equivalent.\n \n Note: This method supports comparing arrays, array buffers, booleans,\n * date objects, error objects, maps, numbers, `Object` objects, regexes,\n * sets, strings, symbols, and typed arrays. `Object` objects are compared\n * by their own, not inherited, enumerable properties. Functions and DOM\n * nodes are compared by strict equality, i.e. `===`.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {} value The value to compare.\n @param {} other The other value to compare.\n @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n \n var object = { 'a': 1 };\n * var other = { 'a': 1 };\n \n _.isEqual(object, other);\n * // => true\n \n object === other;\n * // => false\n /\nfunction isEqual(value, other) {\n return baseIsEqual(value, other);\n}\n\nmodule.exports = isEqual;\n","import {GraphNode, GraphEdge, MarkerType, Position, useVueFlow, Elements} from \"@vue-flow/core\";\nimport dagre from \"dagre\";\nimport Utils from \"./Utils\";\nimport {CLUSTER_PREFIX, NODE_SIZES} from \"./constants\";\nimport {flowHaveTasks as yamlFlowHaveTask} from \"./FlowYamlUtils\";\nimport isEqual from \"lodash/isEqual\"\n\nconst TRIGGERS_NODE_UID = \"root.Triggers\";\n\nenum BranchType {\n ERROR = \"ERROR\",\n FINALLY = \"FINALLY\",\n AFTER_EXECUTION = \"AFTER_EXECUTION\"\n}\n\ninterface MinimalNode {\n unused?: boolean;\n executionId?: string;\n branchType?: BranchType;\n uid: string;\n type: string;\n task?: {\n id?: string;\n type: string;\n namespace: string;\n flowId: string;\n }\n}\n\ninterface Cluster {\n uid: string\n type: string\n nodes: MinimalNode[]\n taskNode: {\n uid: string\n task: {\n type: string\n namespace: string\n flowId: string\n }\n }\n branchType: BranchType\n}\n\nexport interface FlowGraph {\n nodes: MinimalNode[];\n clusters: {\n cluster: Cluster;\n nodes: string[];\n parents: {\n uid: string;\n }[];\n }[];\n edges: GraphEdge[]\n}\n\ntype EdgeReplacer = Record<string, string>\n\n\nexport function predecessorsEdge(vueFlowId: string, nodeUid: string): GraphEdge[] {\n const {getEdges} = useVueFlow(vueFlowId);\n\n const nodes = [];\n\n for (const edge of getEdges.value) {\n if (edge.target === nodeUid) {\n nodes.push(edge);\n const recursiveEdge = predecessorsEdge(vueFlowId, edge.source);\n if (recursiveEdge.length > 0) {\n nodes.push(...recursiveEdge);\n }\n }\n }\n\n return nodes;\n}\n\nexport function successorsEdge(vueFlowId: string, nodeUid: string): GraphEdge[] {\n const {getEdges} = useVueFlow(vueFlowId);\n\n const nodes = [];\n\n for (const edge of getEdges.value) {\n if (edge.source === nodeUid) {\n nodes.push(edge);\n const recursiveEdge = successorsEdge(vueFlowId, edge.target);\n if (recursiveEdge.length > 0) {\n nodes.push(...recursiveEdge);\n }\n }\n }\n\n return nodes;\n}\n\nexport function predecessorsNode(vueFlowId: string, nodeUid: string): (GraphEdge \| GraphNode)[] {\n const {getEdges, findNode} = useVueFlow(vueFlowId);\n\n const foundNode = findNode(nodeUid)\n const nodes: (GraphEdge \| GraphNode)[] = foundNode ? [foundNode] : [];\n\n for (const edge of getEdges.value) {\n if (edge.target === nodeUid) {\n nodes.push(edge.sourceNode);\n const recursiveEdge = predecessorsNode(vueFlowId, edge.source);\n if (recursiveEdge.length > 0) {\n nodes.push(...recursiveEdge);\n }\n }\n }\n\n return nodes;\n}\n\nexport function successorsNode(vueFlowId: string, nodeUid: string) {\n const {getEdges, findNode} = useVueFlow(vueFlowId);\n\n const nodes = [findNode(nodeUid)];\n\n for (const edge of getEdges.value) {\n if (edge.source === nodeUid) {\n nodes.push(edge.targetNode);\n const recursiveEdge = successorsNode(vueFlowId, edge.target);\n if (recursiveEdge.length > 0) {\n nodes.push(...recursiveEdge);\n }\n }\n }\n\n return nodes;\n}\n\nexport function linkedElements(vueFlowId: string, nodeUid: string) {\n return [\n ...predecessorsEdge(vueFlowId, nodeUid),\n ...predecessorsNode(vueFlowId, nodeUid),\n ...successorsEdge(vueFlowId, nodeUid),\n ...successorsNode(vueFlowId, nodeUid),\n ];\n}\n\nexport function generateDagreGraph(\n flowGraph: { nodes: any; clusters: any; edges: any },\n hiddenNodes: string[],\n isHorizontal: boolean,\n clustersWithoutRootNode: string[],\n edgeReplacer: EdgeReplacer,\n collapsed: Set<string>,\n clusterToNode: MinimalNode[]\n) {\n const dagreGraph = new dagre.graphlib.Graph({compound: true});\n dagreGraph.setDefaultEdgeLabel(() => ({}));\n dagreGraph.setGraph({rankdir: isHorizontal ? \"LR\" : \"TB\"});\n\n for (const node of flowGraph.nodes) {\n if (!hiddenNodes.includes(node.uid)) {\n dagreGraph.setNode(node.uid, {\n width: getNodeWidth(node),\n height: getNodeHeight(node),\n });\n }\n }\n\n for (const cluster of flowGraph.clusters \|\| []) {\n const nodeUid = cluster.cluster.uid.replace(CLUSTER_PREFIX, \"\");\n if (\n clustersWithoutRootNode.includes(cluster.cluster.uid) &&\n collapsed.has(nodeUid)\n ) {\n const node = {uid: nodeUid, type: \"collapsedcluster\"};\n dagreGraph.setNode(nodeUid, {\n width: getNodeWidth(node),\n height: getNodeHeight(node),\n });\n clusterToNode.push(node);\n continue;\n }\n if (!edgeReplacer[cluster.cluster.uid]) {\n dagreGraph.setNode(cluster.cluster.uid, {clusterLabelPos: \"top\"});\n\n for (const node of cluster.nodes \|\| []) {\n if (!hiddenNodes.includes(node)) {\n dagreGraph.setParent(node, cluster.cluster.uid);\n }\n }\n }\n if (cluster.parents) {\n const nodeChild = edgeReplacer[cluster.cluster.uid]\n ? edgeReplacer[cluster.cluster.uid]\n : cluster.cluster.uid;\n if (!hiddenNodes.includes(nodeChild)) {\n dagreGraph.setParent(\n nodeChild,\n cluster.parents[cluster.parents.length - 1]\n );\n }\n }\n }\n\n for (const edge of flowGraph.edges \|\| []) {\n const newEdge = replaceIfCollapsed(\n edge.source,\n edge.target,\n edgeReplacer,\n hiddenNodes\n );\n if (newEdge) {\n dagreGraph.setEdge(newEdge.source, newEdge.target);\n }\n }\n\n dagre.layout(dagreGraph);\n return dagreGraph;\n}\n\nexport function getNodePosition(n: {\n x: number;\n y: number;\n width: number;\n height: number;\n}, parent?: {\n x: number;\n y: number;\n width: number;\n height: number;\n}) {\n const position = {x: n.x - n.width / 2, y: n.y - n.height / 2};\n\n // bug with parent node,\n if (parent) {\n const parentPosition = getNodePosition(parent);\n position.x = position.x - parentPosition.x;\n position.y = position.y - parentPosition.y;\n }\n return position;\n}\n\nexport function getNodeWidth(node: MinimalNode) {\n return isTaskNode(node) \|\| isTriggerNode(node)\n ? NODE_SIZES.TASK_WIDTH\n : (isCollapsedCluster(node)\n ? NODE_SIZES.COLLAPSED_CLUSTER_WIDTH\n : NODE_SIZES.DOT_WIDTH);\n}\n\nexport function getNodeHeight(node: MinimalNode) {\n return isTaskNode(node) \|\| isTriggerNode(node)\n ? NODE_SIZES.TASK_HEIGHT\n : (isCollapsedCluster(node)\n ? NODE_SIZES.COLLAPSED_CLUSTER_HEIGHT\n : NODE_SIZES.DOT_HEIGHT);\n}\n\nexport function isTaskNode(node: MinimalNode) {\n return [\"GraphTask\", \"SubflowGraphTask$1\"].some((t) => node.type.endsWith(t));\n}\n\nexport function isTriggerNode(node: MinimalNode) {\n return node.type.endsWith(\"GraphTrigger\");\n}\n\nexport function isCollapsedCluster(node: MinimalNode) {\n return node.type === \"collapsedcluster\";\n}\n\nexport function replaceIfCollapsed(source: string, target: string, edgeReplacer: EdgeReplacer, hiddenNodes: string[]) {\n const newSource = edgeReplacer[source] ? edgeReplacer[source] : source;\n const newTarget = edgeReplacer[target] ? edgeReplacer[target] : target;\n\n if (\n newSource === newTarget \|\|\n hiddenNodes.includes(newSource) \|\|\n hiddenNodes.includes(newTarget)\n ) {\n return null;\n }\n return {target: newTarget, source: newSource};\n}\n\nexport function cleanGraph(vueflowId: string) {\n const {\n getEdges,\n getNodes,\n getElements,\n removeEdges,\n removeNodes,\n removeSelectedElements,\n } = useVueFlow(vueflowId);\n removeEdges(getEdges.value);\n removeNodes(getNodes.value);\n removeSelectedElements(getElements.value);\n}\n\nexport function flowHaveTasks(source: string) {\n return source ? yamlFlowHaveTask(source) : false;\n}\n\nexport function nodeColor(node: MinimalNode, collapsed: Set<string>) {\n if (node.uid === TRIGGERS_NODE_UID) {\n return \"success\";\n }\n\n if (isTriggerNode(node) \|\| isCollapsedCluster(node)) {\n return \"success\";\n }\n\n if (node.type.endsWith(\"SubflowGraphTask\")) {\n return \"primary\";\n }\n\n if (node.branchType == BranchType.ERROR) {\n return \"danger\";\n }\n\n if (node.branchType == BranchType.FINALLY) {\n return \"warning\";\n }\n\n if (collapsed.has(node.uid)) {\n return \"blue\";\n }\n\n return \"default\";\n}\n\nexport function haveAdd(edge: GraphEdge,\n nodeByUid: Record<string, MinimalNode>,\n clustersRootTaskUids: string[],\n readOnlyUidPrefixes: string[]) {\n // prevent subflow edit (edge = subflowNode -> subflowNode)\n if (\n readOnlyUidPrefixes.some(\n (prefix) =>\n edge.source.startsWith(prefix) && edge.target.startsWith(prefix)\n )\n ) {\n return undefined;\n }\n\n // edge = clusterRoot -> clusterRootTask\n if (clustersRootTaskUids.includes(edge.target)) {\n return undefined;\n }\n\n // edge = Triggers cluster -> something \|\| edge = something -> Triggers cluster\n if (\n edge.source.startsWith(TRIGGERS_NODE_UID) \|\|\n edge.target.startsWith(TRIGGERS_NODE_UID)\n ) {\n return undefined;\n }\n\n const dotSplitTarget = edge.target.split(\".\");\n dotSplitTarget.pop();\n const targetNodeClusterUid = dotSplitTarget.join(\".\");\n const clusterRootTaskId = Utils.afterLastDot(targetNodeClusterUid);\n\n // edge = task of parallel -> end of parallel, we only add + symbol right after the parallel cluster root task node\n const targetNode = nodeByUid[edge.target];\n if (\n targetNode.type.endsWith(\"GraphClusterEnd\") &&\n nodeByUid[targetNodeClusterUid]?.task?.type?.endsWith(\"Parallel\")\n ) {\n return undefined;\n }\n\n // edge = something -> clusterRoot ==> we insert before the cluster\n // clusterUid = clusterTraversalPrefix.{rootTaskUid}\n // clusterRoot.uid = clusterUid.someUid = clusterTraversalPrefix.{rootTaskUid}.someUid\n if (targetNode.type.endsWith(\"GraphClusterRoot\")) {\n return [clusterRootTaskId, \"before\"];\n }\n\n const sourceIsEndOfCluster =\n nodeByUid[edge.source].type.endsWith(\"GraphClusterEnd\");\n // edge = clusterTask -> clusterEnd ==> we insert after the previous task\n if (!sourceIsEndOfCluster && targetNode.type.endsWith(\"GraphClusterEnd\")) {\n return [Utils.afterLastDot(edge.source), \"after\"];\n }\n\n // edge = cluster1End -> something ==> we insert after cluster1\n if (sourceIsEndOfCluster) {\n const dotSplitSource = edge.source.split(\".\");\n return [dotSplitSource[dotSplitSource.length - 2], \"after\"];\n }\n\n return [Utils.afterLastDot(edge.target), \"before\"];\n}\n\nexport function getEdgeColor(edge: GraphEdge, nodeByUid: Record<string, MinimalNode>, clusterByNodeUid: Record<string, Cluster>) {\n const findRootBranchType = (nodeId: string): BranchType \| null => {\n const uidParts = nodeId.split(\".\");\n for (let i = 1; i <= uidParts.length; i++) {\n const parentUid = uidParts.slice(0, i).join(\".\");\n const branchType = clusterByNodeUid[parentUid]?.branchType;\n if (branchType) return branchType;\n }\n return nodeByUid[nodeId]?.branchType ?? null;\n };\n\n const sourceBranchType = findRootBranchType(edge.source);\n const targetBranchType = findRootBranchType(edge.target);\n\n return [sourceBranchType, targetBranchType].includes(BranchType.ERROR) ? \"danger\"\n : [sourceBranchType, targetBranchType].includes(BranchType.FINALLY) ? \"warning\"\n : null;\n}\n\nexport function generateGraph(\n _vueFlowId: string,\n flowId: string \| undefined,\n namespace: string \| undefined,\n flowGraph: FlowGraph \| undefined,\n flowSource: string \| undefined,\n hiddenNodes: string[],\n isHorizontal: boolean,\n edgeReplacer: EdgeReplacer,\n collapsed: Set<string>,\n clusterToNode: MinimalNode[],\n isReadOnly: boolean,\n isAllowedEdit: boolean,\n enableSubflowInteraction: boolean\n): Elements \| undefined {\n const elements: Elements = [];\n\n const clustersWithoutRootNode = [CLUSTER_PREFIX + TRIGGERS_NODE_UID];\n\n if (!flowGraph \|\| (flowSource && !flowHaveTasks(flowSource))) {\n elements.push({\n id: \"start\",\n type: \"dot\",\n position: {x: 0, y: 0},\n style: {\n width: \"5px\",\n height: \"5px\",\n },\n sourcePosition: isHorizontal ? Position.Right : Position.Bottom,\n targetPosition: isHorizontal ? Position.Left : Position.Top,\n parentNode: undefined,\n draggable: false,\n });\n elements.push({\n id: \"end\",\n type: \"dot\",\n position: isHorizontal ? {x: 50, y: 0} : {x: 0, y: 50},\n style: {\n width: \"5px\",\n height: \"5px\",\n },\n sourcePosition: isHorizontal ? Position.Right : Position.Bottom,\n targetPosition: isHorizontal ? Position.Left : Position.Top,\n parentNode: undefined,\n draggable: false,\n });\n elements.push({\n id: \"start\|end\",\n source: \"start\",\n target: \"end\",\n type: \"edge\",\n data: {\n edge: {\n relation: {\n relationType: \"SEQUENTIAL\",\n },\n },\n isFlowable: false,\n initTask: true,\n color: \"primary\",\n },\n });\n\n return;\n }\n\n const dagreGraph = generateDagreGraph(\n flowGraph,\n hiddenNodes,\n isHorizontal,\n clustersWithoutRootNode,\n edgeReplacer,\n collapsed,\n clusterToNode\n );\n\n const clusterByNodeUid: Record<string, Cluster> = {};\n const clusters = flowGraph.clusters \|\| [];\n const rawClusters = clusters.map((c) => c.cluster);\n const readOnlyUidPrefixes = rawClusters\n .filter((c) => c.type.endsWith(\"SubflowGraphCluster\"))\n .map((c) => c.taskNode.uid);\n\n const nodeByUid = Object.fromEntries(\n flowGraph.nodes.concat(clusterToNode).map((node) => [node.uid, node])\n );\n for (const cluster of clusters) {\n if (\n !edgeReplacer[cluster.cluster.uid] &&\n !collapsed.has(cluster.cluster.uid)\n ) {\n if (\n cluster.cluster.taskNode?.task?.type ===\n \"io.kestra.core.tasks.flows.Dag\"\n ) {\n readOnlyUidPrefixes.push(cluster.cluster.taskNode.uid);\n }\n\n for (const nodeUid of cluster.nodes) {\n clusterByNodeUid[nodeUid] = cluster.cluster;\n }\n\n const clusterUid = cluster.cluster.uid;\n const dagreNode = dagreGraph.node(clusterUid);\n const parentNode = cluster.parents\n ? cluster.parents[cluster.parents.length - 1]\n : undefined;\n\n const clusterColor = computeClusterColor(cluster.cluster);\n\n elements.push({\n id: clusterUid,\n type: \"cluster\",\n parentNode: parentNode,\n position: getNodePosition(\n dagreNode,\n parentNode ? dagreGraph.node(parentNode) : undefined\n ),\n style: {\n width:\n clusterUid === TRIGGERS_NODE_UID && isHorizontal\n ? NODE_SIZES.TRIGGER_CLUSTER_WIDTH + \"px\"\n : dagreNode.width + \"px\",\n height:\n clusterUid === TRIGGERS_NODE_UID && !isHorizontal\n ? NODE_SIZES.TRIGGER_CLUSTER_HEIGHT + \"px\"\n : dagreNode.height + \"px\",\n },\n data: {\n collapsable: true,\n color: clusterColor,\n taskNode: cluster.cluster.taskNode,\n unused: cluster.cluster.taskNode\n ? nodeByUid[cluster.cluster.taskNode.uid].unused\n : false,\n },\n class: `ks-topology-${clusterColor}-border rounded p-2`,\n } as any);\n }\n }\n\n for (const node of flowGraph.nodes.concat(clusterToNode)) {\n if (!hiddenNodes.includes(node.uid)) {\n const dagreNode = dagreGraph.node(node.uid);\n let nodeType = \"task\";\n if (isClusterRootOrEnd(node)) {\n nodeType = \"dot\";\n } else if (node.type.includes(\"GraphTrigger\")) {\n nodeType = \"trigger\";\n } else if (node.type === \"collapsedcluster\") {\n nodeType = \"collapsedcluster\";\n }\n\n const color = nodeColor(node, collapsed);\n // If task type includes '$', it's an inner class so it's probably an internal class not supposed to be editable\n // In such case, only the root task will be editable\n const isReadOnlyTask =\n isReadOnly \|\|\n node.task?.type?.includes(\"$\") \|\|\n readOnlyUidPrefixes.some((prefix) =>\n node.uid.startsWith(prefix + \".\")\n );\n elements.push({\n id: node.uid,\n type: nodeType,\n position: getNodePosition(\n dagreNode,\n clusterByNodeUid[node.uid]\n ? dagreGraph.node(clusterByNodeUid[node.uid].uid)\n : undefined\n ),\n style: {\n width: getNodeWidth(node) + \"px\",\n height: getNodeHeight(node) + \"px\",\n },\n sourcePosition: isHorizontal ? Position.Right : Position.Bottom,\n targetPosition: isHorizontal ? Position.Left : Position.Top,\n parentNode: clusterByNodeUid[node.uid]\n ? clusterByNodeUid[node.uid].uid\n : undefined,\n draggable: nodeType === \"task\" ? !isReadOnlyTask : false,\n data: {\n node: node,\n parent: clusterByNodeUid[node.uid] ? clusterByNodeUid[node.uid] : undefined,\n namespace:\n clusterByNodeUid[node.uid]?.taskNode?.task?.namespace ??\n namespace,\n flowId:\n clusterByNodeUid[node.uid]?.taskNode?.task?.flowId ?? flowId,\n isFlowable:\n clusterByNodeUid[node.uid]?.uid === CLUSTER_PREFIX + node.uid &&\n !node.type.endsWith(\"SubflowGraphTask\"),\n color: color,\n expandable: isExpandableTask(\n node,\n clusterByNodeUid,\n edgeReplacer,\n enableSubflowInteraction\n ),\n isReadOnly: isReadOnlyTask,\n iconComponent: isCollapsedCluster(node)\n ? \"lightning-bolt\"\n : null,\n executionId: node.executionId,\n unused: node.unused,\n },\n class:\n node.type === \"collapsedcluster\"\n ? `ks-topology-${color}-border rounded`\n : \"\",\n });\n }\n }\n\n const clusterRootTaskNodeUids = rawClusters\n .filter((c) => c.taskNode)\n .map((c) => c.taskNode.uid);\n const edges = flowGraph.edges ?? [];\n\n for (const edge of edges) {\n const newEdge = replaceIfCollapsed(\n edge.source,\n edge.target,\n edgeReplacer,\n hiddenNodes\n );\n if (newEdge) {\n const edgeColor = getEdgeColor(edge, nodeByUid, clusterByNodeUid);\n elements.push({\n id: newEdge.source + \"\|\" + newEdge.target,\n source: newEdge.source,\n target: newEdge.target,\n type: \"edge\",\n markerEnd: isClusterRootOrEnd(nodeByUid[newEdge.target])\n ? \"\"\n : {\n id: \"marker-\" + (nodeByUid[newEdge.target].branchType ? nodeByUid[newEdge.target].branchType?.toLocaleLowerCase() : \"custom\"),\n type: MarkerType.ArrowClosed,\n color: edgeColor ? `var(--ks-border-${edgeColor})` : \"var(--ks-topology-edge-color)\"\n },\n data: {\n haveAdd:\n !isReadOnly &&\n isAllowedEdit &&\n haveAdd(\n edge,\n nodeByUid,\n clusterRootTaskNodeUids,\n readOnlyUidPrefixes\n ),\n haveDashArray:\n nodeByUid[edge.source].type.endsWith(\"GraphTrigger\") \|\|\n nodeByUid[edge.target].type.endsWith(\"GraphTrigger\") \|\|\n edge.source.startsWith(TRIGGERS_NODE_UID),\n color: edgeColor,\n unused: (edge as any).unused,\n },\n style: {\n zIndex: 10,\n },\n });\n }\n }\n\n return elements;\n}\n\nexport function isClusterRootOrEnd(node: MinimalNode) {\n return [\"GraphClusterRoot\", \"GraphClusterFinally\", \"GraphClusterAfterExecution\", \"GraphClusterEnd\"].some((s) =>\n node.type.endsWith(s)\n );\n}\n\nexport function computeClusterColor(cluster: Cluster) {\n if (cluster.uid === CLUSTER_PREFIX + TRIGGERS_NODE_UID) {\n return \"success\";\n }\n\n if (cluster.type.endsWith(\"SubflowGraphCluster\")) {\n return \"primary\";\n }\n\n if (cluster.branchType === BranchType.ERROR) {\n return \"danger\";\n }\n\n return \"blue\";\n}\n\nexport function isExpandableTask(\n node: MinimalNode,\n clusterByNodeUid: Record<string, Cluster>,\n edgeReplacer: EdgeReplacer,\n enableSubflowInteraction?: boolean\n) {\n if (Object.values(edgeReplacer).includes(node.uid)) {\n return true;\n }\n\n if (isCollapsedCluster(node)) {\n return true;\n }\n\n return (\n node.type.endsWith(\"SubflowGraphTask\") &&\n clusterByNodeUid[node.uid]?.uid?.replace(CLUSTER_PREFIX, \"\") !==\n node.uid &&\n enableSubflowInteraction\n );\n}\n\n/\n Get nodes that have no incoming edges, i.e., root nodes of the graph.\n /\nexport function getRootNodes(graph: FlowGraph) {\n const nodeUIDs = graph.nodes.map((node) => node.uid);\n const rootUIDs = nodeUIDs.filter((uid) => {\n return !graph.edges.some((edge) => edge.target === uid);\n });\n return graph.nodes.filter((node) => rootUIDs.includes(node.uid));\n}\n\n/\n Get the edges connected as the source to a specific node. (outward facing arrows)\n * @param graph The flow graph.\n * @param nodeUid The UID of the node.\n * @returns An array of edges connected to the node.\n /\nexport function getTargetNodesEdges(graph: FlowGraph, nodeUid?: string) {\n if (!nodeUid) {\n return undefined;\n }\n return graph.edges.filter((edge) => edge.source === nodeUid && edge.target);\n}\n\n/\n Follow the graph from a specific node to find the next task nodes.\n * This function traverses the graph until it finds a node that is not a cluster.\n * @param graph \n * @param initialNode The initial node to start the search from.\n * @returns An array of the next task nodes found.\n /\nexport function getNextTaskNodes(graph: FlowGraph, initialNode: MinimalNode) {\n let edges: GraphEdge[], nextTaskNodes: MinimalNode[], nodeUIDs: string[] = [initialNode.uid];\n // loop until we find a node that is not a cluster\n do {\n // find all the edges that are connected to this task\n edges = nodeUIDs.flatMap((uid) => getTargetNodesEdges(graph, uid)).filter(Boolean) as GraphEdge[];\n // if there are no edges, return undefined\n if (edges.length === 0) {\n return [];\n }\n nodeUIDs = edges.map((edge) => edge.target);\n nextTaskNodes = graph.nodes.filter((node) => nodeUIDs.includes(node.uid) && node.task);\n } while (!nextTaskNodes.length);\n\n return nextTaskNodes\n}\n\n/\n Check if the tasks in the current graph are identical to the previous graph until the specified task.\n * @param previousGraph The graph from the previous execution.\n * @param currentGraph The graph from the current execution.\n * @param taskId The ID of the task to check.\n * @returns True if all tasks are identical, false otherwise.\n /\nexport function areTasksIdenticalInGraphUntilTask(previousGraph: FlowGraph, currentGraph: FlowGraph, taskId?: string) {\n if (!taskId) {\n return false;\n }\n \n let previousRootTaskNodes = getRootNodes(previousGraph);\n let currentRootTaskNodes = getRootNodes(currentGraph);\n \n // if the root nodes are not the same, we cannot compare\n if (previousRootTaskNodes.length !== currentRootTaskNodes.length) {\n return false;\n }\n\n // avoid infinite loop\n let failIndex = 120\n\n // walk the graph until we find the taskId in the current root task nodes\n // or until we run out of nodes to compare\n do {\n currentRootTaskNodes = currentRootTaskNodes.flatMap((node) => getNextTaskNodes(currentGraph, node));\n \n // stop if we find the taskId in the current root task nodes\n if (currentRootTaskNodes.some((node: any) => node.task.id === taskId)) {\n return true;\n }\n\n previousRootTaskNodes = previousRootTaskNodes.flatMap((node) => getNextTaskNodes(previousGraph, node));\n\n if (previousRootTaskNodes.length !== currentRootTaskNodes.length) {\n return false;\n }\n\n for (const currentTaskNode of currentRootTaskNodes) {\n const prevTaskNode = previousRootTaskNodes.find((taskNode) => taskNode.task?.id === currentTaskNode.task?.id);\n const prevTaskValue = prevTaskNode?.task as Record<string, any> ?? {};\n const currentTaskValue = currentTaskNode.task as Record<string, any> ?? {};\n\n // if any member of the task is different, tasks are different\n if (!prevTaskNode \n \|\| Object.keys(prevTaskValue).length !== Object.keys(currentTaskValue).length\n ){\n return false;\n }\n \n if (!isEqual(prevTaskValue, currentTaskValue)) {\n return false;\n }\n \n }\n } while (previousRootTaskNodes.length && currentRootTaskNodes.length && failIndex-- > 0);\n\n if (failIndex <= 0) {\n console.warn(\"areTasksIdenticalInGraphUntilTask: Infinite loop detected, stopping comparison.\");\n return false;\n }\n\n return true;\n}\n\n/\n @deprecated prefer using VueFlowUtils directly for tree shaking\n */\nexport default {\n isClusterRootOrEnd,\n computeClusterColor,\n isExpandableTask,\n generateGraph,\n generateDagreGraph,\n getNodePosition,\n getNodeWidth,\n getNodeHeight,\n isTaskNode,\n isTriggerNode,\n isCollapsedCluster,\n replaceIfCollapsed,\n cleanGraph,\n flowHaveTasks,\n nodeColor,\n haveAdd,\n getEdgeColor,\n predecessorsEdge,\n successorsEdge,\n predecessorsNode,\n successorsNode,\n linkedElements,\n}"],"names":["SECTIONS","EVENTS","CLUSTER_PREFIX","stateGlobalChartTypes","logDisplayTypes","NODE_SIZES","editorViewTypes","storageKeys","executeFlowBehaviours","stateDisplayValues","createBaseFor","fromRight","object","iteratee","keysFunc","index","iterable","props","length","key","_createBaseFor","require$$0","baseFor","_baseFor","keys","require$$1","baseForOwn","_baseForOwn","HASH_UNDEFINED","setCacheAdd","value","_setCacheAdd","setCacheHas","_setCacheHas","MapCache","require$$2","SetCache","values","_SetCache","arraySome","array","predicate","_arraySome","cacheHas","cache","_cacheHas","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","equalArrays","other","bitmask","customizer","equalFunc","stack","isPartial","arrLength","othLength","arrStacked","othStacked","result","seen","arrValue","othValue","compared","othIndex","_equalArrays","mapToArray","map","_mapToArray","setToArray","set","_setToArray","Symbol","Uint8Array","eq","require$$3","require$$4","require$$5","boolTag","dateTag","errorTag","mapTag","numberTag","regexpTag","setTag","stringTag","symbolTag","arrayBufferTag","dataViewTag","symbolProto","symbolValueOf","equalByTag","tag","convert","stacked","_equalByTag","getAllKeys","objectProto","hasOwnProperty","equalObjects","objProps","objLength","othProps","objStacked","skipCtor","objValue","objCtor","othCtor","_equalObjects","Stack","getTag","isArray","isBuffer","require$$6","isTypedArray","require$$7","argsTag","arrayTag","objectTag","baseIsEqualDeep","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","_baseIsEqualDeep","isObjectLike","baseIsEqual","_baseIsEqual","baseIsMatch","source","matchData","noCustomizer","data","srcValue","_baseIsMatch","isObject","isStrictComparable","_isStrictComparable","getMatchData","_getMatchData","matchesStrictComparable","_matchesStrictComparable","baseMatches","_baseMatches","baseGetTag","isSymbol","isSymbol_1","reIsDeepProp","reIsPlainProp","isKey","type","_isKey","FUNC_ERROR_TEXT","memoize","func","resolver","memoized","args","memoize_1","MAX_MEMOIZE_SIZE","memoizeCapped","_memoizeCapped","rePropName","reEscapeChar","stringToPath","string","match","number","quote","subString","_stringToPath","arrayMap","_arrayMap","symbolToString","baseToString","_baseToString","toString","toString_1","castPath","_castPath","toKey","_toKey","baseGet","path","_baseGet","get","defaultValue","get_1","baseHasIn","_baseHasIn","isArguments","isIndex","isLength","hasPath","hasFunc","_hasPath","hasIn","hasIn_1","baseMatchesProperty","_baseMatchesProperty","identity","identity_1","baseProperty","_baseProperty","basePropertyDeep","_basePropertyDeep","property","property_1","baseIteratee","_baseIteratee","baseAssignValue","mapValues","mapValues_1","humanizeDurationLanguages","DATE_FORMAT_STORAGE_KEY","TIMEZONE_STORAGE_KEY","capitalize","str","dateFilter","dateString","format","currentLocale","_a","getCurrentInstance","momentInstance","_b","f","momentTz","splitFirst","separator","duration","isoString","moment","humanDuration","options","humanizeDuration","afterLastDot","distinctFilter","Utils","baseClone","CLONE_SYMBOLS_FLAG","clone","clone_1","constant","constant_1","isArrayLike","createBaseEach","eachFunc","collection","_createBaseEach","baseEach","_baseEach","castFunction","_castFunction","arrayEach","forEach","forEach_1","each","baseFilter","_baseFilter","arrayFilter","filter","filter_1","baseHas","_baseHas","has","has_1","baseKeys","isPrototype","isEmpty","isEmpty_1","isUndefined","isUndefined_1","baseMap","_baseMap","map_1","arrayReduce","accumulator","initAccum","_arrayReduce","baseReduce","_baseReduce","reduce","reduce_1","isString","isString_1","asciiSize","_asciiSize","rsAstralRange","rsComboMarksRange","reComboHalfMarksRange","rsComboSymbolsRange","rsComboRange","rsVarRange","rsZWJ","reHasUnicode","hasUnicode","_hasUnicode","rsAstral","rsCombo","rsFitz","rsModifier","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsOptVar","rsOptJoin","rsSeq","rsSymbol","reUnicode","unicodeSize","_unicodeSize","stringSize","_stringSize","size","size_1","baseCreate","getPrototype","isFunction","require$$8","require$$9","transform","isArr","isArrLike","Ctor","transform_1","spreadableSymbol","isFlattenable","_isFlattenable","arrayPush","baseFlatten","depth","isStrict","_baseFlatten","apply","thisArg","_apply","nativeMax","overRest","start","otherArgs","_overRest","defineProperty","baseSetToString","_baseSetToString","HOT_COUNT","HOT_SPAN","nativeNow","shortOut","count","lastCalled","stamp","remaining","_shortOut","setToString","_setToString","baseRest","_baseRest","baseFindIndex","fromIndex","_baseFindIndex","baseIsNaN","_baseIsNaN","strictIndexOf","_strictIndexOf","baseIndexOf","_baseIndexOf","arrayIncludes","_arrayIncludes","arrayIncludesWith","comparator","_arrayIncludesWith","noop","noop_1","Set","INFINITY","createSet","_createSet","LARGE_ARRAY_SIZE","baseUniq","includes","isCommon","outer","computed","seenIndex","_baseUniq","isArrayLikeObject","isArrayLikeObject_1","union","arrays","union_1","baseValues","_baseValues","values_1","lodash","require","require$$10","require$$11","require$$12","require$$13","require$$14","require$$15","lodash_1","_","graph","Graph","DEFAULT_EDGE_NAME","GRAPH_NODE","EDGE_KEY_DELIM","opts","label","newDefault","self","v","vs","removeEdge","e","child","parent","ancestor","children","predsV","sucsV","preds","neighbors","copy","parents","findParent","w","name","valueSpecified","arg0","edgeArgsToId","edgeObj","edgeArgsToObj","incrementOrInitEntry","edgeObjToId","edge","decrementOrRemoveEntry","u","inV","edges","outV","inEdges","k","isDirected","v_","w_","tmp","version","lib","json","write","read","g","writeNodes","writeEdges","nodeValue","node","edgeValue","entry","components_1","components","visited","cmpts","cmpt","dfs","priorityQueue","PriorityQueue","x","priority","keyIndices","arr","min","i","l","r","largest","j","origArrI","origArrJ","dijkstra_1","dijkstra","DEFAULT_WEIGHT_FUNC","weightFn","edgeFn","runDijkstra","results","pq","vEntry","updateNeighbors","wEntry","weight","distance","dijkstraAll_1","dijkstraAll","weightFunc","edgeFunc","acc","tarjan_1","tarjan","findCycles_1","findCycles","floydWarshall_1","floydWarshall","runFloydWarshall","nodes","d","rowK","rowI","ik","kj","ij","altDistance","topsort_1","topsort","CycleException","visit","isAcyclic_1","isAcyclic","dfs_1","order","navigation","doDfs","postorder","postorder_1","preorder_1","preorder","prim_1","prim","pri","edgeWeight","init","alg","graphlib","graphlib_1","isIterateeCall","_isIterateeCall","keysIn","defaults","sources","guard","propsIndex","propsLength","defaults_1","createFind","findIndexFunc","_createFind","reWhitespace","trimmedEndIndex","_trimmedEndIndex","reTrimStart","baseTrim","_baseTrim","NAN","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","toNumber","isBinary","toNumber_1","MAX_INTEGER","toFinite","sign","toFinite_1","toInteger","remainder","toInteger_1","findIndex","findIndex_1","find","find_1","flatten","flatten_1","forIn","forIn_1","last","last_1","baseExtremum","current","_baseExtremum","baseGt","_baseGt","max","max_1","assignMergeValue","_assignMergeValue","funcProto","funcToString","objectCtorString","isPlainObject","proto","isPlainObject_1","safeGet","_safeGet","copyObject","toPlainObject","toPlainObject_1","cloneBuffer","cloneTypedArray","copyArray","initCloneObject","baseMergeDeep","srcIndex","mergeFunc","newValue","isBuff","isTyped","_baseMergeDeep","baseMerge","_baseMerge","createAssigner","assigner","_createAssigner","merge","merge_1","baseLt","_baseLt","min_1","minBy","minBy_1","root","now","now_1","assignValue","baseSet","lastIndex","nested","_baseSet","basePickBy","paths","_basePickBy","basePick","_basePick","flatRest","_flatRest","pick","pick_1","nativeCeil","baseRange","end","step","_baseRange","createRange","_createRange","range","range_1","baseSortBy","comparer","_baseSortBy","compareAscending","valIsDefined","valIsNull","valIsReflexive","valIsSymbol","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","_compareAscending","compareMultiple","orders","objCriteria","othCriteria","ordersLength","_compareMultiple","baseUnary","baseOrderBy","iteratees","criteria","_baseOrderBy","sortBy","sortBy_1","idCounter","uniqueId","prefix","id","uniqueId_1","baseZipObject","assignFunc","valsLength","_baseZipObject","zipObject","zipObject_1","require$$16","require$$17","require$$18","require$$19","require$$20","require$$21","require$$22","require$$23","require$$24","require$$25","list","List","sentinel","unlink","strs","curr","filterOutLinks","greedyFas","greedyFAS","DEFAULT_WEIGHT_FN","state","buildState","doGreedyFAS","buckets","zeroIdx","sinks","removeNode","collectPredecessors","uEntry","assignBucket","fasGraph","maxIn","maxOut","prevWeight","acyclic","run","undo","fas","dfsFAS","forwardName","util","addDummyNode","simplify","asNonCompoundGraph","successorWeights","predecessorWeights","intersectRect","buildLayerMatrix","normalizeRanks","removeEmptyRanks","addBorderNode","maxRank","partition","time","notime","attrs","simplified","simpleLabel","weightMap","sucs","rect","point","y","dx","dy","h","sx","sy","layering","rank","offset","layers","delta","nodeRankFactor","fn","normalize","normalizeEdge","vRank","wRank","edgeLabel","labelRank","dummy","origLabel","longestPath","slack","feasibleTree_1","feasibleTree","t","tightTree","findMinSlackEdge","shiftRanks","edgeV","initRank","networkSimplex_1","networkSimplex","initLowLimValues","initCutValues","calcCutValue","leaveEdge","enterEdge","exchangeEdges","assignCutValue","childLab","childIsTail","graphEdge","cutValue","isOutEdge","pointsToHead","otherWeight","isTreeEdge","otherCutValue","tree","dfsAssignLowLim","nextLim","low","vLabel","wLabel","tailLabel","flip","candidates","isDescendant","updateRanks","flipped","rootLabel","rankUtil","rank_1","networkSimplexRanker","tightTreeRanker","longestPathRanker","parentDummyChains_1","parentDummyChains","postorderNums","pathData","findPath","lca","pathIdx","pathV","ascending","vPath","wPath","lim","nestingGraph","cleanup","depths","treeDepths","height","nodeSep","sumWeights","top","bottom","childNode","childTop","childBottom","thisWeight","minlen","graphLabel","addBorderSegments_1","addBorderSegments","prop","sg","sgNode","prev","coordinateSystem","adjust","rankDir","swapWidthHeight","reverseY","swapXY","swapWidthHeightOne","reverseYOne","swapXYOne","initOrder_1","initOrder","simpleNodes","orderedVs","crossCount_1","crossCount","cc","twoLayerCrossCount","northLayer","southLayer","southPos","southEntries","firstIndex","treeSize","weightSum","barycenter_1","barycenter","movable","nodeU","resolveConflicts_1","resolveConflicts","entries","cg","mappedEntries","entryV","entryW","sourceSet","doResolveConflicts","handleIn","mergeEntries","handleOut","target","sum","sort_1","sort","biasRight","parts","sortable","unsortable","vsIndex","compareWithBias","consumeUnsortable","bias","sortSubgraph_1","sortSubgraph","bl","br","subgraphs","barycenters","subgraphResult","mergeBarycenters","expandSubgraphs","blPred","brPred","buildLayerGraph_1","buildLayerGraph","relationship","createRootNode","addSubgraphConstraints_1","addSubgraphConstraints","rootPrev","prevChild","order_1","downLayerGraphs","buildLayerGraphs","upLayerGraphs","assignOrder","bestCC","best","lastBest","sweepLayerGraphs","ranks","layerGraphs","lg","sorted","layer","bk","positionX","findType1Conflicts","findType2Conflicts","addConflict","hasConflict","verticalAlignment","horizontalCompaction","alignCoordinates","findSmallestWidthAlignment","balance","conflicts","visitLayer","prevLayer","k0","scanPos","prevLayerLength","lastNode","findOtherInnerSegmentNode","k1","scanNode","uLabel","uPos","scan","south","southEnd","prevNorthBorder","nextNorthBorder","uNode","north","prevNorthPos","nextNorthPos","southLookahead","predecessors","conflictsV","neighborFn","align","pos","prevIdx","ws","mp","il","reverseSep","xs","blockG","buildBlockGraph","borderType","iterate","setXsFunc","nextNodesFunc","elem","pass1","pass2","blockGraph","sepFn","sep","vRoot","uRoot","prevMax","xss","halfWidth","width","alignTo","alignToVals","alignToMin","alignToMax","vert","horiz","alignment","xsVals","ignore","adjustedLayering","inner","smallestWidth","edgeSep","position_1","position","positionY","rankSep","prevY","maxHeight","layout_1","layout","layoutGraph","buildLayoutGraph","runLayout","updateInputGraph","makeSpaceForEdgeLabels","removeSelfEdges","injectEdgeLabelProxies","assignRankMinMax","removeEdgeLabelProxies","insertSelfEdges","positionSelfEdges","removeBorderNodes","fixupEdgeLabelCoords","translateGraph","assignNodeIntersects","reversePointsForReversedEdges","inputGraph","inputLabel","layoutLabel","graphNumAttrs","graphDefaults","graphAttrs","nodeNumAttrs","nodeDefaults","edgeNumAttrs","edgeDefaults","edgeAttrs","canonicalize","selectNumberAttrs","minX","maxX","minY","maxY","marginX","marginY","getExtremes","p","nodeV","nodeW","p1","p2","b","orderShift","selfEdge","selfNode","obj","newAttrs","debug","debugOrdering","layerMatrix","layerV","dagre","isEqual","isEqual_1","TRIGGERS_NODE_UID","predecessorsEdge","vueFlowId","nodeUid","getEdges","useVueFlow","recursiveEdge","successorsEdge","predecessorsNode","findNode","foundNode","successorsNode","linkedElements","generateDagreGraph","flowGraph","hiddenNodes","isHorizontal","clustersWithoutRootNode","edgeReplacer","collapsed","clusterToNode","dagreGraph","getNodeWidth","getNodeHeight","cluster","nodeChild","newEdge","replaceIfCollapsed","getNodePosition","n","parentPosition","isTaskNode","isTriggerNode","isCollapsedCluster","newSource","newTarget","cleanGraph","vueflowId","getNodes","getElements","removeEdges","removeNodes","removeSelectedElements","flowHaveTasks","yamlFlowHaveTask","nodeColor","haveAdd","nodeByUid","clustersRootTaskUids","readOnlyUidPrefixes","dotSplitTarget","targetNodeClusterUid","clusterRootTaskId","targetNode","_c","sourceIsEndOfCluster","dotSplitSource","getEdgeColor","clusterByNodeUid","findRootBranchType","nodeId","uidParts","parentUid","branchType","sourceBranchType","targetBranchType","generateGraph","_vueFlowId","flowId","namespace","flowSource","isReadOnly","isAllowedEdit","enableSubflowInteraction","elements","Position","clusters","rawClusters","c","clusterUid","dagreNode","parentNode","clusterColor","computeClusterColor","nodeType","isClusterRootOrEnd","color","isReadOnlyTask","_d","_g","_f","_e","_j","_i","_h","_k","isExpandableTask","clusterRootTaskNodeUids","edgeColor","_l","MarkerType","s","getRootNodes","rootUIDs","uid","getTargetNodesEdges","getNextTaskNodes","initialNode","nextTaskNodes","nodeUIDs","areTasksIdenticalInGraphUntilTask","previousGraph","currentGraph","taskId","previousRootTaskNodes","currentRootTaskNodes","failIndex","currentTaskNode","prevTaskNode","taskNode","prevTaskValue","currentTaskValue","VueFlowUtils"],"mappings":";;;;;;AAAO,MAAMA,KAAW;AAAA,EACtB,OAAO;AAAA,EACP,UAAU;AAAA,EACV,cAAc;AAChB,GAEaC,KAAS;AAAA,EACpB,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,kBAAkB;AAAA,EAClB,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,UAAU;AAAA,EACV,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,WAAW;AAAA,EACX,qBAAqB;AAAA,EACrB,gBAAgB;AAAA,EAChB,UAAU;AACZ,GAEaC,KAAiB,YAEjBC,KAAwB;AAAA,EACnC,YAAY;AAAA,EACZ,UAAU;AACZ,GAEaC,KAAkB;AAAA,EAC7B,KAAK;AAAA,EACL,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,SAAS;AACX,GAEaC,KAAa;AAAA,EACxB,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,eAAe;AAAA,EACf,gBAAgB;AAAA,EAChB,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,yBAAyB;AAAA,EACzB,0BAA0B;AAAA,EAC1B,uBAAuB;AAAA,EACvB,wBAAwB;AAC1B,GAEaC,KAAkB;AAAA,EAC7B,aAAa;AAAA,EACb,QAAQ;AAAA,EACR,iBAAiB;AAAA,EACjB,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,mBAAmB;AACrB,GAEaC,KAAc;AAAA,EACzB,4BAA4B;AAAA,EAC5B,iCAAiC;AAAA,EACjC,iBAAiB;AAAA,EACjB,wBAAwB;AAAA,EACxB,YAAY;AAAA,EACZ,kBAAkB;AAAA,EAClB,iBAAiB;AAAA,EACjB,mBAAmB;AAAA,EACnB,kBAAkB;AAAA,EAClB,iBAAiB;AAAA,EACjB,aAAa;AAAA,EACb,kBAAkB;AACpB,GAEaC,KAAwB;AAAA,EACnC,UAAU;AAAA,EACV,SAAS;AACX,GAEaC,KAAqB;AAAA,EAChC,YAAY;AACd;;;;;AC1EA,WAASC,EAAcC,GAAW;AAChC,WAAO,SAASC,GAAQC,GAAUC,GAAU;AAM1C,eALIC,IAAQ,IACRC,IAAW,OAAOJ,CAAM,GACxBK,IAAQH,EAASF,CAAM,GACvBM,IAASD,EAAM,QAEZC,OAAU;AACf,YAAIC,IAAMF,EAAMN,IAAYO,IAAS,EAAEH,CAAK;AAC5C,YAAIF,EAASG,EAASG,CAAG,GAAGA,GAAKH,CAAQ,MAAM;AAC7C;AAAA,MAER;AACI,aAAOJ;AAAA,IACR;AAAA,EACH;AAEA,SAAAQ,KAAiBV;;;;;;ACxBjB,MAAIA,IAAgBW,GAA2B,GAa3CC,IAAUZ,EAAe;AAE7B,SAAAa,KAAiBD;;;;;;ACfjB,MAAIA,IAAUD,GAAqB,GAC/BG,IAAOC,GAAiB;AAU5B,WAASC,EAAWd,GAAQC,GAAU;AACpC,WAAOD,KAAUU,EAAQV,GAAQC,GAAUW,CAAI;AAAA,EACjD;AAEA,SAAAG,KAAiBD;;;;;;ACdjB,MAAIE,IAAiB;AAYrB,WAASC,EAAYC,GAAO;AAC1B,gBAAK,SAAS,IAAIA,GAAOF,CAAc,GAChC;AAAA,EACT;AAEA,SAAAG,KAAiBF;;;;;;ACTjB,WAASG,EAAYF,GAAO;AAC1B,WAAO,KAAK,SAAS,IAAIA,CAAK;AAAA,EAChC;AAEA,SAAAG,KAAiBD;;;;;;ACbjB,MAAIE,IAAWb,GAAsB,GACjCQ,IAAcJ,GAAyB,GACvCO,IAAcG,GAAyB;AAU3C,WAASC,EAASC,GAAQ;AACxB,QAAItB,IAAQ,IACRG,IAASmB,KAAU,OAAO,IAAIA,EAAO;AAGzC,SADA,KAAK,WAAW,IAAIH,KACb,EAAEnB,IAAQG;AACf,WAAK,IAAImB,EAAOtB,CAAK,CAAC;AAAA,EAE1B;AAGA,SAAAqB,EAAS,UAAU,MAAMA,EAAS,UAAU,OAAOP,GACnDO,EAAS,UAAU,MAAMJ,GAEzBM,KAAiBF;;;;;;AChBjB,WAASG,EAAUC,GAAOC,GAAW;AAInC,aAHI1B,IAAQ,IACRG,IAASsB,KAAS,OAAO,IAAIA,EAAM,QAEhC,EAAEzB,IAAQG;AACf,UAAIuB,EAAUD,EAAMzB,CAAK,GAAGA,GAAOyB,CAAK;AACtC,eAAO;AAGX,WAAO;AAAA,EACT;AAEA,SAAAE,KAAiBH;;;;;;ACdjB,WAASI,EAASC,GAAOzB,GAAK;AAC5B,WAAOyB,EAAM,IAAIzB,CAAG;AAAA,EACtB;AAEA,SAAA0B,KAAiBF;;;;;;ACZjB,MAAIP,IAAWf,GAAsB,GACjCkB,IAAYd,GAAuB,GACnCkB,IAAWR,GAAsB,GAGjCW,IAAuB,GACvBC,IAAyB;AAe7B,WAASC,EAAYR,GAAOS,GAAOC,GAASC,GAAYC,GAAWC,GAAO;AACxE,QAAIC,IAAYJ,IAAUJ,GACtBS,IAAYf,EAAM,QAClBgB,IAAYP,EAAM;AAEtB,QAAIM,KAAaC,KAAa,EAAEF,KAAaE,IAAYD;AACvD,aAAO;AAGT,QAAIE,IAAaJ,EAAM,IAAIb,CAAK,GAC5BkB,IAAaL,EAAM,IAAIJ,CAAK;AAChC,QAAIQ,KAAcC;AAChB,aAAOD,KAAcR,KAASS,KAAclB;AAE9C,QAAIzB,IAAQ,IACR4C,IAAS,IACTC,IAAQV,IAAUH,IAA0B,IAAIX,MAAW;AAM/D,SAJAiB,EAAM,IAAIb,GAAOS,CAAK,GACtBI,EAAM,IAAIJ,GAAOT,CAAK,GAGf,EAAEzB,IAAQwC,KAAW;AAC1B,UAAIM,IAAWrB,EAAMzB,CAAK,GACtB+C,IAAWb,EAAMlC,CAAK;AAE1B,UAAIoC;AACF,YAAIY,IAAWT,IACXH,EAAWW,GAAUD,GAAU9C,GAAOkC,GAAOT,GAAOa,CAAK,IACzDF,EAAWU,GAAUC,GAAU/C,GAAOyB,GAAOS,GAAOI,CAAK;AAE/D,UAAIU,MAAa,QAAW;AAC1B,YAAIA;AACF;AAEF,QAAAJ,IAAS;AACT;AAAA,MACN;AAEI,UAAIC;AACF,YAAI,CAACrB,EAAUU,GAAO,SAASa,GAAUE,GAAU;AAC7C,cAAI,CAACrB,EAASiB,GAAMI,CAAQ,MACvBH,MAAaC,KAAYV,EAAUS,GAAUC,GAAUZ,GAASC,GAAYE,CAAK;AACpF,mBAAOO,EAAK,KAAKI,CAAQ;AAAA,QAEvC,CAAW,GAAG;AACN,UAAAL,IAAS;AACT;AAAA,QACR;AAAA,iBACe,EACLE,MAAaC,KACXV,EAAUS,GAAUC,GAAUZ,GAASC,GAAYE,CAAK,IACzD;AACL,QAAAM,IAAS;AACT;AAAA,MACN;AAAA,IACA;AACE,WAAAN,EAAM,OAAUb,CAAK,GACrBa,EAAM,OAAUJ,CAAK,GACdU;AAAA,EACT;AAEA,SAAAM,KAAiBjB;;;;;;AC5EjB,WAASkB,EAAWC,GAAK;AACvB,QAAIpD,IAAQ,IACR4C,IAAS,MAAMQ,EAAI,IAAI;AAE3B,WAAAA,EAAI,QAAQ,SAASrC,GAAOX,GAAK;AAC/B,MAAAwC,EAAO,EAAE5C,CAAK,IAAI,CAACI,GAAKW,CAAK;AAAA,IACjC,CAAG,GACM6B;AAAA,EACT;AAEA,SAAAS,KAAiBF;;;;;;ACVjB,WAASG,EAAWC,GAAK;AACvB,QAAIvD,IAAQ,IACR4C,IAAS,MAAMW,EAAI,IAAI;AAE3B,WAAAA,EAAI,QAAQ,SAASxC,GAAO;AAC1B,MAAA6B,EAAO,EAAE5C,CAAK,IAAIe;AAAA,IACtB,CAAG,GACM6B;AAAA,EACT;AAEA,SAAAY,KAAiBF;;;;;;ACjBjB,MAAIG,IAASnD,GAAoB,GAC7BoD,IAAahD,GAAwB,GACrCiD,IAAKvC,GAAe,GACpBa,IAAc2B,GAAyB,GACvCT,IAAaU,GAAwB,GACrCP,IAAaQ,GAAwB,GAGrC/B,IAAuB,GACvBC,IAAyB,GAGzB+B,IAAU,oBACVC,IAAU,iBACVC,IAAW,kBACXC,IAAS,gBACTC,IAAY,mBACZC,IAAY,mBACZC,IAAS,gBACTC,IAAY,mBACZC,IAAY,mBAEZC,IAAiB,wBACjBC,IAAc,qBAGdC,IAAcjB,IAASA,EAAO,YAAY,QAC1CkB,IAAgBD,IAAcA,EAAY,UAAU;AAmBxD,WAASE,EAAW/E,GAAQqC,GAAO2C,GAAK1C,GAASC,GAAYC,GAAWC,GAAO;AAC7E,YAAQuC,GAAG;AAAA,MACT,KAAKJ;AACH,YAAK5E,EAAO,cAAcqC,EAAM,cAC3BrC,EAAO,cAAcqC,EAAM;AAC9B,iBAAO;AAET,QAAArC,IAASA,EAAO,QAChBqC,IAAQA,EAAM;AAAA,MAEhB,KAAKsC;AACH,eAAK,EAAA3E,EAAO,cAAcqC,EAAM,cAC5B,CAACG,EAAU,IAAIqB,EAAW7D,CAAM,GAAG,IAAI6D,EAAWxB,CAAK,CAAC;AAAA,MAK9D,KAAK6B;AAAA,MACL,KAAKC;AAAA,MACL,KAAKG;AAGH,eAAOR,EAAG,CAAC9D,GAAQ,CAACqC,CAAK;AAAA,MAE3B,KAAK+B;AACH,eAAOpE,EAAO,QAAQqC,EAAM,QAAQrC,EAAO,WAAWqC,EAAM;AAAA,MAE9D,KAAKkC;AAAA,MACL,KAAKE;AAIH,eAAOzE,KAAWqC,IAAQ;AAAA,MAE5B,KAAKgC;AACH,YAAIY,IAAU3B;AAAA,MAEhB,KAAKkB;AACH,YAAI9B,IAAYJ,IAAUJ;AAG1B,YAFA+C,MAAYA,IAAUxB,IAElBzD,EAAO,QAAQqC,EAAM,QAAQ,CAACK;AAChC,iBAAO;AAGT,YAAIwC,IAAUzC,EAAM,IAAIzC,CAAM;AAC9B,YAAIkF;AACF,iBAAOA,KAAW7C;AAEpB,QAAAC,KAAWH,GAGXM,EAAM,IAAIzC,GAAQqC,CAAK;AACvB,YAAIU,IAASX,EAAY6C,EAAQjF,CAAM,GAAGiF,EAAQ5C,CAAK,GAAGC,GAASC,GAAYC,GAAWC,CAAK;AAC/F,eAAAA,EAAM,OAAUzC,CAAM,GACf+C;AAAA,MAET,KAAK2B;AACH,YAAII;AACF,iBAAOA,EAAc,KAAK9E,CAAM,KAAK8E,EAAc,KAAKzC,CAAK;AAAA,IAErE;AACE,WAAO;AAAA,EACT;AAEA,SAAA8C,KAAiBJ;;;;;;AC/GjB,MAAIK,IAAa3E,GAAwB,GAGrCyB,IAAuB,GAGvBmD,IAAc,OAAO,WAGrBC,IAAiBD,EAAY;AAejC,WAASE,EAAavF,GAAQqC,GAAOC,GAASC,GAAYC,GAAWC,GAAO;AAC1E,QAAIC,IAAYJ,IAAUJ,GACtBsD,IAAWJ,EAAWpF,CAAM,GAC5ByF,IAAYD,EAAS,QACrBE,IAAWN,EAAW/C,CAAK,GAC3BO,IAAY8C,EAAS;AAEzB,QAAID,KAAa7C,KAAa,CAACF;AAC7B,aAAO;AAGT,aADIvC,IAAQsF,GACLtF,OAAS;AACd,UAAII,IAAMiF,EAASrF,CAAK;AACxB,UAAI,EAAEuC,IAAYnC,KAAO8B,IAAQiD,EAAe,KAAKjD,GAAO9B,CAAG;AAC7D,eAAO;AAAA,IAEb;AAEE,QAAIoF,IAAalD,EAAM,IAAIzC,CAAM,GAC7B8C,IAAaL,EAAM,IAAIJ,CAAK;AAChC,QAAIsD,KAAc7C;AAChB,aAAO6C,KAActD,KAASS,KAAc9C;AAE9C,QAAI+C,IAAS;AACb,IAAAN,EAAM,IAAIzC,GAAQqC,CAAK,GACvBI,EAAM,IAAIJ,GAAOrC,CAAM;AAGvB,aADI4F,IAAWlD,GACR,EAAEvC,IAAQsF,KAAW;AAC1B,MAAAlF,IAAMiF,EAASrF,CAAK;AACpB,UAAI0F,IAAW7F,EAAOO,CAAG,GACrB2C,IAAWb,EAAM9B,CAAG;AAExB,UAAIgC;AACF,YAAIY,IAAWT,IACXH,EAAWW,GAAU2C,GAAUtF,GAAK8B,GAAOrC,GAAQyC,CAAK,IACxDF,EAAWsD,GAAU3C,GAAU3C,GAAKP,GAAQqC,GAAOI,CAAK;AAG9D,UAAI,EAAEU,MAAa,SACV0C,MAAa3C,KAAYV,EAAUqD,GAAU3C,GAAUZ,GAASC,GAAYE,CAAK,IAClFU,IACD;AACL,QAAAJ,IAAS;AACT;AAAA,MACN;AACI,MAAA6C,MAAaA,IAAWrF,KAAO;AAAA,IACnC;AACE,QAAIwC,KAAU,CAAC6C,GAAU;AACvB,UAAIE,IAAU9F,EAAO,aACjB+F,IAAU1D,EAAM;AAGpB,MAAIyD,KAAWC,KACV,iBAAiB/F,KAAU,iBAAiBqC,KAC7C,EAAE,OAAOyD,KAAW,cAAcA,aAAmBA,KACnD,OAAOC,KAAW,cAAcA,aAAmBA,OACvDhD,IAAS;AAAA,IAEf;AACE,WAAAN,EAAM,OAAUzC,CAAM,GACtByC,EAAM,OAAUJ,CAAK,GACdU;AAAA,EACT;AAEA,SAAAiD,KAAiBT;;;;;;ACzFjB,MAAIU,IAAQxF,GAAmB,GAC3B2B,IAAcvB,GAAyB,GACvCkE,IAAaxD,GAAwB,GACrCgE,IAAexB,GAA0B,GACzCmC,IAASlC,GAAoB,GAC7BmC,IAAUlC,EAAoB,GAC9BmC,IAAWC,GAAqB,GAChCC,IAAeC,GAAyB,GAGxCrE,IAAuB,GAGvBsE,IAAU,sBACVC,IAAW,kBACXC,IAAY,mBAGZrB,IAAc,OAAO,WAGrBC,IAAiBD,EAAY;AAgBjC,WAASsB,EAAgB3G,GAAQqC,GAAOC,GAASC,GAAYC,GAAWC,GAAO;AAC7E,QAAImE,IAAWT,EAAQnG,CAAM,GACzB6G,IAAWV,EAAQ9D,CAAK,GACxByE,IAASF,IAAWH,IAAWP,EAAOlG,CAAM,GAC5C+G,IAASF,IAAWJ,IAAWP,EAAO7D,CAAK;AAE/C,IAAAyE,IAASA,KAAUN,IAAUE,IAAYI,GACzCC,IAASA,KAAUP,IAAUE,IAAYK;AAEzC,QAAIC,IAAWF,KAAUJ,GACrBO,IAAWF,KAAUL,GACrBQ,IAAYJ,KAAUC;AAE1B,QAAIG,KAAad,EAASpG,CAAM,GAAG;AACjC,UAAI,CAACoG,EAAS/D,CAAK;AACjB,eAAO;AAET,MAAAuE,IAAW,IACXI,IAAW;AAAA,IACf;AACE,QAAIE,KAAa,CAACF;AAChB,aAAAvE,MAAUA,IAAQ,IAAIwD,MACdW,KAAYN,EAAatG,CAAM,IACnCoC,EAAYpC,GAAQqC,GAAOC,GAASC,GAAYC,GAAWC,CAAK,IAChEsC,EAAW/E,GAAQqC,GAAOyE,GAAQxE,GAASC,GAAYC,GAAWC,CAAK;AAE7E,QAAI,EAAEH,IAAUJ,IAAuB;AACrC,UAAIiF,IAAeH,KAAY1B,EAAe,KAAKtF,GAAQ,aAAa,GACpEoH,IAAeH,KAAY3B,EAAe,KAAKjD,GAAO,aAAa;AAEvE,UAAI8E,KAAgBC,GAAc;AAChC,YAAIC,IAAeF,IAAenH,EAAO,MAAO,IAAGA,GAC/CsH,IAAeF,IAAe/E,EAAM,MAAO,IAAGA;AAElD,eAAAI,MAAUA,IAAQ,IAAIwD,MACfzD,EAAU6E,GAAcC,GAAchF,GAASC,GAAYE,CAAK;AAAA,MAC7E;AAAA,IACA;AACE,WAAKyE,KAGLzE,MAAUA,IAAQ,IAAIwD,MACfV,EAAavF,GAAQqC,GAAOC,GAASC,GAAYC,GAAWC,CAAK,KAH/D;AAAA,EAIX;AAEA,SAAA8E,KAAiBZ;;;;;;AClFjB,MAAIA,IAAkBlG,GAA6B,GAC/C+G,IAAe3G,GAAyB;AAgB5C,WAAS4G,EAAYvG,GAAOmB,GAAOC,GAASC,GAAYE,GAAO;AAC7D,WAAIvB,MAAUmB,IACL,KAELnB,KAAS,QAAQmB,KAAS,QAAS,CAACmF,EAAatG,CAAK,KAAK,CAACsG,EAAanF,CAAK,IACzEnB,MAAUA,KAASmB,MAAUA,IAE/BsE,EAAgBzF,GAAOmB,GAAOC,GAASC,GAAYkF,GAAahF,CAAK;AAAA,EAC9E;AAEA,SAAAiF,KAAiBD;;;;;;AC3BjB,MAAIxB,IAAQxF,GAAmB,GAC3BgH,IAAc5G,GAAyB,GAGvCqB,IAAuB,GACvBC,IAAyB;AAY7B,WAASwF,EAAY3H,GAAQ4H,GAAQC,GAAWtF,GAAY;AAC1D,QAAIpC,IAAQ0H,EAAU,QAClBvH,IAASH,GACT2H,IAAe,CAACvF;AAEpB,QAAIvC,KAAU;AACZ,aAAO,CAACM;AAGV,SADAN,IAAS,OAAOA,CAAM,GACfG,OAAS;AACd,UAAI4H,IAAOF,EAAU1H,CAAK;AAC1B,UAAK2H,KAAgBC,EAAK,CAAC,IACnBA,EAAK,CAAC,MAAM/H,EAAO+H,EAAK,CAAC,CAAC,IAC1B,EAAEA,EAAK,CAAC,KAAK/H;AAEnB,eAAO;AAAA,IAEb;AACE,WAAO,EAAEG,IAAQG,KAAQ;AACvB,MAAAyH,IAAOF,EAAU1H,CAAK;AACtB,UAAII,IAAMwH,EAAK,CAAC,GACZlC,IAAW7F,EAAOO,CAAG,GACrByH,IAAWD,EAAK,CAAC;AAErB,UAAID,KAAgBC,EAAK,CAAC;AACxB,YAAIlC,MAAa,UAAa,EAAEtF,KAAOP;AACrC,iBAAO;AAAA,aAEJ;AACL,YAAIyC,IAAQ,IAAIwD;AAChB,YAAI1D;AACF,cAAIQ,IAASR,EAAWsD,GAAUmC,GAAUzH,GAAKP,GAAQ4H,GAAQnF,CAAK;AAExE,YAAI,EAAEM,MAAW,SACT0E,EAAYO,GAAUnC,GAAU3D,IAAuBC,GAAwBI,GAAYE,CAAK,IAChGM;AAEN,iBAAO;AAAA,MAEf;AAAA,IACA;AACE,WAAO;AAAA,EACT;AAEA,SAAAkF,KAAiBN;;;;;;AC7DjB,MAAIO,IAAWzH,GAAqB;AAUpC,WAAS0H,EAAmBjH,GAAO;AACjC,WAAOA,MAAUA,KAAS,CAACgH,EAAShH,CAAK;AAAA,EAC3C;AAEA,SAAAkH,KAAiBD;;;;;;ACdjB,MAAIA,IAAqB1H,GAAgC,GACrDG,IAAOC,GAAiB;AAS5B,WAASwH,EAAarI,GAAQ;AAI5B,aAHI+C,IAASnC,EAAKZ,CAAM,GACpBM,IAASyC,EAAO,QAEbzC,OAAU;AACf,UAAIC,IAAMwC,EAAOzC,CAAM,GACnBY,IAAQlB,EAAOO,CAAG;AAEtB,MAAAwC,EAAOzC,CAAM,IAAI,CAACC,GAAKW,GAAOiH,EAAmBjH,CAAK,CAAC;AAAA,IAC3D;AACE,WAAO6B;AAAA,EACT;AAEA,SAAAuF,KAAiBD;;;;;;ACdjB,WAASE,EAAwBhI,GAAKyH,GAAU;AAC9C,WAAO,SAAShI,GAAQ;AACtB,aAAIA,KAAU,OACL,KAEFA,EAAOO,CAAG,MAAMyH,MACpBA,MAAa,UAAczH,KAAO,OAAOP,CAAM;AAAA,IACnD;AAAA,EACH;AAEA,SAAAwI,KAAiBD;;;;;;ACnBjB,MAAIZ,IAAclH,GAAyB,GACvC4H,IAAexH,GAA0B,GACzC0H,IAA0BhH,GAAqC;AASnE,WAASkH,EAAYb,GAAQ;AAC3B,QAAIC,IAAYQ,EAAaT,CAAM;AACnC,WAAIC,EAAU,UAAU,KAAKA,EAAU,CAAC,EAAE,CAAC,IAClCU,EAAwBV,EAAU,CAAC,EAAE,CAAC,GAAGA,EAAU,CAAC,EAAE,CAAC,CAAC,IAE1D,SAAS7H,GAAQ;AACtB,aAAOA,MAAW4H,KAAUD,EAAY3H,GAAQ4H,GAAQC,CAAS;AAAA,IAClE;AAAA,EACH;AAEA,SAAAa,KAAiBD;;;;;;ACrBjB,MAAIE,IAAalI,GAAwB,GACrC+G,IAAe3G,GAAyB,GAGxC6D,IAAY;AAmBhB,WAASkE,EAAS1H,GAAO;AACvB,WAAO,OAAOA,KAAS,YACpBsG,EAAatG,CAAK,KAAKyH,EAAWzH,CAAK,KAAKwD;AAAA,EACjD;AAEA,SAAAmE,KAAiBD;;;;;;AC5BjB,MAAIzC,IAAU1F,EAAoB,GAC9BmI,IAAW/H,GAAqB,GAGhCiI,IAAe,oDACfC,IAAgB;AAUpB,WAASC,EAAM9H,GAAOlB,GAAQ;AAC5B,QAAImG,EAAQjF,CAAK;AACf,aAAO;AAET,QAAI+H,IAAO,OAAO/H;AAClB,WAAI+H,KAAQ,YAAYA,KAAQ,YAAYA,KAAQ,aAChD/H,KAAS,QAAQ0H,EAAS1H,CAAK,IAC1B,KAEF6H,EAAc,KAAK7H,CAAK,KAAK,CAAC4H,EAAa,KAAK5H,CAAK,KACzDlB,KAAU,QAAQkB,KAAS,OAAOlB,CAAM;AAAA,EAC7C;AAEA,SAAAkJ,KAAiBF;;;;;;AC5BjB,MAAI1H,IAAWb,GAAsB,GAGjC0I,IAAkB;AA8CtB,WAASC,EAAQC,GAAMC,GAAU;AAC/B,QAAI,OAAOD,KAAQ,cAAeC,KAAY,QAAQ,OAAOA,KAAY;AACvE,YAAM,IAAI,UAAUH,CAAe;AAErC,QAAII,IAAW,WAAW;AACxB,UAAIC,IAAO,WACPjJ,IAAM+I,IAAWA,EAAS,MAAM,MAAME,CAAI,IAAIA,EAAK,CAAC,GACpDxH,IAAQuH,EAAS;AAErB,UAAIvH,EAAM,IAAIzB,CAAG;AACf,eAAOyB,EAAM,IAAIzB,CAAG;AAEtB,UAAIwC,IAASsG,EAAK,MAAM,MAAMG,CAAI;AAClC,aAAAD,EAAS,QAAQvH,EAAM,IAAIzB,GAAKwC,CAAM,KAAKf,GACpCe;AAAA,IACR;AACD,WAAAwG,EAAS,QAAQ,KAAKH,EAAQ,SAAS9H,MAChCiI;AAAA,EACT;AAGA,SAAAH,EAAQ,QAAQ9H,GAEhBmI,KAAiBL;;;;;;ACxEjB,MAAIA,IAAU3I,GAAoB,GAG9BiJ,IAAmB;AAUvB,WAASC,EAAcN,GAAM;AAC3B,QAAItG,IAASqG,EAAQC,GAAM,SAAS9I,GAAK;AACvC,aAAIyB,EAAM,SAAS0H,KACjB1H,EAAM,MAAO,GAERzB;AAAA,IACX,CAAG,GAEGyB,IAAQe,EAAO;AACnB,WAAOA;AAAA,EACT;AAEA,SAAA6G,KAAiBD;;;;;;ACzBjB,MAAIA,IAAgBlJ,GAA2B,GAG3CoJ,IAAa,oGAGbC,IAAe,YASfC,IAAeJ,EAAc,SAASK,GAAQ;AAChD,QAAIjH,IAAS,CAAE;AACf,WAAIiH,EAAO,WAAW,CAAC,MAAM,MAC3BjH,EAAO,KAAK,EAAE,GAEhBiH,EAAO,QAAQH,GAAY,SAASI,GAAOC,GAAQC,GAAOC,GAAW;AACnE,MAAArH,EAAO,KAAKoH,IAAQC,EAAU,QAAQN,GAAc,IAAI,IAAKI,KAAUD,CAAM;AAAA,IACjF,CAAG,GACMlH;AAAA,EACT,CAAC;AAED,SAAAsH,KAAiBN;;;;;;ACjBjB,WAASO,EAAS1I,GAAO3B,GAAU;AAKjC,aAJIE,IAAQ,IACRG,IAASsB,KAAS,OAAO,IAAIA,EAAM,QACnCmB,IAAS,MAAMzC,CAAM,GAElB,EAAEH,IAAQG;AACf,MAAAyC,EAAO5C,CAAK,IAAIF,EAAS2B,EAAMzB,CAAK,GAAGA,GAAOyB,CAAK;AAErD,WAAOmB;AAAA,EACT;AAEA,SAAAwH,KAAiBD;;;;;;ACpBjB,MAAI1G,IAASnD,GAAoB,GAC7B6J,IAAWzJ,GAAsB,GACjCsF,IAAU5E,EAAoB,GAC9BqH,IAAW7E,GAAqB,GAMhCc,IAAcjB,IAASA,EAAO,YAAY,QAC1C4G,IAAiB3F,IAAcA,EAAY,WAAW;AAU1D,WAAS4F,EAAavJ,GAAO;AAE3B,QAAI,OAAOA,KAAS;AAClB,aAAOA;AAET,QAAIiF,EAAQjF,CAAK;AAEf,aAAOoJ,EAASpJ,GAAOuJ,CAAY,IAAI;AAEzC,QAAI7B,EAAS1H,CAAK;AAChB,aAAOsJ,IAAiBA,EAAe,KAAKtJ,CAAK,IAAI;AAEvD,QAAI6B,IAAU7B,IAAQ;AACtB,WAAQ6B,KAAU,OAAQ,IAAI7B,KAAU,SAAa,OAAO6B;AAAA,EAC9D;AAEA,SAAA2H,KAAiBD;;;;;;ACpCjB,MAAIA,IAAehK,GAA0B;AAuB7C,WAASkK,EAASzJ,GAAO;AACvB,WAAOA,KAAS,OAAO,KAAKuJ,EAAavJ,CAAK;AAAA,EAChD;AAEA,SAAA0J,KAAiBD;;;;;;AC3BjB,MAAIxE,IAAU1F,EAAoB,GAC9BuI,IAAQnI,GAAmB,GAC3BkJ,IAAexI,GAA0B,GACzCoJ,IAAW5G,GAAqB;AAUpC,WAAS8G,EAAS3J,GAAOlB,GAAQ;AAC/B,WAAImG,EAAQjF,CAAK,IACRA,IAEF8H,EAAM9H,GAAOlB,CAAM,IAAI,CAACkB,CAAK,IAAI6I,EAAaY,EAASzJ,CAAK,CAAC;AAAA,EACtE;AAEA,SAAA4J,KAAiBD;;;;;;ACpBjB,MAAIjC,IAAWnI,GAAqB;AAYpC,WAASsK,EAAM7J,GAAO;AACpB,QAAI,OAAOA,KAAS,YAAY0H,EAAS1H,CAAK;AAC5C,aAAOA;AAET,QAAI6B,IAAU7B,IAAQ;AACtB,WAAQ6B,KAAU,OAAQ,IAAI7B,KAAU,SAAa,OAAO6B;AAAA,EAC9D;AAEA,SAAAiI,KAAiBD;;;;;;ACpBjB,MAAIF,IAAWpK,GAAsB,GACjCsK,IAAQlK,GAAmB;AAU/B,WAASoK,EAAQjL,GAAQkL,GAAM;AAC7B,IAAAA,IAAOL,EAASK,GAAMlL,CAAM;AAK5B,aAHIG,IAAQ,GACRG,IAAS4K,EAAK,QAEXlL,KAAU,QAAQG,IAAQG;AAC/B,MAAAN,IAASA,EAAO+K,EAAMG,EAAK/K,GAAO,CAAC,CAAC;AAEtC,WAAQA,KAASA,KAASG,IAAUN,IAAS;AAAA,EAC/C;AAEA,SAAAmL,KAAiBF;;;;;;ACvBjB,MAAIA,IAAUxK,GAAqB;AA2BnC,WAAS2K,EAAIpL,GAAQkL,GAAMG,GAAc;AACvC,QAAItI,IAAS/C,KAAU,OAAO,SAAYiL,EAAQjL,GAAQkL,CAAI;AAC9D,WAAOnI,MAAW,SAAYsI,IAAetI;AAAA,EAC/C;AAEA,SAAAuI,KAAiBF;;;;;;ACxBjB,WAASG,EAAUvL,GAAQO,GAAK;AAC9B,WAAOP,KAAU,QAAQO,KAAO,OAAOP,CAAM;AAAA,EAC/C;AAEA,SAAAwL,KAAiBD;;;;;;ACZjB,MAAIV,IAAWpK,GAAsB,GACjCgL,IAAc5K,GAAwB,GACtCsF,IAAU5E,EAAoB,GAC9BmK,IAAU3H,GAAqB,GAC/B4H,IAAW3H,GAAqB,GAChC+G,IAAQ9G,GAAmB;AAW/B,WAAS2H,EAAQ5L,GAAQkL,GAAMW,GAAS;AACtC,IAAAX,IAAOL,EAASK,GAAMlL,CAAM;AAM5B,aAJIG,IAAQ,IACRG,IAAS4K,EAAK,QACdnI,IAAS,IAEN,EAAE5C,IAAQG,KAAQ;AACvB,UAAIC,IAAMwK,EAAMG,EAAK/K,CAAK,CAAC;AAC3B,UAAI,EAAE4C,IAAS/C,KAAU,QAAQ6L,EAAQ7L,GAAQO,CAAG;AAClD;AAEF,MAAAP,IAASA,EAAOO,CAAG;AAAA,IACvB;AACE,WAAIwC,KAAU,EAAE5C,KAASG,IAChByC,KAETzC,IAASN,KAAU,OAAO,IAAIA,EAAO,QAC9B,CAAC,CAACM,KAAUqL,EAASrL,CAAM,KAAKoL,EAAQnL,GAAKD,CAAM,MACvD6F,EAAQnG,CAAM,KAAKyL,EAAYzL,CAAM;AAAA,EAC1C;AAEA,SAAA8L,KAAiBF;;;;;;ACtCjB,MAAIL,IAAY9K,GAAuB,GACnCmL,IAAU/K,GAAqB;AA4BnC,WAASkL,EAAM/L,GAAQkL,GAAM;AAC3B,WAAOlL,KAAU,QAAQ4L,EAAQ5L,GAAQkL,GAAMK,CAAS;AAAA,EAC1D;AAEA,SAAAS,KAAiBD;;;;;;ACjCjB,MAAItE,IAAchH,GAAyB,GACvC2K,IAAMvK,GAAgB,GACtBkL,IAAQxK,GAAkB,GAC1ByH,IAAQjF,GAAmB,GAC3BoE,IAAqBnE,GAAgC,GACrDuE,IAA0BtE,GAAqC,GAC/D8G,IAAQ1E,GAAmB,GAG3BnE,IAAuB,GACvBC,IAAyB;AAU7B,WAAS8J,EAAoBf,GAAMlD,GAAU;AAC3C,WAAIgB,EAAMkC,CAAI,KAAK/C,EAAmBH,CAAQ,IACrCO,EAAwBwC,EAAMG,CAAI,GAAGlD,CAAQ,IAE/C,SAAShI,GAAQ;AACtB,UAAI6F,IAAWuF,EAAIpL,GAAQkL,CAAI;AAC/B,aAAQrF,MAAa,UAAaA,MAAamC,IAC3C+D,EAAM/L,GAAQkL,CAAI,IAClBzD,EAAYO,GAAUnC,GAAU3D,IAAuBC,CAAsB;AAAA,IAClF;AAAA,EACH;AAEA,SAAA+J,KAAiBD;;;;;;AChBjB,WAASE,EAASjL,GAAO;AACvB,WAAOA;AAAA,EACT;AAEA,SAAAkL,KAAiBD;;;;;;ACbjB,WAASE,EAAa9L,GAAK;AACzB,WAAO,SAASP,GAAQ;AACtB,aAAOA,KAAU,OAAO,SAAYA,EAAOO,CAAG;AAAA,IAC/C;AAAA,EACH;AAEA,SAAA+L,KAAiBD;;;;;;ACbjB,MAAIpB,IAAUxK,GAAqB;AASnC,WAAS8L,EAAiBrB,GAAM;AAC9B,WAAO,SAASlL,GAAQ;AACtB,aAAOiL,EAAQjL,GAAQkL,CAAI;AAAA,IAC5B;AAAA,EACH;AAEA,SAAAsB,KAAiBD;;;;;;ACfjB,MAAIF,IAAe5L,GAA0B,GACzC8L,IAAmB1L,GAA8B,GACjDmI,IAAQzH,GAAmB,GAC3BwJ,IAAQhH,GAAmB;AAwB/B,WAAS0I,EAASvB,GAAM;AACtB,WAAOlC,EAAMkC,CAAI,IAAImB,EAAatB,EAAMG,CAAI,CAAC,IAAIqB,EAAiBrB,CAAI;AAAA,EACxE;AAEA,SAAAwB,KAAiBD;;;;;;AC/BjB,MAAIhE,IAAchI,GAAyB,GACvCwL,IAAsBpL,GAAiC,GACvDsL,IAAW5K,GAAqB,GAChC4E,IAAUpC,EAAoB,GAC9B0I,IAAWzI,GAAqB;AASpC,WAAS2I,EAAazL,GAAO;AAG3B,WAAI,OAAOA,KAAS,aACXA,IAELA,KAAS,OACJiL,IAEL,OAAOjL,KAAS,WACXiF,EAAQjF,CAAK,IAChB+K,EAAoB/K,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC,IACtCuH,EAAYvH,CAAK,IAEhBuL,EAASvL,CAAK;AAAA,EACvB;AAEA,SAAA0L,KAAiBD;;;;;;AC9BjB,MAAIE,IAAkBpM,GAA6B,GAC/CK,IAAaD,GAAwB,GACrC8L,IAAepL,GAA0B;AA8B7C,WAASuL,EAAU9M,GAAQC,GAAU;AACnC,QAAI8C,IAAS,CAAE;AACf,WAAA9C,IAAW0M,EAAa1M,GAAU,CAAC,GAEnCa,EAAWd,GAAQ,SAASkB,GAAOX,GAAKP,GAAQ;AAC9C,MAAA6M,EAAgB9J,GAAQxC,GAAKN,EAASiB,GAAOX,GAAKP,CAAM,CAAC;AAAA,IAC7D,CAAG,GACM+C;AAAA,EACT;AAEA,SAAAgK,KAAiBD;;ACrCjB,MAAME,KAA4B;AAAA,EAC9B,IAAI;AAAA,IACA,GAAG,MAAM;AAAA,IACT,IAAI,MAAM;AAAA,IACV,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,IAAI,MAAM;AAAA,EACd;AAAA,EACA,IAAI;AAAA,IACA,GAAG,MAAM;AAAA,IACT,IAAI,MAAM;AAAA,IACV,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,GAAG,MAAM;AAAA,IACT,IAAI,MAAM;AAAA,EAAA;AAElB,GAEaC,KAA0B,cAC1BC,KAAuB,YAGvBC,KAAa,CAACC,MAAgBA,EAAI,OAAO,CAAC,EAAE,gBAAgBA,EAAI,MAAM,CAAC,GAEvEC,KAAa,CAACC,GAAoBC,MAAoB;;AACrD,QAAAC,KAAgBC,IAAAC,SAAA,gBAAAD,EAAsB,WAAW,OAAO,iBAAiB,UAAU,UACnFE,KAAiBC,IAAAF,SAAA,gBAAAE,EAAsB,WAAW,OAAO,iBAAiB,QAAQN,GAAY,OAAOE;AACvG,MAAAK;AACJ,SAAIN,MAAW,QACPM,IAAA,4BAEJA,IAAIN,KAAU,aAAa,QAAQN,EAAuB,KAAK,QAG5DU,EACF,GAAG,aAAa,QAAQT,EAAoB,KAAKY,GAAS,GAAG,MAAM,CAAC,EACpE,OAAOD,CAAC;AACjB;AAEY,SAAAE,GAAWX,GAAaY,GAAmB;AAChD,SAAAZ,EAAI,MAAMY,CAAS,EAAE,MAAM,CAAC,EAAE,KAAKA,CAAS;AACvD;AAEO,SAASC,GAASC,GAAmB;AACxC,SACIC,GAAO,SAASD,GAAWC,GAAO,QAAe,EAAE,mBAAmB;AAE9E;AAEgB,SAAAC,GACZlN,GACAmN,GACF;AACY,SAAAA,IAAAA,KAAW,EAAC,kBAAkB,EAAC,GACzCA,EAAQ,SAAS,IACjBA,EAAQ,WAAW,aAAa,QAAQ,MAAM,KAAK,MACnDA,EAAQ,YAAYrB,IACpBqB,EAAQ,UAAU,GAEd,OAAOnN,KAAU,aACjBA,IAAQ+M,GAAS/M,CAAK,IAGnBoN,GAAiBpN,IAAQ,KAAMmN,CAAO,EAAE;AAAA,IAC3C;AAAA,IACA;AAAA,EACJ;AACJ;AAEO,SAASE,GAAanB,GAAa;AACtC,SAAOA,EAAI,MAAM,GAAG,EAAE,IAAI;AAC9B;AAEgB,SAAAoB,GAAetN,GAAYf,GAAeyB,GAAc;AAC7D,SAAAA,EAAM,QAAQV,CAAK,MAAMf;AACpC;AAEA,MAAesO,KAAA;AAAA,EACX,YAAAtB;AAAA,EACA,YAAAE;AAAA,EACA,YAAAU;AAAA,EACA,UAAAE;AAAA,EACA,eAAAG;AAAA,EACA,cAAAG;AAAA,EACA,gBAAAC;AACJ;;;;;;;;AC/FA,MAAIE,IAAYjO,GAAuB,GAGnCkO,IAAqB;AA4BzB,WAASC,EAAM1N,GAAO;AACpB,WAAOwN,EAAUxN,GAAOyN,CAAkB;AAAA,EAC5C;AAEA,SAAAE,KAAiBD;;;;;;AChBjB,WAASE,EAAS5N,GAAO;AACvB,WAAO,WAAW;AAChB,aAAOA;AAAA,IACR;AAAA,EACH;AAEA,SAAA6N,KAAiBD;;;;;;ACzBjB,MAAIE,IAAcvO,GAAwB;AAU1C,WAASwO,EAAeC,GAAUnP,GAAW;AAC3C,WAAO,SAASoP,GAAYlP,GAAU;AACpC,UAAIkP,KAAc;AAChB,eAAOA;AAET,UAAI,CAACH,EAAYG,CAAU;AACzB,eAAOD,EAASC,GAAYlP,CAAQ;AAMtC,eAJIK,IAAS6O,EAAW,QACpBhP,IAAQJ,IAAYO,IAAS,IAC7BF,IAAW,OAAO+O,CAAU,IAExBpP,IAAYI,MAAU,EAAEA,IAAQG,MAClCL,EAASG,EAASD,CAAK,GAAGA,GAAOC,CAAQ,MAAM;AAAnD;AAIF,aAAO+O;AAAA,IACR;AAAA,EACH;AAEA,SAAAC,KAAiBH;;;;;;AC/BjB,MAAInO,IAAaL,GAAwB,GACrCwO,IAAiBpO,GAA4B,GAU7CwO,IAAWJ,EAAenO,CAAU;AAExC,SAAAwO,KAAiBD;;;;;;ACbjB,MAAIlD,IAAW1L,GAAqB;AASpC,WAAS8O,EAAarO,GAAO;AAC3B,WAAO,OAAOA,KAAS,aAAaA,IAAQiL;AAAA,EAC9C;AAEA,SAAAqD,KAAiBD;;;;;;ACbjB,MAAIE,IAAYhP,GAAuB,GACnC4O,IAAWxO,GAAsB,GACjC0O,IAAehO,GAA0B,GACzC4E,IAAUpC,EAAoB;AAgClC,WAAS2L,EAAQP,GAAYlP,GAAU;AACrC,QAAIoJ,IAAOlD,EAAQgJ,CAAU,IAAIM,IAAYJ;AAC7C,WAAOhG,EAAK8F,GAAYI,EAAatP,CAAQ,CAAC;AAAA,EAChD;AAEA,SAAA0P,KAAiBD;;;;wBCxCjBE,KAAiBnP,GAAoB;;;;;;ACArC,MAAI4O,IAAW5O,GAAsB;AAUrC,WAASoP,EAAWV,GAAYtN,GAAW;AACzC,QAAIkB,IAAS,CAAE;AACf,WAAAsM,EAASF,GAAY,SAASjO,GAAOf,GAAOgP,GAAY;AACtD,MAAItN,EAAUX,GAAOf,GAAOgP,CAAU,KACpCpM,EAAO,KAAK7B,CAAK;AAAA,IAEvB,CAAG,GACM6B;AAAA,EACT;AAEA,SAAA+M,KAAiBD;;;;;;ACpBjB,MAAIE,IAActP,GAAyB,GACvCoP,IAAahP,GAAwB,GACrC8L,IAAepL,GAA0B,GACzC4E,IAAUpC,EAAoB;AA2ClC,WAASiM,EAAOb,GAAYtN,GAAW;AACrC,QAAIwH,IAAOlD,EAAQgJ,CAAU,IAAIY,IAAcF;AAC/C,WAAOxG,EAAK8F,GAAYxC,EAAa9K,GAAW,CAAC,CAAC;AAAA,EACpD;AAEA,SAAAoO,KAAiBD;;;;;;AClDjB,MAAI3K,IAAc,OAAO,WAGrBC,IAAiBD,EAAY;AAUjC,WAAS6K,EAAQlQ,GAAQO,GAAK;AAC5B,WAAOP,KAAU,QAAQsF,EAAe,KAAKtF,GAAQO,CAAG;AAAA,EAC1D;AAEA,SAAA4P,KAAiBD;;;;;;AClBjB,MAAIA,IAAUzP,GAAqB,GAC/BmL,IAAU/K,GAAqB;AA6BnC,WAASuP,EAAIpQ,GAAQkL,GAAM;AACzB,WAAOlL,KAAU,QAAQ4L,EAAQ5L,GAAQkL,GAAMgF,CAAO;AAAA,EACxD;AAEA,SAAAG,KAAiBD;;;;;;AClCjB,MAAIE,IAAW7P,GAAsB,GACjCyF,IAASrF,GAAoB,GAC7B4K,IAAclK,GAAwB,GACtC4E,IAAUpC,EAAoB,GAC9BiL,IAAchL,GAAwB,GACtCoC,IAAWnC,GAAqB,GAChCsM,IAAclK,GAAyB,GACvCC,IAAeC,GAAyB,GAGxClC,IAAS,gBACTG,IAAS,gBAGTa,IAAc,OAAO,WAGrBC,IAAiBD,EAAY;AAmCjC,WAASmL,EAAQtP,GAAO;AACtB,QAAIA,KAAS;AACX,aAAO;AAET,QAAI8N,EAAY9N,CAAK,MAChBiF,EAAQjF,CAAK,KAAK,OAAOA,KAAS,YAAY,OAAOA,EAAM,UAAU,cACpEkF,EAASlF,CAAK,KAAKoF,EAAapF,CAAK,KAAKuK,EAAYvK,CAAK;AAC/D,aAAO,CAACA,EAAM;AAEhB,QAAI8D,IAAMkB,EAAOhF,CAAK;AACtB,QAAI8D,KAAOX,KAAUW,KAAOR;AAC1B,aAAO,CAACtD,EAAM;AAEhB,QAAIqP,EAAYrP,CAAK;AACnB,aAAO,CAACoP,EAASpP,CAAK,EAAE;AAE1B,aAASX,KAAOW;AACd,UAAIoE,EAAe,KAAKpE,GAAOX,CAAG;AAChC,eAAO;AAGX,WAAO;AAAA,EACT;AAEA,SAAAkQ,KAAiBD;;;;;;AC3DjB,WAASE,EAAYxP,GAAO;AAC1B,WAAOA,MAAU;AAAA,EACnB;AAEA,SAAAyP,KAAiBD;;;;;;ACrBjB,MAAIrB,IAAW5O,GAAsB,GACjCuO,IAAcnO,GAAwB;AAU1C,WAAS+P,EAAQzB,GAAYlP,GAAU;AACrC,QAAIE,IAAQ,IACR4C,IAASiM,EAAYG,CAAU,IAAI,MAAMA,EAAW,MAAM,IAAI,CAAE;AAEpE,WAAAE,EAASF,GAAY,SAASjO,GAAOX,GAAK4O,GAAY;AACpD,MAAApM,EAAO,EAAE5C,CAAK,IAAIF,EAASiB,GAAOX,GAAK4O,CAAU;AAAA,IACrD,CAAG,GACMpM;AAAA,EACT;AAEA,SAAA8N,KAAiBD;;;;;;ACrBjB,MAAItG,IAAW7J,GAAsB,GACjCkM,IAAe9L,GAA0B,GACzC+P,IAAUrP,GAAqB,GAC/B4E,IAAUpC,EAAoB;AA4ClC,WAASR,EAAI4L,GAAYlP,GAAU;AACjC,QAAIoJ,IAAOlD,EAAQgJ,CAAU,IAAI7E,IAAWsG;AAC5C,WAAOvH,EAAK8F,GAAYxC,EAAa1M,GAAU,CAAC,CAAC;AAAA,EACnD;AAEA,SAAA6Q,KAAiBvN;;;;;;ACxCjB,WAASwN,EAAYnP,GAAO3B,GAAU+Q,GAAaC,GAAW;AAC5D,QAAI9Q,IAAQ,IACRG,IAASsB,KAAS,OAAO,IAAIA,EAAM;AAKvC,SAHIqP,KAAa3Q,MACf0Q,IAAcpP,EAAM,EAAEzB,CAAK,IAEtB,EAAEA,IAAQG;AACf,MAAA0Q,IAAc/Q,EAAS+Q,GAAapP,EAAMzB,CAAK,GAAGA,GAAOyB,CAAK;AAEhE,WAAOoP;AAAA,EACT;AAEA,SAAAE,KAAiBH;;;;;;ACZjB,WAASI,EAAWhC,GAAYlP,GAAU+Q,GAAaC,GAAW/B,GAAU;AAC1E,WAAAA,EAASC,GAAY,SAASjO,GAAOf,GAAOgP,GAAY;AACtD,MAAA6B,IAAcC,KACTA,IAAY,IAAO/P,KACpBjB,EAAS+Q,GAAa9P,GAAOf,GAAOgP,CAAU;AAAA,IACtD,CAAG,GACM6B;AAAA,EACT;AAEA,SAAAI,KAAiBD;;;;;;ACtBjB,MAAIJ,IAActQ,GAAyB,GACvC4O,IAAWxO,GAAsB,GACjC8L,IAAepL,GAA0B,GACzC4P,IAAapN,GAAwB,GACrCoC,IAAUnC,EAAoB;AAuClC,WAASqN,EAAOlC,GAAYlP,GAAU+Q,GAAa;AACjD,QAAI3H,IAAOlD,EAAQgJ,CAAU,IAAI4B,IAAcI,GAC3CF,IAAY,UAAU,SAAS;AAEnC,WAAO5H,EAAK8F,GAAYxC,EAAa1M,GAAU,CAAC,GAAG+Q,GAAaC,GAAW5B,CAAQ;AAAA,EACrF;AAEA,SAAAiC,KAAiBD;;;;;;AClDjB,MAAI1I,IAAalI,GAAwB,GACrC0F,IAAUtF,EAAoB,GAC9B2G,IAAejG,GAAyB,GAGxCkD,IAAY;AAmBhB,WAAS8M,EAASrQ,GAAO;AACvB,WAAO,OAAOA,KAAS,YACpB,CAACiF,EAAQjF,CAAK,KAAKsG,EAAatG,CAAK,KAAKyH,EAAWzH,CAAK,KAAKuD;AAAA,EACpE;AAEA,SAAA+M,KAAiBD;;;;;;AC7BjB,MAAIlF,IAAe5L,GAA0B,GASzCgR,IAAYpF,EAAa,QAAQ;AAErC,SAAAqF,KAAiBD;;;;;;ACVjB,MAAIE,IAAgB,mBAChBC,IAAoB,mBACpBC,IAAwB,mBACxBC,IAAsB,mBACtBC,IAAeH,IAAoBC,IAAwBC,GAC3DE,IAAa,kBAGbC,IAAQ,WAGRC,IAAe,OAAO,MAAMD,IAAQN,IAAiBI,IAAeC,IAAa,GAAG;AASxF,WAASG,EAAWnI,GAAQ;AAC1B,WAAOkI,EAAa,KAAKlI,CAAM;AAAA,EACjC;AAEA,SAAAoI,KAAiBD;;;;;;ACxBjB,MAAIR,IAAgB,mBAChBC,IAAoB,mBACpBC,IAAwB,mBACxBC,IAAsB,mBACtBC,IAAeH,IAAoBC,IAAwBC,GAC3DE,IAAa,kBAGbK,IAAW,MAAMV,IAAgB,KACjCW,IAAU,MAAMP,IAAe,KAC/BQ,IAAS,4BACTC,IAAa,QAAQF,IAAU,MAAMC,IAAS,KAC9CE,IAAc,OAAOd,IAAgB,KACrCe,IAAa,mCACbC,IAAa,sCACbV,IAAQ,WAGRW,IAAWJ,IAAa,KACxBK,IAAW,MAAMb,IAAa,MAC9Bc,IAAY,QAAQb,IAAQ,QAAQ,CAACQ,GAAaC,GAAYC,CAAU,EAAE,KAAK,GAAG,IAAI,MAAME,IAAWD,IAAW,MAClHG,IAAQF,IAAWD,IAAWE,GAC9BE,IAAW,QAAQ,CAACP,IAAcH,IAAU,KAAKA,GAASI,GAAYC,GAAYN,CAAQ,EAAE,KAAK,GAAG,IAAI,KAGxGY,IAAY,OAAOV,IAAS,QAAQA,IAAS,OAAOS,IAAWD,GAAO,GAAG;AAS7E,WAASG,EAAYlJ,GAAQ;AAE3B,aADIjH,IAASkQ,EAAU,YAAY,GAC5BA,EAAU,KAAKjJ,CAAM;AAC1B,QAAEjH;AAEJ,WAAOA;AAAA,EACT;AAEA,SAAAoQ,KAAiBD;;;;;;AC3CjB,MAAIzB,IAAYhR,GAAuB,GACnC0R,IAAatR,GAAwB,GACrCqS,IAAc3R,GAAyB;AAS3C,WAAS6R,EAAWpJ,GAAQ;AAC1B,WAAOmI,EAAWnI,CAAM,IACpBkJ,EAAYlJ,CAAM,IAClByH,EAAUzH,CAAM;AAAA,EACtB;AAEA,SAAAqJ,KAAiBD;;;;;;ACjBjB,MAAI9C,IAAW7P,GAAsB,GACjCyF,IAASrF,GAAoB,GAC7BmO,IAAczN,GAAwB,GACtCgQ,IAAWxN,GAAqB,GAChCqP,IAAapP,GAAwB,GAGrCK,IAAS,gBACTG,IAAS;AAuBb,WAAS8O,EAAKnE,GAAY;AACxB,QAAIA,KAAc;AAChB,aAAO;AAET,QAAIH,EAAYG,CAAU;AACxB,aAAOoC,EAASpC,CAAU,IAAIiE,EAAWjE,CAAU,IAAIA,EAAW;AAEpE,QAAInK,IAAMkB,EAAOiJ,CAAU;AAC3B,WAAInK,KAAOX,KAAUW,KAAOR,IACnB2K,EAAW,OAEbmB,EAASnB,CAAU,EAAE;AAAA,EAC9B;AAEA,SAAAoE,KAAiBD;;;;;;AC7CjB,MAAI7D,IAAYhP,GAAuB,GACnC+S,IAAa3S,GAAwB,GACrCC,IAAaS,GAAwB,GACrCoL,IAAe5I,GAA0B,GACzC0P,IAAezP,GAA0B,GACzCmC,IAAUlC,EAAoB,GAC9BmC,IAAWC,GAAqB,GAChCqN,IAAanN,GAAuB,GACpC2B,IAAWyL,GAAqB,GAChCrN,IAAesN,GAAyB;AAgC5C,WAASC,EAAU7T,GAAQC,GAAU+Q,GAAa;AAChD,QAAI8C,IAAQ3N,EAAQnG,CAAM,GACtB+T,IAAYD,KAAS1N,EAASpG,CAAM,KAAKsG,EAAatG,CAAM;AAGhE,QADAC,IAAW0M,EAAa1M,GAAU,CAAC,GAC/B+Q,KAAe,MAAM;AACvB,UAAIgD,IAAOhU,KAAUA,EAAO;AAC5B,MAAI+T,IACF/C,IAAc8C,IAAQ,IAAIE,MAAO,CAAE,IAE5B9L,EAASlI,CAAM,IACtBgR,IAAc0C,EAAWM,CAAI,IAAIR,EAAWC,EAAazT,CAAM,CAAC,IAAI,CAAE,IAGtEgR,IAAc,CAAE;AAAA,IAEtB;AACE,YAAC+C,IAAYtE,IAAY3O,GAAYd,GAAQ,SAASkB,GAAOf,GAAOH,GAAQ;AAC1E,aAAOC,EAAS+Q,GAAa9P,GAAOf,GAAOH,CAAM;AAAA,IACrD,CAAG,GACMgR;AAAA,EACT;AAEA,SAAAiD,KAAiBJ;;;;;;AChEjB,MAAIjQ,IAASnD,GAAoB,GAC7BgL,IAAc5K,GAAwB,GACtCsF,IAAU5E,EAAoB,GAG9B2S,IAAmBtQ,IAASA,EAAO,qBAAqB;AAS5D,WAASuQ,EAAcjT,GAAO;AAC5B,WAAOiF,EAAQjF,CAAK,KAAKuK,EAAYvK,CAAK,KACxC,CAAC,EAAEgT,KAAoBhT,KAASA,EAAMgT,CAAgB;AAAA,EAC1D;AAEA,SAAAE,KAAiBD;;;;;;ACnBjB,MAAIE,IAAY5T,GAAuB,GACnC0T,IAAgBtT,GAA2B;AAa/C,WAASyT,EAAY1S,GAAO2S,GAAO1S,GAAW2S,GAAUzR,GAAQ;AAC9D,QAAI5C,IAAQ,IACRG,IAASsB,EAAM;AAKnB,SAHAC,MAAcA,IAAYsS,IAC1BpR,MAAWA,IAAS,KAEb,EAAE5C,IAAQG,KAAQ;AACvB,UAAIY,IAAQU,EAAMzB,CAAK;AACvB,MAAIoU,IAAQ,KAAK1S,EAAUX,CAAK,IAC1BqT,IAAQ,IAEVD,EAAYpT,GAAOqT,IAAQ,GAAG1S,GAAW2S,GAAUzR,CAAM,IAEzDsR,EAAUtR,GAAQ7B,CAAK,IAEfsT,MACVzR,EAAOA,EAAO,MAAM,IAAI7B;AAAA,IAE9B;AACE,WAAO6B;AAAA,EACT;AAEA,SAAA0R,KAAiBH;;;;;;AC3BjB,WAASI,EAAMrL,GAAMsL,GAASnL,GAAM;AAClC,YAAQA,EAAK,QAAM;AAAA,MACjB,KAAK;AAAG,eAAOH,EAAK,KAAKsL,CAAO;AAAA,MAChC,KAAK;AAAG,eAAOtL,EAAK,KAAKsL,GAASnL,EAAK,CAAC,CAAC;AAAA,MACzC,KAAK;AAAG,eAAOH,EAAK,KAAKsL,GAASnL,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,MAClD,KAAK;AAAG,eAAOH,EAAK,KAAKsL,GAASnL,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,IAC/D;AACE,WAAOH,EAAK,MAAMsL,GAASnL,CAAI;AAAA,EACjC;AAEA,SAAAoL,KAAiBF;;;;;;ACpBjB,MAAIA,IAAQjU,GAAmB,GAG3BoU,IAAY,KAAK;AAWrB,WAASC,EAASzL,GAAM0L,GAAOlB,GAAW;AACxC,WAAAkB,IAAQF,EAAUE,MAAU,SAAa1L,EAAK,SAAS,IAAK0L,GAAO,CAAC,GAC7D,WAAW;AAMhB,eALIvL,IAAO,WACPrJ,IAAQ,IACRG,IAASuU,EAAUrL,EAAK,SAASuL,GAAO,CAAC,GACzCnT,IAAQ,MAAMtB,CAAM,GAEjB,EAAEH,IAAQG;AACf,QAAAsB,EAAMzB,CAAK,IAAIqJ,EAAKuL,IAAQ5U,CAAK;AAEnC,MAAAA,IAAQ;AAER,eADI6U,IAAY,MAAMD,IAAQ,CAAC,GACxB,EAAE5U,IAAQ4U;AACf,QAAAC,EAAU7U,CAAK,IAAIqJ,EAAKrJ,CAAK;AAE/B,aAAA6U,EAAUD,CAAK,IAAIlB,EAAUjS,CAAK,GAC3B8S,EAAMrL,GAAM,MAAM2L,CAAS;AAAA,IACnC;AAAA,EACH;AAEA,SAAAC,KAAiBH;;;;;;ACnCjB,MAAIhG,IAAWrO,GAAqB,GAChCyU,IAAiBrU,GAA4B,GAC7CsL,IAAW5K,GAAqB,GAUhC4T,IAAmBD,IAA4B,SAAS7L,GAAMW,GAAQ;AACxE,WAAOkL,EAAe7L,GAAM,YAAY;AAAA,MACtC,cAAgB;AAAA,MAChB,YAAc;AAAA,MACd,OAASyF,EAAS9E,CAAM;AAAA,MACxB,UAAY;AAAA,IAChB,CAAG;AAAA,EACF,IAPuCmC;AASxC,SAAAiJ,KAAiBD;;;;;;ACpBjB,MAAIE,IAAY,KACZC,IAAW,IAGXC,IAAY,KAAK;AAWrB,WAASC,EAASnM,GAAM;AACtB,QAAIoM,IAAQ,GACRC,IAAa;AAEjB,WAAO,WAAW;AAChB,UAAIC,IAAQJ,EAAW,GACnBK,IAAYN,KAAYK,IAAQD;AAGpC,UADAA,IAAaC,GACTC,IAAY;AACd,YAAI,EAAEH,KAASJ;AACb,iBAAO,UAAU,CAAC;AAAA;AAGpB,QAAAI,IAAQ;AAEV,aAAOpM,EAAK,MAAM,QAAW,SAAS;AAAA,IACvC;AAAA,EACH;AAEA,SAAAwM,KAAiBL;;;;;;ACpCjB,MAAIL,IAAkB1U,GAA6B,GAC/C+U,IAAW3U,GAAsB,GAUjCiV,IAAcN,EAASL,CAAe;AAE1C,SAAAY,KAAiBD;;;;;;ACbjB,MAAI3J,IAAW1L,GAAqB,GAChCqU,IAAWjU,GAAsB,GACjCiV,IAAcvU,GAAyB;AAU3C,WAASyU,EAAS3M,GAAM0L,GAAO;AAC7B,WAAOe,EAAYhB,EAASzL,GAAM0L,GAAO5I,CAAQ,GAAG9C,IAAO,EAAE;AAAA,EAC/D;AAEA,SAAA4M,KAAiBD;;;;;;ACLjB,WAASE,EAActU,GAAOC,GAAWsU,GAAWpW,GAAW;AAI7D,aAHIO,IAASsB,EAAM,QACfzB,IAAQgW,KAAapW,IAAY,IAAI,KAEjCA,IAAYI,MAAU,EAAEA,IAAQG;AACtC,UAAIuB,EAAUD,EAAMzB,CAAK,GAAGA,GAAOyB,CAAK;AACtC,eAAOzB;AAGX,WAAO;AAAA,EACT;AAEA,SAAAiW,KAAiBF;;;;;;AChBjB,WAASG,EAAUnV,GAAO;AACxB,WAAOA,MAAUA;AAAA,EACnB;AAEA,SAAAoV,KAAiBD;;;;;;ACDjB,WAASE,EAAc3U,GAAOV,GAAOiV,GAAW;AAI9C,aAHIhW,IAAQgW,IAAY,GACpB7V,IAASsB,EAAM,QAEZ,EAAEzB,IAAQG;AACf,UAAIsB,EAAMzB,CAAK,MAAMe;AACnB,eAAOf;AAGX,WAAO;AAAA,EACT;AAEA,SAAAqW,KAAiBD;;;;;;ACtBjB,MAAIL,IAAgBzV,GAA2B,GAC3C4V,IAAYxV,GAAuB,GACnC0V,IAAgBhV,GAA2B;AAW/C,WAASkV,EAAY7U,GAAOV,GAAOiV,GAAW;AAC5C,WAAOjV,MAAUA,IACbqV,EAAc3U,GAAOV,GAAOiV,CAAS,IACrCD,EAActU,GAAOyU,GAAWF,CAAS;AAAA,EAC/C;AAEA,SAAAO,KAAiBD;;;;;;ACnBjB,MAAIA,IAAchW,GAAyB;AAW3C,WAASkW,EAAc/U,GAAOV,GAAO;AACnC,QAAIZ,IAASsB,KAAS,OAAO,IAAIA,EAAM;AACvC,WAAO,CAAC,CAACtB,KAAUmW,EAAY7U,GAAOV,GAAO,CAAC,IAAI;AAAA,EACpD;AAEA,SAAA0V,KAAiBD;;;;;;ACPjB,WAASE,EAAkBjV,GAAOV,GAAO4V,GAAY;AAInD,aAHI3W,IAAQ,IACRG,IAASsB,KAAS,OAAO,IAAIA,EAAM,QAEhC,EAAEzB,IAAQG;AACf,UAAIwW,EAAW5V,GAAOU,EAAMzB,CAAK,CAAC;AAChC,eAAO;AAGX,WAAO;AAAA,EACT;AAEA,SAAA4W,KAAiBF;;;;;;ACTjB,WAASG,IAAO;AAAA,EAEhB;AAEA,SAAAC,KAAiBD;;;;;;AChBjB,MAAIE,IAAMzW,GAAiB,GACvBuW,IAAOnW,GAAiB,GACxB4C,IAAalC,GAAwB,GAGrC4V,IAAW,OASXC,IAAcF,KAAQ,IAAIzT,EAAW,IAAIyT,EAAI,CAAA,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAMC,IAAmB,SAAS1V,GAAQ;AAClG,WAAO,IAAIyV,EAAIzV,CAAM;AAAA,EACtB,IAF2EuV;AAI5E,SAAAK,KAAiBD;;;;;;AClBjB,MAAI5V,IAAWf,GAAsB,GACjCkW,IAAgB9V,GAA2B,GAC3CgW,IAAoBtV,GAA+B,GACnDQ,IAAWgC,GAAsB,GACjCqT,IAAYpT,GAAuB,GACnCP,IAAaQ,GAAwB,GAGrCqT,IAAmB;AAWvB,WAASC,EAAS3V,GAAO3B,GAAU6W,GAAY;AAC7C,QAAI3W,IAAQ,IACRqX,IAAWb,GACXrW,IAASsB,EAAM,QACf6V,IAAW,IACX1U,IAAS,CAAE,GACXC,IAAOD;AAEX,QAAI+T;AACF,MAAAW,IAAW,IACXD,IAAWX;AAAA,aAEJvW,KAAUgX,GAAkB;AACnC,UAAI5T,IAAMzD,IAAW,OAAOmX,EAAUxV,CAAK;AAC3C,UAAI8B;AACF,eAAOD,EAAWC,CAAG;AAEvB,MAAA+T,IAAW,IACXD,IAAWzV,GACXiB,IAAO,IAAIxB;AAAA,IACf;AAEI,MAAAwB,IAAO/C,IAAW,CAAA,IAAK8C;AAEzB,IAAA2U;AACA,aAAO,EAAEvX,IAAQG,KAAQ;AACvB,YAAIY,IAAQU,EAAMzB,CAAK,GACnBwX,IAAW1X,IAAWA,EAASiB,CAAK,IAAIA;AAG5C,YADAA,IAAS4V,KAAc5V,MAAU,IAAKA,IAAQ,GAC1CuW,KAAYE,MAAaA,GAAU;AAErC,mBADIC,IAAY5U,EAAK,QACd4U;AACL,gBAAI5U,EAAK4U,CAAS,MAAMD;AACtB,uBAASD;AAGb,UAAIzX,KACF+C,EAAK,KAAK2U,CAAQ,GAEpB5U,EAAO,KAAK7B,CAAK;AAAA,QACvB,MACS,CAAKsW,EAASxU,GAAM2U,GAAUb,CAAU,MACvC9T,MAASD,KACXC,EAAK,KAAK2U,CAAQ,GAEpB5U,EAAO,KAAK7B,CAAK;AAAA,MAEvB;AACE,WAAO6B;AAAA,EACT;AAEA,SAAA8U,KAAiBN;;;;;;ACvEjB,MAAIvI,IAAcvO,GAAwB,GACtC+G,IAAe3G,GAAyB;AA2B5C,WAASiX,EAAkB5W,GAAO;AAChC,WAAOsG,EAAatG,CAAK,KAAK8N,EAAY9N,CAAK;AAAA,EACjD;AAEA,SAAA6W,KAAiBD;;;;;;AChCjB,MAAIxD,IAAc7T,GAAyB,GACvCuV,IAAWnV,GAAsB,GACjC0W,IAAWhW,GAAsB,GACjCuW,IAAoB/T,GAA8B,GAkBlDiU,IAAQhC,EAAS,SAASiC,GAAQ;AACpC,WAAOV,EAASjD,EAAY2D,GAAQ,GAAGH,GAAmB,EAAI,CAAC;AAAA,EACjE,CAAC;AAED,SAAAI,KAAiBF;;;;;;ACzBjB,MAAI1N,IAAW7J,GAAsB;AAYrC,WAAS0X,EAAWnY,GAAQK,GAAO;AACjC,WAAOiK,EAASjK,GAAO,SAASE,GAAK;AACnC,aAAOP,EAAOO,CAAG;AAAA,IACrB,CAAG;AAAA,EACH;AAEA,SAAA6X,KAAiBD;;;;;;AClBjB,MAAIA,IAAa1X,GAAwB,GACrCG,IAAOC,GAAiB;AA4B5B,WAASY,EAAOzB,GAAQ;AACtB,WAAOA,KAAU,OAAO,CAAE,IAAGmY,EAAWnY,GAAQY,EAAKZ,CAAM,CAAC;AAAA,EAC9D;AAEA,SAAAqY,KAAiB5W;;;;;;AC/BjB,MAAI6W;AAEJ,MAAI,OAAOC,MAAY;AACrB,QAAI;AACF,MAAAD,IAAS;AAAA,QACP,OAAO7X,GAAuB;AAAA,QAC9B,UAAUI,GAA0B;AAAA,QACpC,MAAMU,GAAsB;AAAA,QAC5B,QAAQwC,GAAwB;AAAA,QAChC,KAAMC,GAAqB;AAAA,QAC3B,SAASC,EAAyB;AAAA,QAClC,SAASoC,GAAyB;AAAA,QAClC,YAAYE,GAA4B;AAAA,QACxC,aAAaoN,GAA6B;AAAA,QAC1C,MAAMC,GAAsB;AAAA,QAC5B,KAAK4E,GAAqB;AAAA,QAC1B,QAAQC,GAAwB;AAAA,QAChC,MAAMC,GAAsB;AAAA,QAC5B,WAAWC,GAA2B;AAAA,QACtC,OAAOC,GAAuB;AAAA,QAC9B,QAAQC,GAAA;AAAA,MACT;AAAA,IACF,QAAW;AAAA,IAEd;AAGA,SAAKP,MACHA,IAAS,OAAO,IAGlBQ,KAAiBR;;;;;;AC/BjB,MAAIS,IAAItY,EAAmB;AAE3B,EAAAuY,KAAiBC;AAEjB,MAAIC,IAAoB,MACpBC,IAAa,MACbC,IAAiB;AAYrB,WAASH,EAAMI,GAAM;AACnB,SAAK,cAAcN,EAAE,IAAIM,GAAM,UAAU,IAAIA,EAAK,WAAW,IAC7D,KAAK,gBAAgBN,EAAE,IAAIM,GAAM,YAAY,IAAIA,EAAK,aAAa,IACnE,KAAK,cAAcN,EAAE,IAAIM,GAAM,UAAU,IAAIA,EAAK,WAAW,IAG7D,KAAK,SAAS,QAGd,KAAK,sBAAsBN,EAAE,SAAS,MAAS,GAG/C,KAAK,sBAAsBA,EAAE,SAAS,MAAS,GAG/C,KAAK,SAAS,CAAE,GAEZ,KAAK,gBAEP,KAAK,UAAU,CAAE,GAGjB,KAAK,YAAY,CAAE,GACnB,KAAK,UAAUI,CAAU,IAAI,CAAE,IAIjC,KAAK,MAAM,CAAE,GAGb,KAAK,SAAS,CAAE,GAGhB,KAAK,OAAO,CAAE,GAGd,KAAK,QAAQ,CAAE,GAGf,KAAK,YAAY,CAAE,GAGnB,KAAK,cAAc,CAAE;AAAA,EACvB;AAGA,EAAAF,EAAM,UAAU,aAAa,GAG7BA,EAAM,UAAU,aAAa,GAK7BA,EAAM,UAAU,aAAa,WAAW;AACtC,WAAO,KAAK;AAAA,EACb,GAEDA,EAAM,UAAU,eAAe,WAAW;AACxC,WAAO,KAAK;AAAA,EACb,GAEDA,EAAM,UAAU,aAAa,WAAW;AACtC,WAAO,KAAK;AAAA,EACb,GAEDA,EAAM,UAAU,WAAW,SAASK,GAAO;AACzC,gBAAK,SAASA,GACP;AAAA,EACR,GAEDL,EAAM,UAAU,QAAQ,WAAW;AACjC,WAAO,KAAK;AAAA,EACb,GAKDA,EAAM,UAAU,sBAAsB,SAASM,GAAY;AACzD,WAAKR,EAAE,WAAWQ,CAAU,MAC1BA,IAAaR,EAAE,SAASQ,CAAU,IAEpC,KAAK,sBAAsBA,GACpB;AAAA,EACR,GAEDN,EAAM,UAAU,YAAY,WAAW;AACrC,WAAO,KAAK;AAAA,EACb,GAEDA,EAAM,UAAU,QAAQ,WAAW;AACjC,WAAOF,EAAE,KAAK,KAAK,MAAM;AAAA,EAC1B,GAEDE,EAAM,UAAU,UAAU,WAAW;AACnC,QAAIO,IAAO;AACX,WAAOT,EAAE,OAAO,KAAK,MAAO,GAAE,SAASU,GAAG;AACxC,aAAOV,EAAE,QAAQS,EAAK,IAAIC,CAAC,CAAC;AAAA,IAChC,CAAG;AAAA,EACF,GAEDR,EAAM,UAAU,QAAQ,WAAW;AACjC,QAAIO,IAAO;AACX,WAAOT,EAAE,OAAO,KAAK,MAAO,GAAE,SAASU,GAAG;AACxC,aAAOV,EAAE,QAAQS,EAAK,KAAKC,CAAC,CAAC;AAAA,IACjC,CAAG;AAAA,EACF,GAEDR,EAAM,UAAU,WAAW,SAASS,GAAIxY,GAAO;AAC7C,QAAIsI,IAAO,WACPgQ,IAAO;AACX,WAAAT,EAAE,KAAKW,GAAI,SAASD,GAAG;AACrB,MAAIjQ,EAAK,SAAS,IAChBgQ,EAAK,QAAQC,GAAGvY,CAAK,IAErBsY,EAAK,QAAQC,CAAC;AAAA,IAEpB,CAAG,GACM;AAAA,EACR,GAEDR,EAAM,UAAU,UAAU,SAASQ,GAAGvY,GAAO;AAC3C,WAAI6X,EAAE,IAAI,KAAK,QAAQU,CAAC,KAClB,UAAU,SAAS,MACrB,KAAK,OAAOA,CAAC,IAAIvY,IAEZ,SAGT,KAAK,OAAOuY,CAAC,IAAI,UAAU,SAAS,IAAIvY,IAAQ,KAAK,oBAAoBuY,CAAC,GACtE,KAAK,gBACP,KAAK,QAAQA,CAAC,IAAIN,GAClB,KAAK,UAAUM,CAAC,IAAI,CAAE,GACtB,KAAK,UAAUN,CAAU,EAAEM,CAAC,IAAI,KAElC,KAAK,IAAIA,CAAC,IAAI,CAAE,GAChB,KAAK,OAAOA,CAAC,IAAI,CAAE,GACnB,KAAK,KAAKA,CAAC,IAAI,CAAE,GACjB,KAAK,MAAMA,CAAC,IAAI,CAAE,GAClB,EAAE,KAAK,YACA;AAAA,EACR,GAEDR,EAAM,UAAU,OAAO,SAASQ,GAAG;AACjC,WAAO,KAAK,OAAOA,CAAC;AAAA,EACrB,GAEDR,EAAM,UAAU,UAAU,SAASQ,GAAG;AACpC,WAAOV,EAAE,IAAI,KAAK,QAAQU,CAAC;AAAA,EAC5B,GAEDR,EAAM,UAAU,aAAc,SAASQ,GAAG;AACxC,QAAID,IAAO;AACX,QAAIT,EAAE,IAAI,KAAK,QAAQU,CAAC,GAAG;AACzB,UAAIE,IAAa,SAASC,GAAG;AAAE,QAAAJ,EAAK,WAAWA,EAAK,UAAUI,CAAC,CAAC;AAAA,MAAI;AACpE,aAAO,KAAK,OAAOH,CAAC,GAChB,KAAK,gBACP,KAAK,4BAA4BA,CAAC,GAClC,OAAO,KAAK,QAAQA,CAAC,GACrBV,EAAE,KAAK,KAAK,SAASU,CAAC,GAAG,SAASI,GAAO;AACvC,QAAAL,EAAK,UAAUK,CAAK;AAAA,MAC5B,CAAO,GACD,OAAO,KAAK,UAAUJ,CAAC,IAEzBV,EAAE,KAAKA,EAAE,KAAK,KAAK,IAAIU,CAAC,CAAC,GAAGE,CAAU,GACtC,OAAO,KAAK,IAAIF,CAAC,GACjB,OAAO,KAAK,OAAOA,CAAC,GACpBV,EAAE,KAAKA,EAAE,KAAK,KAAK,KAAKU,CAAC,CAAC,GAAGE,CAAU,GACvC,OAAO,KAAK,KAAKF,CAAC,GAClB,OAAO,KAAK,MAAMA,CAAC,GACnB,EAAE,KAAK;AAAA,IACX;AACE,WAAO;AAAA,EACR,GAEDR,EAAM,UAAU,YAAY,SAASQ,GAAGK,GAAQ;AAC9C,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,MAAM,2CAA2C;AAG7D,QAAIf,EAAE,YAAYe,CAAM;AACtB,MAAAA,IAASX;AAAA,SACJ;AAEL,MAAAW,KAAU;AACV,eAASC,IAAWD,GAClB,CAACf,EAAE,YAAYgB,CAAQ,GACvBA,IAAW,KAAK,OAAOA,CAAQ;AAC/B,YAAIA,MAAaN;AACf,gBAAM,IAAI,MAAM,aAAaK,IAAQ,mBAAmBL,IACxC,uBAAuB;AAI3C,WAAK,QAAQK,CAAM;AAAA,IACvB;AAEE,gBAAK,QAAQL,CAAC,GACd,KAAK,4BAA4BA,CAAC,GAClC,KAAK,QAAQA,CAAC,IAAIK,GAClB,KAAK,UAAUA,CAAM,EAAEL,CAAC,IAAI,IACrB;AAAA,EACR,GAEDR,EAAM,UAAU,8BAA8B,SAASQ,GAAG;AACxD,WAAO,KAAK,UAAU,KAAK,QAAQA,CAAC,CAAC,EAAEA,CAAC;AAAA,EACzC,GAEDR,EAAM,UAAU,SAAS,SAASQ,GAAG;AACnC,QAAI,KAAK,aAAa;AACpB,UAAIK,IAAS,KAAK,QAAQL,CAAC;AAC3B,UAAIK,MAAWX;AACb,eAAOW;AAAA,IAEb;AAAA,EACC,GAEDb,EAAM,UAAU,WAAW,SAASQ,GAAG;AAKrC,QAJIV,EAAE,YAAYU,CAAC,MACjBA,IAAIN,IAGF,KAAK,aAAa;AACpB,UAAIa,IAAW,KAAK,UAAUP,CAAC;AAC/B,UAAIO;AACF,eAAOjB,EAAE,KAAKiB,CAAQ;AAAA,IAE5B,OAAS;AAAA,UAAIP,MAAMN;AACf,eAAO,KAAK,MAAO;AACd,UAAI,KAAK,QAAQM,CAAC;AACvB,eAAO,CAAE;AAAA;AAAA,EAEZ,GAEDR,EAAM,UAAU,eAAe,SAASQ,GAAG;AACzC,QAAIQ,IAAS,KAAK,OAAOR,CAAC;AAC1B,QAAIQ;AACF,aAAOlB,EAAE,KAAKkB,CAAM;AAAA,EAEvB,GAEDhB,EAAM,UAAU,aAAa,SAASQ,GAAG;AACvC,QAAIS,IAAQ,KAAK,MAAMT,CAAC;AACxB,QAAIS;AACF,aAAOnB,EAAE,KAAKmB,CAAK;AAAA,EAEtB,GAEDjB,EAAM,UAAU,YAAY,SAASQ,GAAG;AACtC,QAAIU,IAAQ,KAAK,aAAaV,CAAC;AAC/B,QAAIU;AACF,aAAOpB,EAAE,MAAMoB,GAAO,KAAK,WAAWV,CAAC,CAAC;AAAA,EAE3C,GAEDR,EAAM,UAAU,SAAS,SAAUQ,GAAG;AACpC,QAAIW;AACJ,WAAI,KAAK,eACPA,IAAY,KAAK,WAAWX,CAAC,IAE7BW,IAAY,KAAK,UAAUX,CAAC,GAEvBW,EAAU,WAAW;AAAA,EAC7B,GAEDnB,EAAM,UAAU,cAAc,SAASjJ,GAAQ;AAC7C,QAAIqK,IAAO,IAAI,KAAK,YAAY;AAAA,MAC9B,UAAU,KAAK;AAAA,MACf,YAAY,KAAK;AAAA,MACjB,UAAU,KAAK;AAAA,IACnB,CAAG;AAED,IAAAA,EAAK,SAAS,KAAK,OAAO;AAE1B,QAAIb,IAAO;AACX,IAAAT,EAAE,KAAK,KAAK,QAAQ,SAAS7X,GAAO,GAAG;AACrC,MAAI8O,EAAO,CAAC,KACVqK,EAAK,QAAQ,GAAGnZ,CAAK;AAAA,IAE3B,CAAG,GAED6X,EAAE,KAAK,KAAK,WAAW,SAASa,GAAG;AACjC,MAAIS,EAAK,QAAQT,EAAE,CAAC,KAAKS,EAAK,QAAQT,EAAE,CAAC,KACvCS,EAAK,QAAQT,GAAGJ,EAAK,KAAKI,CAAC,CAAC;AAAA,IAElC,CAAG;AAED,QAAIU,IAAU,CAAE;AAChB,aAASC,EAAWd,GAAG;AACrB,UAAIK,IAASN,EAAK,OAAOC,CAAC;AAC1B,aAAIK,MAAW,UAAaO,EAAK,QAAQP,CAAM,KAC7CQ,EAAQb,CAAC,IAAIK,GACNA,KACEA,KAAUQ,IACZA,EAAQR,CAAM,IAEdS,EAAWT,CAAM;AAAA,IAE9B;AAEE,WAAI,KAAK,eACPf,EAAE,KAAKsB,EAAK,MAAO,GAAE,SAASZ,GAAG;AAC/B,MAAAY,EAAK,UAAUZ,GAAGc,EAAWd,CAAC,CAAC;AAAA,IACrC,CAAK,GAGIY;AAAA,EACR,GAIDpB,EAAM,UAAU,sBAAsB,SAASM,GAAY;AACzD,WAAKR,EAAE,WAAWQ,CAAU,MAC1BA,IAAaR,EAAE,SAASQ,CAAU,IAEpC,KAAK,sBAAsBA,GACpB;AAAA,EACR,GAEDN,EAAM,UAAU,YAAY,WAAW;AACrC,WAAO,KAAK;AAAA,EACb,GAEDA,EAAM,UAAU,QAAQ,WAAW;AACjC,WAAOF,EAAE,OAAO,KAAK,SAAS;AAAA,EAC/B,GAEDE,EAAM,UAAU,UAAU,SAASS,GAAIxY,GAAO;AAC5C,QAAIsY,IAAO,MACPhQ,IAAO;AACX,WAAAuP,EAAE,OAAOW,GAAI,SAASD,GAAGe,GAAG;AAC1B,aAAIhR,EAAK,SAAS,IAChBgQ,EAAK,QAAQC,GAAGe,GAAGtZ,CAAK,IAExBsY,EAAK,QAAQC,GAAGe,CAAC,GAEZA;AAAA,IACX,CAAG,GACM;AAAA,EACR,GAMDvB,EAAM,UAAU,UAAU,WAAW;AACnC,QAAIQ,GAAGe,GAAGC,GAAMvZ,GACZwZ,IAAiB,IACjBC,IAAO,UAAU,CAAC;AAEtB,IAAI,OAAOA,KAAS,YAAYA,MAAS,QAAQ,OAAOA,KACtDlB,IAAIkB,EAAK,GACTH,IAAIG,EAAK,GACTF,IAAOE,EAAK,MACR,UAAU,WAAW,MACvBzZ,IAAQ,UAAU,CAAC,GACnBwZ,IAAiB,QAGnBjB,IAAIkB,GACJH,IAAI,UAAU,CAAC,GACfC,IAAO,UAAU,CAAC,GACd,UAAU,SAAS,MACrBvZ,IAAQ,UAAU,CAAC,GACnBwZ,IAAiB,MAIrBjB,IAAI,KAAKA,GACTe,IAAI,KAAKA,GACJzB,EAAE,YAAY0B,CAAI,MACrBA,IAAO,KAAKA;AAGd,QAAIb,IAAIgB,EAAa,KAAK,aAAanB,GAAGe,GAAGC,CAAI;AACjD,QAAI1B,EAAE,IAAI,KAAK,aAAaa,CAAC;AAC3B,aAAIc,MACF,KAAK,YAAYd,CAAC,IAAI1Y,IAEjB;AAGT,QAAI,CAAC6X,EAAE,YAAY0B,CAAI,KAAK,CAAC,KAAK;AAChC,YAAM,IAAI,MAAM,mDAAmD;AAKrE,SAAK,QAAQhB,CAAC,GACd,KAAK,QAAQe,CAAC,GAEd,KAAK,YAAYZ,CAAC,IAAIc,IAAiBxZ,IAAQ,KAAK,oBAAoBuY,GAAGe,GAAGC,CAAI;AAElF,QAAII,IAAUC,EAAc,KAAK,aAAarB,GAAGe,GAAGC,CAAI;AAExD,WAAAhB,IAAIoB,EAAQ,GACZL,IAAIK,EAAQ,GAEZ,OAAO,OAAOA,CAAO,GACrB,KAAK,UAAUjB,CAAC,IAAIiB,GACpBE,EAAqB,KAAK,OAAOP,CAAC,GAAGf,CAAC,GACtCsB,EAAqB,KAAK,MAAMtB,CAAC,GAAGe,CAAC,GACrC,KAAK,IAAIA,CAAC,EAAEZ,CAAC,IAAIiB,GACjB,KAAK,KAAKpB,CAAC,EAAEG,CAAC,IAAIiB,GAClB,KAAK,cACE;AAAA,EACR,GAED5B,EAAM,UAAU,OAAO,SAASQ,GAAGe,GAAGC,GAAM;AAC1C,QAAIb,IAAK,UAAU,WAAW,IAC1BoB,EAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1CJ,EAAa,KAAK,aAAanB,GAAGe,GAAGC,CAAI;AAC7C,WAAO,KAAK,YAAYb,CAAC;AAAA,EAC1B,GAEDX,EAAM,UAAU,UAAU,SAASQ,GAAGe,GAAGC,GAAM;AAC7C,QAAIb,IAAK,UAAU,WAAW,IAC1BoB,EAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1CJ,EAAa,KAAK,aAAanB,GAAGe,GAAGC,CAAI;AAC7C,WAAO1B,EAAE,IAAI,KAAK,aAAaa,CAAC;AAAA,EACjC,GAEDX,EAAM,UAAU,aAAa,SAASQ,GAAGe,GAAGC,GAAM;AAChD,QAAIb,IAAK,UAAU,WAAW,IAC1BoB,EAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1CJ,EAAa,KAAK,aAAanB,GAAGe,GAAGC,CAAI,GACzCQ,IAAO,KAAK,UAAUrB,CAAC;AAC3B,WAAIqB,MACFxB,IAAIwB,EAAK,GACTT,IAAIS,EAAK,GACT,OAAO,KAAK,YAAYrB,CAAC,GACzB,OAAO,KAAK,UAAUA,CAAC,GACvBsB,EAAuB,KAAK,OAAOV,CAAC,GAAGf,CAAC,GACxCyB,EAAuB,KAAK,MAAMzB,CAAC,GAAGe,CAAC,GACvC,OAAO,KAAK,IAAIA,CAAC,EAAEZ,CAAC,GACpB,OAAO,KAAK,KAAKH,CAAC,EAAEG,CAAC,GACrB,KAAK,eAEA;AAAA,EACR,GAEDX,EAAM,UAAU,UAAU,SAASQ,GAAG0B,GAAG;AACvC,QAAIC,IAAM,KAAK,IAAI3B,CAAC;AACpB,QAAI2B,GAAK;AACP,UAAIC,IAAQtC,EAAE,OAAOqC,CAAG;AACxB,aAAKD,IAGEpC,EAAE,OAAOsC,GAAO,SAASJ,GAAM;AAAE,eAAOA,EAAK,MAAME;AAAA,OAAI,IAFrDE;AAAA,IAGb;AAAA,EACC,GAEDpC,EAAM,UAAU,WAAW,SAASQ,GAAGe,GAAG;AACxC,QAAIc,IAAO,KAAK,KAAK7B,CAAC;AACtB,QAAI6B,GAAM;AACR,UAAID,IAAQtC,EAAE,OAAOuC,CAAI;AACzB,aAAKd,IAGEzB,EAAE,OAAOsC,GAAO,SAASJ,GAAM;AAAE,eAAOA,EAAK,MAAMT;AAAA,OAAI,IAFrDa;AAAA,IAGb;AAAA,EACC,GAEDpC,EAAM,UAAU,YAAY,SAASQ,GAAGe,GAAG;AACzC,QAAIe,IAAU,KAAK,QAAQ9B,GAAGe,CAAC;AAC/B,QAAIe;AACF,aAAOA,EAAQ,OAAO,KAAK,SAAS9B,GAAGe,CAAC,CAAC;AAAA,EAE5C;AAED,WAASO,EAAqBxX,GAAKiY,GAAG;AACpC,IAAIjY,EAAIiY,CAAC,IACPjY,EAAIiY,CAAC,MAELjY,EAAIiY,CAAC,IAAI;AAAA,EAEb;AAEA,WAASN,EAAuB3X,GAAKiY,GAAG;AACtC,IAAK,EAAEjY,EAAIiY,CAAC,KAAK,OAAOjY,EAAIiY,CAAC;AAAA,EAC/B;AAEA,WAASZ,EAAaa,GAAYC,GAAIC,GAAIlB,GAAM;AAC9C,QAAIhB,IAAI,KAAKiC,GACTlB,IAAI,KAAKmB;AACb,QAAI,CAACF,KAAchC,IAAIe,GAAG;AACxB,UAAIoB,IAAMnC;AACV,MAAAA,IAAIe,GACJA,IAAIoB;AAAA,IACR;AACE,WAAOnC,IAAIL,IAAiBoB,IAAIpB,KACpBL,EAAE,YAAY0B,CAAI,IAAIvB,IAAoBuB;AAAA,EACxD;AAEA,WAASK,EAAcW,GAAYC,GAAIC,GAAIlB,GAAM;AAC/C,QAAIhB,IAAI,KAAKiC,GACTlB,IAAI,KAAKmB;AACb,QAAI,CAACF,KAAchC,IAAIe,GAAG;AACxB,UAAIoB,IAAMnC;AACV,MAAAA,IAAIe,GACJA,IAAIoB;AAAA,IACR;AACE,QAAIf,IAAW,EAAE,GAAGpB,GAAG,GAAGe,EAAG;AAC7B,WAAIC,MACFI,EAAQ,OAAOJ,IAEVI;AAAA,EACT;AAEA,WAASG,EAAYS,GAAYZ,GAAS;AACxC,WAAOD,EAAaa,GAAYZ,EAAQ,GAAGA,EAAQ,GAAGA,EAAQ,IAAI;AAAA,EACpE;;;;;wBCnhBAgB,KAAiB;;;;wBCCjBC,KAAiB;AAAA,IACf,OAAOrb,GAAkB;AAAA,IACzB,SAASI,GAAA;AAAA,EACV;;;;;;ACJD,MAAIkY,IAAItY,EAAmB,GACvBwY,IAAQpY,GAAkB;AAE9B,EAAAkb,KAAiB;AAAA,IACf,OAAOC;AAAA,IACP,MAAMC;AAAA,EACP;AAED,WAASD,EAAME,GAAG;AAChB,QAAIH,IAAO;AAAA,MACT,SAAS;AAAA,QACP,UAAUG,EAAE,WAAY;AAAA,QACxB,YAAYA,EAAE,aAAc;AAAA,QAC5B,UAAUA,EAAE,WAAU;AAAA,MACvB;AAAA,MACD,OAAOC,EAAWD,CAAC;AAAA,MACnB,OAAOE,EAAWF,CAAC;AAAA,IACpB;AACD,WAAKnD,EAAE,YAAYmD,EAAE,MAAO,CAAA,MAC1BH,EAAK,QAAQhD,EAAE,MAAMmD,EAAE,MAAK,CAAE,IAEzBH;AAAA,EACT;AAEA,WAASI,EAAWD,GAAG;AACrB,WAAOnD,EAAE,IAAImD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAClC,UAAI4C,IAAYH,EAAE,KAAKzC,CAAC,GACpBK,IAASoC,EAAE,OAAOzC,CAAC,GACnB6C,IAAO,EAAE,GAAG7C,EAAG;AACnB,aAAKV,EAAE,YAAYsD,CAAS,MAC1BC,EAAK,QAAQD,IAEVtD,EAAE,YAAYe,CAAM,MACvBwC,EAAK,SAASxC,IAETwC;AAAA,IACX,CAAG;AAAA,EACH;AAEA,WAASF,EAAWF,GAAG;AACrB,WAAOnD,EAAE,IAAImD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAClC,UAAI2C,IAAYL,EAAE,KAAKtC,CAAC,GACpBqB,IAAO,EAAE,GAAGrB,EAAE,GAAG,GAAGA,EAAE,EAAG;AAC7B,aAAKb,EAAE,YAAYa,EAAE,IAAI,MACvBqB,EAAK,OAAOrB,EAAE,OAEXb,EAAE,YAAYwD,CAAS,MAC1BtB,EAAK,QAAQsB,IAERtB;AAAA,IACX,CAAG;AAAA,EACH;AAEA,WAASgB,EAAKF,GAAM;AAClB,QAAIG,IAAI,IAAIjD,EAAM8C,EAAK,OAAO,EAAE,SAASA,EAAK,KAAK;AACnD,WAAAhD,EAAE,KAAKgD,EAAK,OAAO,SAASS,GAAO;AACjC,MAAAN,EAAE,QAAQM,EAAM,GAAGA,EAAM,KAAK,GAC1BA,EAAM,UACRN,EAAE,UAAUM,EAAM,GAAGA,EAAM,MAAM;AAAA,IAEvC,CAAG,GACDzD,EAAE,KAAKgD,EAAK,OAAO,SAASS,GAAO;AACjC,MAAAN,EAAE,QAAQ,EAAE,GAAGM,EAAM,GAAG,GAAGA,EAAM,GAAG,MAAMA,EAAM,KAAI,GAAIA,EAAM,KAAK;AAAA,IACvE,CAAG,GACMN;AAAA,EACT;;;;;;;ACjEA,MAAInD,IAAItY,EAAoB;AAE5B,EAAAgc,KAAiBC;AAEjB,WAASA,EAAWR,GAAG;AACrB,QAAIS,IAAU,CAAE,GACZC,IAAQ,CAAE,GACVC;AAEJ,aAASC,EAAIrD,GAAG;AACd,MAAIV,EAAE,IAAI4D,GAASlD,CAAC,MACpBkD,EAAQlD,CAAC,IAAI,IACboD,EAAK,KAAKpD,CAAC,GACXV,EAAE,KAAKmD,EAAE,WAAWzC,CAAC,GAAGqD,CAAG,GAC3B/D,EAAE,KAAKmD,EAAE,aAAazC,CAAC,GAAGqD,CAAG;AAAA,IACjC;AAEE,WAAA/D,EAAE,KAAKmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC5B,MAAAoD,IAAO,CAAE,GACTC,EAAIrD,CAAC,GACDoD,EAAK,UACPD,EAAM,KAAKC,CAAI;AAAA,IAErB,CAAG,GAEMD;AAAA,EACT;;;;;;;AC1BA,MAAI7D,IAAItY,EAAoB;AAE5B,EAAAsc,KAAiBC;AASjB,WAASA,IAAgB;AACvB,SAAK,OAAO,CAAE,GACd,KAAK,cAAc,CAAE;AAAA,EACvB;AAKA,SAAAA,EAAc,UAAU,OAAO,WAAW;AACxC,WAAO,KAAK,KAAK;AAAA,EAClB,GAKDA,EAAc,UAAU,OAAO,WAAW;AACxC,WAAO,KAAK,KAAK,IAAI,SAASC,GAAG;AAAE,aAAOA,EAAE;AAAA,KAAM;AAAA,EACnD,GAKDD,EAAc,UAAU,MAAM,SAASzc,GAAK;AAC1C,WAAOwY,EAAE,IAAI,KAAK,aAAaxY,CAAG;AAAA,EACnC,GAQDyc,EAAc,UAAU,WAAW,SAASzc,GAAK;AAC/C,QAAIJ,IAAQ,KAAK,YAAYI,CAAG;AAChC,QAAIJ,MAAU;AACZ,aAAO,KAAK,KAAKA,CAAK,EAAE;AAAA,EAE3B,GAMD6c,EAAc,UAAU,MAAM,WAAW;AACvC,QAAI,KAAK,KAAM,MAAK;AAClB,YAAM,IAAI,MAAM,iBAAiB;AAEnC,WAAO,KAAK,KAAK,CAAC,EAAE;AAAA,EACrB,GAUDA,EAAc,UAAU,MAAM,SAASzc,GAAK2c,GAAU;AACpD,QAAIC,IAAa,KAAK;AAEtB,QADA5c,IAAM,OAAOA,CAAG,GACZ,CAACwY,EAAE,IAAIoE,GAAY5c,CAAG,GAAG;AAC3B,UAAI6c,IAAM,KAAK,MACXjd,IAAQid,EAAI;AAChB,aAAAD,EAAW5c,CAAG,IAAIJ,GAClBid,EAAI,KAAK,EAAC,KAAK7c,GAAK,UAAU2c,EAAQ,CAAC,GACvC,KAAK,UAAU/c,CAAK,GACb;AAAA,IACX;AACE,WAAO;AAAA,EACR,GAKD6c,EAAc,UAAU,YAAY,WAAW;AAC7C,SAAK,MAAM,GAAG,KAAK,KAAK,SAAS,CAAC;AAClC,QAAIK,IAAM,KAAK,KAAK,IAAK;AACzB,kBAAO,KAAK,YAAYA,EAAI,GAAG,GAC/B,KAAK,SAAS,CAAC,GACRA,EAAI;AAAA,EACZ,GASDL,EAAc,UAAU,WAAW,SAASzc,GAAK2c,GAAU;AACzD,QAAI/c,IAAQ,KAAK,YAAYI,CAAG;AAChC,QAAI2c,IAAW,KAAK,KAAK/c,CAAK,EAAE;AAC9B,YAAM,IAAI,MAAM,yDACFI,IAAM,WAAW,KAAK,KAAKJ,CAAK,EAAE,WAAW,WAAW+c,CAAQ;AAEhF,SAAK,KAAK/c,CAAK,EAAE,WAAW+c,GAC5B,KAAK,UAAU/c,CAAK;AAAA,EACrB,GAED6c,EAAc,UAAU,WAAW,SAASM,GAAG;AAC7C,QAAIF,IAAM,KAAK,MACXG,IAAI,IAAID,GACRE,IAAID,IAAI,GACRE,IAAUH;AACd,IAAIC,IAAIH,EAAI,WACVK,IAAUL,EAAIG,CAAC,EAAE,WAAWH,EAAIK,CAAO,EAAE,WAAWF,IAAIE,GACpDD,IAAIJ,EAAI,WACVK,IAAUL,EAAII,CAAC,EAAE,WAAWJ,EAAIK,CAAO,EAAE,WAAWD,IAAIC,IAEtDA,MAAYH,MACd,KAAK,MAAMA,GAAGG,CAAO,GACrB,KAAK,SAASA,CAAO;AAAA,EAG1B,GAEDT,EAAc,UAAU,YAAY,SAAS7c,GAAO;AAIlD,aAHIid,IAAM,KAAK,MACXF,IAAWE,EAAIjd,CAAK,EAAE,UACtB2Z,GACG3Z,MAAU,MACf2Z,IAAS3Z,KAAS,GACd,EAAAid,EAAItD,CAAM,EAAE,WAAWoD;AAG3B,WAAK,MAAM/c,GAAO2Z,CAAM,GACxB3Z,IAAQ2Z;AAAA,EAEX,GAEDkD,EAAc,UAAU,QAAQ,SAASM,GAAGI,GAAG;AAC7C,QAAIN,IAAM,KAAK,MACXD,IAAa,KAAK,aAClBQ,IAAWP,EAAIE,CAAC,GAChBM,IAAWR,EAAIM,CAAC;AACpB,IAAAN,EAAIE,CAAC,IAAIM,GACTR,EAAIM,CAAC,IAAIC,GACTR,EAAWS,EAAS,GAAG,IAAIN,GAC3BH,EAAWQ,EAAS,GAAG,IAAID;AAAA,EAC5B;;;;;;ACvJD,MAAI3E,IAAItY,EAAoB,GACxBuc,IAAgBnc,GAAiC;AAErD,EAAAgd,KAAiBC;AAEjB,MAAIC,IAAsBhF,EAAE,SAAS,CAAC;AAEtC,WAAS+E,EAAS5B,GAAGtU,GAAQoW,GAAUC,GAAQ;AAC7C,WAAOC;AAAA,MAAYhC;AAAA,MAAG,OAAOtU,CAAM;AAAA,MACjCoW,KAAYD;AAAA,MACZE,KAAU,SAASxE,GAAG;AAAE,eAAOyC,EAAE,SAASzC,CAAC;AAAA;IAAI;AAAA,EACnD;AAEA,WAASyE,EAAYhC,GAAGtU,GAAQoW,GAAUC,GAAQ;AAChD,QAAIE,IAAU,CAAE,GACZC,IAAK,IAAIpB,EAAe,GACxBvD,GAAG4E,GAEHC,IAAkB,SAASrD,GAAM;AACnC,UAAIT,IAAIS,EAAK,MAAMxB,IAAIwB,EAAK,IAAIA,EAAK,GACjCsD,IAASJ,EAAQ3D,CAAC,GAClBgE,IAASR,EAAS/C,CAAI,GACtBwD,IAAWJ,EAAO,WAAWG;AAEjC,UAAIA,IAAS;AACX,cAAM,IAAI,MAAM,8DACevD,IAAO,cAAcuD,CAAM;AAG5D,MAAIC,IAAWF,EAAO,aACpBA,EAAO,WAAWE,GAClBF,EAAO,cAAc9E,GACrB2E,EAAG,SAAS5D,GAAGiE,CAAQ;AAAA,IAE1B;AAQD,SANAvC,EAAE,MAAK,EAAG,QAAQ,SAASzC,GAAG;AAC5B,UAAIgF,IAAWhF,MAAM7R,IAAS,IAAI,OAAO;AACzC,MAAAuW,EAAQ1E,CAAC,IAAI,EAAE,UAAUgF,EAAU,GACnCL,EAAG,IAAI3E,GAAGgF,CAAQ;AAAA,IACtB,CAAG,GAEML,EAAG,KAAM,IAAG,MACjB3E,IAAI2E,EAAG,UAAW,GAClBC,IAASF,EAAQ1E,CAAC,GACd4E,EAAO,aAAa,OAAO;AAI/B,MAAAJ,EAAOxE,CAAC,EAAE,QAAQ6E,CAAe;AAGnC,WAAOH;AAAA,EACT;;;;;;;ACrDA,MAAIL,IAAWrd,GAAqB,GAChCsY,IAAIlY,EAAoB;AAE5B,EAAA6d,KAAiBC;AAEjB,WAASA,EAAYzC,GAAG0C,GAAYC,GAAU;AAC5C,WAAO9F,EAAE,UAAUmD,EAAE,MAAK,GAAI,SAAS4C,GAAKrF,GAAG;AAC7C,MAAAqF,EAAIrF,CAAC,IAAIqE,EAAS5B,GAAGzC,GAAGmF,GAAYC,CAAQ;AAAA,IAC7C,GAAE,EAAE;AAAA,EACP;;;;;;;ACTA,MAAI9F,IAAItY,EAAoB;AAE5B,EAAAse,KAAiBC;AAEjB,WAASA,EAAO9C,GAAG;AACjB,QAAI/b,IAAQ,GACRsC,IAAQ,CAAE,GACVka,IAAU,CAAA,GACVwB,IAAU,CAAE;AAEhB,aAASrB,EAAIrD,GAAG;AACd,UAAI+C,IAAQG,EAAQlD,CAAC,IAAI;AAAA,QACvB,SAAS;AAAA,QACT,SAAStZ;AAAA,QACT,OAAOA;AAAA,MACR;AAYD,UAXAsC,EAAM,KAAKgX,CAAC,GAEZyC,EAAE,WAAWzC,CAAC,EAAE,QAAQ,SAASe,GAAG;AAClC,QAAKzB,EAAE,IAAI4D,GAASnC,CAAC,IAGVmC,EAAQnC,CAAC,EAAE,YACpBgC,EAAM,UAAU,KAAK,IAAIA,EAAM,SAASG,EAAQnC,CAAC,EAAE,KAAK,MAHxDsC,EAAItC,CAAC,GACLgC,EAAM,UAAU,KAAK,IAAIA,EAAM,SAASG,EAAQnC,CAAC,EAAE,OAAO;AAAA,MAIlE,CAAK,GAEGgC,EAAM,YAAYA,EAAM,OAAO;AACjC,YAAIK,IAAO,CAAE,GACTrC;AACJ;AACE,UAAAA,IAAI/X,EAAM,IAAK,GACfka,EAAQnC,CAAC,EAAE,UAAU,IACrBqC,EAAK,KAAKrC,CAAC;AAAA,eACJf,MAAMe;AACf,QAAA2D,EAAQ,KAAKtB,CAAI;AAAA,MACvB;AAAA,IACA;AAEE,WAAAX,EAAE,MAAK,EAAG,QAAQ,SAASzC,GAAG;AAC5B,MAAKV,EAAE,IAAI4D,GAASlD,CAAC,KACnBqD,EAAIrD,CAAC;AAAA,IAEX,CAAG,GAEM0E;AAAA,EACT;;;;;;;AC9CA,MAAIpF,IAAItY,EAAoB,GACxBue,IAASne,GAAmB;AAEhC,EAAAoe,KAAiBC;AAEjB,WAASA,EAAWhD,GAAG;AACrB,WAAOnD,EAAE,OAAOiG,EAAO9C,CAAC,GAAG,SAASW,GAAM;AACxC,aAAOA,EAAK,SAAS,KAAMA,EAAK,WAAW,KAAKX,EAAE,QAAQW,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,IAC9E,CAAG;AAAA,EACH;;;;;;;ACTA,MAAI9D,IAAItY,EAAoB;AAE5B,EAAA0e,KAAiBC;AAEjB,MAAIrB,IAAsBhF,EAAE,SAAS,CAAC;AAEtC,WAASqG,EAAclD,GAAG8B,GAAUC,GAAQ;AAC1C,WAAOoB;AAAA,MAAiBnD;AAAA,MACtB8B,KAAYD;AAAA,MACZE,KAAU,SAASxE,GAAG;AAAE,eAAOyC,EAAE,SAASzC,CAAC;AAAA;IAAI;AAAA,EACnD;AAEA,WAAS4F,EAAiBnD,GAAG8B,GAAUC,GAAQ;AAC7C,QAAIE,IAAU,CAAE,GACZmB,IAAQpD,EAAE,MAAO;AAErB,WAAAoD,EAAM,QAAQ,SAAS7F,GAAG;AACxB,MAAA0E,EAAQ1E,CAAC,IAAI,CAAE,GACf0E,EAAQ1E,CAAC,EAAEA,CAAC,IAAI,EAAE,UAAU,EAAG,GAC/B6F,EAAM,QAAQ,SAAS9E,GAAG;AACxB,QAAIf,MAAMe,MACR2D,EAAQ1E,CAAC,EAAEe,CAAC,IAAI,EAAE,UAAU,OAAO,kBAAmB;AAAA,MAE9D,CAAK,GACDyD,EAAOxE,CAAC,EAAE,QAAQ,SAASwB,GAAM;AAC/B,YAAIT,IAAIS,EAAK,MAAMxB,IAAIwB,EAAK,IAAIA,EAAK,GACjCsE,IAAIvB,EAAS/C,CAAI;AACrB,QAAAkD,EAAQ1E,CAAC,EAAEe,CAAC,IAAI,EAAE,UAAU+E,GAAG,aAAa9F,EAAG;AAAA,MACrD,CAAK;AAAA,IACL,CAAG,GAED6F,EAAM,QAAQ,SAAS9D,GAAG;AACxB,UAAIgE,IAAOrB,EAAQ3C,CAAC;AACpB,MAAA8D,EAAM,QAAQ,SAAShC,GAAG;AACxB,YAAImC,IAAOtB,EAAQb,CAAC;AACpB,QAAAgC,EAAM,QAAQ,SAAS5B,GAAG;AACxB,cAAIgC,IAAKD,EAAKjE,CAAC,GACXmE,IAAKH,EAAK9B,CAAC,GACXkC,IAAKH,EAAK/B,CAAC,GACXmC,IAAcH,EAAG,WAAWC,EAAG;AACnC,UAAIE,IAAcD,EAAG,aACnBA,EAAG,WAAWC,GACdD,EAAG,cAAcD,EAAG;AAAA,QAE9B,CAAO;AAAA,MACP,CAAK;AAAA,IACL,CAAG,GAEMxB;AAAA,EACT;;;;;;;ACjDA,MAAIpF,IAAItY,EAAoB;AAE5B,EAAAqf,KAAiBC,GACjBA,EAAQ,iBAAiBC;AAEzB,WAASD,EAAQ7D,GAAG;AAClB,QAAIS,IAAU,CAAE,GACZla,IAAQ,CAAE,GACV0b,IAAU,CAAE;AAEhB,aAAS8B,EAAM3D,GAAM;AACnB,UAAIvD,EAAE,IAAItW,GAAO6Z,CAAI;AACnB,cAAM,IAAI0D,EAAgB;AAG5B,MAAKjH,EAAE,IAAI4D,GAASL,CAAI,MACtB7Z,EAAM6Z,CAAI,IAAI,IACdK,EAAQL,CAAI,IAAI,IAChBvD,EAAE,KAAKmD,EAAE,aAAaI,CAAI,GAAG2D,CAAK,GAClC,OAAOxd,EAAM6Z,CAAI,GACjB6B,EAAQ,KAAK7B,CAAI;AAAA,IAEvB;AAIE,QAFAvD,EAAE,KAAKmD,EAAE,MAAK,GAAI+D,CAAK,GAEnBlH,EAAE,KAAK4D,CAAO,MAAMT,EAAE,UAAS;AACjC,YAAM,IAAI8D,EAAgB;AAG5B,WAAO7B;AAAA,EACT;AAEA,WAAS6B,IAAiB;AAAA,EAAA;AAC1B,SAAAA,EAAe,YAAY,IAAI;;;;;;AClC/B,MAAID,IAAUtf,GAAoB;AAElC,EAAAyf,KAAiBC;AAEjB,WAASA,EAAUjE,GAAG;AACpB,QAAI;AACF,MAAA6D,EAAQ7D,CAAC;AAAA,IACV,SAAQtC,GAAG;AACV,UAAIA,aAAamG,EAAQ;AACvB,eAAO;AAET,YAAMnG;AAAA,IACV;AACE,WAAO;AAAA,EACT;;;;;;;ACdA,MAAIb,IAAItY,EAAoB;AAE5B,EAAA2f,KAAiBtD;AAUjB,WAASA,EAAIZ,GAAGxC,GAAI2G,GAAO;AACzB,IAAKtH,EAAE,QAAQW,CAAE,MACfA,IAAK,CAACA,CAAE;AAGV,QAAI4G,KAAcpE,EAAE,eAAeA,EAAE,aAAaA,EAAE,WAAW,KAAKA,CAAC,GAEjE4C,IAAM,CAAE,GACRnC,IAAU,CAAE;AAChB,WAAA5D,EAAE,KAAKW,GAAI,SAASD,GAAG;AACrB,UAAI,CAACyC,EAAE,QAAQzC,CAAC;AACd,cAAM,IAAI,MAAM,+BAA+BA,CAAC;AAGlD,MAAA8G,EAAMrE,GAAGzC,GAAG4G,MAAU,QAAQ1D,GAAS2D,GAAYxB,CAAG;AAAA,IAC1D,CAAG,GACMA;AAAA,EACT;AAEA,WAASyB,EAAMrE,GAAGzC,GAAG+G,GAAW7D,GAAS2D,GAAYxB,GAAK;AACxD,IAAK/F,EAAE,IAAI4D,GAASlD,CAAC,MACnBkD,EAAQlD,CAAC,IAAI,IAER+G,KAAa1B,EAAI,KAAKrF,CAAC,GAC5BV,EAAE,KAAKuH,EAAW7G,CAAC,GAAG,SAASe,GAAG;AAChC,MAAA+F,EAAMrE,GAAG1B,GAAGgG,GAAW7D,GAAS2D,GAAYxB,CAAG;AAAA,IACrD,CAAK,GACG0B,KAAa1B,EAAI,KAAKrF,CAAC;AAAA,EAE/B;;;;;;;ACzCA,MAAIqD,IAAMrc,GAAgB;AAE1B,EAAAggB,KAAiBD;AAEjB,WAASA,EAAUtE,GAAGxC,GAAI;AACxB,WAAOoD,EAAIZ,GAAGxC,GAAI,MAAM;AAAA,EAC1B;;;;;;;ACNA,MAAIoD,IAAMrc,GAAgB;AAE1B,EAAAigB,KAAiBC;AAEjB,WAASA,EAASzE,GAAGxC,GAAI;AACvB,WAAOoD,EAAIZ,GAAGxC,GAAI,KAAK;AAAA,EACzB;;;;;;;ACNA,MAAIX,IAAItY,EAAoB,GACxBwY,IAAQpY,GAAmB,GAC3Bmc,IAAgBzb,GAAiC;AAErD,EAAAqf,KAAiBC;AAEjB,WAASA,EAAK3E,GAAG0C,GAAY;AAC3B,QAAI7b,IAAS,IAAIkW,EAAO,GACpBqB,IAAU,CAAE,GACZ8D,IAAK,IAAIpB,EAAe,GACxBvD;AAEJ,aAAS6E,EAAgBrD,GAAM;AAC7B,UAAIT,IAAIS,EAAK,MAAMxB,IAAIwB,EAAK,IAAIA,EAAK,GACjC6F,IAAM1C,EAAG,SAAS5D,CAAC;AACvB,UAAIsG,MAAQ,QAAW;AACrB,YAAIC,IAAanC,EAAW3D,CAAI;AAChC,QAAI8F,IAAaD,MACfxG,EAAQE,CAAC,IAAIf,GACb2E,EAAG,SAAS5D,GAAGuG,CAAU;AAAA,MAEjC;AAAA,IACA;AAEE,QAAI7E,EAAE,UAAW,MAAK;AACpB,aAAOnZ;AAGT,IAAAgW,EAAE,KAAKmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC5B,MAAA2E,EAAG,IAAI3E,GAAG,OAAO,iBAAiB,GAClC1W,EAAO,QAAQ0W,CAAC;AAAA,IACpB,CAAG,GAGD2E,EAAG,SAASlC,EAAE,MAAK,EAAG,CAAC,GAAG,CAAC;AAG3B,aADI8E,IAAO,IACJ5C,EAAG,KAAM,IAAG,KAAG;AAEpB,UADA3E,IAAI2E,EAAG,UAAW,GACdrF,EAAE,IAAIuB,GAASb,CAAC;AAClB,QAAA1W,EAAO,QAAQ0W,GAAGa,EAAQb,CAAC,CAAC;AAAA,WACvB;AAAA,YAAIuH;AACT,gBAAM,IAAI,MAAM,mCAAmC9E,CAAC;AAEpD,QAAA8E,IAAO;AAAA;AAGT,MAAA9E,EAAE,UAAUzC,CAAC,EAAE,QAAQ6E,CAAe;AAAA,IAC1C;AAEE,WAAOvb;AAAA,EACT;;;;;wBCnDAke,KAAiB;AAAA,IACf,YAAYxgB,GAAuB;AAAA,IACnC,UAAUI,GAAqB;AAAA,IAC/B,aAAaU,GAAyB;AAAA,IACtC,YAAYwC,GAAwB;AAAA,IACpC,eAAeC,GAA2B;AAAA,IAC1C,WAAWC,GAAuB;AAAA,IAClC,WAAWoC,GAAsB;AAAA,IACjC,UAAUE,GAAqB;AAAA,IAC/B,MAAMoN,GAAiB;AAAA,IACvB,QAAQC,GAAmB;AAAA,IAC3B,SAAS4E,GAAA;AAAA,EACV;;;;;;ACkBD,MAAIsD,IAAMrb,GAAgB;AAE1B,SAAAygB,KAAiB;AAAA,IACf,OAAOpF,EAAI;AAAA,IACX,MAAMjb,GAAqB;AAAA,IAC3B,KAAKU,GAAoB;AAAA,IACzB,SAASua,EAAI;AAAA,EACd;;;;;;ACnCD,MAAIoF;AAEJ,MAAI,OAAO3I,MAAY;AACrB,QAAI;AACF,MAAA2I,IAAWzgB,GAAmB;AAAA,IAC/B,QAAW;AAAA,IAEd;AAGA,SAAKygB,MACHA,IAAW,OAAO,WAGpBC,KAAiBD;;;;;;AChBjB,MAAIpd,IAAKrD,GAAe,GACpBuO,IAAcnO,GAAwB,GACtC6K,IAAUnK,GAAqB,GAC/B2G,IAAWnE,GAAqB;AAYpC,WAASqd,EAAelgB,GAAOf,GAAOH,GAAQ;AAC5C,QAAI,CAACkI,EAASlI,CAAM;AAClB,aAAO;AAET,QAAIiJ,IAAO,OAAO9I;AAClB,YAAI8I,KAAQ,WACH+F,EAAYhP,CAAM,KAAK0L,EAAQvL,GAAOH,EAAO,MAAM,IACnDiJ,KAAQ,YAAY9I,KAASH,KAE7B8D,EAAG9D,EAAOG,CAAK,GAAGe,CAAK,IAEzB;AAAA,EACT;AAEA,SAAAmgB,KAAiBD;;;;;;AC7BjB,MAAIpL,IAAWvV,GAAsB,GACjCqD,IAAKjD,GAAe,GACpBugB,IAAiB7f,GAA4B,GAC7C+f,IAASvd,GAAmB,GAG5BsB,IAAc,OAAO,WAGrBC,IAAiBD,EAAY,gBAuB7Bkc,IAAWvL,EAAS,SAAShW,GAAQwhB,GAAS;AAChD,IAAAxhB,IAAS,OAAOA,CAAM;AAEtB,QAAIG,IAAQ,IACRG,IAASkhB,EAAQ,QACjBC,IAAQnhB,IAAS,IAAIkhB,EAAQ,CAAC,IAAI;AAMtC,SAJIC,KAASL,EAAeI,EAAQ,CAAC,GAAGA,EAAQ,CAAC,GAAGC,CAAK,MACvDnhB,IAAS,IAGJ,EAAEH,IAAQG;AAMf,eALIsH,IAAS4Z,EAAQrhB,CAAK,GACtBE,IAAQihB,EAAO1Z,CAAM,GACrB8Z,IAAa,IACbC,IAActhB,EAAM,QAEjB,EAAEqhB,IAAaC,KAAa;AACjC,YAAIphB,IAAMF,EAAMqhB,CAAU,GACtBxgB,IAAQlB,EAAOO,CAAG;AAEtB,SAAIW,MAAU,UACT4C,EAAG5C,GAAOmE,EAAY9E,CAAG,CAAC,KAAK,CAAC+E,EAAe,KAAKtF,GAAQO,CAAG,OAClEP,EAAOO,CAAG,IAAIqH,EAAOrH,CAAG;AAAA,MAEhC;AAGE,WAAOP;AAAA,EACT,CAAC;AAED,SAAA4hB,KAAiBL;;;;;;AC/DjB,MAAI5U,IAAelM,GAA0B,GACzCuO,IAAcnO,GAAwB,GACtCD,IAAOW,GAAiB;AAS5B,WAASsgB,EAAWC,GAAe;AACjC,WAAO,SAAS3S,GAAYtN,GAAWsU,GAAW;AAChD,UAAI/V,IAAW,OAAO+O,CAAU;AAChC,UAAI,CAACH,EAAYG,CAAU,GAAG;AAC5B,YAAIlP,IAAW0M,EAAa9K,GAAW,CAAC;AACxC,QAAAsN,IAAavO,EAAKuO,CAAU,GAC5BtN,IAAY,SAAStB,GAAK;AAAE,iBAAON,EAASG,EAASG,CAAG,GAAGA,GAAKH,CAAQ;AAAA,QAAI;AAAA,MAClF;AACI,UAAID,IAAQ2hB,EAAc3S,GAAYtN,GAAWsU,CAAS;AAC1D,aAAOhW,IAAQ,KAAKC,EAASH,IAAWkP,EAAWhP,CAAK,IAAIA,CAAK,IAAI;AAAA,IACtE;AAAA,EACH;AAEA,SAAA4hB,KAAiBF;;;;;;ACvBjB,MAAIG,IAAe;AAUnB,WAASC,EAAgBjY,GAAQ;AAG/B,aAFI7J,IAAQ6J,EAAO,QAEZ7J,OAAW6hB,EAAa,KAAKhY,EAAO,OAAO7J,CAAK,CAAC;AAAG;AAC3D,WAAOA;AAAA,EACT;AAEA,SAAA+hB,KAAiBD;;;;;;AClBjB,MAAIA,IAAkBxhB,GAA6B,GAG/C0hB,IAAc;AASlB,WAASC,EAASpY,GAAQ;AACxB,WAAOA,KACHA,EAAO,MAAM,GAAGiY,EAAgBjY,CAAM,IAAI,CAAC,EAAE,QAAQmY,GAAa,EAAE;AAAA,EAE1E;AAEA,SAAAE,KAAiBD;;;;;;AClBjB,MAAIA,IAAW3hB,GAAsB,GACjCyH,IAAWrH,GAAqB,GAChC+H,IAAWrH,GAAqB,GAGhC+gB,IAAM,KAGNC,IAAa,sBAGbC,IAAa,cAGbC,IAAY,eAGZC,IAAe;AAyBnB,WAASC,EAASzhB,GAAO;AACvB,QAAI,OAAOA,KAAS;AAClB,aAAOA;AAET,QAAI0H,EAAS1H,CAAK;AAChB,aAAOohB;AAET,QAAIpa,EAAShH,CAAK,GAAG;AACnB,UAAImB,IAAQ,OAAOnB,EAAM,WAAW,aAAaA,EAAM,QAAO,IAAKA;AACnE,MAAAA,IAAQgH,EAAS7F,CAAK,IAAKA,IAAQ,KAAMA;AAAA,IAC7C;AACE,QAAI,OAAOnB,KAAS;AAClB,aAAOA,MAAU,IAAIA,IAAQ,CAACA;AAEhC,IAAAA,IAAQkhB,EAASlhB,CAAK;AACtB,QAAI0hB,IAAWJ,EAAW,KAAKthB,CAAK;AACpC,WAAQ0hB,KAAYH,EAAU,KAAKvhB,CAAK,IACpCwhB,EAAaxhB,EAAM,MAAM,CAAC,GAAG0hB,IAAW,IAAI,CAAC,IAC5CL,EAAW,KAAKrhB,CAAK,IAAIohB,IAAM,CAACphB;AAAA,EACvC;AAEA,SAAA2hB,KAAiBF;;;;;;AC/DjB,MAAIA,IAAWliB,GAAqB,GAGhC0W,IAAW,OACX2L,IAAc;AAyBlB,WAASC,EAAS7hB,GAAO;AACvB,QAAI,CAACA;AACH,aAAOA,MAAU,IAAIA,IAAQ;AAG/B,QADAA,IAAQyhB,EAASzhB,CAAK,GAClBA,MAAUiW,KAAYjW,MAAU,QAAW;AAC7C,UAAI8hB,IAAQ9hB,IAAQ,IAAI,KAAK;AAC7B,aAAO8hB,IAAOF;AAAA,IAClB;AACE,WAAO5hB,MAAUA,IAAQA,IAAQ;AAAA,EACnC;AAEA,SAAA+hB,KAAiBF;;;;;;ACzCjB,MAAIA,IAAWtiB,GAAqB;AA4BpC,WAASyiB,EAAUhiB,GAAO;AACxB,QAAI6B,IAASggB,EAAS7hB,CAAK,GACvBiiB,IAAYpgB,IAAS;AAEzB,WAAOA,MAAWA,IAAUogB,IAAYpgB,IAASogB,IAAYpgB,IAAU;AAAA,EACzE;AAEA,SAAAqgB,KAAiBF;;;;;;ACnCjB,MAAIhN,IAAgBzV,GAA2B,GAC3CkM,IAAe9L,GAA0B,GACzCqiB,IAAY3hB,GAAsB,GAGlCsT,IAAY,KAAK;AAqCrB,WAASwO,EAAUzhB,GAAOC,GAAWsU,GAAW;AAC9C,QAAI7V,IAASsB,KAAS,OAAO,IAAIA,EAAM;AACvC,QAAI,CAACtB;AACH,aAAO;AAET,QAAIH,IAAQgW,KAAa,OAAO,IAAI+M,EAAU/M,CAAS;AACvD,WAAIhW,IAAQ,MACVA,IAAQ0U,EAAUvU,IAASH,GAAO,CAAC,IAE9B+V,EAActU,GAAO+K,EAAa9K,GAAW,CAAC,GAAG1B,CAAK;AAAA,EAC/D;AAEA,SAAAmjB,KAAiBD;;;;;;ACtDjB,MAAIxB,IAAaphB,GAAwB,GACrC4iB,IAAYxiB,GAAsB,GAsClC0iB,IAAO1B,EAAWwB,CAAS;AAE/B,SAAAG,KAAiBD;;;;;;ACzCjB,MAAIjP,IAAc7T,GAAyB;AAgB3C,WAASgjB,EAAQ7hB,GAAO;AACtB,QAAItB,IAASsB,KAAS,OAAO,IAAIA,EAAM;AACvC,WAAOtB,IAASgU,EAAY1S,GAAO,CAAC,IAAI,CAAE;AAAA,EAC5C;AAEA,SAAA8hB,KAAiBD;;;;;;ACrBjB,MAAI/iB,IAAUD,GAAqB,GAC/B8O,IAAe1O,GAA0B,GACzCygB,IAAS/f,GAAmB;AA8BhC,WAASoiB,EAAM3jB,GAAQC,GAAU;AAC/B,WAAOD,KAAU,OACbA,IACAU,EAAQV,GAAQuP,EAAatP,CAAQ,GAAGqhB,CAAM;AAAA,EACpD;AAEA,SAAAsC,KAAiBD;;;;;;ACxBjB,WAASE,EAAKjiB,GAAO;AACnB,QAAItB,IAASsB,KAAS,OAAO,IAAIA,EAAM;AACvC,WAAOtB,IAASsB,EAAMtB,IAAS,CAAC,IAAI;AAAA,EACtC;AAEA,SAAAwjB,KAAiBD;;;;;;ACnBjB,MAAIjb,IAAWnI,GAAqB;AAYpC,WAASsjB,EAAaniB,GAAO3B,GAAU6W,GAAY;AAIjD,aAHI3W,IAAQ,IACRG,IAASsB,EAAM,QAEZ,EAAEzB,IAAQG,KAAQ;AACvB,UAAIY,IAAQU,EAAMzB,CAAK,GACnB6jB,IAAU/jB,EAASiB,CAAK;AAE5B,UAAI8iB,KAAW,SAASrM,MAAa,SAC5BqM,MAAYA,KAAW,CAACpb,EAASob,CAAO,IACzClN,EAAWkN,GAASrM,CAAQ;AAElC,YAAIA,IAAWqM,GACXjhB,IAAS7B;AAAA,IAEnB;AACE,WAAO6B;AAAA,EACT;AAEA,SAAAkhB,KAAiBF;;;;;;ACtBjB,WAASG,EAAOhjB,GAAOmB,GAAO;AAC5B,WAAOnB,IAAQmB;AAAA,EACjB;AAEA,SAAA8hB,KAAiBD;;;;;;ACbjB,MAAIH,IAAetjB,GAA0B,GACzCyjB,IAASrjB,GAAoB,GAC7BsL,IAAW5K,GAAqB;AAoBpC,WAAS6iB,EAAIxiB,GAAO;AAClB,WAAQA,KAASA,EAAM,SACnBmiB,EAAaniB,GAAOuK,GAAU+X,CAAM,IACpC;AAAA,EACN;AAEA,SAAAG,KAAiBD;;;;;;AC5BjB,MAAIvX,IAAkBpM,GAA6B,GAC/CqD,IAAKjD,GAAe;AAWxB,WAASyjB,EAAiBtkB,GAAQO,GAAKW,GAAO;AAC5C,KAAKA,MAAU,UAAa,CAAC4C,EAAG9D,EAAOO,CAAG,GAAGW,CAAK,KAC7CA,MAAU,UAAa,EAAEX,KAAOP,OACnC6M,EAAgB7M,GAAQO,GAAKW,CAAK;AAAA,EAEtC;AAEA,SAAAqjB,KAAiBD;;;;;;ACnBjB,MAAI3b,IAAalI,GAAwB,GACrCgT,IAAe5S,GAA0B,GACzC2G,IAAejG,GAAyB,GAGxCmF,IAAY,mBAGZ8d,IAAY,SAAS,WACrBnf,IAAc,OAAO,WAGrBof,IAAeD,EAAU,UAGzBlf,IAAiBD,EAAY,gBAG7Bqf,IAAmBD,EAAa,KAAK,MAAM;AA8B/C,WAASE,EAAczjB,GAAO;AAC5B,QAAI,CAACsG,EAAatG,CAAK,KAAKyH,EAAWzH,CAAK,KAAKwF;AAC/C,aAAO;AAET,QAAIke,IAAQnR,EAAavS,CAAK;AAC9B,QAAI0jB,MAAU;AACZ,aAAO;AAET,QAAI5Q,IAAO1O,EAAe,KAAKsf,GAAO,aAAa,KAAKA,EAAM;AAC9D,WAAO,OAAO5Q,KAAQ,cAAcA,aAAgBA,KAClDyQ,EAAa,KAAKzQ,CAAI,KAAK0Q;AAAA,EAC/B;AAEA,SAAAG,KAAiBF;;;;;;ACrDjB,WAASG,EAAQ9kB,GAAQO,GAAK;AAC5B,QAAI,EAAAA,MAAQ,iBAAiB,OAAOP,EAAOO,CAAG,KAAM,eAIhDA,KAAO;AAIX,aAAOP,EAAOO,CAAG;AAAA,EACnB;AAEA,SAAAwkB,KAAiBD;;;;;;ACpBjB,MAAIE,IAAavkB,GAAwB,GACrC6gB,IAASzgB,GAAmB;AA0BhC,WAASokB,EAAc/jB,GAAO;AAC5B,WAAO8jB,EAAW9jB,GAAOogB,EAAOpgB,CAAK,CAAC;AAAA,EACxC;AAEA,SAAAgkB,KAAiBD;;;;;;AC/BjB,MAAIX,IAAmB7jB,GAA8B,GACjD0kB,IAActkB,GAAyB,GACvCukB,IAAkB7jB,GAA6B,GAC/C8jB,IAAYthB,GAAuB,GACnCuhB,IAAkBthB,GAA6B,GAC/CyH,IAAcxH,GAAwB,GACtCkC,IAAUE,EAAoB,GAC9ByR,IAAoBvR,GAA8B,GAClDH,IAAWuN,GAAqB,GAChCD,IAAaE,GAAuB,GACpC1L,IAAWsQ,GAAqB,GAChCmM,IAAgBlM,GAA0B,GAC1CnS,IAAeoS,GAAyB,GACxCoM,IAAUnM,GAAqB,GAC/BsM,IAAgBrM,GAA0B;AAiB9C,WAAS2M,EAAcvlB,GAAQ4H,GAAQrH,GAAKilB,GAAUC,GAAWljB,GAAYE,GAAO;AAClF,QAAIoD,IAAWif,EAAQ9kB,GAAQO,CAAG,GAC9ByH,IAAW8c,EAAQld,GAAQrH,CAAG,GAC9B2E,IAAUzC,EAAM,IAAIuF,CAAQ;AAEhC,QAAI9C,GAAS;AACX,MAAAof,EAAiBtkB,GAAQO,GAAK2E,CAAO;AACrC;AAAA,IACJ;AACE,QAAIwgB,IAAWnjB,IACXA,EAAWsD,GAAUmC,GAAWzH,IAAM,IAAKP,GAAQ4H,GAAQnF,CAAK,IAChE,QAEAgV,IAAWiO,MAAa;AAE5B,QAAIjO,GAAU;AACZ,UAAI3D,IAAQ3N,EAAQ6B,CAAQ,GACxB2d,IAAS,CAAC7R,KAAS1N,EAAS4B,CAAQ,GACpC4d,IAAU,CAAC9R,KAAS,CAAC6R,KAAUrf,EAAa0B,CAAQ;AAExD,MAAA0d,IAAW1d,GACP8L,KAAS6R,KAAUC,IACjBzf,EAAQN,CAAQ,IAClB6f,IAAW7f,IAEJiS,EAAkBjS,CAAQ,IACjC6f,IAAWL,EAAUxf,CAAQ,IAEtB8f,KACPlO,IAAW,IACXiO,IAAWP,EAAYnd,GAAU,EAAI,KAE9B4d,KACPnO,IAAW,IACXiO,IAAWN,EAAgBpd,GAAU,EAAI,KAGzC0d,IAAW,CAAE,IAGRf,EAAc3c,CAAQ,KAAKyD,EAAYzD,CAAQ,KACtD0d,IAAW7f,GACP4F,EAAY5F,CAAQ,IACtB6f,IAAWT,EAAcpf,CAAQ,KAE1B,CAACqC,EAASrC,CAAQ,KAAK6N,EAAW7N,CAAQ,OACjD6f,IAAWJ,EAAgBtd,CAAQ,MAIrCyP,IAAW;AAAA,IAEjB;AACE,IAAIA,MAEFhV,EAAM,IAAIuF,GAAU0d,CAAQ,GAC5BD,EAAUC,GAAU1d,GAAUwd,GAAUjjB,GAAYE,CAAK,GACzDA,EAAM,OAAUuF,CAAQ,IAE1Bsc,EAAiBtkB,GAAQO,GAAKmlB,CAAQ;AAAA,EACxC;AAEA,SAAAG,KAAiBN;;;;;;AC7FjB,MAAItf,IAAQxF,GAAmB,GAC3B6jB,IAAmBzjB,GAA8B,GACjDH,IAAUa,GAAqB,GAC/BgkB,IAAgBxhB,GAA2B,GAC3CmE,IAAWlE,GAAqB,GAChCsd,IAASrd,GAAmB,GAC5B6gB,IAAUze,GAAqB;AAanC,WAASyf,EAAU9lB,GAAQ4H,GAAQ4d,GAAUjjB,GAAYE,GAAO;AAC9D,IAAIzC,MAAW4H,KAGflH,EAAQkH,GAAQ,SAASI,GAAUzH,GAAK;AAEtC,UADAkC,MAAUA,IAAQ,IAAIwD,MAClBiC,EAASF,CAAQ;AACnB,QAAAud,EAAcvlB,GAAQ4H,GAAQrH,GAAKilB,GAAUM,GAAWvjB,GAAYE,CAAK;AAAA,WAEtE;AACH,YAAIijB,IAAWnjB,IACXA,EAAWuiB,EAAQ9kB,GAAQO,CAAG,GAAGyH,GAAWzH,IAAM,IAAKP,GAAQ4H,GAAQnF,CAAK,IAC5E;AAEJ,QAAIijB,MAAa,WACfA,IAAW1d,IAEbsc,EAAiBtkB,GAAQO,GAAKmlB,CAAQ;AAAA,MAC5C;AAAA,IACG,GAAEpE,CAAM;AAAA,EACX;AAEA,SAAAyE,KAAiBD;;;;;;ACzCjB,MAAI9P,IAAWvV,GAAsB,GACjC2gB,IAAiBvgB,GAA4B;AASjD,WAASmlB,EAAeC,GAAU;AAChC,WAAOjQ,EAAS,SAAShW,GAAQwhB,GAAS;AACxC,UAAIrhB,IAAQ,IACRG,IAASkhB,EAAQ,QACjBjf,IAAajC,IAAS,IAAIkhB,EAAQlhB,IAAS,CAAC,IAAI,QAChDmhB,IAAQnhB,IAAS,IAAIkhB,EAAQ,CAAC,IAAI;AAWtC,WATAjf,IAAc0jB,EAAS,SAAS,KAAK,OAAO1jB,KAAc,cACrDjC,KAAUiC,KACX,QAEAkf,KAASL,EAAeI,EAAQ,CAAC,GAAGA,EAAQ,CAAC,GAAGC,CAAK,MACvDlf,IAAajC,IAAS,IAAI,SAAYiC,GACtCjC,IAAS,IAEXN,IAAS,OAAOA,CAAM,GACf,EAAEG,IAAQG,KAAQ;AACvB,YAAIsH,IAAS4Z,EAAQrhB,CAAK;AAC1B,QAAIyH,KACFqe,EAASjmB,GAAQ4H,GAAQzH,GAAOoC,CAAU;AAAA,MAElD;AACI,aAAOvC;AAAA,IACX,CAAG;AAAA,EACH;AAEA,SAAAkmB,KAAiBF;;;;;;ACpCjB,MAAIF,IAAYrlB,GAAuB,GACnCulB,IAAiBnlB,GAA4B,GAiC7CslB,IAAQH,EAAe,SAAShmB,GAAQ4H,GAAQ4d,GAAU;AAC5D,IAAAM,EAAU9lB,GAAQ4H,GAAQ4d,CAAQ;AAAA,EACpC,CAAC;AAED,SAAAY,KAAiBD;;;;;;AC7BjB,WAASE,EAAOnlB,GAAOmB,GAAO;AAC5B,WAAOnB,IAAQmB;AAAA,EACjB;AAEA,SAAAikB,KAAiBD;;;;;;ACbjB,MAAItC,IAAetjB,GAA0B,GACzC4lB,IAASxlB,GAAoB,GAC7BsL,IAAW5K,GAAqB;AAoBpC,WAAS8b,EAAIzb,GAAO;AAClB,WAAQA,KAASA,EAAM,SACnBmiB,EAAaniB,GAAOuK,GAAUka,CAAM,IACpC;AAAA,EACN;AAEA,SAAAE,KAAiBlJ;;;;;;AC5BjB,MAAI0G,IAAetjB,GAA0B,GACzCkM,IAAe9L,GAA0B,GACzCwlB,IAAS9kB,GAAoB;AAyBjC,WAASilB,EAAM5kB,GAAO3B,GAAU;AAC9B,WAAQ2B,KAASA,EAAM,SACnBmiB,EAAaniB,GAAO+K,EAAa1M,GAAU,CAAC,GAAGomB,CAAM,IACrD;AAAA,EACN;AAEA,SAAAI,KAAiBD;;;;;;ACjCjB,MAAIE,IAAOjmB,GAAkB,GAkBzBkmB,IAAM,WAAW;AACnB,WAAOD,EAAK,KAAK,IAAK;AAAA,EACvB;AAED,SAAAE,KAAiBD;;;;;;ACtBjB,MAAIE,IAAcpmB,GAAyB,GACvCoK,IAAWhK,GAAsB,GACjC6K,IAAUnK,GAAqB,GAC/B2G,IAAWnE,GAAqB,GAChCgH,IAAQ/G,GAAmB;AAY/B,WAAS8iB,EAAQ9mB,GAAQkL,GAAMhK,GAAOqB,GAAY;AAChD,QAAI,CAAC2F,EAASlI,CAAM;AAClB,aAAOA;AAET,IAAAkL,IAAOL,EAASK,GAAMlL,CAAM;AAO5B,aALIG,IAAQ,IACRG,IAAS4K,EAAK,QACd6b,IAAYzmB,IAAS,GACrB0mB,IAAShnB,GAENgnB,KAAU,QAAQ,EAAE7mB,IAAQG,KAAQ;AACzC,UAAIC,IAAMwK,EAAMG,EAAK/K,CAAK,CAAC,GACvBulB,IAAWxkB;AAEf,UAAIX,MAAQ,eAAeA,MAAQ,iBAAiBA,MAAQ;AAC1D,eAAOP;AAGT,UAAIG,KAAS4mB,GAAW;AACtB,YAAIlhB,IAAWmhB,EAAOzmB,CAAG;AACzB,QAAAmlB,IAAWnjB,IAAaA,EAAWsD,GAAUtF,GAAKymB,CAAM,IAAI,QACxDtB,MAAa,WACfA,IAAWxd,EAASrC,CAAQ,IACxBA,IACC6F,EAAQR,EAAK/K,IAAQ,CAAC,CAAC,IAAI,CAAE,IAAG;MAE7C;AACI,MAAA0mB,EAAYG,GAAQzmB,GAAKmlB,CAAQ,GACjCsB,IAASA,EAAOzmB,CAAG;AAAA,IACvB;AACE,WAAOP;AAAA,EACT;AAEA,SAAAinB,KAAiBH;;;;;;AClDjB,MAAI7b,IAAUxK,GAAqB,GAC/BqmB,IAAUjmB,GAAqB,GAC/BgK,IAAWtJ,GAAsB;AAWrC,WAAS2lB,EAAWlnB,GAAQmnB,GAAOtlB,GAAW;AAK5C,aAJI1B,IAAQ,IACRG,IAAS6mB,EAAM,QACfpkB,IAAS,CAAE,GAER,EAAE5C,IAAQG,KAAQ;AACvB,UAAI4K,IAAOic,EAAMhnB,CAAK,GAClBe,IAAQ+J,EAAQjL,GAAQkL,CAAI;AAEhC,MAAIrJ,EAAUX,GAAOgK,CAAI,KACvB4b,EAAQ/jB,GAAQ8H,EAASK,GAAMlL,CAAM,GAAGkB,CAAK;AAAA,IAEnD;AACE,WAAO6B;AAAA,EACT;AAEA,SAAAqkB,KAAiBF;;;;;;AC7BjB,MAAIA,IAAazmB,GAAwB,GACrCsL,IAAQlL,GAAkB;AAW9B,WAASwmB,EAASrnB,GAAQmnB,GAAO;AAC/B,WAAOD,EAAWlnB,GAAQmnB,GAAO,SAASjmB,GAAOgK,GAAM;AACrD,aAAOa,EAAM/L,GAAQkL,CAAI;AAAA,IAC7B,CAAG;AAAA,EACH;AAEA,SAAAoc,KAAiBD;;;;;;AClBjB,MAAI5D,IAAUhjB,GAAoB,GAC9BqU,IAAWjU,GAAsB,GACjCiV,IAAcvU,GAAyB;AAS3C,WAASgmB,EAASle,GAAM;AACtB,WAAOyM,EAAYhB,EAASzL,GAAM,QAAWoa,CAAO,GAAGpa,IAAO,EAAE;AAAA,EAClE;AAEA,SAAAme,KAAiBD;;;;;;ACfjB,MAAIF,IAAW5mB,GAAsB,GACjC8mB,IAAW1mB,GAAsB,GAmBjC4mB,IAAOF,EAAS,SAASvnB,GAAQmnB,GAAO;AAC1C,WAAOnnB,KAAU,OAAO,CAAA,IAAKqnB,EAASrnB,GAAQmnB,CAAK;AAAA,EACrD,CAAC;AAED,SAAAO,KAAiBD;;;;;;ACvBjB,MAAIE,IAAa,KAAK,MAClB9S,IAAY,KAAK;AAarB,WAAS+S,EAAU7S,GAAO8S,GAAKC,GAAM/nB,GAAW;AAK9C,aAJII,IAAQ,IACRG,IAASuU,EAAU8S,GAAYE,IAAM9S,MAAU+S,KAAQ,EAAE,GAAG,CAAC,GAC7D/kB,IAAS,MAAMzC,CAAM,GAElBA;AACL,MAAAyC,EAAOhD,IAAYO,IAAS,EAAEH,CAAK,IAAI4U,GACvCA,KAAS+S;AAEX,WAAO/kB;AAAA,EACT;AAEA,SAAAglB,KAAiBH;;;;;;AC3BjB,MAAIA,IAAYnnB,GAAuB,GACnC2gB,IAAiBvgB,GAA4B,GAC7CkiB,IAAWxhB,GAAqB;AASpC,WAASymB,EAAYjoB,GAAW;AAC9B,WAAO,SAASgV,GAAO8S,GAAKC,GAAM;AAChC,aAAIA,KAAQ,OAAOA,KAAQ,YAAY1G,EAAerM,GAAO8S,GAAKC,CAAI,MACpED,IAAMC,IAAO,SAGf/S,IAAQgO,EAAShO,CAAK,GAClB8S,MAAQ,UACVA,IAAM9S,GACNA,IAAQ,KAER8S,IAAM9E,EAAS8E,CAAG,GAEpBC,IAAOA,MAAS,SAAa/S,IAAQ8S,IAAM,IAAI,KAAM9E,EAAS+E,CAAI,GAC3DF,EAAU7S,GAAO8S,GAAKC,GAAM/nB,CAAS;AAAA,IAC7C;AAAA,EACH;AAEA,SAAAkoB,KAAiBD;;;;;;AC7BjB,MAAIA,IAAcvnB,GAAyB,GA2CvCynB,IAAQF,EAAa;AAEzB,SAAAG,KAAiBD;;;;;;ACnCjB,WAASE,EAAWxmB,GAAOymB,GAAU;AACnC,QAAI/nB,IAASsB,EAAM;AAGnB,SADAA,EAAM,KAAKymB,CAAQ,GACZ/nB;AACL,MAAAsB,EAAMtB,CAAM,IAAIsB,EAAMtB,CAAM,EAAE;AAEhC,WAAOsB;AAAA,EACT;AAEA,SAAA0mB,KAAiBF;;;;;;ACpBjB,MAAIxf,IAAWnI,GAAqB;AAUpC,WAAS8nB,EAAiBrnB,GAAOmB,GAAO;AACtC,QAAInB,MAAUmB,GAAO;AACnB,UAAImmB,IAAetnB,MAAU,QACzBunB,IAAYvnB,MAAU,MACtBwnB,IAAiBxnB,MAAUA,GAC3BynB,IAAc/f,EAAS1H,CAAK,GAE5B0nB,IAAevmB,MAAU,QACzBwmB,IAAYxmB,MAAU,MACtBymB,IAAiBzmB,MAAUA,GAC3B0mB,IAAcngB,EAASvG,CAAK;AAEhC,UAAK,CAACwmB,KAAa,CAACE,KAAe,CAACJ,KAAeznB,IAAQmB,KACtDsmB,KAAeC,KAAgBE,KAAkB,CAACD,KAAa,CAACE,KAChEN,KAAaG,KAAgBE,KAC7B,CAACN,KAAgBM,KAClB,CAACJ;AACH,eAAO;AAET,UAAK,CAACD,KAAa,CAACE,KAAe,CAACI,KAAe7nB,IAAQmB,KACtD0mB,KAAeP,KAAgBE,KAAkB,CAACD,KAAa,CAACE,KAChEE,KAAaL,KAAgBE,KAC7B,CAACE,KAAgBF,KAClB,CAACI;AACH,eAAO;AAAA,IAEb;AACE,WAAO;AAAA,EACT;AAEA,SAAAE,KAAiBT;;;;;;ACxCjB,MAAIA,IAAmB9nB,GAA8B;AAgBrD,WAASwoB,EAAgBjpB,GAAQqC,GAAO6mB,GAAQ;AAO9C,aANI/oB,IAAQ,IACRgpB,IAAcnpB,EAAO,UACrBopB,IAAc/mB,EAAM,UACpB/B,IAAS6oB,EAAY,QACrBE,IAAeH,EAAO,QAEnB,EAAE/oB,IAAQG,KAAQ;AACvB,UAAIyC,IAASwlB,EAAiBY,EAAYhpB,CAAK,GAAGipB,EAAYjpB,CAAK,CAAC;AACpE,UAAI4C,GAAQ;AACV,YAAI5C,KAASkpB;AACX,iBAAOtmB;AAET,YAAIsd,IAAQ6I,EAAO/oB,CAAK;AACxB,eAAO4C,KAAUsd,KAAS,SAAS,KAAK;AAAA,MAC9C;AAAA,IACA;AAQE,WAAOrgB,EAAO,QAAQqC,EAAM;AAAA,EAC9B;AAEA,SAAAinB,KAAiBL;;;;;;AC3CjB,MAAI3e,IAAW7J,GAAsB,GACjCwK,IAAUpK,GAAqB,GAC/B8L,IAAepL,GAA0B,GACzCqP,IAAU7M,GAAqB,GAC/BqkB,IAAapkB,GAAwB,GACrCulB,IAAYtlB,GAAuB,GACnCglB,IAAkB5iB,GAA6B,GAC/C8F,IAAW5F,GAAqB,GAChCJ,IAAUwN,EAAoB;AAWlC,WAAS6V,EAAYra,GAAYsa,GAAWP,GAAQ;AAClD,IAAIO,EAAU,SACZA,IAAYnf,EAASmf,GAAW,SAASxpB,GAAU;AACjD,aAAIkG,EAAQlG,CAAQ,IACX,SAASiB,GAAO;AACrB,eAAO+J,EAAQ/J,GAAOjB,EAAS,WAAW,IAAIA,EAAS,CAAC,IAAIA,CAAQ;AAAA,MAC9E,IAEaA;AAAA,IACb,CAAK,IAEDwpB,IAAY,CAACtd,CAAQ;AAGvB,QAAIhM,IAAQ;AACZ,IAAAspB,IAAYnf,EAASmf,GAAWF,EAAU5c,CAAY,CAAC;AAEvD,QAAI5J,IAAS6N,EAAQzB,GAAY,SAASjO,GAAOX,GAAK4O,GAAY;AAChE,UAAIua,IAAWpf,EAASmf,GAAW,SAASxpB,GAAU;AACpD,eAAOA,EAASiB,CAAK;AAAA,MAC3B,CAAK;AACD,aAAO,EAAE,UAAYwoB,GAAU,OAAS,EAAEvpB,GAAO,OAASe,EAAO;AAAA,IACrE,CAAG;AAED,WAAOknB,EAAWrlB,GAAQ,SAAS/C,GAAQqC,GAAO;AAChD,aAAO4mB,EAAgBjpB,GAAQqC,GAAO6mB,CAAM;AAAA,IAChD,CAAG;AAAA,EACH;AAEA,SAAAS,KAAiBH;;;;;;AChDjB,MAAIlV,IAAc7T,GAAyB,GACvC+oB,IAAc3oB,GAAyB,GACvCmV,IAAWzU,GAAsB,GACjC6f,IAAiBrd,GAA4B,GA+B7C6lB,IAAS5T,EAAS,SAAS7G,GAAYsa,GAAW;AACpD,QAAIta,KAAc;AAChB,aAAO,CAAE;AAEX,QAAI7O,IAASmpB,EAAU;AACvB,WAAInpB,IAAS,KAAK8gB,EAAejS,GAAYsa,EAAU,CAAC,GAAGA,EAAU,CAAC,CAAC,IACrEA,IAAY,CAAE,IACLnpB,IAAS,KAAK8gB,EAAeqI,EAAU,CAAC,GAAGA,EAAU,CAAC,GAAGA,EAAU,CAAC,CAAC,MAC9EA,IAAY,CAACA,EAAU,CAAC,CAAC,IAEpBD,EAAYra,GAAYmF,EAAYmV,GAAW,CAAC,GAAG,EAAE;AAAA,EAC9D,CAAC;AAED,SAAAI,KAAiBD;;;;;;AC/CjB,MAAIjf,IAAWlK,GAAqB,GAGhCqpB,IAAY;AAmBhB,WAASC,EAASC,GAAQ;AACxB,QAAIC,IAAK,EAAEH;AACX,WAAOnf,EAASqf,CAAM,IAAIC;AAAA,EAC5B;AAEA,SAAAC,KAAiBH;;;;;;AClBjB,WAASI,EAAc9pB,GAAOoB,GAAQ2oB,GAAY;AAMhD,aALIjqB,IAAQ,IACRG,IAASD,EAAM,QACfgqB,IAAa5oB,EAAO,QACpBsB,IAAS,CAAE,GAER,EAAE5C,IAAQG,KAAQ;AACvB,UAAIY,IAAQf,IAAQkqB,IAAa5oB,EAAOtB,CAAK,IAAI;AACjD,MAAAiqB,EAAWrnB,GAAQ1C,EAAMF,CAAK,GAAGe,CAAK;AAAA,IAC1C;AACE,WAAO6B;AAAA,EACT;AAEA,SAAAunB,KAAiBH;;;;;;ACtBjB,MAAItD,IAAcpmB,GAAyB,GACvC0pB,IAAgBtpB,GAA2B;AAkB/C,WAAS0pB,EAAUlqB,GAAOoB,GAAQ;AAChC,WAAO0oB,EAAc9pB,KAAS,CAAA,GAAIoB,KAAU,CAAA,GAAIolB,CAAW;AAAA,EAC7D;AAEA,SAAA2D,KAAiBD;;;;;;ACrBjB,MAAIjS;AAEJ,MAAI,OAAOC,MAAY;AACrB,QAAI;AACF,MAAAD,IAAS;AAAA,QACP,WAAW7X,GAA2B;AAAA,QACtC,UAAUI,GAA0B;AAAA,QACpC,UAAUU,GAA0B;AAAA,QACpC,MAAMwC,GAAsB;AAAA,QAC5B,QAAQC,GAAwB;AAAA,QAChC,MAAMC,GAAsB;AAAA,QAC5B,SAASoC,GAAyB;AAAA,QAClC,SAASE,GAAyB;AAAA,QAClC,OAAOoN,GAAuB;AAAA,QAC9B,KAAMC,GAAqB;AAAA,QAC3B,aAAa4E,GAA6B;AAAA,QAC1C,MAAMC,GAAsB;AAAA,QAC5B,KAAKC,GAAqB;AAAA,QAC1B,WAAWC,GAA2B;AAAA,QACtC,KAAKC,GAAqB;AAAA,QAC1B,OAAOC,GAAuB;AAAA,QAC9B,KAAK4R,GAAqB;AAAA,QAC1B,OAAOC,GAAuB;AAAA,QAC9B,KAAKC,GAAqB;AAAA,QAC1B,MAAMC,GAAsB;AAAA,QAC5B,OAAOC,GAAuB;AAAA,QAC9B,QAAQC,GAAwB;AAAA,QAChC,QAAQC,GAAwB;AAAA,QAChC,UAAUC,GAA0B;AAAA,QACpC,QAAQC,GAAwB;AAAA,QAChC,WAAWC,GAA2B;AAAA,MACvC;AAAA,IACF,QAAW;AAAA,IAEd;AAGA,SAAK5S,MACHA,IAAS,OAAO,IAGlBQ,KAAiBR;;;;;UCtCjB6S,KAAiBC;AAEjB,WAASA,IAAO;AACd,QAAIC,IAAW,CAAE;AACjB,IAAAA,EAAS,QAAQA,EAAS,QAAQA,GAClC,KAAK,YAAYA;AAAA,EACnB;AAEA,EAAAD,EAAK,UAAU,UAAU,WAAW;AAClC,QAAIC,IAAW,KAAK,WAChB7O,IAAQ6O,EAAS;AACrB,QAAI7O,MAAU6O;AACZ,aAAAC,EAAO9O,CAAK,GACLA;AAAA,EAEV,GAED4O,EAAK,UAAU,UAAU,SAAS5O,GAAO;AACvC,QAAI6O,IAAW,KAAK;AACpB,IAAI7O,EAAM,SAASA,EAAM,SACvB8O,EAAO9O,CAAK,GAEdA,EAAM,QAAQ6O,EAAS,OACvBA,EAAS,MAAM,QAAQ7O,GACvB6O,EAAS,QAAQ7O,GACjBA,EAAM,QAAQ6O;AAAA,EACf,GAEDD,EAAK,UAAU,WAAW,WAAW;AAInC,aAHIG,IAAO,CAAE,GACTF,IAAW,KAAK,WAChBG,IAAOH,EAAS,OACbG,MAASH;AACd,MAAAE,EAAK,KAAK,KAAK,UAAUC,GAAMC,CAAc,CAAC,GAC9CD,IAAOA,EAAK;AAEd,WAAO,MAAMD,EAAK,KAAK,IAAI,IAAI;AAAA,EAChC;AAED,WAASD,EAAO9O,GAAO;AACrB,IAAAA,EAAM,MAAM,QAAQA,EAAM,OAC1BA,EAAM,MAAM,QAAQA,EAAM,OAC1B,OAAOA,EAAM,OACb,OAAOA,EAAM;AAAA,EACf;AAEA,WAASiP,EAAejQ,GAAG/B,GAAG;AAC5B,QAAI+B,MAAM,WAAWA,MAAM;AACzB,aAAO/B;AAAA,EAEX;;;;;;;ACvDA,MAAIV,IAAItY,EAAmB,GACvBwY,IAAQpY,EAAqB,EAAC,OAC9BuqB,IAAO7pB,GAAsB;AASjC,EAAAmqB,KAAiBC;AAEjB,MAAIC,IAAoB7S,EAAE,SAAS,CAAC;AAEpC,WAAS4S,EAAUzP,GAAG8B,GAAU;AAC9B,QAAI9B,EAAE,UAAW,KAAI;AACnB,aAAO,CAAE;AAEX,QAAI2P,IAAQC,EAAW5P,GAAG8B,KAAY4N,CAAiB,GACnDzN,IAAU4N,EAAYF,EAAM,OAAOA,EAAM,SAASA,EAAM,OAAO;AAGnE,WAAO9S,EAAE,QAAQA,EAAE,IAAIoF,GAAS,SAASvE,GAAG;AAC1C,aAAOsC,EAAE,SAAStC,EAAE,GAAGA,EAAE,CAAC;AAAA,IAC3B,CAAA,GAAG,EAAI;AAAA,EACV;AAEA,WAASmS,EAAY7P,GAAG8P,GAASC,GAAS;AAMxC,aALI9N,IAAU,CAAE,GACZqD,IAAUwK,EAAQA,EAAQ,SAAS,CAAC,GACpCE,IAAQF,EAAQ,CAAC,GAEjBxP,GACGN,EAAE,eAAa;AACpB,aAAQM,IAAQ0P,EAAM;AAAgB,QAAAC,EAAWjQ,GAAG8P,GAASC,GAASzP,CAAK;AAC3E,aAAQA,IAAQgF,EAAQ;AAAc,QAAA2K,EAAWjQ,GAAG8P,GAASC,GAASzP,CAAK;AAC3E,UAAIN,EAAE;AACJ,iBAASoB,IAAI0O,EAAQ,SAAS,GAAG1O,IAAI,GAAG,EAAEA;AAExC,cADAd,IAAQwP,EAAQ1O,CAAC,EAAE,QAAS,GACxBd,GAAO;AACT,YAAA2B,IAAUA,EAAQ,OAAOgO,EAAWjQ,GAAG8P,GAASC,GAASzP,GAAO,EAAI,CAAC;AACrE;AAAA,UACV;AAAA;AAAA,IAGA;AAEE,WAAO2B;AAAA,EACT;AAEA,WAASgO,EAAWjQ,GAAG8P,GAASC,GAASzP,GAAO4P,GAAqB;AACnE,QAAIjO,IAAUiO,IAAsB,CAAA,IAAK;AAEzC,WAAArT,EAAE,QAAQmD,EAAE,QAAQM,EAAM,CAAC,GAAG,SAASvB,GAAM;AAC3C,UAAIuD,IAAStC,EAAE,KAAKjB,CAAI,GACpBoR,IAASnQ,EAAE,KAAKjB,EAAK,CAAC;AAE1B,MAAImR,KACFjO,EAAQ,KAAK,EAAE,GAAGlD,EAAK,GAAG,GAAGA,EAAK,GAAG,GAGvCoR,EAAO,OAAO7N,GACd8N,EAAaN,GAASC,GAASI,CAAM;AAAA,IACzC,CAAG,GAEDtT,EAAE,QAAQmD,EAAE,SAASM,EAAM,CAAC,GAAG,SAASvB,GAAM;AAC5C,UAAIuD,IAAStC,EAAE,KAAKjB,CAAI,GACpBT,IAAIS,EAAK,GACTsD,IAASrC,EAAE,KAAK1B,CAAC;AACrB,MAAA+D,EAAO,MAASC,GAChB8N,EAAaN,GAASC,GAAS1N,CAAM;AAAA,IACzC,CAAG,GAEDrC,EAAE,WAAWM,EAAM,CAAC,GAEb2B;AAAA,EACT;AAEA,WAAS2N,EAAW5P,GAAG8B,GAAU;AAC/B,QAAIuO,IAAW,IAAItT,EAAO,GACtBuT,IAAQ,GACRC,IAAS;AAEb,IAAA1T,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAS,GAAG;AAC/B,MAAAqQ,EAAS,QAAQ,GAAG,EAAE,GAAM,IAAM,GAAG,KAAK,GAAG;AAAA,IACjD,CAAG,GAIDxT,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAI8S,IAAaH,EAAS,KAAK3S,EAAE,GAAGA,EAAE,CAAC,KAAK,GACxC4E,IAASR,EAASpE,CAAC,GACnBmH,IAAa2L,IAAalO;AAC9B,MAAA+N,EAAS,QAAQ3S,EAAE,GAAGA,EAAE,GAAGmH,CAAU,GACrC0L,IAAS,KAAK,IAAIA,GAAQF,EAAS,KAAK3S,EAAE,CAAC,EAAE,OAAO4E,CAAM,GAC1DgO,IAAS,KAAK,IAAIA,GAAQD,EAAS,KAAK3S,EAAE,CAAC,EAAE,MAAU4E,CAAM;AAAA,IACjE,CAAG;AAED,QAAIwN,IAAUjT,EAAE,MAAM0T,IAASD,IAAQ,CAAC,EAAE,IAAI,WAAW;AAAE,aAAO,IAAIpB,EAAI;AAAA,IAAG,CAAE,GAC3Ea,IAAUO,IAAQ;AAEtB,WAAAzT,EAAE,QAAQwT,EAAS,MAAO,GAAE,SAAS,GAAG;AACtC,MAAAD,EAAaN,GAASC,GAASM,EAAS,KAAK,CAAC,CAAC;AAAA,IACnD,CAAG,GAEM,EAAE,OAAOA,GAAU,SAASP,GAAS,SAASC,EAAS;AAAA,EAChE;AAEA,WAASK,EAAaN,GAASC,GAASzP,GAAO;AAC7C,IAAKA,EAAM,MAECA,EAAM,KAGhBwP,EAAQxP,EAAM,MAAMA,EAAM,KAAQyP,CAAO,EAAE,QAAQzP,CAAK,IAFxDwP,EAAQA,EAAQ,SAAS,CAAC,EAAE,QAAQxP,CAAK,IAFzCwP,EAAQ,CAAC,EAAE,QAAQxP,CAAK;AAAA,EAM5B;;;;;;;ACnHA,MAAIzD,IAAItY,EAAmB,GACvBkrB,IAAY9qB,GAAuB;AAEvC,EAAA8rB,KAAiB;AAAA,IACf,KAAKC;AAAA,IACL,MAAMC;AAAA,EACP;AAED,WAASD,EAAI1Q,GAAG;AACd,QAAI4Q,IAAO5Q,EAAE,MAAK,EAAG,cAAc,WAC/ByP,EAAUzP,GAAG8B,EAAS9B,CAAC,CAAC,IACxB6Q,EAAO7Q,CAAC;AACZ,IAAAnD,EAAE,QAAQ+T,GAAK,SAASlT,GAAG;AACzB,UAAIN,IAAQ4C,EAAE,KAAKtC,CAAC;AACpB,MAAAsC,EAAE,WAAWtC,CAAC,GACdN,EAAM,cAAcM,EAAE,MACtBN,EAAM,WAAW,IACjB4C,EAAE,QAAQtC,EAAE,GAAGA,EAAE,GAAGN,GAAOP,EAAE,SAAS,KAAK,CAAC;AAAA,IAChD,CAAG;AAED,aAASiF,EAAS9B,GAAG;AACnB,aAAO,SAAStC,GAAG;AACjB,eAAOsC,EAAE,KAAKtC,CAAC,EAAE;AAAA,MAClB;AAAA,IACL;AAAA,EACA;AAEA,WAASmT,EAAO7Q,GAAG;AACjB,QAAI4Q,IAAM,CAAE,GACRrqB,IAAQ,CAAE,GACVka,IAAU,CAAE;AAEhB,aAASG,EAAIrD,GAAG;AACd,MAAIV,EAAE,IAAI4D,GAASlD,CAAC,MAGpBkD,EAAQlD,CAAC,IAAI,IACbhX,EAAMgX,CAAC,IAAI,IACXV,EAAE,QAAQmD,EAAE,SAASzC,CAAC,GAAG,SAASG,GAAG;AACnC,QAAIb,EAAE,IAAItW,GAAOmX,EAAE,CAAC,IAClBkT,EAAI,KAAKlT,CAAC,IAEVkD,EAAIlD,EAAE,CAAC;AAAA,MAEf,CAAK,GACD,OAAOnX,EAAMgX,CAAC;AAAA,IAClB;AAEE,WAAAV,EAAE,QAAQmD,EAAE,MAAK,GAAIY,CAAG,GACjBgQ;AAAA,EACT;AAEA,WAASD,EAAK3Q,GAAG;AACf,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIN,IAAQ4C,EAAE,KAAKtC,CAAC;AACpB,UAAIN,EAAM,UAAU;AAClB,QAAA4C,EAAE,WAAWtC,CAAC;AAEd,YAAIoT,IAAc1T,EAAM;AACxB,eAAOA,EAAM,UACb,OAAOA,EAAM,aACb4C,EAAE,QAAQtC,EAAE,GAAGA,EAAE,GAAGN,GAAO0T,CAAW;AAAA,MAC5C;AAAA,IACA,CAAG;AAAA,EACH;;;;;;;AC9DA,MAAIjU,IAAItY,EAAmB,GACvBwY,IAAQpY,EAAqB,EAAC;AAElCosB,EAAAA,KAAiB;AAAA,IACf,cAAcC;AAAA,IACd,UAAUC;AAAA,IACV,oBAAoBC;AAAA,IACpB,kBAAkBC;AAAA,IAClB,oBAAoBC;AAAA,IACpB,eAAeC;AAAA,IACf,kBAAkBC;AAAA,IAClB,gBAAgBC;AAAA,IAChB,kBAAkBC;AAAA,IAClB,eAAeC;AAAA,IACf,SAASC;AAAA,IACT,WAAWC;AAAA,IACX,MAAMC;AAAA,IACN,QAAQC;AAAA,EACT;AAKD,WAASb,EAAahR,GAAGjT,GAAM+kB,GAAOvT,GAAM;AAC1C,QAAIhB;AACJ;AACE,MAAAA,IAAIV,EAAE,SAAS0B,CAAI;AAAA,WACZyB,EAAE,QAAQzC,CAAC;AAEpB,WAAAuU,EAAM,QAAQ/kB,GACdiT,EAAE,QAAQzC,GAAGuU,CAAK,GACXvU;AAAA,EACT;AAMA,WAAS0T,EAASjR,GAAG;AACnB,QAAI+R,IAAa,IAAIhV,EAAK,EAAG,SAASiD,EAAE,OAAO;AAC/C,WAAAnD,EAAE,QAAQmD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAAE,MAAAwU,EAAW,QAAQxU,GAAGyC,EAAE,KAAKzC,CAAC,CAAC;AAAA,IAAE,CAAE,GACtEV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIsU,IAAcD,EAAW,KAAKrU,EAAE,GAAGA,EAAE,CAAC,KAAK,EAAE,QAAQ,GAAG,QAAQ,EAAG,GACnEN,IAAQ4C,EAAE,KAAKtC,CAAC;AACpB,MAAAqU,EAAW,QAAQrU,EAAE,GAAGA,EAAE,GAAG;AAAA,QAC3B,QAAQsU,EAAY,SAAS5U,EAAM;AAAA,QACnC,QAAQ,KAAK,IAAI4U,EAAY,QAAQ5U,EAAM,MAAM;AAAA,MACvD,CAAK;AAAA,IACL,CAAG,GACM2U;AAAA,EACT;AAEA,WAASb,EAAmBlR,GAAG;AAC7B,QAAI+R,IAAa,IAAIhV,EAAM,EAAE,YAAYiD,EAAE,aAAc,EAAA,CAAE,EAAE,SAASA,EAAE,MAAK,CAAE;AAC/E,WAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,MAAKyC,EAAE,SAASzC,CAAC,EAAE,UACjBwU,EAAW,QAAQxU,GAAGyC,EAAE,KAAKzC,CAAC,CAAC;AAAA,IAErC,CAAG,GACDV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,MAAAqU,EAAW,QAAQrU,GAAGsC,EAAE,KAAKtC,CAAC,CAAC;AAAA,IACnC,CAAG,GACMqU;AAAA,EACT;AAEA,WAASZ,EAAiBnR,GAAG;AAC3B,QAAIiS,IAAYpV,EAAE,IAAImD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAC3C,UAAI2U,IAAO,CAAE;AACb,aAAArV,EAAE,QAAQmD,EAAE,SAASzC,CAAC,GAAG,SAASG,GAAG;AACnC,QAAAwU,EAAKxU,EAAE,CAAC,KAAKwU,EAAKxU,EAAE,CAAC,KAAK,KAAKsC,EAAE,KAAKtC,CAAC,EAAE;AAAA,MAC/C,CAAK,GACMwU;AAAA,IACX,CAAG;AACD,WAAOrV,EAAE,UAAUmD,EAAE,MAAK,GAAIiS,CAAS;AAAA,EACzC;AAEA,WAASb,EAAmBpR,GAAG;AAC7B,QAAIiS,IAAYpV,EAAE,IAAImD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAC3C,UAAIU,IAAQ,CAAE;AACd,aAAApB,EAAE,QAAQmD,EAAE,QAAQzC,CAAC,GAAG,SAASG,GAAG;AAClC,QAAAO,EAAMP,EAAE,CAAC,KAAKO,EAAMP,EAAE,CAAC,KAAK,KAAKsC,EAAE,KAAKtC,CAAC,EAAE;AAAA,MACjD,CAAK,GACMO;AAAA,IACX,CAAG;AACD,WAAOpB,EAAE,UAAUmD,EAAE,MAAK,GAAIiS,CAAS;AAAA,EACzC;AAMA,WAASZ,EAAcc,GAAMC,GAAO;AAClC,QAAIrR,IAAIoR,EAAK,GACTE,IAAIF,EAAK,GAITG,IAAKF,EAAM,IAAIrR,GACfwR,IAAKH,EAAM,IAAIC,GACf,IAAIF,EAAK,QAAQ,GACjBK,IAAIL,EAAK,SAAS;AAEtB,QAAI,CAACG,KAAM,CAACC;AACV,YAAM,IAAI,MAAM,2DAA2D;AAG7E,QAAIE,GAAIC;AACR,WAAI,KAAK,IAAIH,CAAE,IAAI,IAAI,KAAK,IAAID,CAAE,IAAIE,KAEhCD,IAAK,MACPC,IAAI,CAACA,IAEPC,IAAKD,IAAIF,IAAKC,GACdG,IAAKF,MAGDF,IAAK,MACP,IAAI,CAAC,IAEPG,IAAK,GACLC,IAAK,IAAIH,IAAKD,IAGT,EAAE,GAAGvR,IAAI0R,GAAI,GAAGJ,IAAIK,EAAI;AAAA,EACjC;AAMA,WAASpB,EAAiBtR,GAAG;AAC3B,QAAI2S,IAAW9V,EAAE,IAAIA,EAAE,MAAM6U,EAAQ1R,CAAC,IAAI,CAAC,GAAG,WAAW;AAAE,aAAO,CAAA;AAAA,IAAG,CAAE;AACvE,WAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC,GACfqV,IAAOxS,EAAK;AAChB,MAAKvD,EAAE,YAAY+V,CAAI,MACrBD,EAASC,CAAI,EAAExS,EAAK,KAAK,IAAI7C;AAAA,IAEnC,CAAG,GACMoV;AAAA,EACT;AAMA,WAASpB,EAAevR,GAAG;AACzB,QAAImB,IAAMtE,EAAE,IAAIA,EAAE,IAAImD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAAE,aAAOyC,EAAE,KAAKzC,CAAC,EAAE;AAAA,IAAK,CAAE,CAAC;AACxE,IAAAV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC;AACnB,MAAIV,EAAE,IAAIuD,GAAM,MAAM,MACpBA,EAAK,QAAQe;AAAA,IAEnB,CAAG;AAAA,EACH;AAEA,WAASqQ,EAAiBxR,GAAG;AAE3B,QAAI6S,IAAShW,EAAE,IAAIA,EAAE,IAAImD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAAE,aAAOyC,EAAE,KAAKzC,CAAC,EAAE;AAAA,IAAK,CAAE,CAAC,GAEvEuV,IAAS,CAAE;AACf,IAAAjW,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAIqV,IAAO5S,EAAE,KAAKzC,CAAC,EAAE,OAAOsV;AAC5B,MAAKC,EAAOF,CAAI,MACdE,EAAOF,CAAI,IAAI,CAAE,IAEnBE,EAAOF,CAAI,EAAE,KAAKrV,CAAC;AAAA,IACvB,CAAG;AAED,QAAIwV,IAAQ,GACRC,IAAiBhT,EAAE,MAAK,EAAG;AAC/B,IAAAnD,EAAE,QAAQiW,GAAQ,SAAStV,GAAI4D,GAAG;AAChC,MAAIvE,EAAE,YAAYW,CAAE,KAAK4D,IAAI4R,MAAmB,IAC9C,EAAED,IACOA,KACTlW,EAAE,QAAQW,GAAI,SAASD,GAAG;AAAE,QAAAyC,EAAE,KAAKzC,CAAC,EAAE,QAAQwV;AAAA,MAAM,CAAE;AAAA,IAE5D,CAAG;AAAA,EACH;AAEA,WAAStB,EAAczR,GAAG8N,GAAQ8E,GAAMzO,GAAO;AAC7C,QAAI/D,IAAO;AAAA,MACT,OAAO;AAAA,MACP,QAAQ;AAAA,IACT;AACD,WAAI,UAAU,UAAU,MACtBA,EAAK,OAAOwS,GACZxS,EAAK,QAAQ+D,IAER6M,EAAahR,GAAG,UAAUI,GAAM0N,CAAM;AAAA,EAC/C;AAEA,WAAS4D,EAAQ1R,GAAG;AAClB,WAAOnD,EAAE,IAAIA,EAAE,IAAImD,EAAE,MAAK,GAAI,SAASzC,GAAG;AACxC,UAAIqV,IAAO5S,EAAE,KAAKzC,CAAC,EAAE;AACrB,UAAI,CAACV,EAAE,YAAY+V,CAAI;AACrB,eAAOA;AAAA,IAEb,CAAG,CAAC;AAAA,EACJ;AAOA,WAASjB,EAAU1e,GAAYggB,GAAI;AACjC,QAAIpsB,IAAS,EAAE,KAAK,CAAA,GAAI,KAAK,CAAA,EAAI;AACjC,WAAAgW,EAAE,QAAQ5J,GAAY,SAASjO,GAAO;AACpC,MAAIiuB,EAAGjuB,CAAK,IACV6B,EAAO,IAAI,KAAK7B,CAAK,IAErB6B,EAAO,IAAI,KAAK7B,CAAK;AAAA,IAE3B,CAAG,GACM6B;AAAA,EACT;AAMA,WAAS+qB,EAAKrT,GAAM0U,GAAI;AACtB,QAAIpa,IAAQgE,EAAE,IAAK;AACnB,QAAI;AACF,aAAOoW,EAAI;AAAA,IACf,UAAY;AACR,cAAQ,IAAI1U,IAAO,aAAa1B,EAAE,IAAK,IAAGhE,KAAS,IAAI;AAAA,IAC3D;AAAA,EACA;AAEA,WAASgZ,EAAOtT,GAAM0U,GAAI;AACxB,WAAOA,EAAI;AAAA,EACb;;;;;;;AC3OA,MAAIpW,IAAItY,EAAmB,GACvBwsB,IAAOpsB,EAAiB;AAE5B,EAAAuuB,KAAiB;AAAA,IACf,KAAKxC;AAAA,IACL,MAAMC;AAAA,EACP;AAkBD,WAASD,EAAI1Q,GAAG;AACd,IAAAA,EAAE,QAAQ,cAAc,CAAE,GAC1BnD,EAAE,QAAQmD,EAAE,SAAS,SAASjB,GAAM;AAAE,MAAAoU,EAAcnT,GAAGjB,CAAI;AAAA,IAAE,CAAE;AAAA,EACjE;AAEA,WAASoU,EAAcnT,GAAGtC,GAAG;AAC3B,QAAIH,IAAIG,EAAE,GACN0V,IAAQpT,EAAE,KAAKzC,CAAC,EAAE,MAClBe,IAAIZ,EAAE,GACN2V,IAAQrT,EAAE,KAAK1B,CAAC,EAAE,MAClBC,IAAOb,EAAE,MACT4V,IAAYtT,EAAE,KAAKtC,CAAC,GACpB6V,IAAYD,EAAU;AAE1B,QAAID,MAAUD,IAAQ,GAEtB;AAAA,MAAApT,EAAE,WAAWtC,CAAC;AAEd,UAAI8V,GAAO1B,GAAO1Q;AAClB,WAAKA,IAAI,GAAG,EAAEgS,GAAOA,IAAQC,GAAO,EAAEjS,GAAG,EAAEgS;AACzC,QAAAE,EAAU,SAAS,CAAE,GACrBxB,IAAQ;AAAA,UACN,OAAO;AAAA,UAAG,QAAQ;AAAA,UAClB,WAAWwB;AAAA,UAAW,SAAS5V;AAAA,UAC/B,MAAM0V;AAAA,QACP,GACDI,IAAQzC,EAAK,aAAa/Q,GAAG,QAAQ8R,GAAO,IAAI,GAC5CsB,MAAUG,MACZzB,EAAM,QAAQwB,EAAU,OACxBxB,EAAM,SAASwB,EAAU,QACzBxB,EAAM,QAAQ,cACdA,EAAM,WAAWwB,EAAU,WAE7BtT,EAAE,QAAQzC,GAAGiW,GAAO,EAAE,QAAQF,EAAU,OAAQ,GAAE/U,CAAI,GAClD6C,MAAM,KACRpB,EAAE,MAAO,EAAC,YAAY,KAAKwT,CAAK,GAElCjW,IAAIiW;AAGN,MAAAxT,EAAE,QAAQzC,GAAGe,GAAG,EAAE,QAAQgV,EAAU,OAAQ,GAAE/U,CAAI;AAAA;AAAA,EACpD;AAEA,WAASoS,EAAK3Q,GAAG;AACf,IAAAnD,EAAE,QAAQmD,EAAE,MAAK,EAAG,aAAa,SAASzC,GAAG;AAC3C,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC,GACfkW,IAAYrT,EAAK,WACjB9B;AAEJ,WADA0B,EAAE,QAAQI,EAAK,SAASqT,CAAS,GAC1BrT,EAAK;AACV,QAAA9B,IAAI0B,EAAE,WAAWzC,CAAC,EAAE,CAAC,GACrByC,EAAE,WAAWzC,CAAC,GACdkW,EAAU,OAAO,KAAK,EAAE,GAAGrT,EAAK,GAAG,GAAGA,EAAK,GAAG,GAC1CA,EAAK,UAAU,iBACjBqT,EAAU,IAAIrT,EAAK,GACnBqT,EAAU,IAAIrT,EAAK,GACnBqT,EAAU,QAAQrT,EAAK,OACvBqT,EAAU,SAASrT,EAAK,SAE1B7C,IAAIe,GACJ8B,IAAOJ,EAAE,KAAKzC,CAAC;AAAA,IAErB,CAAG;AAAA,EACH;;;;;;;ACvFA,MAAIV,IAAItY,EAAoB;AAE5B,EAAAwsB,KAAiB;AAAA,IACf,aAAa2C;AAAA,IACb,OAAOC;AAAA,EACR;AAuBD,WAASD,EAAY1T,GAAG;AACtB,QAAIS,IAAU,CAAE;AAEhB,aAASG,EAAIrD,GAAG;AACd,UAAIH,IAAQ4C,EAAE,KAAKzC,CAAC;AACpB,UAAIV,EAAE,IAAI4D,GAASlD,CAAC;AAClB,eAAOH,EAAM;AAEf,MAAAqD,EAAQlD,CAAC,IAAI;AAEb,UAAIqV,IAAO/V,EAAE,IAAIA,EAAE,IAAImD,EAAE,SAASzC,CAAC,GAAG,SAASG,GAAG;AAChD,eAAOkD,EAAIlD,EAAE,CAAC,IAAIsC,EAAE,KAAKtC,CAAC,EAAE;AAAA,MAClC,CAAK,CAAC;AAEF,cAAIkV,MAAS,OAAO;AAAA,MAChBA,MAAS;AAAA,MACTA,MAAS,UACXA,IAAO,IAGDxV,EAAM,OAAOwV;AAAA,IACzB;AAEE,IAAA/V,EAAE,QAAQmD,EAAE,QAAO,GAAIY,CAAG;AAAA,EAC5B;AAMA,WAAS+S,EAAM3T,GAAGtC,GAAG;AACnB,WAAOsC,EAAE,KAAKtC,EAAE,CAAC,EAAE,OAAOsC,EAAE,KAAKtC,EAAE,CAAC,EAAE,OAAOsC,EAAE,KAAKtC,CAAC,EAAE;AAAA,EACzD;;;;;;;AC5DA,MAAIb,IAAItY,EAAoB,GACxBwY,IAAQpY,EAAsB,EAAC,OAC/BgvB,IAAQtuB,GAAiB,EAAC;AAE9B,EAAAuuB,KAAiBC;AA2BjB,WAASA,EAAa7T,GAAG;AACvB,QAAI8T,IAAI,IAAI/W,EAAM,EAAE,UAAU,GAAK,CAAE,GAGjClE,IAAQmH,EAAE,MAAK,EAAG,CAAC,GACnB5I,IAAO4I,EAAE,UAAW;AACxB,IAAA8T,EAAE,QAAQjb,GAAO,EAAE;AAGnB,aADIkG,GAAMgU,GACHgB,EAAUD,GAAG9T,CAAC,IAAI5I;AACvB,MAAA2H,IAAOiV,EAAiBF,GAAG9T,CAAC,GAC5B+S,IAAQe,EAAE,QAAQ/U,EAAK,CAAC,IAAI4U,EAAM3T,GAAGjB,CAAI,IAAI,CAAC4U,EAAM3T,GAAGjB,CAAI,GAC3DkV,EAAWH,GAAG9T,GAAG+S,CAAK;AAGxB,WAAOe;AAAA,EACT;AAMA,WAASC,EAAUD,GAAG9T,GAAG;AACvB,aAASY,EAAIrD,GAAG;AACd,MAAAV,EAAE,QAAQmD,EAAE,UAAUzC,CAAC,GAAG,SAASG,GAAG;AACpC,YAAIwW,IAAQxW,EAAE,GACZY,IAAKf,MAAM2W,IAASxW,EAAE,IAAIwW;AAC5B,QAAI,CAACJ,EAAE,QAAQxV,CAAC,KAAK,CAACqV,EAAM3T,GAAGtC,CAAC,MAC9BoW,EAAE,QAAQxV,GAAG,EAAE,GACfwV,EAAE,QAAQvW,GAAGe,GAAG,CAAA,CAAE,GAClBsC,EAAItC,CAAC;AAAA,MAEb,CAAK;AAAA,IACL;AAEE,WAAAzB,EAAE,QAAQiX,EAAE,MAAK,GAAIlT,CAAG,GACjBkT,EAAE,UAAW;AAAA,EACtB;AAMA,WAASE,EAAiBF,GAAG9T,GAAG;AAC9B,WAAOnD,EAAE,MAAMmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AACpC,UAAIoW,EAAE,QAAQpW,EAAE,CAAC,MAAMoW,EAAE,QAAQpW,EAAE,CAAC;AAClC,eAAOiW,EAAM3T,GAAGtC,CAAC;AAAA,IAEvB,CAAG;AAAA,EACH;AAEA,WAASuW,EAAWH,GAAG9T,GAAG+S,GAAO;AAC/B,IAAAlW,EAAE,QAAQiX,EAAE,MAAO,GAAE,SAASvW,GAAG;AAC/B,MAAAyC,EAAE,KAAKzC,CAAC,EAAE,QAAQwV;AAAA,IACtB,CAAG;AAAA,EACH;;;;;;;ACtFA,MAAIlW,IAAItY,EAAoB,GACxBsvB,IAAelvB,GAA0B,GACzCgvB,IAAQtuB,GAAiB,EAAC,OAC1B8uB,IAAW9uB,GAAiB,EAAC,aAC7Bof,IAAW5c,IAAuB,IAAI,UACtCyc,IAAYzc,IAAuB,IAAI,WACvCopB,IAAWnpB,EAAkB,EAAC;AAElC,EAAAssB,KAAiBC,GAGjBA,EAAe,mBAAmBC,GAClCD,EAAe,gBAAgBE,GAC/BF,EAAe,eAAeG,GAC9BH,EAAe,YAAYI,GAC3BJ,EAAe,YAAYK,GAC3BL,EAAe,gBAAgBM;AAmC/B,WAASN,EAAe,GAAG;AACzB,QAAIpD,EAAS,CAAC,GACdkD,EAAS,CAAC;AACV,QAAIL,IAAID,EAAa,CAAC;AACtB,IAAAS,EAAiBR,CAAC,GAClBS,EAAcT,GAAG,CAAC;AAGlB,aADIpW,GAAG/L,GACC+L,IAAI+W,EAAUX,CAAC;AACrB,MAAAniB,IAAI+iB,EAAUZ,GAAG,GAAGpW,CAAC,GACrBiX,EAAcb,GAAG,GAAGpW,GAAG/L,CAAC;AAAA,EAE5B;AAKA,WAAS4iB,EAAcT,GAAG9T,GAAG;AAC3B,QAAIxC,IAAK8G,EAAUwP,GAAGA,EAAE,MAAK,CAAE;AAC/B,IAAAtW,IAAKA,EAAG,MAAM,GAAGA,EAAG,SAAS,CAAC,GAC9BX,EAAE,QAAQW,GAAI,SAASD,GAAG;AACxB,MAAAqX,EAAed,GAAG9T,GAAGzC,CAAC;AAAA,IAC1B,CAAG;AAAA,EACH;AAEA,WAASqX,EAAed,GAAG9T,GAAGrC,GAAO;AACnC,QAAIkX,IAAWf,EAAE,KAAKnW,CAAK,GACvBC,IAASiX,EAAS;AACtB,IAAAf,EAAE,KAAKnW,GAAOC,CAAM,EAAE,WAAW4W,EAAaV,GAAG9T,GAAGrC,CAAK;AAAA,EAC3D;AAMA,WAAS6W,EAAaV,GAAG9T,GAAGrC,GAAO;AACjC,QAAIkX,IAAWf,EAAE,KAAKnW,CAAK,GACvBC,IAASiX,EAAS,QAElBC,IAAc,IAEdC,IAAY/U,EAAE,KAAKrC,GAAOC,CAAM,GAEhCoX,IAAW;AAEf,WAAKD,MACHD,IAAc,IACdC,IAAY/U,EAAE,KAAKpC,GAAQD,CAAK,IAGlCqX,IAAWD,EAAU,QAErBlY,EAAE,QAAQmD,EAAE,UAAUrC,CAAK,GAAG,SAASD,GAAG;AACxC,UAAIuX,IAAYvX,EAAE,MAAMC,GACtBxX,IAAQ8uB,IAAYvX,EAAE,IAAIA,EAAE;AAE9B,UAAIvX,MAAUyX,GAAQ;AACpB,YAAIsX,IAAeD,MAAcH,GAC/BK,IAAcnV,EAAE,KAAKtC,CAAC,EAAE;AAG1B,YADAsX,KAAYE,IAAeC,IAAc,CAACA,GACtCC,EAAWtB,GAAGnW,GAAOxX,CAAK,GAAG;AAC/B,cAAIkvB,IAAgBvB,EAAE,KAAKnW,GAAOxX,CAAK,EAAE;AACzC,UAAA6uB,KAAYE,IAAe,CAACG,IAAgBA;AAAA,QACpD;AAAA,MACA;AAAA,IACA,CAAG,GAEML;AAAA,EACT;AAEA,WAASV,EAAiBgB,GAAM9K,GAAM;AACpC,IAAI,UAAU,SAAS,MACrBA,IAAO8K,EAAK,MAAO,EAAC,CAAC,IAEvBC,EAAgBD,GAAM,IAAI,GAAG9K,CAAI;AAAA,EACnC;AAEA,WAAS+K,EAAgBD,GAAM7U,GAAS+U,GAASjY,GAAGK,GAAQ;AAC1D,QAAI6X,IAAMD,GACNpY,IAAQkY,EAAK,KAAK/X,CAAC;AAEvB,WAAAkD,EAAQlD,CAAC,IAAI,IACbV,EAAE,QAAQyY,EAAK,UAAU/X,CAAC,GAAG,SAASe,GAAG;AACvC,MAAKzB,EAAE,IAAI4D,GAASnC,CAAC,MACnBkX,IAAUD,EAAgBD,GAAM7U,GAAS+U,GAASlX,GAAGf,CAAC;AAAA,IAE5D,CAAG,GAEDH,EAAM,MAAMqY,GACZrY,EAAM,MAAMoY,KACR5X,IACFR,EAAM,SAASQ,IAGf,OAAOR,EAAM,QAGRoY;AAAA,EACT;AAEA,WAASf,EAAUa,GAAM;AACvB,WAAOzY,EAAE,KAAKyY,EAAK,MAAO,GAAE,SAAS5X,GAAG;AACtC,aAAO4X,EAAK,KAAK5X,CAAC,EAAE,WAAW;AAAA,IACnC,CAAG;AAAA,EACH;AAEA,WAASgX,EAAUZ,GAAG9T,GAAGjB,GAAM;AAC7B,QAAIxB,IAAIwB,EAAK,GACTT,IAAIS,EAAK;AAKb,IAAKiB,EAAE,QAAQzC,GAAGe,CAAC,MACjBf,IAAIwB,EAAK,GACTT,IAAIS,EAAK;AAGX,QAAI2W,IAAS5B,EAAE,KAAKvW,CAAC,GACjBoY,IAAS7B,EAAE,KAAKxV,CAAC,GACjBsX,IAAYF,GACZG,IAAO;AAIX,IAAIH,EAAO,MAAMC,EAAO,QACtBC,IAAYD,GACZE,IAAO;AAGT,QAAIC,IAAajZ,EAAE,OAAOmD,EAAE,MAAK,GAAI,SAASjB,GAAM;AAClD,aAAO8W,MAASE,EAAajC,GAAGA,EAAE,KAAK/U,EAAK,CAAC,GAAG6W,CAAS,KAClDC,MAASE,EAAajC,GAAGA,EAAE,KAAK/U,EAAK,CAAC,GAAG6W,CAAS;AAAA,IAC7D,CAAG;AAED,WAAO/Y,EAAE,MAAMiZ,GAAY,SAAS/W,GAAM;AAAE,aAAO4U,EAAM3T,GAAGjB,CAAI;AAAA,KAAI;AAAA,EACtE;AAEA,WAAS4V,EAAcb,GAAG9T,GAAGtC,GAAG/L,GAAG;AACjC,QAAI4L,IAAIG,EAAE,GACNY,IAAIZ,EAAE;AACV,IAAAoW,EAAE,WAAWvW,GAAGe,CAAC,GACjBwV,EAAE,QAAQniB,EAAE,GAAGA,EAAE,GAAG,EAAE,GACtB2iB,EAAiBR,CAAC,GAClBS,EAAcT,GAAG9T,CAAC,GAClBgW,EAAYlC,GAAG9T,CAAC;AAAA,EAClB;AAEA,WAASgW,EAAYlC,GAAG9T,GAAG;AACzB,QAAIwK,IAAO3N,EAAE,KAAKiX,EAAE,MAAO,GAAE,SAASvW,GAAG;AAAE,aAAO,CAACyC,EAAE,KAAKzC,CAAC,EAAE;AAAA,IAAO,CAAE,GAClEC,IAAKiH,EAASqP,GAAGtJ,CAAI;AACzB,IAAAhN,IAAKA,EAAG,MAAM,CAAC,GACfX,EAAE,QAAQW,GAAI,SAASD,GAAG;AACxB,UAAIK,IAASkW,EAAE,KAAKvW,CAAC,EAAE,QACrBwB,IAAOiB,EAAE,KAAKzC,GAAGK,CAAM,GACvBqY,IAAU;AAEZ,MAAKlX,MACHA,IAAOiB,EAAE,KAAKpC,GAAQL,CAAC,GACvB0Y,IAAU,KAGZjW,EAAE,KAAKzC,CAAC,EAAE,OAAOyC,EAAE,KAAKpC,CAAM,EAAE,QAAQqY,IAAUlX,EAAK,SAAS,CAACA,EAAK;AAAA,IAC1E,CAAG;AAAA,EACH;AAKA,WAASqW,EAAWE,GAAMrW,GAAG1B,GAAG;AAC9B,WAAO+X,EAAK,QAAQrW,GAAG1B,CAAC;AAAA,EAC1B;AAMA,WAASwY,EAAaT,GAAMI,GAAQQ,GAAW;AAC7C,WAAOA,EAAU,OAAOR,EAAO,OAAOA,EAAO,OAAOQ,EAAU;AAAA,EAChE;;;;;;;ACvOA,MAAIC,IAAW5xB,GAAiB,GAC5BmvB,IAAcyC,EAAS,aACvBtC,IAAelvB,GAA0B,GACzC0vB,IAAiBhvB,GAA4B;AAEjD,EAAA+wB,KAAiBxD;AAqBjB,WAASA,EAAK5S,GAAG;AACf,YAAOA,EAAE,MAAK,EAAG,QAAM;AAAA,MACvB,KAAK;AAAmB,QAAAqW,EAAqBrW,CAAC;AAAG;AAAA,MACjD,KAAK;AAAc,QAAAsW,EAAgBtW,CAAC;AAAG;AAAA,MACvC,KAAK;AAAgB,QAAAuW,EAAkBvW,CAAC;AAAG;AAAA,MAC3C;AAAS,QAAAqW,EAAqBrW,CAAC;AAAA,IACjC;AAAA,EACA;AAGA,MAAIuW,IAAoB7C;AAExB,WAAS4C,EAAgBtW,GAAG;AAC1B,IAAA0T,EAAY1T,CAAC,GACb6T,EAAa7T,CAAC;AAAA,EAChB;AAEA,WAASqW,EAAqBrW,GAAG;AAC/B,IAAAqU,EAAerU,CAAC;AAAA,EAClB;;;;;;;AC/CA,MAAInD,IAAItY,EAAmB;AAE3B,EAAAiyB,KAAiBC;AAEjB,WAASA,EAAkBzW,GAAG;AAC5B,QAAI0W,IAAgBpS,EAAUtE,CAAC;AAE/B,IAAAnD,EAAE,QAAQmD,EAAE,MAAK,EAAG,aAAa,SAASzC,GAAG;AAU3C,eATI6C,IAAOJ,EAAE,KAAKzC,CAAC,GACfoB,IAAUyB,EAAK,SACfuW,IAAWC,EAAS5W,GAAG0W,GAAe/X,EAAQ,GAAGA,EAAQ,CAAC,GAC1D3P,IAAO2nB,EAAS,MAChBE,IAAMF,EAAS,KACfG,IAAU,GACVC,IAAQ/nB,EAAK8nB,CAAO,GACpBE,IAAY,IAETzZ,MAAMoB,EAAQ,KAAG;AAGtB,YAFAyB,IAAOJ,EAAE,KAAKzC,CAAC,GAEXyZ,GAAW;AACb,kBAAQD,IAAQ/nB,EAAK8nB,CAAO,OAAOD,KAC5B7W,EAAE,KAAK+W,CAAK,EAAE,UAAU3W,EAAK;AAClC,YAAA0W;AAGF,UAAIC,MAAUF,MACZG,IAAY;AAAA,QAEtB;AAEM,YAAI,CAACA,GAAW;AACd,iBAAOF,IAAU9nB,EAAK,SAAS,KACxBgR,EAAE,KAAK+W,IAAQ/nB,EAAK8nB,IAAU,CAAC,CAAC,EAAE,WAAW1W,EAAK;AACvD,YAAA0W;AAEF,UAAAC,IAAQ/nB,EAAK8nB,CAAO;AAAA,QAC5B;AAEM,QAAA9W,EAAE,UAAUzC,GAAGwZ,CAAK,GACpBxZ,IAAIyC,EAAE,WAAWzC,CAAC,EAAE,CAAC;AAAA,MAC3B;AAAA,IACA,CAAG;AAAA,EACH;AAIA,WAASqZ,EAAS5W,GAAG0W,GAAenZ,GAAGe,GAAG;AACxC,QAAI2Y,IAAQ,CAAE,GACVC,IAAQ,CAAE,GACVzB,IAAM,KAAK,IAAIiB,EAAcnZ,CAAC,EAAE,KAAKmZ,EAAcpY,CAAC,EAAE,GAAG,GACzD6Y,IAAM,KAAK,IAAIT,EAAcnZ,CAAC,EAAE,KAAKmZ,EAAcpY,CAAC,EAAE,GAAG,GACzDV,GACAiZ;AAGJ,IAAAjZ,IAASL;AACT;AACE,MAAAK,IAASoC,EAAE,OAAOpC,CAAM,GACxBqZ,EAAM,KAAKrZ,CAAM;AAAA,WACVA,MACC8Y,EAAc9Y,CAAM,EAAE,MAAM6X,KAAO0B,IAAMT,EAAc9Y,CAAM,EAAE;AAKzE,SAJAiZ,IAAMjZ,GAGNA,IAASU,IACDV,IAASoC,EAAE,OAAOpC,CAAM,OAAOiZ;AACrC,MAAAK,EAAM,KAAKtZ,CAAM;AAGnB,WAAO,EAAE,MAAMqZ,EAAM,OAAOC,EAAM,QAAS,CAAA,GAAG,KAAKL,EAAK;AAAA,EAC1D;AAEA,WAASvS,EAAUtE,GAAG;AACpB,QAAInZ,IAAS,CAAE,GACXswB,IAAM;AAEV,aAASvW,EAAIrD,GAAG;AACd,UAAIkY,IAAM0B;AACV,MAAAta,EAAE,QAAQmD,EAAE,SAASzC,CAAC,GAAGqD,CAAG,GAC5B/Z,EAAO0W,CAAC,IAAI,EAAE,KAAKkY,GAAK,KAAK0B,IAAO;AAAA,IACxC;AACE,WAAAta,EAAE,QAAQmD,EAAE,SAAQ,GAAIY,CAAG,GAEpB/Z;AAAA,EACT;;;;;;;ACrFA,MAAIgW,IAAItY,EAAmB,GACvBwsB,IAAOpsB,EAAiB;AAE5B,EAAAyyB,KAAiB;AAAA,IACf,KAAK1G;AAAA,IACL,SAAS2G;AAAA,EACV;AAyBD,WAAS3G,EAAI1Q,GAAG;AACd,QAAIwK,IAAOuG,EAAK,aAAa/Q,GAAG,QAAQ,CAAE,GAAE,OAAO,GAC/CsX,IAASC,EAAWvX,CAAC,GACrBwX,IAAS3a,EAAE,IAAIA,EAAE,OAAOya,CAAM,CAAC,IAAI,GACnCG,IAAU,IAAID,IAAS;AAE3B,IAAAxX,EAAE,QAAQ,cAAcwK,GAGxB3N,EAAE,QAAQmD,EAAE,MAAK,GAAI,SAAStC,GAAG;AAAE,MAAAsC,EAAE,KAAKtC,CAAC,EAAE,UAAU+Z;AAAA,IAAQ,CAAE;AAGjE,QAAInV,IAASoV,EAAW1X,CAAC,IAAI;AAG7B,IAAAnD,EAAE,QAAQmD,EAAE,SAAU,GAAE,SAASrC,GAAO;AACtC,MAAAiD,EAAIZ,GAAGwK,GAAMiN,GAASnV,GAAQkV,GAAQF,GAAQ3Z,CAAK;AAAA,IACvD,CAAG,GAIDqC,EAAE,QAAQ,iBAAiByX;AAAA,EAC7B;AAEA,WAAS7W,EAAIZ,GAAGwK,GAAMiN,GAASnV,GAAQkV,GAAQF,GAAQ/Z,GAAG;AACxD,QAAIO,IAAWkC,EAAE,SAASzC,CAAC;AAC3B,QAAI,CAACO,EAAS,QAAQ;AACpB,MAAIP,MAAMiN,KACRxK,EAAE,QAAQwK,GAAMjN,GAAG,EAAE,QAAQ,GAAG,QAAQka,GAAS;AAEnD;AAAA,IACJ;AAEE,QAAIE,IAAM5G,EAAK,cAAc/Q,GAAG,KAAK,GACjC4X,IAAS7G,EAAK,cAAc/Q,GAAG,KAAK,GACpC5C,IAAQ4C,EAAE,KAAKzC,CAAC;AAEpB,IAAAyC,EAAE,UAAU2X,GAAKpa,CAAC,GAClBH,EAAM,YAAYua,GAClB3X,EAAE,UAAU4X,GAAQra,CAAC,GACrBH,EAAM,eAAewa,GAErB/a,EAAE,QAAQiB,GAAU,SAASH,GAAO;AAClC,MAAAiD,EAAIZ,GAAGwK,GAAMiN,GAASnV,GAAQkV,GAAQF,GAAQ3Z,CAAK;AAEnD,UAAIka,IAAY7X,EAAE,KAAKrC,CAAK,GACxBma,IAAWD,EAAU,YAAYA,EAAU,YAAYla,GACvDoa,IAAcF,EAAU,eAAeA,EAAU,eAAela,GAChEqa,IAAaH,EAAU,YAAYvV,IAAS,IAAIA,GAChD2V,IAASH,MAAaC,IAAc,IAAIP,IAASF,EAAO/Z,CAAC,IAAI;AAEjE,MAAAyC,EAAE,QAAQ2X,GAAKG,GAAU;AAAA,QACvB,QAAQE;AAAA,QACR,QAAQC;AAAA,QACR,aAAa;AAAA,MACnB,CAAK,GAEDjY,EAAE,QAAQ+X,GAAaH,GAAQ;AAAA,QAC7B,QAAQI;AAAA,QACR,QAAQC;AAAA,QACR,aAAa;AAAA,MACnB,CAAK;AAAA,IACL,CAAG,GAEIjY,EAAE,OAAOzC,CAAC,KACbyC,EAAE,QAAQwK,GAAMmN,GAAK,EAAE,QAAQ,GAAG,QAAQH,IAASF,EAAO/Z,CAAC,EAAC,CAAE;AAAA,EAElE;AAEA,WAASga,EAAWvX,GAAG;AACrB,QAAIsX,IAAS,CAAE;AACf,aAAS1W,EAAIrD,GAAGlF,GAAO;AACrB,UAAIyF,IAAWkC,EAAE,SAASzC,CAAC;AAC3B,MAAIO,KAAYA,EAAS,UACvBjB,EAAE,QAAQiB,GAAU,SAASH,GAAO;AAClC,QAAAiD,EAAIjD,GAAOtF,IAAQ,CAAC;AAAA,MAC5B,CAAO,GAEHif,EAAO/Z,CAAC,IAAIlF;AAAA,IAChB;AACE,WAAAwE,EAAE,QAAQmD,EAAE,YAAY,SAASzC,GAAG;AAAE,MAAAqD,EAAIrD,GAAG,CAAC;AAAA,IAAE,CAAE,GAC3C+Z;AAAA,EACT;AAEA,WAASI,EAAW1X,GAAG;AACrB,WAAOnD,EAAE,OAAOmD,EAAE,MAAK,GAAI,SAAS4C,GAAKlF,GAAG;AAC1C,aAAOkF,IAAM5C,EAAE,KAAKtC,CAAC,EAAE;AAAA,IACxB,GAAE,CAAC;AAAA,EACN;AAEA,WAAS2Z,EAAQrX,GAAG;AAClB,QAAIkY,IAAalY,EAAE,MAAO;AAC1B,IAAAA,EAAE,WAAWkY,EAAW,WAAW,GACnC,OAAOA,EAAW,aAClBrb,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,MAAIqB,EAAK,eACPiB,EAAE,WAAWtC,CAAC;AAAA,IAEpB,CAAG;AAAA,EACH;;;;;;;ACnIA,MAAIb,IAAItY,EAAmB,GACvBwsB,IAAOpsB,EAAiB;AAE5B,EAAAwzB,KAAiBC;AAEjB,WAASA,EAAkBpY,GAAG;AAC5B,aAASY,EAAIrD,GAAG;AACd,UAAIO,IAAWkC,EAAE,SAASzC,CAAC,GACvB6C,IAAOJ,EAAE,KAAKzC,CAAC;AAKnB,UAJIO,EAAS,UACXjB,EAAE,QAAQiB,GAAU8C,CAAG,GAGrB/D,EAAE,IAAIuD,GAAM,SAAS,GAAG;AAC1B,QAAAA,EAAK,aAAa,CAAE,GACpBA,EAAK,cAAc,CAAE;AACrB,iBAASwS,IAAOxS,EAAK,SAASsR,IAAUtR,EAAK,UAAU,GACrDwS,IAAOlB,GACP,EAAEkB;AACF,UAAAnB,EAAczR,GAAG,cAAc,OAAOzC,GAAG6C,GAAMwS,CAAI,GACnDnB,EAAczR,GAAG,eAAe,OAAOzC,GAAG6C,GAAMwS,CAAI;AAAA,MAE5D;AAAA,IACA;AAEE,IAAA/V,EAAE,QAAQmD,EAAE,SAAQ,GAAIY,CAAG;AAAA,EAC7B;AAEA,WAAS6Q,EAAczR,GAAGqY,GAAMvK,GAAQwK,GAAIC,GAAQ3F,GAAM;AACxD,QAAIxV,IAAQ,EAAE,OAAO,GAAG,QAAQ,GAAG,MAAMwV,GAAM,YAAYyF,EAAM,GAC7DG,IAAOD,EAAOF,CAAI,EAAEzF,IAAO,CAAC,GAC5BtD,IAAOyB,EAAK,aAAa/Q,GAAG,UAAU5C,GAAO0Q,CAAM;AACvD,IAAAyK,EAAOF,CAAI,EAAEzF,CAAI,IAAItD,GACrBtP,EAAE,UAAUsP,GAAMgJ,CAAE,GAChBE,KACFxY,EAAE,QAAQwY,GAAMlJ,GAAM,EAAE,QAAQ,GAAG;AAAA,EAEvC;;;;;;;ACnCA,MAAIzS,IAAItY,EAAmB;AAE3B,EAAAk0B,KAAiB;AAAA,IACf,QAAQC;AAAA,IACR,MAAM/H;AAAA,EACP;AAED,WAAS+H,EAAO1Y,GAAG;AACjB,QAAI2Y,IAAU3Y,EAAE,MAAK,EAAG,QAAQ,YAAa;AAC7C,KAAI2Y,MAAY,QAAQA,MAAY,SAClCC,EAAgB5Y,CAAC;AAAA,EAErB;AAEA,WAAS2Q,EAAK3Q,GAAG;AACf,QAAI2Y,IAAU3Y,EAAE,MAAK,EAAG,QAAQ,YAAa;AAC7C,KAAI2Y,MAAY,QAAQA,MAAY,SAClCE,EAAS7Y,CAAC,IAGR2Y,MAAY,QAAQA,MAAY,UAClCG,EAAO9Y,CAAC,GACR4Y,EAAgB5Y,CAAC;AAAA,EAErB;AAEA,WAAS4Y,EAAgB5Y,GAAG;AAC1B,IAAAnD,EAAE,QAAQmD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAAE,MAAAwb,EAAmB/Y,EAAE,KAAKzC,CAAC,CAAC;AAAA,IAAE,CAAE,GACnEV,EAAE,QAAQmD,EAAE,MAAK,GAAI,SAAStC,GAAG;AAAE,MAAAqb,EAAmB/Y,EAAE,KAAKtC,CAAC,CAAC;AAAA,IAAE,CAAE;AAAA,EACrE;AAEA,WAASqb,EAAmBjH,GAAO;AACjC,QAAIxT,IAAIwT,EAAM;AACd,IAAAA,EAAM,QAAQA,EAAM,QACpBA,EAAM,SAASxT;AAAA,EACjB;AAEA,WAASua,EAAS7Y,GAAG;AACnB,IAAAnD,EAAE,QAAQmD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAAE,MAAAyb,EAAYhZ,EAAE,KAAKzC,CAAC,CAAC;AAAA,IAAE,CAAE,GAE5DV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,MAAAb,EAAE,QAAQkC,EAAK,QAAQia,CAAW,GAC9Bnc,EAAE,IAAIkC,GAAM,GAAG,KACjBia,EAAYja,CAAI;AAAA,IAEtB,CAAG;AAAA,EACH;AAEA,WAASia,EAAYlH,GAAO;AAC1B,IAAAA,EAAM,IAAI,CAACA,EAAM;AAAA,EACnB;AAEA,WAASgH,EAAO9Y,GAAG;AACjB,IAAAnD,EAAE,QAAQmD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAAE,MAAA0b,EAAUjZ,EAAE,KAAKzC,CAAC,CAAC;AAAA,IAAE,CAAE,GAE1DV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,MAAAb,EAAE,QAAQkC,EAAK,QAAQka,CAAS,GAC5Bpc,EAAE,IAAIkC,GAAM,GAAG,KACjBka,EAAUla,CAAI;AAAA,IAEpB,CAAG;AAAA,EACH;AAEA,WAASka,EAAUnH,GAAO;AACxB,QAAI/Q,IAAI+Q,EAAM;AACd,IAAAA,EAAM,IAAIA,EAAM,GAChBA,EAAM,IAAI/Q;AAAA,EACZ;;;;;;;ACrEA,MAAIlE,IAAItY,EAAoB;AAE5B,EAAA20B,KAAiBC;AAajB,WAASA,EAAUnZ,GAAG;AACpB,QAAIS,IAAU,CAAE,GACZ2Y,IAAcvc,EAAE,OAAOmD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAChD,aAAO,CAACyC,EAAE,SAASzC,CAAC,EAAE;AAAA,IAC1B,CAAG,GACGmU,IAAU7U,EAAE,IAAIA,EAAE,IAAIuc,GAAa,SAAS7b,GAAG;AAAE,aAAOyC,EAAE,KAAKzC,CAAC,EAAE;AAAA,IAAK,CAAE,CAAC,GAC1EuV,IAASjW,EAAE,IAAIA,EAAE,MAAM6U,IAAU,CAAC,GAAG,WAAW;AAAE,aAAO,CAAA;AAAA,IAAG,CAAE;AAElE,aAAS9Q,EAAIrD,GAAG;AACd,UAAI,CAAAV,EAAE,IAAI4D,GAASlD,CAAC,GACpB;AAAA,QAAAkD,EAAQlD,CAAC,IAAI;AACb,YAAI6C,IAAOJ,EAAE,KAAKzC,CAAC;AACnB,QAAAuV,EAAO1S,EAAK,IAAI,EAAE,KAAK7C,CAAC,GACxBV,EAAE,QAAQmD,EAAE,WAAWzC,CAAC,GAAGqD,CAAG;AAAA;AAAA,IAClC;AAEE,QAAIyY,IAAYxc,EAAE,OAAOuc,GAAa,SAAS7b,GAAG;AAAE,aAAOyC,EAAE,KAAKzC,CAAC,EAAE;AAAA,IAAK,CAAE;AAC5E,WAAAV,EAAE,QAAQwc,GAAWzY,CAAG,GAEjBkS;AAAA,EACT;;;;;;;ACnCA,MAAIjW,IAAItY,EAAoB;AAE5B,EAAA+0B,KAAiBC;AAkBjB,WAASA,EAAWvZ,GAAG2S,GAAU;AAE/B,aADI6G,IAAK,GACApY,IAAI,GAAGA,IAAIuR,EAAS,QAAQ,EAAEvR;AACrC,MAAAoY,KAAMC,EAAmBzZ,GAAG2S,EAASvR,IAAE,CAAC,GAAGuR,EAASvR,CAAC,CAAC;AAExD,WAAOoY;AAAA,EACT;AAEA,WAASC,EAAmBzZ,GAAG0Z,GAAYC,GAAY;AAcrD,aAVIC,IAAW/c,EAAE;AAAA,MAAU8c;AAAA,MACzB9c,EAAE,IAAI8c,GAAY,SAAUpc,GAAG6D,GAAG;AAAE,eAAOA;AAAA,MAAE,CAAE;AAAA,IAAC,GAC9CyY,IAAehd,EAAE,QAAQA,EAAE,IAAI6c,GAAY,SAASnc,GAAG;AACzD,aAAOV,EAAE,OAAOA,EAAE,IAAImD,EAAE,SAASzC,CAAC,GAAG,SAASG,GAAG;AAC/C,eAAO,EAAE,KAAKkc,EAASlc,EAAE,CAAC,GAAG,QAAQsC,EAAE,KAAKtC,CAAC,EAAE,OAAQ;AAAA,MACxD,CAAA,GAAG,KAAK;AAAA,IACV,CAAA,GAAG,EAAI,GAGJoc,IAAa,GACVA,IAAaH,EAAW,SAAQ,CAAAG,MAAe;AACtD,QAAIC,IAAW,IAAID,IAAa;AAChC,IAAAA,KAAc;AACd,QAAIxE,IAAOzY,EAAE,IAAI,IAAI,MAAMkd,CAAQ,GAAG,WAAW;AAAE,aAAO;AAAA,KAAI,GAG1DP,IAAK;AACT,WAAA3c,EAAE,QAAQgd,EAAa,QAAQ,SAASvZ,GAAO;AAC7C,UAAIrc,IAAQqc,EAAM,MAAMwZ;AACxB,MAAAxE,EAAKrxB,CAAK,KAAKqc,EAAM;AAErB,eADI0Z,IAAY,GACT/1B,IAAQ;AACb,QAAIA,IAAQ,MACV+1B,KAAa1E,EAAKrxB,IAAQ,CAAC,IAE7BA,IAASA,IAAQ,KAAM,GACvBqxB,EAAKrxB,CAAK,KAAKqc,EAAM;AAEvB,MAAAkZ,KAAMlZ,EAAM,SAAS0Z;AAAA,IACzB,CAAG,CAAC,GAEKR;AAAA,EACT;;;;;;;AClEA,MAAI3c,IAAItY,EAAoB;AAE5B,EAAA01B,KAAiBC;AAEjB,WAASA,EAAWla,GAAGma,GAAS;AAC9B,WAAOtd,EAAE,IAAIsd,GAAS,SAAS5c,GAAG;AAChC,UAAI2B,IAAMc,EAAE,QAAQzC,CAAC;AACrB,UAAK2B,EAAI,QAEF;AACL,YAAIrY,IAASgW,EAAE,OAAOqC,GAAK,SAAS0D,GAAKlF,GAAG;AAC1C,cAAIqB,IAAOiB,EAAE,KAAKtC,CAAC,GACjB0c,IAAQpa,EAAE,KAAKtC,EAAE,CAAC;AACpB,iBAAO;AAAA,YACL,KAAKkF,EAAI,MAAO7D,EAAK,SAASqb,EAAM;AAAA,YACpC,QAAQxX,EAAI,SAAS7D,EAAK;AAAA,UAC3B;AAAA,QACF,GAAE,EAAE,KAAK,GAAG,QAAQ,EAAC,CAAE;AAExB,eAAO;AAAA,UACL,GAAGxB;AAAA,UACH,YAAY1W,EAAO,MAAMA,EAAO;AAAA,UAChC,QAAQA,EAAO;AAAA,QAChB;AAAA,MACP;AAhBM,eAAO,EAAE,GAAG0W,EAAG;AAAA,IAiBrB,CAAG;AAAA,EACH;;;;;;;ACxBA,MAAIV,IAAItY,EAAoB;AAE5B,EAAA81B,KAAiBC;AA2BjB,WAASA,EAAiBC,GAASC,GAAI;AACrC,QAAIC,IAAgB,CAAE;AACtB,IAAA5d,EAAE,QAAQ0d,GAAS,SAASja,GAAOc,GAAG;AACpC,UAAI1B,IAAM+a,EAAcna,EAAM,CAAC,IAAI;AAAA,QACjC,UAAU;AAAA,QACV,IAAM,CAAE;AAAA,QACR,KAAK,CAAE;AAAA,QACP,IAAI,CAACA,EAAM,CAAC;AAAA,QACZ,GAAGc;AAAA,MACJ;AACD,MAAKvE,EAAE,YAAYyD,EAAM,UAAU,MACjCZ,EAAI,aAAaY,EAAM,YACvBZ,EAAI,SAASY,EAAM;AAAA,IAEzB,CAAG,GAEDzD,EAAE,QAAQ2d,EAAG,MAAO,GAAE,SAAS9c,GAAG;AAChC,UAAIgd,IAASD,EAAc/c,EAAE,CAAC,GAC1Bid,IAASF,EAAc/c,EAAE,CAAC;AAC9B,MAAI,CAACb,EAAE,YAAY6d,CAAM,KAAK,CAAC7d,EAAE,YAAY8d,CAAM,MACjDA,EAAO,YACPD,EAAO,IAAI,KAAKD,EAAc/c,EAAE,CAAC,CAAC;AAAA,IAExC,CAAG;AAED,QAAIkd,IAAY/d,EAAE,OAAO4d,GAAe,SAASna,GAAO;AACtD,aAAO,CAACA,EAAM;AAAA,IAClB,CAAG;AAED,WAAOua,EAAmBD,CAAS;AAAA,EACrC;AAEA,WAASC,EAAmBD,GAAW;AACrC,QAAIL,IAAU,CAAE;AAEhB,aAASO,EAAS3Y,GAAQ;AACxB,aAAO,SAASgO,GAAQ;AACtB,QAAIA,EAAO,WAGPtT,EAAE,YAAYsT,EAAO,UAAU,KAC/BtT,EAAE,YAAYsF,EAAO,UAAU,KAC/BgO,EAAO,cAAchO,EAAO,eAC9B4Y,EAAa5Y,GAAQgO,CAAM;AAAA,MAE9B;AAAA,IACL;AAEE,aAAS6K,EAAU7Y,GAAQ;AACzB,aAAO,SAASE,GAAQ;AACtB,QAAAA,EAAO,GAAM,KAAKF,CAAM,GACpB,EAAEE,EAAO,aAAa,KACxBuY,EAAU,KAAKvY,CAAM;AAAA,MAExB;AAAA,IACL;AAEE,WAAOuY,EAAU,UAAQ;AACvB,UAAIta,IAAQsa,EAAU,IAAK;AAC3B,MAAAL,EAAQ,KAAKja,CAAK,GAClBzD,EAAE,QAAQyD,EAAM,GAAM,WAAWwa,EAASxa,CAAK,CAAC,GAChDzD,EAAE,QAAQyD,EAAM,KAAK0a,EAAU1a,CAAK,CAAC;AAAA,IACzC;AAEE,WAAOzD,EAAE;AAAA,MAAIA,EAAE,OAAO0d,GAAS,SAASja,GAAO;AAAE,eAAO,CAACA,EAAM;AAAA,MAAO,CAAE;AAAA,MACtE,SAASA,GAAO;AACd,eAAOzD,EAAE,KAAKyD,GAAO,CAAC,MAAM,KAAK,cAAc,QAAQ,CAAC;AAAA,MAC9D;AAAA,IAAK;AAAA,EAEL;AAEA,WAASya,EAAaE,GAAQvvB,GAAQ;AACpC,QAAIwvB,IAAM,GACN5Y,IAAS;AAEb,IAAI2Y,EAAO,WACTC,KAAOD,EAAO,aAAaA,EAAO,QAClC3Y,KAAU2Y,EAAO,SAGfvvB,EAAO,WACTwvB,KAAOxvB,EAAO,aAAaA,EAAO,QAClC4W,KAAU5W,EAAO,SAGnBuvB,EAAO,KAAKvvB,EAAO,GAAG,OAAOuvB,EAAO,EAAE,GACtCA,EAAO,aAAaC,IAAM5Y,GAC1B2Y,EAAO,SAAS3Y,GAChB2Y,EAAO,IAAI,KAAK,IAAIvvB,EAAO,GAAGuvB,EAAO,CAAC,GACtCvvB,EAAO,SAAS;AAAA,EAClB;;;;;;;ACzHA,MAAImR,IAAItY,EAAoB,GACxBwsB,IAAOpsB,EAAkB;AAE7B,EAAAw2B,KAAiBC;AAEjB,WAASA,EAAKb,GAASc,GAAW;AAChC,QAAIC,IAAQvK,EAAK,UAAUwJ,GAAS,SAASja,GAAO;AAClD,aAAOzD,EAAE,IAAIyD,GAAO,YAAY;AAAA,IACpC,CAAG,GACGib,IAAWD,EAAM,KACnBE,IAAa3e,EAAE,OAAOye,EAAM,KAAK,SAAShb,GAAO;AAAE,aAAO,CAACA,EAAM;AAAA,IAAE,CAAE,GACrE9C,IAAK,CAAE,GACP0d,IAAM,GACN5Y,IAAS,GACTmZ,IAAU;AAEZ,IAAAF,EAAS,KAAKG,EAAgB,CAAC,CAACL,CAAS,CAAC,GAE1CI,IAAUE,EAAkBne,GAAIge,GAAYC,CAAO,GAEnD5e,EAAE,QAAQ0e,GAAU,SAAUjb,GAAO;AACnC,MAAAmb,KAAWnb,EAAM,GAAG,QACpB9C,EAAG,KAAK8C,EAAM,EAAE,GAChB4a,KAAO5a,EAAM,aAAaA,EAAM,QAChCgC,KAAUhC,EAAM,QAChBmb,IAAUE,EAAkBne,GAAIge,GAAYC,CAAO;AAAA,IACvD,CAAG;AAED,QAAI50B,IAAS,EAAE,IAAIgW,EAAE,QAAQW,GAAI,EAAI,EAAG;AACxC,WAAI8E,MACFzb,EAAO,aAAaq0B,IAAM5Y,GAC1Bzb,EAAO,SAASyb,IAEXzb;AAAA,EACT;AAEA,WAAS80B,EAAkBne,GAAIge,GAAYv3B,GAAO;AAEhD,aADI0jB,GACG6T,EAAW,WAAW7T,IAAO9K,EAAE,KAAK2e,CAAU,GAAG,KAAKv3B;AAC3D,MAAAu3B,EAAW,IAAK,GAChBhe,EAAG,KAAKmK,EAAK,EAAE,GACf1jB;AAEF,WAAOA;AAAA,EACT;AAEA,WAASy3B,EAAgBE,GAAM;AAC7B,WAAO,SAASlB,GAAQC,GAAQ;AAC9B,aAAID,EAAO,aAAaC,EAAO,aACtB,KACED,EAAO,aAAaC,EAAO,aAC7B,IAGDiB,IAA6BjB,EAAO,IAAID,EAAO,IAAxCA,EAAO,IAAIC,EAAO;AAAA,IAClC;AAAA,EACH;;;;;;;ACxDA,MAAI9d,IAAItY,EAAoB,GACxB21B,IAAav1B,GAAuB,GACpC21B,IAAmBj1B,GAA8B,GACjD+1B,IAAOvzB,GAAiB;AAE5B,EAAAg0B,KAAiBC;AAEjB,WAASA,EAAa9b,GAAGzC,GAAGid,GAAIa,GAAW;AACzC,QAAIlB,IAAUna,EAAE,SAASzC,CAAC,GACtB6C,IAAOJ,EAAE,KAAKzC,CAAC,GACfwe,IAAK3b,IAAOA,EAAK,aAAa,QAC9B4b,IAAK5b,IAAOA,EAAK,cAAa,QAC9B6b,IAAY,CAAE;AAElB,IAAIF,MACF5B,IAAUtd,EAAE,OAAOsd,GAAS,SAAS7b,GAAG;AACtC,aAAOA,MAAMyd,KAAMzd,MAAM0d;AAAA,IAC/B,CAAK;AAGH,QAAIE,IAAchC,EAAWla,GAAGma,CAAO;AACvC,IAAAtd,EAAE,QAAQqf,GAAa,SAAS5b,GAAO;AACrC,UAAIN,EAAE,SAASM,EAAM,CAAC,EAAE,QAAQ;AAC9B,YAAI6b,IAAiBL,EAAa9b,GAAGM,EAAM,GAAGka,GAAIa,CAAS;AAC3D,QAAAY,EAAU3b,EAAM,CAAC,IAAI6b,GACjBtf,EAAE,IAAIsf,GAAgB,YAAY,KACpCC,EAAiB9b,GAAO6b,CAAc;AAAA,MAE9C;AAAA,IACA,CAAG;AAED,QAAI5B,IAAUD,EAAiB4B,GAAa1B,CAAE;AAC9C,IAAA6B,EAAgB9B,GAAS0B,CAAS;AAElC,QAAIp1B,IAASu0B,EAAKb,GAASc,CAAS;AAEpC,QAAIU,MACFl1B,EAAO,KAAKgW,EAAE,QAAQ,CAACkf,GAAIl1B,EAAO,IAAIm1B,CAAE,GAAG,EAAI,GAC3Chc,EAAE,aAAa+b,CAAE,EAAE,SAAQ;AAC7B,UAAIO,IAAStc,EAAE,KAAKA,EAAE,aAAa+b,CAAE,EAAE,CAAC,CAAC,GACvCQ,IAASvc,EAAE,KAAKA,EAAE,aAAagc,CAAE,EAAE,CAAC,CAAC;AACvC,MAAKnf,EAAE,IAAIhW,GAAQ,YAAY,MAC7BA,EAAO,aAAa,GACpBA,EAAO,SAAS,IAElBA,EAAO,cAAcA,EAAO,aAAaA,EAAO,SAC3By1B,EAAO,QAAQC,EAAO,UAAU11B,EAAO,SAAS,IACrEA,EAAO,UAAU;AAAA,IACvB;AAGE,WAAOA;AAAA,EACT;AAEA,WAASw1B,EAAgB9B,GAAS0B,GAAW;AAC3C,IAAApf,EAAE,QAAQ0d,GAAS,SAASja,GAAO;AACjC,MAAAA,EAAM,KAAKzD,EAAE,QAAQyD,EAAM,GAAG,IAAI,SAAS/C,GAAG;AAC5C,eAAI0e,EAAU1e,CAAC,IACN0e,EAAU1e,CAAC,EAAE,KAEfA;AAAA,MACR,CAAA,GAAG,EAAI;AAAA,IACZ,CAAG;AAAA,EACH;AAEA,WAAS6e,EAAiBnB,GAAQ90B,GAAO;AACvC,IAAK0W,EAAE,YAAYoe,EAAO,UAAU,KAMlCA,EAAO,aAAa90B,EAAM,YAC1B80B,EAAO,SAAS90B,EAAM,WANtB80B,EAAO,cAAcA,EAAO,aAAaA,EAAO,SAC3B90B,EAAM,aAAaA,EAAM,WACzB80B,EAAO,SAAS90B,EAAM,SAC3C80B,EAAO,UAAU90B,EAAM;AAAA,EAK3B;;;;;;;AC3EA,MAAI0W,IAAItY,EAAoB,GACxBwY,IAAQpY,EAAsB,EAAC;AAEnC,EAAA63B,KAAiBC;AAgCjB,WAASA,EAAgBzc,GAAG4S,GAAM8J,GAAc;AAC9C,QAAIlS,IAAOmS,EAAe3c,CAAC,GACzBnZ,IAAS,IAAIkW,EAAM,EAAE,UAAU,GAAM,CAAA,EAAE,SAAS,EAAE,MAAMyN,EAAM,CAAA,EAC3D,oBAAoB,SAASjN,GAAG;AAAE,aAAOyC,EAAE,KAAKzC,CAAC;AAAA,KAAI;AAE1D,WAAAV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC,GACjBK,IAASoC,EAAE,OAAOzC,CAAC;AAErB,OAAI6C,EAAK,SAASwS,KAAQxS,EAAK,WAAWwS,KAAQA,KAAQxS,EAAK,aAC7DvZ,EAAO,QAAQ0W,CAAC,GAChB1W,EAAO,UAAU0W,GAAGK,KAAU4M,CAAI,GAGlC3N,EAAE,QAAQmD,EAAE0c,CAAY,EAAEnf,CAAC,GAAG,SAASG,GAAG;AACxC,YAAIuB,IAAIvB,EAAE,MAAMH,IAAIG,EAAE,IAAIA,EAAE,GAC1BqB,IAAOlY,EAAO,KAAKoY,GAAG1B,CAAC,GACvB+E,IAAUzF,EAAE,YAAYkC,CAAI,IAAkB,IAAdA,EAAK;AACvC,QAAAlY,EAAO,QAAQoY,GAAG1B,GAAG,EAAE,QAAQyC,EAAE,KAAKtC,CAAC,EAAE,SAAS4E,EAAM,CAAE;AAAA,MAClE,CAAO,GAEGzF,EAAE,IAAIuD,GAAM,SAAS,KACvBvZ,EAAO,QAAQ0W,GAAG;AAAA,QAChB,YAAY6C,EAAK,WAAWwS,CAAI;AAAA,QAChC,aAAaxS,EAAK,YAAYwS,CAAI;AAAA,MAC5C,CAAS;AAAA,IAGT,CAAG,GAEM/rB;AAAA,EACT;AAEA,WAAS81B,EAAe3c,GAAG;AAEzB,aADIzC,GACGyC,EAAE,QAASzC,IAAIV,EAAE,SAAS,OAAO,KAAI;AAC5C,WAAOU;AAAA,EACT;;;;;;;ACxEA,MAAIV,IAAItY,EAAoB;AAE5B,EAAAq4B,KAAiBC;AAEjB,WAASA,EAAuB7c,GAAGwa,GAAIhd,GAAI;AACzC,QAAIgb,IAAO,CAAE,GACXsE;AAEF,IAAAjgB,EAAE,QAAQW,GAAI,SAASD,GAAG;AAIxB,eAHII,IAAQqC,EAAE,OAAOzC,CAAC,GACpBK,GACAmf,GACKpf,KAAO;AASZ,YARAC,IAASoC,EAAE,OAAOrC,CAAK,GACnBC,KACFmf,IAAYvE,EAAK5a,CAAM,GACvB4a,EAAK5a,CAAM,IAAID,MAEfof,IAAYD,GACZA,IAAWnf,IAETof,KAAaA,MAAcpf,GAAO;AACpC,UAAA6c,EAAG,QAAQuC,GAAWpf,CAAK;AAC3B;AAAA,QACR;AACM,QAAAA,IAAQC;AAAA,MACd;AAAA,IACA,CAAG;AAAA,EAyBH;;;;;;;AClDA,MAAIf,IAAItY,EAAoB,GACxB40B,IAAYx0B,GAAuB,GACnC40B,IAAal0B,GAAwB,GACrCy2B,IAAej0B,GAA0B,GACzC40B,IAAkB30B,GAA8B,GAChD+0B,IAAyB90B,GAAqC,GAC9DgV,IAAQ5S,EAAsB,EAAC,OAC/B4mB,IAAO1mB,EAAkB;AAE7B,EAAA2yB,KAAiB7Y;AAiBjB,WAASA,EAAMnE,GAAG;AAChB,QAAI0R,IAAUX,EAAK,QAAQ/Q,CAAC,GAC1Bid,IAAkBC,EAAiBld,GAAGnD,EAAE,MAAM,GAAG6U,IAAU,CAAC,GAAG,SAAS,GACxEyL,IAAgBD,EAAiBld,GAAGnD,EAAE,MAAM6U,IAAU,GAAG,IAAI,EAAE,GAAG,UAAU,GAE1EiB,IAAWwG,EAAUnZ,CAAC;AAC1B,IAAAod,EAAYpd,GAAG2S,CAAQ;AAKvB,aAHI0K,IAAS,OAAO,mBAClBC,GAEOlc,IAAI,GAAGmc,IAAW,GAAGA,IAAW,GAAG,EAAEnc,GAAG,EAAEmc,GAAU;AAC3D,MAAAC,EAAiBpc,IAAI,IAAI6b,IAAkBE,GAAe/b,IAAI,KAAK,CAAC,GAEpEuR,IAAW5B,EAAK,iBAAiB/Q,CAAC;AAClC,UAAIwZ,IAAKD,EAAWvZ,GAAG2S,CAAQ;AAC/B,MAAI6G,IAAK6D,MACPE,IAAW,GACXD,IAAOzgB,EAAE,UAAU8V,CAAQ,GAC3B0K,IAAS7D;AAAA,IAEf;AAEE,IAAA4D,EAAYpd,GAAGsd,CAAI;AAAA,EACrB;AAEA,WAASJ,EAAiBld,GAAGyd,GAAOf,GAAc;AAChD,WAAO7f,EAAE,IAAI4gB,GAAO,SAAS7K,GAAM;AACjC,aAAO6J,EAAgBzc,GAAG4S,GAAM8J,CAAY;AAAA,IAChD,CAAG;AAAA,EACH;AAEA,WAASc,EAAiBE,GAAarC,GAAW;AAChD,QAAIb,IAAK,IAAIzd,EAAO;AACpB,IAAAF,EAAE,QAAQ6gB,GAAa,SAASC,GAAI;AAClC,UAAInT,IAAOmT,EAAG,MAAK,EAAG,MAClBC,IAAS9B,EAAa6B,GAAInT,GAAMgQ,GAAIa,CAAS;AACjD,MAAAxe,EAAE,QAAQ+gB,EAAO,IAAI,SAASrgB,GAAG6D,GAAG;AAClC,QAAAuc,EAAG,KAAKpgB,CAAC,EAAE,QAAQ6D;AAAA,MACzB,CAAK,GACDyb,EAAuBc,GAAInD,GAAIoD,EAAO,EAAE;AAAA,IAC5C,CAAG;AAAA,EACH;AAEA,WAASR,EAAYpd,GAAG2S,GAAU;AAChC,IAAA9V,EAAE,QAAQ8V,GAAU,SAASkL,GAAO;AAClC,MAAAhhB,EAAE,QAAQghB,GAAO,SAAStgB,GAAG6D,GAAG;AAC9B,QAAApB,EAAE,KAAKzC,CAAC,EAAE,QAAQ6D;AAAA,MACxB,CAAK;AAAA,IACL,CAAG;AAAA,EACH;;;;;;;AC5EA,MAAIvE,IAAItY,EAAoB,GACxBwY,IAAQpY,EAAsB,EAAC,OAC/BosB,IAAO1rB,EAAkB;AAO7B,EAAAy4B,KAAiB;AAAA,IACf,WAAWC;AAAA,IACX,oBAAoBC;AAAA,IACpB,oBAAoBC;AAAA,IACpB,aAAaC;AAAA,IACb,aAAaC;AAAA,IACb,mBAAmBC;AAAA,IACnB,sBAAsBC;AAAA,IACtB,kBAAkBC;AAAA,IAClB,4BAA4BC;AAAA,IAC5B,SAASC;AAAA,EACV;AAmBD,WAASR,EAAmBhe,GAAG2S,GAAU;AACvC,QAAI8L,IAAY,CAAE;AAElB,aAASC,EAAWC,GAAWd,GAAO;AACpC,UAGEe,IAAK,GAGLC,IAAU,GACVC,IAAkBH,EAAU,QAC5BI,IAAWliB,EAAE,KAAKghB,CAAK;AAEzB,aAAAhhB,EAAE,QAAQghB,GAAO,SAAStgB,GAAG6D,GAAG;AAC9B,YAAI9C,IAAI0gB,EAA0Bhf,GAAGzC,CAAC,GACpC0hB,IAAK3gB,IAAI0B,EAAE,KAAK1B,CAAC,EAAE,QAAQwgB;AAE7B,SAAIxgB,KAAKf,MAAMwhB,OACbliB,EAAE,QAAQghB,EAAM,MAAMgB,GAASzd,IAAG,CAAC,GAAG,SAAS8d,GAAU;AACvD,UAAAriB,EAAE,QAAQmD,EAAE,aAAakf,CAAQ,GAAG,SAASjgB,GAAG;AAC9C,gBAAIkgB,KAASnf,EAAE,KAAKf,CAAC,GACnBmgB,KAAOD,GAAO;AAChB,aAAKC,KAAOR,KAAMK,IAAKG,OACnB,EAAED,GAAO,SAASnf,EAAE,KAAKkf,CAAQ,EAAE,UACrChB,EAAYO,GAAWxf,GAAGigB,CAAQ;AAAA,UAEhD,CAAW;AAAA,QACX,CAAS,GACDL,IAAUzd,IAAI,GACdwd,IAAKK;AAAA,MAEb,CAAK,GAEMpB;AAAA,IACX;AAEE,WAAAhhB,EAAE,OAAO8V,GAAU+L,CAAU,GACtBD;AAAA,EACT;AAEA,WAASR,EAAmBje,GAAG2S,GAAU;AACvC,QAAI8L,IAAY,CAAE;AAElB,aAASY,EAAKC,GAAO1F,GAAU2F,GAAUC,GAAiBC,GAAiB;AACzE,UAAIliB;AACJ,MAAAV,EAAE,QAAQA,EAAE,MAAM+c,GAAU2F,CAAQ,GAAG,SAASne,GAAG;AACjD,QAAA7D,IAAI+hB,EAAMle,CAAC,GACPpB,EAAE,KAAKzC,CAAC,EAAE,SACZV,EAAE,QAAQmD,EAAE,aAAazC,CAAC,GAAG,SAAS0B,GAAG;AACvC,cAAIygB,IAAQ1f,EAAE,KAAKf,CAAC;AACpB,UAAIygB,EAAM,UACLA,EAAM,QAAQF,KAAmBE,EAAM,QAAQD,MAClDvB,EAAYO,GAAWxf,GAAG1B,CAAC;AAAA,QAEvC,CAAS;AAAA,MAET,CAAK;AAAA,IACL;AAGE,aAASmhB,EAAWiB,GAAOL,GAAO;AAChC,UAAIM,IAAe,IACjBC,GACAjG,IAAW;AAEb,aAAA/c,EAAE,QAAQyiB,GAAO,SAAS/hB,GAAGuiB,GAAgB;AAC3C,YAAI9f,EAAE,KAAKzC,CAAC,EAAE,UAAU,UAAU;AAChC,cAAIwiB,IAAe/f,EAAE,aAAazC,CAAC;AACnC,UAAIwiB,EAAa,WACfF,IAAe7f,EAAE,KAAK+f,EAAa,CAAC,CAAC,EAAE,OACvCV,EAAKC,GAAO1F,GAAUkG,GAAgBF,GAAcC,CAAY,GAChEjG,IAAWkG,GACXF,IAAeC;AAAA,QAEzB;AACM,QAAAR,EAAKC,GAAO1F,GAAU0F,EAAM,QAAQO,GAAcF,EAAM,MAAM;AAAA,MACpE,CAAK,GAEML;AAAA,IACX;AAEE,WAAAziB,EAAE,OAAO8V,GAAU+L,CAAU,GACtBD;AAAA,EACT;AAEA,WAASO,EAA0Bhf,GAAGzC,GAAG;AACvC,QAAIyC,EAAE,KAAKzC,CAAC,EAAE;AACZ,aAAOV,EAAE,KAAKmD,EAAE,aAAazC,CAAC,GAAG,SAAS0B,GAAG;AAC3C,eAAOe,EAAE,KAAKf,CAAC,EAAE;AAAA,MACvB,CAAK;AAAA,EAEL;AAEA,WAASif,EAAYO,GAAWlhB,GAAGe,GAAG;AACpC,QAAIf,IAAIe,GAAG;AACT,UAAIoB,IAAMnC;AACV,MAAAA,IAAIe,GACJA,IAAIoB;AAAA,IACR;AAEE,QAAIsgB,IAAavB,EAAUlhB,CAAC;AAC5B,IAAKyiB,MACHvB,EAAUlhB,CAAC,IAAIyiB,IAAa,CAAE,IAEhCA,EAAW1hB,CAAC,IAAI;AAAA,EAClB;AAEA,WAAS6f,EAAYM,GAAWlhB,GAAGe,GAAG;AACpC,QAAIf,IAAIe,GAAG;AACT,UAAIoB,IAAMnC;AACV,MAAAA,IAAIe,GACJA,IAAIoB;AAAA,IACR;AACE,WAAO7C,EAAE,IAAI4hB,EAAUlhB,CAAC,GAAGe,CAAC;AAAA,EAC9B;AAUA,WAAS8f,EAAkBpe,GAAG2S,GAAU8L,GAAWwB,GAAY;AAC7D,QAAIzV,IAAO,CAAE,GACX0V,IAAQ,CAAE,GACVC,IAAM,CAAE;AAKV,WAAAtjB,EAAE,QAAQ8V,GAAU,SAASkL,GAAO;AAClC,MAAAhhB,EAAE,QAAQghB,GAAO,SAAStgB,GAAG4G,GAAO;AAClC,QAAAqG,EAAKjN,CAAC,IAAIA,GACV2iB,EAAM3iB,CAAC,IAAIA,GACX4iB,EAAI5iB,CAAC,IAAI4G;AAAA,MACf,CAAK;AAAA,IACL,CAAG,GAEDtH,EAAE,QAAQ8V,GAAU,SAASkL,GAAO;AAClC,UAAIuC,IAAU;AACd,MAAAvjB,EAAE,QAAQghB,GAAO,SAAStgB,GAAG;AAC3B,YAAI8iB,IAAKJ,EAAW1iB,CAAC;AACrB,YAAI8iB,EAAG,QAAQ;AACb,UAAAA,IAAKxjB,EAAE,OAAOwjB,GAAI,SAAS/hB,GAAG;AAAE,mBAAO6hB,EAAI7hB,CAAC;AAAA,WAAI;AAEhD,mBADIgiB,KAAMD,EAAG,SAAS,KAAK,GAClBjf,IAAI,KAAK,MAAMkf,CAAE,GAAGC,IAAK,KAAK,KAAKD,CAAE,GAAGlf,KAAKmf,GAAI,EAAEnf,GAAG;AAC7D,gBAAI9C,IAAI+hB,EAAGjf,CAAC;AACZ,YAAI8e,EAAM3iB,CAAC,MAAMA,KACb6iB,IAAUD,EAAI7hB,CAAC,KACf,CAAC6f,EAAYM,GAAWlhB,GAAGe,CAAC,MAC9B4hB,EAAM5hB,CAAC,IAAIf,GACX2iB,EAAM3iB,CAAC,IAAIiN,EAAKjN,CAAC,IAAIiN,EAAKlM,CAAC,GAC3B8hB,IAAUD,EAAI7hB,CAAC;AAAA,UAE3B;AAAA,QACA;AAAA,MACA,CAAK;AAAA,IACL,CAAG,GAEM,EAAE,MAAMkM,GAAM,OAAO0V,EAAO;AAAA,EACrC;AAEA,WAAS7B,EAAqBre,GAAG2S,GAAUnI,GAAM0V,GAAOM,GAAY;AAMlE,QAAIC,IAAK,CAAE,GACTC,IAASC,EAAgB3gB,GAAG2S,GAAUnI,GAAMgW,CAAU,GACtDI,IAAaJ,IAAa,eAAe;AAE3C,aAASK,EAAQC,GAAWC,GAAe;AAIzC,eAHIx6B,IAAQm6B,EAAO,MAAO,GACtBM,IAAOz6B,EAAM,IAAK,GAClBka,IAAU,CAAE,GACTugB;AACL,QAAIvgB,EAAQugB,CAAI,IACdF,EAAUE,CAAI,KAEdvgB,EAAQugB,CAAI,IAAI,IAChBz6B,EAAM,KAAKy6B,CAAI,GACfz6B,IAAQA,EAAM,OAAOw6B,EAAcC,CAAI,CAAC,IAG1CA,IAAOz6B,EAAM,IAAK;AAAA,IAExB;AAGE,aAAS06B,EAAMD,GAAM;AACnB,MAAAP,EAAGO,CAAI,IAAIN,EAAO,QAAQM,CAAI,EAAE,OAAO,SAASpe,GAAKlF,GAAG;AACtD,eAAO,KAAK,IAAIkF,GAAK6d,EAAG/iB,EAAE,CAAC,IAAIgjB,EAAO,KAAKhjB,CAAC,CAAC;AAAA,MAC9C,GAAE,CAAC;AAAA,IACR;AAGE,aAASwjB,EAAMF,GAAM;AACnB,UAAI7f,IAAMuf,EAAO,SAASM,CAAI,EAAE,OAAO,SAASpe,GAAKlF,GAAG;AACtD,eAAO,KAAK,IAAIkF,GAAK6d,EAAG/iB,EAAE,CAAC,IAAIgjB,EAAO,KAAKhjB,CAAC,CAAC;AAAA,MACnD,GAAO,OAAO,iBAAiB,GAEvB0C,IAAOJ,EAAE,KAAKghB,CAAI;AACtB,MAAI7f,MAAQ,OAAO,qBAAqBf,EAAK,eAAewgB,MAC1DH,EAAGO,CAAI,IAAI,KAAK,IAAIP,EAAGO,CAAI,GAAG7f,CAAG;AAAA,IAEvC;AAEE,WAAA0f,EAAQI,GAAOP,EAAO,aAAa,KAAKA,CAAM,CAAC,GAC/CG,EAAQK,GAAOR,EAAO,WAAW,KAAKA,CAAM,CAAC,GAG7C7jB,EAAE,QAAQqjB,GAAO,SAAS3iB,GAAG;AAC3B,MAAAkjB,EAAGljB,CAAC,IAAIkjB,EAAGjW,EAAKjN,CAAC,CAAC;AAAA,IACtB,CAAG,GAEMkjB;AAAA,EACT;AAGA,WAASE,EAAgB3gB,GAAG2S,GAAUnI,GAAMgW,GAAY;AACtD,QAAIW,IAAa,IAAIpkB,EAAO,GAC1Bmb,IAAalY,EAAE,MAAO,GACtBohB,IAAQC,EAAInJ,EAAW,SAASA,EAAW,SAASsI,CAAU;AAEhE,WAAA3jB,EAAE,QAAQ8V,GAAU,SAASkL,GAAO;AAClC,UAAI5e;AACJ,MAAApC,EAAE,QAAQghB,GAAO,SAAStgB,GAAG;AAC3B,YAAI+jB,IAAQ9W,EAAKjN,CAAC;AAElB,YADA4jB,EAAW,QAAQG,CAAK,GACpBriB,GAAG;AACL,cAAIsiB,IAAQ/W,EAAKvL,CAAC,GAChBuiB,IAAUL,EAAW,KAAKI,GAAOD,CAAK;AACxC,UAAAH,EAAW,QAAQI,GAAOD,GAAO,KAAK,IAAIF,EAAMphB,GAAGzC,GAAG0B,CAAC,GAAGuiB,KAAW,CAAC,CAAC;AAAA,QAC/E;AACM,QAAAviB,IAAI1B;AAAA,MACV,CAAK;AAAA,IACL,CAAG,GAEM4jB;AAAA,EACT;AAKA,WAAS5C,EAA2Bve,GAAGyhB,GAAK;AAC1C,WAAO5kB,EAAE,MAAMA,EAAE,OAAO4kB,CAAG,GAAG,SAAUhB,GAAI;AAC1C,UAAIvY,IAAM,OAAO,mBACb/G,IAAM,OAAO;AAEjB,aAAAtE,EAAE,MAAM4jB,GAAI,SAAU1f,GAAGxD,GAAG;AAC1B,YAAImkB,IAAYC,EAAM3hB,GAAGzC,CAAC,IAAI;AAE9B,QAAA2K,IAAM,KAAK,IAAInH,IAAI2gB,GAAWxZ,CAAG,GACjC/G,IAAM,KAAK,IAAIJ,IAAI2gB,GAAWvgB,CAAG;AAAA,MACvC,CAAK,GAEM+G,IAAM/G;AAAA,IACjB,CAAG;AAAA,EACH;AASA,WAASmd,EAAiBmD,GAAKG,GAAS;AACtC,QAAIC,IAAchlB,EAAE,OAAO+kB,CAAO,GAChCE,IAAajlB,EAAE,IAAIglB,CAAW,GAC9BE,IAAallB,EAAE,IAAIglB,CAAW;AAEhC,IAAAhlB,EAAE,QAAQ,CAAC,KAAK,GAAG,GAAG,SAASmlB,GAAM;AACnC,MAAAnlB,EAAE,QAAQ,CAAC,KAAK,GAAG,GAAG,SAASolB,GAAO;AACpC,YAAIC,IAAYF,IAAOC,GACrBxB,IAAKgB,EAAIS,CAAS,GAClBnP;AACF,YAAI0N,MAAOmB,GAEX;AAAA,cAAIO,IAAStlB,EAAE,OAAO4jB,CAAE;AACxB,UAAA1N,IAAQkP,MAAU,MAAMH,IAAajlB,EAAE,IAAIslB,CAAM,IAAIJ,IAAallB,EAAE,IAAIslB,CAAM,GAE1EpP,MACF0O,EAAIS,CAAS,IAAIrlB,EAAE,UAAU4jB,GAAI,SAAS1f,GAAG;AAAE,mBAAOA,IAAIgS;AAAA,UAAM,CAAE;AAAA;AAAA,MAE1E,CAAK;AAAA,IACL,CAAG;AAAA,EACH;AAEA,WAASyL,EAAQiD,GAAKvB,GAAO;AAC3B,WAAOrjB,EAAE,UAAU4kB,EAAI,IAAI,SAASW,GAAQ7kB,GAAG;AAC7C,UAAI2iB;AACF,eAAOuB,EAAIvB,EAAM,YAAa,CAAA,EAAE3iB,CAAC;AAEjC,UAAIkjB,IAAK5jB,EAAE,OAAOA,EAAE,IAAI4kB,GAAKlkB,CAAC,CAAC;AAC/B,cAAQkjB,EAAG,CAAC,IAAIA,EAAG,CAAC,KAAK;AAAA,IAE/B,CAAG;AAAA,EACH;AAEA,WAAS1C,EAAU/d,GAAG;AACpB,QAAI2S,IAAW5B,EAAK,iBAAiB/Q,CAAC,GAClCye,IAAY5hB,EAAE;AAAA,MAChBmhB,EAAmBhe,GAAG2S,CAAQ;AAAA,MAC9BsL,EAAmBje,GAAG2S,CAAQ;AAAA,IAAC,GAE7B8O,IAAM,CAAE,GACRY;AACJ,IAAAxlB,EAAE,QAAQ,CAAC,KAAK,GAAG,GAAG,SAASmlB,GAAM;AACnC,MAAAK,IAAmBL,MAAS,MAAMrP,IAAW9V,EAAE,OAAO8V,CAAQ,EAAE,QAAS,GACzE9V,EAAE,QAAQ,CAAC,KAAK,GAAG,GAAG,SAASolB,GAAO;AACpC,QAAIA,MAAU,QACZI,IAAmBxlB,EAAE,IAAIwlB,GAAkB,SAASC,GAAO;AACzD,iBAAOzlB,EAAE,OAAOylB,CAAK,EAAE,QAAS;AAAA,QAC1C,CAAS;AAGH,YAAIrC,KAAc+B,MAAS,MAAMhiB,EAAE,eAAeA,EAAE,YAAY,KAAKA,CAAC,GAClEkgB,IAAQ9B,EAAkBpe,GAAGqiB,GAAkB5D,GAAWwB,CAAU,GACpEQ,IAAKpC;AAAA,UAAqBre;AAAA,UAAGqiB;AAAA,UAC/BnC,EAAM;AAAA,UAAMA,EAAM;AAAA,UAAO+B,MAAU;AAAA,QAAG;AACxC,QAAIA,MAAU,QACZxB,IAAK5jB,EAAE,UAAU4jB,GAAI,SAAS1f,GAAG;AAAE,iBAAO,CAACA;AAAA,SAAI,IAEjD0gB,EAAIO,IAAOC,CAAK,IAAIxB;AAAA,MAC1B,CAAK;AAAA,IACL,CAAG;AAED,QAAI8B,IAAgBhE,EAA2Bve,GAAGyhB,CAAG;AACrD,WAAAnD,EAAiBmD,GAAKc,CAAa,GAC5B/D,EAAQiD,GAAKzhB,EAAE,MAAK,EAAG,KAAK;AAAA,EACrC;AAEA,WAASqhB,EAAI5J,GAAS+K,GAAShC,GAAY;AACzC,WAAO,SAASxgB,GAAGzC,GAAG,GAAG;AACvB,UAAImY,IAAS1V,EAAE,KAAKzC,CAAC,GACjBoY,IAAS3V,EAAE,KAAK,CAAC,GACjBkb,IAAM,GACNnI;AAGJ,UADAmI,KAAOxF,EAAO,QAAQ,GAClB7Y,EAAE,IAAI6Y,GAAQ,UAAU;AAC1B,gBAAQA,EAAO,SAAS,YAAa,GAAA;AAAA,UACrC,KAAK;AAAK,YAAA3C,IAAQ,CAAC2C,EAAO,QAAQ;AAAG;AAAA,UACrC,KAAK;AAAK,YAAA3C,IAAQ2C,EAAO,QAAQ;AAAG;AAAA,QAC1C;AAWI,UATI3C,MACFmI,KAAOsF,IAAazN,IAAQ,CAACA,IAE/BA,IAAQ,GAERmI,MAAQxF,EAAO,QAAQ8M,IAAU/K,KAAW,GAC5CyD,MAAQvF,EAAO,QAAQ6M,IAAU/K,KAAW,GAE5CyD,KAAOvF,EAAO,QAAQ,GAClB9Y,EAAE,IAAI8Y,GAAQ,UAAU;AAC1B,gBAAQA,EAAO,SAAS,YAAa,GAAA;AAAA,UACrC,KAAK;AAAK,YAAA5C,IAAQ4C,EAAO,QAAQ;AAAG;AAAA,UACpC,KAAK;AAAK,YAAA5C,IAAQ,CAAC4C,EAAO,QAAQ;AAAG;AAAA,QAC3C;AAEI,aAAI5C,MACFmI,KAAOsF,IAAazN,IAAQ,CAACA,IAE/BA,IAAQ,GAEDmI;AAAA,IACR;AAAA,EACH;AAEA,WAASyG,EAAM3hB,GAAGzC,GAAG;AACnB,WAAOyC,EAAE,KAAKzC,CAAC,EAAE;AAAA,EACnB;;;;;;;AChaA,MAAIV,IAAItY,EAAoB,GACxBwsB,IAAOpsB,EAAkB,GACzBo5B,IAAY14B,GAAe,EAAC;AAEhC,EAAAo9B,KAAiBC;AAEjB,WAASA,EAAS1iB,GAAG;AACnB,IAAAA,IAAI+Q,EAAK,mBAAmB/Q,CAAC,GAE7B2iB,EAAU3iB,CAAC,GACXnD,EAAE,QAAQkhB,EAAU/d,CAAC,GAAG,SAASe,GAAGxD,GAAG;AACrC,MAAAyC,EAAE,KAAKzC,CAAC,EAAE,IAAIwD;AAAA,IAClB,CAAG;AAAA,EACH;AAEA,WAAS4hB,EAAU3iB,GAAG;AACpB,QAAI2S,IAAW5B,EAAK,iBAAiB/Q,CAAC,GAClC4iB,IAAU5iB,EAAE,MAAK,EAAG,SACpB6iB,IAAQ;AACZ,IAAAhmB,EAAE,QAAQ8V,GAAU,SAASkL,GAAO;AAClC,UAAIiF,IAAYjmB,EAAE,IAAIA,EAAE,IAAIghB,GAAO,SAAStgB,GAAG;AAAE,eAAOyC,EAAE,KAAKzC,CAAC,EAAE;AAAA,MAAO,CAAE,CAAC;AAC5E,MAAAV,EAAE,QAAQghB,GAAO,SAAStgB,GAAG;AAC3B,QAAAyC,EAAE,KAAKzC,CAAC,EAAE,IAAIslB,IAAQC,IAAY;AAAA,MACxC,CAAK,GACDD,KAASC,IAAYF;AAAA,IACzB,CAAG;AAAA,EACH;;;;;;;AC1BA,MAAI/lB,IAAItY,EAAmB,GACvBksB,IAAU9rB,GAAoB,GAC9BuuB,IAAY7tB,GAAsB,GAClCutB,IAAO/qB,GAAiB,GACxB0pB,IAAiBzpB,EAAiB,EAAC,gBACnC2uB,IAAoB1uB,GAAgC,GACpDypB,IAAmB1pB,EAAiB,EAAC,kBACrCsvB,IAAejtB,GAA0B,GACzCiuB,IAAoB/tB,GAAgC,GACpDouB,IAAmBhhB,GAA8B,GACjD0M,IAAQzM,GAAkB,GAC1BgrB,IAAWpmB,GAAqB,GAChCyU,IAAOjpB,EAAiB,GACxBiV,IAAQR,EAAqB,EAAC;AAElC,EAAAwmB,KAAiBC;AAEjB,WAASA,EAAOhjB,GAAG7C,GAAM;AACvB,QAAIyU,IAAOzU,KAAQA,EAAK,cAAc4T,EAAK,OAAOA,EAAK;AACvD,IAAAa,EAAK,UAAU,WAAW;AACxB,UAAIqR,IACFrR,EAAK,sBAAsB,WAAW;AAAE,eAAOsR,EAAiBljB,CAAC;AAAA,OAAI;AACvE,MAAA4R,EAAK,eAAsB,WAAW;AAAE,QAAAuR,EAAUF,GAAarR,CAAI;AAAA,OAAI,GACvEA,EAAK,sBAAsB,WAAW;AAAE,QAAAwR,EAAiBpjB,GAAGijB,CAAW;AAAA,OAAI;AAAA,IAC/E,CAAG;AAAA,EACH;AAEA,WAASE,EAAUnjB,GAAG4R,GAAM;AAC1B,IAAAA,EAAK,8BAA8B,WAAW;AAAE,MAAAyR,EAAuBrjB,CAAC;AAAA,IAAE,CAAE,GAC5E4R,EAAK,uBAA8B,WAAW;AAAE,MAAA0R,EAAgBtjB,CAAC;AAAA,IAAE,CAAE,GACrE4R,EAAK,eAA8B,WAAW;AAAE,MAAAnB,EAAQ,IAAIzQ,CAAC;AAAA,KAAI,GACjE4R,EAAK,wBAA8B,WAAW;AAAE,MAAAwF,EAAa,IAAIpX,CAAC;AAAA,KAAI,GACtE4R,EAAK,YAA8B,WAAW;AAAE,MAAAgB,EAAK7B,EAAK,mBAAmB/Q,CAAC,CAAC;AAAA,KAAI,GACnF4R,EAAK,8BAA8B,WAAW;AAAE,MAAA2R,EAAuBvjB,CAAC;AAAA,IAAE,CAAE,GAC5E4R,EAAK,wBAA8B,WAAW;AAAE,MAAAJ,EAAiBxR,CAAC;AAAA,IAAE,CAAE,GACtE4R,EAAK,4BAA8B,WAAW;AAAE,MAAAwF,EAAa,QAAQpX,CAAC;AAAA,KAAI,GAC1E4R,EAAK,sBAA8B,WAAW;AAAE,MAAAL,EAAevR,CAAC;AAAA,IAAE,CAAE,GACpE4R,EAAK,wBAA8B,WAAW;AAAE,MAAA4R,EAAiBxjB,CAAC;AAAA,IAAE,CAAE,GACtE4R,EAAK,8BAA8B,WAAW;AAAE,MAAA6R,EAAuBzjB,CAAC;AAAA,IAAE,CAAE,GAC5E4R,EAAK,qBAA8B,WAAW;AAAE,MAAAsB,EAAU,IAAIlT,CAAC;AAAA,KAAI,GACnE4R,EAAK,yBAA8B,WAAW;AAAE,MAAA6E,EAAkBzW,CAAC;AAAA,IAAE,CAAE,GACvE4R,EAAK,yBAA8B,WAAW;AAAE,MAAAwG,EAAkBpY,CAAC;AAAA,IAAE,CAAE,GACvE4R,EAAK,aAA8B,WAAW;AAAE,MAAAzN,EAAMnE,CAAC;AAAA,IAAE,CAAE,GAC3D4R,EAAK,uBAA8B,WAAW;AAAE,MAAA8R,EAAgB1jB,CAAC;AAAA,IAAE,CAAE,GACrE4R,EAAK,8BAA8B,WAAW;AAAE,MAAA6G,EAAiB,OAAOzY,CAAC;AAAA,KAAI,GAC7E4R,EAAK,gBAA8B,WAAW;AAAE,MAAA8Q,EAAS1iB,CAAC;AAAA,IAAE,CAAE,GAC9D4R,EAAK,yBAA8B,WAAW;AAAE,MAAA+R,EAAkB3jB,CAAC;AAAA,IAAE,CAAE,GACvE4R,EAAK,yBAA8B,WAAW;AAAE,MAAAgS,GAAkB5jB,CAAC;AAAA,IAAE,CAAE,GACvE4R,EAAK,sBAA8B,WAAW;AAAE,MAAAsB,EAAU,KAAKlT,CAAC;AAAA,KAAI,GACpE4R,EAAK,4BAA8B,WAAW;AAAE,MAAAiS,EAAqB7jB,CAAC;AAAA,IAAE,CAAE,GAC1E4R,EAAK,4BAA8B,WAAW;AAAE,MAAA6G,EAAiB,KAAKzY,CAAC;AAAA,KAAI,GAC3E4R,EAAK,sBAA8B,WAAW;AAAE,MAAAkS,EAAe9jB,CAAC;AAAA,IAAE,CAAE,GACpE4R,EAAK,4BAA8B,WAAW;AAAE,MAAAmS,EAAqB/jB,CAAC;AAAA,IAAE,CAAE,GAC1E4R,EAAK,qBAA8B,WAAW;AAAE,MAAAoS,GAA8BhkB,CAAC;AAAA,IAAE,CAAE,GACnF4R,EAAK,oBAA8B,WAAW;AAAE,MAAAnB,EAAQ,KAAKzQ,CAAC;AAAA,KAAI;AAAA,EACpE;AAQA,WAASojB,EAAiBa,GAAYhB,GAAa;AACjD,IAAApmB,EAAE,QAAQonB,EAAW,MAAO,GAAE,SAAS1mB,GAAG;AACxC,UAAI2mB,IAAaD,EAAW,KAAK1mB,CAAC,GAC9B4mB,IAAclB,EAAY,KAAK1lB,CAAC;AAEpC,MAAI2mB,MACFA,EAAW,IAAIC,EAAY,GAC3BD,EAAW,IAAIC,EAAY,GAEvBlB,EAAY,SAAS1lB,CAAC,EAAE,WAC1B2mB,EAAW,QAAQC,EAAY,OAC/BD,EAAW,SAASC,EAAY;AAAA,IAGxC,CAAG,GAEDtnB,EAAE,QAAQonB,EAAW,MAAO,GAAE,SAASvmB,GAAG;AACxC,UAAIwmB,IAAaD,EAAW,KAAKvmB,CAAC,GAC9BymB,IAAclB,EAAY,KAAKvlB,CAAC;AAEpC,MAAAwmB,EAAW,SAASC,EAAY,QAC5BtnB,EAAE,IAAIsnB,GAAa,GAAG,MACxBD,EAAW,IAAIC,EAAY,GAC3BD,EAAW,IAAIC,EAAY;AAAA,IAEjC,CAAG,GAEDF,EAAW,MAAK,EAAG,QAAQhB,EAAY,MAAO,EAAC,OAC/CgB,EAAW,MAAK,EAAG,SAAShB,EAAY,MAAO,EAAC;AAAA,EAClD;AAEA,MAAImB,IAAgB,CAAC,WAAW,WAAW,WAAW,WAAW,SAAS,GACtEC,IAAgB,EAAE,SAAS,IAAI,SAAS,IAAI,SAAS,IAAI,SAAS,KAAM,GACxEC,IAAa,CAAC,aAAa,UAAU,WAAW,OAAO,GACvDC,IAAe,CAAC,SAAS,QAAQ,GACjCC,IAAe,EAAE,OAAO,GAAG,QAAQ,EAAG,GACtCC,IAAe,CAAC,UAAU,UAAU,SAAS,UAAU,aAAa,GACpEC,IAAe;AAAA,IACjB,QAAQ;AAAA,IAAG,QAAQ;AAAA,IAAG,OAAO;AAAA,IAAG,QAAQ;AAAA,IACxC,aAAa;AAAA,IAAI,UAAU;AAAA,EAC5B,GACGC,IAAY,CAAC,UAAU;AAQ3B,WAASzB,EAAiBe,GAAY;AACpC,QAAIjkB,IAAI,IAAIjD,EAAM,EAAE,YAAY,IAAM,UAAU,IAAM,GAClDD,IAAQ8nB,EAAaX,EAAW,MAAK,CAAE;AAE3C,WAAAjkB,EAAE,SAASnD,EAAE;AAAA,MAAM,CAAE;AAAA,MACnBwnB;AAAA,MACAQ,EAAkB/nB,GAAOsnB,CAAa;AAAA,MACtCvnB,EAAE,KAAKC,GAAOwnB,CAAU;AAAA,IAAC,CAAC,GAE5BznB,EAAE,QAAQonB,EAAW,MAAO,GAAE,SAAS1mB,GAAG;AACxC,UAAI6C,IAAOwkB,EAAaX,EAAW,KAAK1mB,CAAC,CAAC;AAC1C,MAAAyC,EAAE,QAAQzC,GAAGV,EAAE,SAASgoB,EAAkBzkB,GAAMmkB,CAAY,GAAGC,CAAY,CAAC,GAC5ExkB,EAAE,UAAUzC,GAAG0mB,EAAW,OAAO1mB,CAAC,CAAC;AAAA,IACvC,CAAG,GAEDV,EAAE,QAAQonB,EAAW,MAAO,GAAE,SAASvmB,GAAG;AACxC,UAAIqB,IAAO6lB,EAAaX,EAAW,KAAKvmB,CAAC,CAAC;AAC1C,MAAAsC,EAAE,QAAQtC,GAAGb,EAAE;AAAA,QAAM,CAAE;AAAA,QACrB6nB;AAAA,QACAG,EAAkB9lB,GAAM0lB,CAAY;AAAA,QACpC5nB,EAAE,KAAKkC,GAAM4lB,CAAS;AAAA,MAAC,CAAC;AAAA,IAC9B,CAAG,GAEM3kB;AAAA,EACT;AAUA,WAASqjB,EAAuBrjB,GAAG;AACjC,QAAIlD,IAAQkD,EAAE,MAAO;AACrB,IAAAlD,EAAM,WAAW,GACjBD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,MAAAqB,EAAK,UAAU,GACXA,EAAK,SAAS,YAAW,MAAO,QAC9BjC,EAAM,YAAY,QAAQA,EAAM,YAAY,OAC9CiC,EAAK,SAASA,EAAK,cAEnBA,EAAK,UAAUA,EAAK;AAAA,IAG5B,CAAG;AAAA,EACH;AAQA,WAASwkB,EAAuBvjB,GAAG;AACjC,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,UAAIqB,EAAK,SAASA,EAAK,QAAQ;AAC7B,YAAIxB,IAAIyC,EAAE,KAAKtC,EAAE,CAAC,GACdY,IAAI0B,EAAE,KAAKtC,EAAE,CAAC,GACdN,IAAQ,EAAE,OAAOkB,EAAE,OAAOf,EAAE,QAAQ,IAAIA,EAAE,MAAM,GAAGG,EAAG;AAC1D,QAAAqT,EAAK,aAAa/Q,GAAG,cAAc5C,GAAO,KAAK;AAAA,MACrD;AAAA,IACA,CAAG;AAAA,EACH;AAEA,WAASomB,EAAiBxjB,GAAG;AAC3B,QAAI0R,IAAU;AACd,IAAA7U,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC;AACnB,MAAI6C,EAAK,cACPA,EAAK,UAAUJ,EAAE,KAAKI,EAAK,SAAS,EAAE,MACtCA,EAAK,UAAUJ,EAAE,KAAKI,EAAK,YAAY,EAAE,MACzCsR,IAAU7U,EAAE,IAAI6U,GAAStR,EAAK,OAAO;AAAA,IAE3C,CAAG,GACDJ,EAAE,QAAQ,UAAU0R;AAAA,EACtB;AAEA,WAAS+R,EAAuBzjB,GAAG;AACjC,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC;AACnB,MAAI6C,EAAK,UAAU,iBACjBJ,EAAE,KAAKI,EAAK,CAAC,EAAE,YAAYA,EAAK,MAChCJ,EAAE,WAAWzC,CAAC;AAAA,IAEpB,CAAG;AAAA,EACH;AAEA,WAASumB,EAAe9jB,GAAG;AACzB,QAAI8kB,IAAO,OAAO,mBACdC,IAAO,GACPC,IAAO,OAAO,mBACdC,IAAO,GACP/M,IAAalY,EAAE,MAAO,GACtBklB,IAAUhN,EAAW,WAAW,GAChCiN,IAAUjN,EAAW,WAAW;AAEpC,aAASkN,GAAYtT,GAAO;AAC1B,UAAI/Q,IAAI+Q,EAAM,GACVO,KAAIP,EAAM,GACVxT,KAAIwT,EAAM,OACVU,KAAIV,EAAM;AACd,MAAAgT,IAAO,KAAK,IAAIA,GAAM/jB,IAAIzC,KAAI,CAAC,GAC/BymB,IAAO,KAAK,IAAIA,GAAMhkB,IAAIzC,KAAI,CAAC,GAC/B0mB,IAAO,KAAK,IAAIA,GAAM3S,KAAIG,KAAI,CAAC,GAC/ByS,IAAO,KAAK,IAAIA,GAAM5S,KAAIG,KAAI,CAAC;AAAA,IACnC;AAEE,IAAA3V,EAAE,QAAQmD,EAAE,MAAK,GAAI,SAASzC,GAAG;AAAE,MAAA6nB,GAAYplB,EAAE,KAAKzC,CAAC,CAAC;AAAA,IAAE,CAAE,GAC5DV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,MAAIb,EAAE,IAAIkC,GAAM,GAAG,KACjBqmB,GAAYrmB,CAAI;AAAA,IAEtB,CAAG,GAED+lB,KAAQI,GACRF,KAAQG,GAERtoB,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC;AACnB,MAAA6C,EAAK,KAAK0kB,GACV1kB,EAAK,KAAK4kB;AAAA,IACd,CAAG,GAEDnoB,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,MAAAb,EAAE,QAAQkC,EAAK,QAAQ,SAASsmB,IAAG;AACjC,QAAAA,GAAE,KAAKP,GACPO,GAAE,KAAKL;AAAA,MACb,CAAK,GACGnoB,EAAE,IAAIkC,GAAM,GAAG,MAAKA,EAAK,KAAK+lB,IAC9BjoB,EAAE,IAAIkC,GAAM,GAAG,MAAKA,EAAK,KAAKimB;AAAA,IACtC,CAAG,GAED9M,EAAW,QAAQ6M,IAAOD,IAAOI,GACjChN,EAAW,SAAS+M,IAAOD,IAAOG;AAAA,EACpC;AAEA,WAASpB,EAAqB/jB,GAAG;AAC/B,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC,GACf4nB,IAAQtlB,EAAE,KAAKtC,EAAE,CAAC,GAClB6nB,IAAQvlB,EAAE,KAAKtC,EAAE,CAAC,GAClB8nB,GAAIC;AACR,MAAK1mB,EAAK,UAKRymB,IAAKzmB,EAAK,OAAO,CAAC,GAClB0mB,IAAK1mB,EAAK,OAAOA,EAAK,OAAO,SAAS,CAAC,MALvCA,EAAK,SAAS,CAAE,GAChBymB,IAAKD,GACLE,IAAKH,IAKPvmB,EAAK,OAAO,QAAQgS,EAAK,cAAcuU,GAAOE,CAAE,CAAC,GACjDzmB,EAAK,OAAO,KAAKgS,EAAK,cAAcwU,GAAOE,CAAE,CAAC;AAAA,IAClD,CAAG;AAAA,EACH;AAEA,WAAS5B,EAAqB7jB,GAAG;AAC/B,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,UAAIb,EAAE,IAAIkC,GAAM,GAAG;AAIjB,iBAHIA,EAAK,aAAa,OAAOA,EAAK,aAAa,SAC7CA,EAAK,SAASA,EAAK,cAEbA,EAAK,UAAQ;AAAA,UACrB,KAAK;AAAK,YAAAA,EAAK,KAAKA,EAAK,QAAQ,IAAIA,EAAK;AAAa;AAAA,UACvD,KAAK;AAAK,YAAAA,EAAK,KAAKA,EAAK,QAAQ,IAAIA,EAAK;AAAa;AAAA,QAC7D;AAAA,IAEA,CAAG;AAAA,EACH;AAEA,WAASilB,GAA8BhkB,GAAG;AACxC,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIqB,IAAOiB,EAAE,KAAKtC,CAAC;AACnB,MAAIqB,EAAK,YACPA,EAAK,OAAO,QAAS;AAAA,IAE3B,CAAG;AAAA,EACH;AAEA,WAAS6kB,GAAkB5jB,GAAG;AAC5B,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAIyC,EAAE,SAASzC,CAAC,EAAE,QAAQ;AACxB,YAAI6C,IAAOJ,EAAE,KAAKzC,CAAC,GACfuW,IAAI9T,EAAE,KAAKI,EAAK,SAAS,GACzBslB,IAAI1lB,EAAE,KAAKI,EAAK,YAAY,GAC5BiB,IAAIrB,EAAE,KAAKnD,EAAE,KAAKuD,EAAK,UAAU,CAAC,GAClCkB,IAAItB,EAAE,KAAKnD,EAAE,KAAKuD,EAAK,WAAW,CAAC;AAEvC,QAAAA,EAAK,QAAQ,KAAK,IAAIkB,EAAE,IAAID,EAAE,CAAC,GAC/BjB,EAAK,SAAS,KAAK,IAAIslB,EAAE,IAAI5R,EAAE,CAAC,GAChC1T,EAAK,IAAIiB,EAAE,IAAIjB,EAAK,QAAQ,GAC5BA,EAAK,IAAI0T,EAAE,IAAI1T,EAAK,SAAS;AAAA,MACnC;AAAA,IACA,CAAG,GAEDvD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,MAAIyC,EAAE,KAAKzC,CAAC,EAAE,UAAU,YACtByC,EAAE,WAAWzC,CAAC;AAAA,IAEpB,CAAG;AAAA,EACH;AAEA,WAAS+lB,EAAgBtjB,GAAG;AAC1B,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,UAAIA,EAAE,MAAMA,EAAE,GAAG;AACf,YAAI0C,IAAOJ,EAAE,KAAKtC,EAAE,CAAC;AACrB,QAAK0C,EAAK,cACRA,EAAK,YAAY,CAAE,IAErBA,EAAK,UAAU,KAAK,EAAE,GAAG1C,GAAG,OAAOsC,EAAE,KAAKtC,CAAC,GAAG,GAC9CsC,EAAE,WAAWtC,CAAC;AAAA,MACpB;AAAA,IACA,CAAG;AAAA,EACH;AAEA,WAASgmB,EAAgB1jB,GAAG;AAC1B,QAAI8S,IAAS/B,EAAK,iBAAiB/Q,CAAC;AACpC,IAAAnD,EAAE,QAAQiW,GAAQ,SAAS+K,GAAO;AAChC,UAAI8H,IAAa;AACjB,MAAA9oB,EAAE,QAAQghB,GAAO,SAAStgB,GAAG6D,GAAG;AAC9B,YAAIhB,IAAOJ,EAAE,KAAKzC,CAAC;AACnB,QAAA6C,EAAK,QAAQgB,IAAIukB,GACjB9oB,EAAE,QAAQuD,EAAK,WAAW,SAASwlB,GAAU;AAC3C,UAAA7U,EAAK,aAAa/Q,GAAG,YAAY;AAAA,YAC/B,OAAO4lB,EAAS,MAAM;AAAA,YACtB,QAAQA,EAAS,MAAM;AAAA,YACvB,MAAMxlB,EAAK;AAAA,YACX,OAAOgB,IAAK,EAAEukB;AAAA,YACd,GAAGC,EAAS;AAAA,YACZ,OAAOA,EAAS;AAAA,UACjB,GAAE,KAAK;AAAA,QAChB,CAAO,GACD,OAAOxlB,EAAK;AAAA,MAClB,CAAK;AAAA,IACL,CAAG;AAAA,EACH;AAEA,WAASujB,EAAkB3jB,GAAG;AAC5B,IAAAnD,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,UAAI6C,IAAOJ,EAAE,KAAKzC,CAAC;AACnB,UAAI6C,EAAK,UAAU,YAAY;AAC7B,YAAIylB,IAAW7lB,EAAE,KAAKI,EAAK,EAAE,CAAC,GAC1BW,IAAI8kB,EAAS,IAAIA,EAAS,QAAQ,GAClCxT,IAAIwT,EAAS,GACbvT,IAAKlS,EAAK,IAAIW,GACdwR,IAAKsT,EAAS,SAAS;AAC3B,QAAA7lB,EAAE,QAAQI,EAAK,GAAGA,EAAK,KAAK,GAC5BJ,EAAE,WAAWzC,CAAC,GACd6C,EAAK,MAAM,SAAS;AAAA,UAClB,EAAE,GAAGW,IAAI,IAAIuR,IAAK,GAAG,GAAGD,IAAIE,EAAI;AAAA,UAChC,EAAE,GAAGxR,IAAI,IAAIuR,IAAK,GAAG,GAAGD,IAAIE,EAAI;AAAA,UAChC,EAAE,GAAGxR,IAAQuR,GAAQ,GAAGD,EAAG;AAAA,UAC3B,EAAE,GAAGtR,IAAI,IAAIuR,IAAK,GAAG,GAAGD,IAAIE,EAAI;AAAA,UAChC,EAAE,GAAGxR,IAAI,IAAIuR,IAAK,GAAG,GAAGD,IAAIE,EAAE;AAAA,QAC/B,GACDnS,EAAK,MAAM,IAAIA,EAAK,GACpBA,EAAK,MAAM,IAAIA,EAAK;AAAA,MAC1B;AAAA,IACA,CAAG;AAAA,EACH;AAEA,WAASykB,EAAkBiB,GAAKhU,GAAO;AACrC,WAAOjV,EAAE,UAAUA,EAAE,KAAKipB,GAAKhU,CAAK,GAAG,MAAM;AAAA,EAC/C;AAEA,WAAS8S,EAAa9S,GAAO;AAC3B,QAAIiU,IAAW,CAAE;AACjB,WAAAlpB,EAAE,QAAQiV,GAAO,SAASvU,GAAG+B,GAAG;AAC9B,MAAAymB,EAASzmB,EAAE,YAAa,CAAA,IAAI/B;AAAA,IAChC,CAAG,GACMwoB;AAAA,EACT;;;;;;;ACvYA,MAAIlpB,IAAItY,EAAmB,GACvBwsB,IAAOpsB,EAAiB,GACxBoY,IAAQ1X,EAAqB,EAAC;AAElC,EAAA2gC,KAAiB;AAAA,IACf,eAAeC;AAAA,EAChB;AAGD,WAASA,EAAcjmB,GAAG;AACxB,QAAIkmB,IAAcnV,EAAK,iBAAiB/Q,CAAC,GAErCwS,IAAI,IAAIzV,EAAM,EAAE,UAAU,IAAM,YAAY,GAAM,CAAA,EAAE,SAAS,EAAE;AAEnE,WAAAF,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAASzC,GAAG;AAC/B,MAAAiV,EAAE,QAAQjV,GAAG,EAAE,OAAOA,EAAC,CAAE,GACzBiV,EAAE,UAAUjV,GAAG,UAAUyC,EAAE,KAAKzC,CAAC,EAAE,IAAI;AAAA,IAC3C,CAAG,GAEDV,EAAE,QAAQmD,EAAE,MAAO,GAAE,SAAStC,GAAG;AAC/B,MAAA8U,EAAE,QAAQ9U,EAAE,GAAGA,EAAE,GAAG,CAAA,GAAIA,EAAE,IAAI;AAAA,IAClC,CAAG,GAEDb,EAAE,QAAQqpB,GAAa,SAASrI,GAAOzc,GAAG;AACxC,UAAI+kB,IAAS,UAAU/kB;AACvB,MAAAoR,EAAE,QAAQ2T,GAAQ,EAAE,MAAM,OAAM,CAAE,GAClCtpB,EAAE,OAAOghB,GAAO,SAAS5e,GAAG1B,GAAG;AAC7B,eAAAiV,EAAE,QAAQvT,GAAG1B,GAAG,EAAE,OAAO,SAAS,GAC3BA;AAAA,MACb,CAAK;AAAA,IACL,CAAG,GAEMiV;AAAA,EACT;;;;;wBCjCA7S,KAAiB;;;;wBCsBjBymB,KAAiB;AAAA,IACf,UAAU7hC,EAAyB;AAAA,IAEnC,QAAQI,GAAuB;AAAA,IAC/B,OAAOU,GAAsB;AAAA,IAC7B,MAAM;AAAA,MACJ,MAAMwC,EAAqB,EAAC;AAAA,MAC5B,QAAQA,EAAA,EAAsB;AAAA,IAC/B;AAAA,IACD,SAASC,GAAA;AAAA,EACV;;;;;;;;AChCD,MAAIyD,IAAchH,GAAyB;AA8B3C,WAAS8hC,EAAQrhC,GAAOmB,GAAO;AAC7B,WAAOoF,EAAYvG,GAAOmB,CAAK;AAAA,EACjC;AAEA,SAAAmgC,KAAiBD;;;mCC3BXE,KAAoB;AAoDV,SAAAC,GAAiBC,GAAmBC,GAA8B;AAC9E,QAAM,EAAC,UAAAC,EAAA,IAAYC,GAAWH,CAAS,GAEjCrjB,IAAQ,CAAC;AAEJ,aAAArE,KAAQ4nB,EAAS;AACpB,QAAA5nB,EAAK,WAAW2nB,GAAS;AACzB,MAAAtjB,EAAM,KAAKrE,CAAI;AACf,YAAM8nB,IAAgBL,GAAiBC,GAAW1nB,EAAK,MAAM;AACzD,MAAA8nB,EAAc,SAAS,KACjBzjB,EAAA,KAAK,GAAGyjB,CAAa;AAAA,IAC/B;AAID,SAAAzjB;AACX;AAEgB,SAAA0jB,GAAeL,GAAmBC,GAA8B;AAC5E,QAAM,EAAC,UAAAC,EAAA,IAAYC,GAAWH,CAAS,GAEjCrjB,IAAQ,CAAC;AAEJ,aAAArE,KAAQ4nB,EAAS;AACpB,QAAA5nB,EAAK,WAAW2nB,GAAS;AACzB,MAAAtjB,EAAM,KAAKrE,CAAI;AACf,YAAM8nB,IAAgBC,GAAeL,GAAW1nB,EAAK,MAAM;AACvD,MAAA8nB,EAAc,SAAS,KACjBzjB,EAAA,KAAK,GAAGyjB,CAAa;AAAA,IAC/B;AAID,SAAAzjB;AACX;AAEgB,SAAA2jB,GAAiBN,GAAmBC,GAA4C;AAC5F,QAAM,EAAC,UAAAC,GAAU,UAAAK,MAAYJ,GAAWH,CAAS,GAE3CQ,IAAYD,EAASN,CAAO,GAC5BtjB,IAAmC6jB,IAAY,CAACA,CAAS,IAAI,CAAC;AAEzD,aAAAloB,KAAQ4nB,EAAS;AACpB,QAAA5nB,EAAK,WAAW2nB,GAAS;AACnB,MAAAtjB,EAAA,KAAKrE,EAAK,UAAU;AAC1B,YAAM8nB,IAAgBE,GAAiBN,GAAW1nB,EAAK,MAAM;AACzD,MAAA8nB,EAAc,SAAS,KACjBzjB,EAAA,KAAK,GAAGyjB,CAAa;AAAA,IAC/B;AAID,SAAAzjB;AACX;AAEgB,SAAA8jB,GAAeT,GAAmBC,GAAiB;AAC/D,QAAM,EAAC,UAAAC,GAAU,UAAAK,MAAYJ,GAAWH,CAAS,GAE3CrjB,IAAQ,CAAC4jB,EAASN,CAAO,CAAC;AAErB,aAAA3nB,KAAQ4nB,EAAS;AACpB,QAAA5nB,EAAK,WAAW2nB,GAAS;AACnB,MAAAtjB,EAAA,KAAKrE,EAAK,UAAU;AAC1B,YAAM8nB,IAAgBK,GAAeT,GAAW1nB,EAAK,MAAM;AACvD,MAAA8nB,EAAc,SAAS,KACjBzjB,EAAA,KAAK,GAAGyjB,CAAa;AAAA,IAC/B;AAID,SAAAzjB;AACX;AAEgB,SAAA+jB,GAAeV,GAAmBC,GAAiB;AACxD,SAAA;AAAA,IACH,GAAGF,GAAiBC,GAAWC,CAAO;AAAA,IACtC,GAAGK,GAAiBN,GAAWC,CAAO;AAAA,IACtC,GAAGI,GAAeL,GAAWC,CAAO;AAAA,IACpC,GAAGQ,GAAeT,GAAWC,CAAO;AAAA,EACxC;AACJ;AAEO,SAASU,GACZC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACF;AACQ,QAAAC,IAAa,IAAIxB,GAAM,SAAS,MAAM,EAAC,UAAU,IAAK;AACjD,EAAAwB,EAAA,oBAAoB,OAAO,CAAA,EAAG,GACzCA,EAAW,SAAS,EAAC,SAASL,IAAe,OAAO,MAAK;AAE9C,aAAAnnB,KAAQinB,EAAU;AACzB,IAAKC,EAAY,SAASlnB,EAAK,GAAG,KACnBwnB,EAAA,QAAQxnB,EAAK,KAAK;AAAA,MACzB,OAAOynB,GAAaznB,CAAI;AAAA,MACxB,QAAQ0nB,GAAc1nB,CAAI;AAAA,IAAA,CAC7B;AAIT,aAAW2nB,KAAWV,EAAU,YAAY,CAAA,GAAI;AAC5C,UAAMX,IAAUqB,EAAQ,QAAQ,IAAI,QAAQ3kC,IAAgB,EAAE;AAE1D,QAAAokC,EAAwB,SAASO,EAAQ,QAAQ,GAAG,KACpDL,EAAU,IAAIhB,CAAO,GACvB;AACE,YAAMtmB,IAAO,EAAC,KAAKsmB,GAAS,MAAM,mBAAkB;AACpD,MAAAkB,EAAW,QAAQlB,GAAS;AAAA,QACxB,OAAOmB,GAAaznB,CAAI;AAAA,QACxB,QAAQ0nB,GAAc1nB,CAAI;AAAA,MAAA,CAC7B,GACDunB,EAAc,KAAKvnB,CAAI;AACvB;AAAA,IAAA;AAEJ,QAAI,CAACqnB,EAAaM,EAAQ,QAAQ,GAAG,GAAG;AACpC,MAAAH,EAAW,QAAQG,EAAQ,QAAQ,KAAK,EAAC,iBAAiB,OAAM;AAEhE,iBAAW3nB,KAAQ2nB,EAAQ,SAAS,CAAA;AAChC,QAAKT,EAAY,SAASlnB,CAAI,KAC1BwnB,EAAW,UAAUxnB,GAAM2nB,EAAQ,QAAQ,GAAG;AAAA,IAEtD;AAEJ,QAAIA,EAAQ,SAAS;AACjB,YAAMC,IAAYP,EAAaM,EAAQ,QAAQ,GAAG,IAC5CN,EAAaM,EAAQ,QAAQ,GAAG,IAChCA,EAAQ,QAAQ;AACtB,MAAKT,EAAY,SAASU,CAAS,KACpBJ,EAAA;AAAA,QACPI;AAAA,QACAD,EAAQ,QAAQA,EAAQ,QAAQ,SAAS,CAAC;AAAA,MAC9C;AAAA,IACJ;AAAA,EACJ;AAGJ,aAAWhpB,KAAQsoB,EAAU,SAAS,CAAA,GAAI;AACtC,UAAMY,IAAUC;AAAA,MACZnpB,EAAK;AAAA,MACLA,EAAK;AAAA,MACL0oB;AAAA,MACAH;AAAA,IACJ;AACA,IAAIW,KACAL,EAAW,QAAQK,EAAQ,QAAQA,EAAQ,MAAM;AAAA,EACrD;AAGJ,SAAA7B,GAAM,OAAOwB,CAAU,GAChBA;AACX;AAEgB,SAAAO,GAAgBC,GAK7BxqB,GAKA;AACC,QAAM8kB,IAAW,EAAC,GAAG0F,EAAE,IAAIA,EAAE,QAAQ,GAAG,GAAGA,EAAE,IAAIA,EAAE,SAAS,EAAC;AAG7D,MAAIxqB,GAAQ;AACF,UAAAyqB,IAAiBF,GAAgBvqB,CAAM;AACpC,IAAA8kB,EAAA,IAAIA,EAAS,IAAI2F,EAAe,GAChC3F,EAAA,IAAIA,EAAS,IAAI2F,EAAe;AAAA,EAAA;AAEtC,SAAA3F;AACX;AAEO,SAASmF,GAAaznB,GAAmB;AAC5C,SAAOkoB,GAAWloB,CAAI,KAAKmoB,GAAcnoB,CAAI,IACvC7c,GAAW,aACVilC,GAAmBpoB,CAAI,IACpB7c,GAAW,0BACXA,GAAW;AACzB;AAEO,SAASukC,GAAc1nB,GAAmB;AAC7C,SAAOkoB,GAAWloB,CAAI,KAAKmoB,GAAcnoB,CAAI,IACvC7c,GAAW,cACVilC,GAAmBpoB,CAAI,IACpB7c,GAAW,2BACXA,GAAW;AACzB;AAEO,SAAS+kC,GAAWloB,GAAmB;AACnC,SAAA,CAAC,aAAa,oBAAoB,EAAE,KAAK,CAAC0T,MAAM1T,EAAK,KAAK,SAAS0T,CAAC,CAAC;AAChF;AAEO,SAASyU,GAAcnoB,GAAmB;AACtC,SAAAA,EAAK,KAAK,SAAS,cAAc;AAC5C;AAEO,SAASooB,GAAmBpoB,GAAmB;AAClD,SAAOA,EAAK,SAAS;AACzB;AAEO,SAAS8nB,GAAmBx8B,GAAgBuvB,GAAgBwM,GAA4BH,GAAuB;AAClH,QAAMmB,IAAYhB,EAAa/7B,CAAM,IAAI+7B,EAAa/7B,CAAM,IAAIA,GAC1Dg9B,IAAYjB,EAAaxM,CAAM,IAAIwM,EAAaxM,CAAM,IAAIA;AAG5D,SAAAwN,MAAcC,KACdpB,EAAY,SAASmB,CAAS,KAC9BnB,EAAY,SAASoB,CAAS,IAEvB,OAEJ,EAAC,QAAQA,GAAW,QAAQD,EAAS;AAChD;AAEO,SAASE,GAAWC,GAAmB;AACpC,QAAA;AAAA,IACF,UAAAjC;AAAA,IACA,UAAAkC;AAAA,IACA,aAAAC;AAAA,IACA,aAAAC;AAAA,IACA,aAAAC;AAAA,IACA,wBAAAC;AAAA,EAAA,IACArC,GAAWgC,CAAS;AACxB,EAAAG,EAAYpC,EAAS,KAAK,GAC1BqC,EAAYH,EAAS,KAAK,GAC1BI,EAAuBH,EAAY,KAAK;AAC5C;AAEO,SAASI,GAAcx9B,GAAgB;AACnC,SAAAA,IAASy9B,GAAiBz9B,CAAM,IAAI;AAC/C;AAEgB,SAAA09B,GAAUhpB,GAAmBsnB,GAAwB;AAKjE,SAJItnB,EAAK,QAAQmmB,MAIbgC,GAAcnoB,CAAI,KAAKooB,GAAmBpoB,CAAI,IACvC,YAGPA,EAAK,KAAK,SAAS,kBAAkB,IAC9B,YAGPA,EAAK,cAAc,UACZ,WAGPA,EAAK,cAAc,YACZ,YAGPsnB,EAAU,IAAItnB,EAAK,GAAG,IACf,SAGJ;AACX;AAEO,SAASipB,GAAQtqB,GACpBuqB,GACAC,GACAC,GAA+B;;AAkB3B,MAfAA,EAAoB;AAAA,IAChB,CAAC1b,MACG/O,EAAK,OAAO,WAAW+O,CAAM,KAAK/O,EAAK,OAAO,WAAW+O,CAAM;AAAA,EAAA,KAOvEyb,EAAqB,SAASxqB,EAAK,MAAM,KAMzCA,EAAK,OAAO,WAAWwnB,EAAiB,KACxCxnB,EAAK,OAAO,WAAWwnB,EAAiB;AAEjC;AAGX,QAAMkD,IAAiB1qB,EAAK,OAAO,MAAM,GAAG;AAC5C,EAAA0qB,EAAe,IAAI;AACb,QAAAC,IAAuBD,EAAe,KAAK,GAAG,GAC9CE,IAAoBp3B,GAAM,aAAam3B,CAAoB,GAG3DE,IAAaN,EAAUvqB,EAAK,MAAM;AACxC,MACI6qB,EAAW,KAAK,SAAS,iBAAiB,OAC1CC,KAAAn4B,KAAAH,IAAA+3B,EAAUI,CAAoB,MAA9B,gBAAAn4B,EAAiC,SAAjC,gBAAAG,EAAuC,SAAvC,QAAAm4B,EAA6C,SAAS;AAE/C;AAMX,MAAID,EAAW,KAAK,SAAS,kBAAkB;AACpC,WAAA,CAACD,GAAmB,QAAQ;AAGvC,QAAMG,IACFR,EAAUvqB,EAAK,MAAM,EAAE,KAAK,SAAS,iBAAiB;AAE1D,MAAI,CAAC+qB,KAAwBF,EAAW,KAAK,SAAS,iBAAiB;AACnE,WAAO,CAACr3B,GAAM,aAAawM,EAAK,MAAM,GAAG,OAAO;AAIpD,MAAI+qB,GAAsB;AACtB,UAAMC,IAAiBhrB,EAAK,OAAO,MAAM,GAAG;AAC5C,WAAO,CAACgrB,EAAeA,EAAe,SAAS,CAAC,GAAG,OAAO;AAAA,EAAA;AAG9D,SAAO,CAACx3B,GAAM,aAAawM,EAAK,MAAM,GAAG,QAAQ;AACrD;AAEgB,SAAAirB,GAAajrB,GAAiBuqB,GAAwCW,GAA2C;AACvH,QAAAC,IAAqB,CAACC,MAAsC;;AACxD,UAAAC,IAAWD,EAAO,MAAM,GAAG;AACjC,aAAS/oB,IAAI,GAAGA,KAAKgpB,EAAS,QAAQhpB,KAAK;AACvC,YAAMipB,IAAYD,EAAS,MAAM,GAAGhpB,CAAC,EAAE,KAAK,GAAG,GACzCkpB,KAAa/4B,IAAA04B,EAAiBI,CAAS,MAA1B,gBAAA94B,EAA6B;AAChD,UAAI+4B,EAAmB,QAAAA;AAAA,IAAA;AAEpB,aAAA54B,IAAA43B,EAAUa,CAAM,MAAhB,gBAAAz4B,EAAmB,eAAc;AAAA,EAC5C,GAEM64B,IAAmBL,EAAmBnrB,EAAK,MAAM,GACjDyrB,IAAmBN,EAAmBnrB,EAAK,MAAM;AAEvD,SAAO,CAACwrB,GAAkBC,CAAgB,EAAE;AAAA,IAAS;AAAA;AAAA,EAAgB,IAAI,WACnE,CAACD,GAAkBC,CAAgB,EAAE;AAAA,IAAS;AAAA;AAAA,MAAsB,YAChE;AACd;AAEO,SAASC,GACZC,GACAC,GACAC,GACAvD,GACAwD,GACAvD,GACAC,GACAE,GACAC,GACAC,GACAmD,GACAC,GACAC,GACoB;;AACpB,QAAMC,IAAqB,CAAC,GAEtBzD,IAA0B,CAACpkC,KAAiBmjC,EAAiB;AAEnE,MAAI,CAACc,KAAcwD,KAAc,CAAC3B,GAAc2B,CAAU,GAAI;AAC1D,IAAAI,EAAS,KAAK;AAAA,MACV,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,UAAU,EAAC,GAAG,GAAG,GAAG,EAAC;AAAA,MACrB,OAAO;AAAA,QACH,OAAO;AAAA,QACP,QAAQ;AAAA,MACZ;AAAA,MACA,gBAAgB1D,IAAe2D,EAAS,QAAQA,EAAS;AAAA,MACzD,gBAAgB3D,IAAe2D,EAAS,OAAOA,EAAS;AAAA,MACxD,YAAY;AAAA,MACZ,WAAW;AAAA,IAAA,CACd,GACDD,EAAS,KAAK;AAAA,MACV,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,UAAU1D,IAAe,EAAC,GAAG,IAAI,GAAG,EAAC,IAAI,EAAC,GAAG,GAAG,GAAG,GAAE;AAAA,MACrD,OAAO;AAAA,QACH,OAAO;AAAA,QACP,QAAQ;AAAA,MACZ;AAAA,MACA,gBAAgBA,IAAe2D,EAAS,QAAQA,EAAS;AAAA,MACzD,gBAAgB3D,IAAe2D,EAAS,OAAOA,EAAS;AAAA,MACxD,YAAY;AAAA,MACZ,WAAW;AAAA,IAAA,CACd,GACDD,EAAS,KAAK;AAAA,MACV,IAAI;AAAA,MACJ,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,QACF,MAAM;AAAA,UACF,UAAU;AAAA,YACN,cAAc;AAAA,UAAA;AAAA,QAEtB;AAAA,QACA,YAAY;AAAA,QACZ,UAAU;AAAA,QACV,OAAO;AAAA,MAAA;AAAA,IACX,CACH;AAED;AAAA,EAAA;AAGJ,QAAMrD,IAAaR;AAAA,IACfC;AAAA,IACAC;AAAA,IACAC;AAAA,IACAC;AAAA,IACAC;AAAA,IACAC;AAAA,IACAC;AAAA,EACJ,GAEMsC,IAA4C,CAAC,GAC7CkB,IAAW9D,EAAU,YAAY,CAAC,GAClC+D,IAAcD,EAAS,IAAI,CAACE,MAAMA,EAAE,OAAO,GAC3C7B,IAAsB4B,EACvB,OAAO,CAACC,MAAMA,EAAE,KAAK,SAAS,qBAAqB,CAAC,EACpD,IAAI,CAACA,MAAMA,EAAE,SAAS,GAAG,GAExB/B,IAAY,OAAO;AAAA,IACrBjC,EAAU,MAAM,OAAOM,CAAa,EAAE,IAAI,CAACvnB,MAAS,CAACA,EAAK,KAAKA,CAAI,CAAC;AAAA,EACxE;AACA,aAAW2nB,KAAWoD;AAClB,QACI,CAAC1D,EAAaM,EAAQ,QAAQ,GAAG,KACjC,CAACL,EAAU,IAAIK,EAAQ,QAAQ,GAAG,GACpC;AACE,QACIr2B,KAAAH,IAAAw2B,EAAQ,QAAQ,aAAhB,gBAAAx2B,EAA0B,SAA1B,gBAAAG,EAAgC,UAChC,oCAEA83B,EAAoB,KAAKzB,EAAQ,QAAQ,SAAS,GAAG;AAG9C,iBAAArB,KAAWqB,EAAQ;AACT,QAAAkC,EAAAvD,CAAO,IAAIqB,EAAQ;AAGlC,YAAAuD,IAAavD,EAAQ,QAAQ,KAC7BwD,IAAY3D,EAAW,KAAK0D,CAAU,GACtCE,IAAazD,EAAQ,UACrBA,EAAQ,QAAQA,EAAQ,QAAQ,SAAS,CAAC,IAC1C,QAEA0D,IAAeC,GAAoB3D,EAAQ,OAAO;AAExD,MAAAkD,EAAS,KAAK;AAAA,QACV,IAAIK;AAAA,QACJ,MAAM;AAAA,QACN,YAAAE;AAAA,QACA,UAAUrD;AAAA,UACNoD;AAAA,UACAC,IAAa5D,EAAW,KAAK4D,CAAU,IAAI;AAAA,QAC/C;AAAA,QACA,OAAO;AAAA,UACH,OACIF,MAAe/E,MAAqBgB,IAC9BhkC,GAAW,wBAAwB,OACnCgoC,EAAU,QAAQ;AAAA,UAC5B,QACID,MAAe/E,MAAqB,CAACgB,IAC/BhkC,GAAW,yBAAyB,OACpCgoC,EAAU,SAAS;AAAA,QACjC;AAAA,QACA,MAAM;AAAA,UACF,aAAa;AAAA,UACb,OAAOE;AAAA,UACP,UAAU1D,EAAQ,QAAQ;AAAA,UAC1B,QAAQA,EAAQ,QAAQ,WAClBuB,EAAUvB,EAAQ,QAAQ,SAAS,GAAG,EAAE,SACxC;AAAA,QACV;AAAA,QACA,OAAO,eAAe0D,CAAY;AAAA,MAAA,CAC9B;AAAA,IAAA;AAIhB,aAAWrrB,KAAQinB,EAAU,MAAM,OAAOM,CAAa;AACnD,QAAI,CAACL,EAAY,SAASlnB,EAAK,GAAG,GAAG;AACjC,YAAMmrB,IAAY3D,EAAW,KAAKxnB,EAAK,GAAG;AAC1C,UAAIurB,IAAW;AACX,MAAAC,GAAmBxrB,CAAI,IACZurB,IAAA,QACJvrB,EAAK,KAAK,SAAS,cAAc,IAC7BurB,IAAA,YACJvrB,EAAK,SAAS,uBACVurB,IAAA;AAGT,YAAAE,IAAQzC,GAAUhpB,GAAMsnB,CAAS,GAGjCoE,IACFhB,OACAiB,KAAAlC,IAAAzpB,EAAK,SAAL,gBAAAypB,EAAW,SAAX,gBAAAkC,EAAiB,SAAS,SAC1BvC,EAAoB;AAAA,QAAK,CAAC1b,MACtB1N,EAAK,IAAI,WAAW0N,IAAS,GAAG;AAAA,MACpC;AACJ,MAAAmd,EAAS,KAAK;AAAA,QACV,IAAI7qB,EAAK;AAAA,QACT,MAAMurB;AAAA,QACN,UAAUxD;AAAA,UACNoD;AAAA,UACAtB,EAAiB7pB,EAAK,GAAG,IACnBwnB,EAAW,KAAKqC,EAAiB7pB,EAAK,GAAG,EAAE,GAAG,IAC9C;AAAA,QACV;AAAA,QACA,OAAO;AAAA,UACH,OAAOynB,GAAaznB,CAAI,IAAI;AAAA,UAC5B,QAAQ0nB,GAAc1nB,CAAI,IAAI;AAAA,QAClC;AAAA,QACA,gBAAgBmnB,IAAe2D,EAAS,QAAQA,EAAS;AAAA,QACzD,gBAAgB3D,IAAe2D,EAAS,OAAOA,EAAS;AAAA,QACxD,YAAYjB,EAAiB7pB,EAAK,GAAG,IAC/B6pB,EAAiB7pB,EAAK,GAAG,EAAE,MAC3B;AAAA,QACN,WAAWurB,MAAa,SAAS,CAACG,IAAiB;AAAA,QACnD,MAAM;AAAA,UACF,MAAA1rB;AAAA,UACA,QAAQ6pB,EAAiB7pB,EAAK,GAAG,IAAI6pB,EAAiB7pB,EAAK,GAAG,IAAI;AAAA,UAClE,aACI4rB,KAAAC,KAAAC,IAAAjC,EAAiB7pB,EAAK,GAAG,MAAzB,gBAAA8rB,EAA4B,aAA5B,gBAAAD,EAAsC,SAAtC,gBAAAD,EAA4C,cAC5CpB;AAAA,UACJ,UACIuB,KAAAC,KAAAC,IAAApC,EAAiB7pB,EAAK,GAAG,MAAzB,gBAAAisB,EAA4B,aAA5B,gBAAAD,EAAsC,SAAtC,gBAAAD,EAA4C,WAAUxB;AAAA,UAC1D,cACI2B,KAAArC,EAAiB7pB,EAAK,GAAG,MAAzB,gBAAAksB,GAA4B,SAAQlpC,KAAiBgd,EAAK,OAC1D,CAACA,EAAK,KAAK,SAAS,kBAAkB;AAAA,UAC1C,OAAAyrB;AAAA,UACA,YAAYU;AAAA,YACRnsB;AAAA,YACA6pB;AAAA,YACAxC;AAAA,YACAuD;AAAA,UACJ;AAAA,UACA,YAAYc;AAAA,UACZ,eAAetD,GAAmBpoB,CAAI,IAChC,mBACA;AAAA,UACN,aAAaA,EAAK;AAAA,UAClB,QAAQA,EAAK;AAAA,QACjB;AAAA,QACA,OACIA,EAAK,SAAS,qBACR,eAAeyrB,CAAK,oBACpB;AAAA,MAAA,CACb;AAAA,IAAA;AAIT,QAAMW,IAA0BpB,EAC3B,OAAO,CAACC,MAAMA,EAAE,QAAQ,EACxB,IAAI,CAACA,MAAMA,EAAE,SAAS,GAAG,GACxBlsB,IAAQkoB,EAAU,SAAS,CAAC;AAElC,aAAWtoB,KAAQI,GAAO;AACtB,UAAM8oB,IAAUC;AAAA,MACZnpB,EAAK;AAAA,MACLA,EAAK;AAAA,MACL0oB;AAAA,MACAH;AAAA,IACJ;AACA,QAAIW,GAAS;AACT,YAAMwE,IAAYzC,GAAajrB,GAAMuqB,GAAWW,CAAgB;AAChE,MAAAgB,EAAS,KAAK;AAAA,QACV,IAAIhD,EAAQ,SAAS,MAAMA,EAAQ;AAAA,QACnC,QAAQA,EAAQ;AAAA,QAChB,QAAQA,EAAQ;AAAA,QAChB,MAAM;AAAA,QACN,WAAW2D,GAAmBtC,EAAUrB,EAAQ,MAAM,CAAC,IACjD,KACA;AAAA,UACE,IAAI,aAAaqB,EAAUrB,EAAQ,MAAM,EAAE,cAAayE,KAAApD,EAAUrB,EAAQ,MAAM,EAAE,eAA1B,gBAAAyE,GAAsC,sBAAsB;AAAA,UACpH,MAAMC,GAAW;AAAA,UACjB,OAAOF,IAAY,mBAAmBA,CAAS,MAAM;AAAA,QACzD;AAAA,QACJ,MAAM;AAAA,UACF,SACI,CAAC3B,KACDC,KACA1B;AAAA,YACItqB;AAAA,YACAuqB;AAAA,YACAkD;AAAA,YACAhD;AAAA,UACJ;AAAA,UACJ,eACIF,EAAUvqB,EAAK,MAAM,EAAE,KAAK,SAAS,cAAc,KACnDuqB,EAAUvqB,EAAK,MAAM,EAAE,KAAK,SAAS,cAAc,KACnDA,EAAK,OAAO,WAAWwnB,EAAiB;AAAA,UAC5C,OAAOkG;AAAA,UACP,QAAS1tB,EAAa;AAAA,QAC1B;AAAA,QACA,OAAO;AAAA,UACH,QAAQ;AAAA,QAAA;AAAA,MACZ,CACH;AAAA,IAAA;AAAA,EACL;AAGG,SAAAksB;AACX;AAEO,SAASW,GAAmBxrB,GAAmB;AAClD,SAAO,CAAC,oBAAoB,uBAAuB,8BAA8B,iBAAiB,EAAE;AAAA,IAAK,CAACwsB,MACtGxsB,EAAK,KAAK,SAASwsB,CAAC;AAAA,EACxB;AACJ;AAEO,SAASlB,GAAoB3D,GAAkB;AAC9C,SAAAA,EAAQ,QAAQ3kC,KAAiBmjC,KAC1B,YAGPwB,EAAQ,KAAK,SAAS,qBAAqB,IACpC,YAGPA,EAAQ,eAAe,UAChB,WAGJ;AACX;AAEO,SAASwE,GACZnsB,GACA6pB,GACAxC,GACAuD,GACF;;AAKM,SAJA,OAAO,OAAOvD,CAAY,EAAE,SAASrnB,EAAK,GAAG,KAI7CooB,GAAmBpoB,CAAI,IAChB,KAIPA,EAAK,KAAK,SAAS,kBAAkB,OACrC1O,KAAAH,IAAA04B,EAAiB7pB,EAAK,GAAG,MAAzB,gBAAA7O,EAA4B,QAA5B,gBAAAG,EAAiC,QAAQtO,IAAgB,SACzDgd,EAAK,OACL4qB;AAER;AAKO,SAAS6B,GAAa/vB,GAAkB;AAE3C,QAAMgwB,IADWhwB,EAAM,MAAM,IAAI,CAACsD,MAASA,EAAK,GAAG,EACzB,OAAO,CAAC2sB,MACvB,CAACjwB,EAAM,MAAM,KAAK,CAACiC,MAASA,EAAK,WAAWguB,CAAG,CACzD;AACM,SAAAjwB,EAAM,MAAM,OAAO,CAACsD,MAAS0sB,EAAS,SAAS1sB,EAAK,GAAG,CAAC;AACnE;AAQgB,SAAA4sB,GAAoBlwB,GAAkB4pB,GAAkB;AACpE,MAAKA;AAGE,WAAA5pB,EAAM,MAAM,OAAO,CAACiC,MAASA,EAAK,WAAW2nB,KAAW3nB,EAAK,MAAM;AAC9E;AASgB,SAAAkuB,GAAiBnwB,GAAkBowB,GAA0B;AACzE,MAAI/tB,GAAoBguB,GAA8BC,IAAqB,CAACF,EAAY,GAAG;AAExF,KAAA;AAIK,QAFI/tB,IAAAiuB,EAAS,QAAQ,CAACL,MAAQC,GAAoBlwB,GAAOiwB,CAAG,CAAC,EAAE,OAAO,OAAO,GAE7E5tB,EAAM,WAAW;AACjB,aAAO,CAAC;AAEZ,IAAAiuB,IAAWjuB,EAAM,IAAI,CAACJ,MAASA,EAAK,MAAM,GAC1BouB,IAAArwB,EAAM,MAAM,OAAO,CAACsD,MAASgtB,EAAS,SAAShtB,EAAK,GAAG,KAAKA,EAAK,IAAI;AAAA,EAAA,SAChF,CAAC+sB,EAAc;AAEjB,SAAAA;AACX;AASgB,SAAAE,GAAkCC,GAA0BC,GAAyBC,GAAiB;AAClH,MAAI,CAACA;AACM,WAAA;AAGP,MAAAC,IAAwBZ,GAAaS,CAAa,GAClDI,IAAuBb,GAAaU,CAAY;AAGhD,MAAAE,EAAsB,WAAWC,EAAqB;AAC/C,WAAA;AAIX,MAAIC,IAAY;AAIb,KAAA;AAIK,QAHJD,IAAuBA,EAAqB,QAAQ,CAACttB,MAAS6sB,GAAiBM,GAAcntB,CAAI,CAAC,GAG9FstB,EAAqB,KAAK,CAACttB,MAAcA,EAAK,KAAK,OAAOotB,CAAM;AACzD,aAAA;AAKP,QAFJC,IAAwBA,EAAsB,QAAQ,CAACrtB,MAAS6sB,GAAiBK,GAAeltB,CAAI,CAAC,GAEjGqtB,EAAsB,WAAWC,EAAqB;AAC/C,aAAA;AAGX,eAAWE,KAAmBF,GAAsB;AAC1C,YAAAG,IAAeJ,EAAsB,KAAK,CAACK,MAAA;;AAAa,iBAAAv8B,IAAAu8B,EAAS,SAAT,gBAAAv8B,EAAe,UAAOG,IAAAk8B,EAAgB,SAAhB,gBAAAl8B,EAAsB;AAAA,OAAE,GACtGq8B,KAAgBF,KAAA,gBAAAA,EAAc,SAA+B,CAAC,GAC9DG,IAAmBJ,EAAgB,QAA+B,CAAC;AASzE,UANI,CAACC,KACE,OAAO,KAAKE,CAAa,EAAE,WAAW,OAAO,KAAKC,CAAgB,EAAE,UAKvE,CAAC3H,GAAQ0H,GAAeC,CAAgB;AACjC,eAAA;AAAA,IACX;AAAA,EAEJ,SACKP,EAAsB,UAAUC,EAAqB,UAAUC,MAAc;AAEtF,SAAIA,KAAa,KACb,QAAQ,KAAK,iFAAiF,GACvF,MAGJ;AACX;AAKA,MAAeM,KAAA;AAAA,EACX,oBAAArC;AAAA,EACA,qBAAAF;AAAA,EACA,kBAAAa;AAAA,EACA,eAAA9B;AAAA,EACA,oBAAArD;AAAA,EACA,iBAAAe;AAAA,EACA,cAAAN;AAAA,EACA,eAAAC;AAAA,EACA,YAAAQ;AAAA,EACA,eAAAC;AAAA,EACA,oBAAAC;AAAA,EACA,oBAAAN;AAAA,EACA,YAAAS;AAAA,EACA,eAAAO;AAAA,EACA,WAAAE;AAAA,EACA,SAAAC;AAAA,EACA,cAAAW;AAAA,EACA,kBAAAxD;AAAA,EACA,gBAAAM;AAAA,EACA,kBAAAC;AAAA,EACA,gBAAAG;AAAA,EACA,gBAAAC;AACJ;","x_google_ignoreList":[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184]}