npm - @logicflow/layout - Versions diffs - 2.0.2 → 2.0.4 - Mend

@logicflow/layout 2.0.2 → 2.0.4

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 (11) hide show

package/dist/index.min.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index.min.js","sources":["../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/eq.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_assocIndexOf.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_ListCache.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheClear.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheDelete.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheGet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheHas.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_freeGlobal.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_root.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Symbol.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseGetTag.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getRawTag.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_objectToString.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isObject.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isFunction.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isMasked.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_coreJsData.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_toSource.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getNative.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsNative.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getValue.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Map.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nativeCreate.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Hash.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashClear.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashDelete.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashGet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashHas.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getMapData.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isKeyable.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_MapCache.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheClear.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheDelete.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheGet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheHas.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Stack.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackClear.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackDelete.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackGet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackHas.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayEach.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_defineProperty.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseAssignValue.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_assignValue.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copyObject.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isObjectLike.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isArguments.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsArguments.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isBuffer.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/stubFalse.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isIndex.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isLength.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseUnary.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nodeUtil.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isTypedArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsTypedArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayLikeKeys.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseTimes.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isPrototype.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_overArg.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseKeys.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nativeKeys.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isArrayLike.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/keys.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseKeysIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nativeKeysIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/keysIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneBuffer.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copyArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayFilter.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/stubArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getSymbols.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayPush.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getPrototype.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getSymbolsIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseGetAllKeys.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getAllKeys.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Set.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getTag.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_DataView.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Promise.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_WeakMap.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Uint8Array.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneArrayBuffer.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneTypedArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_initCloneByTag.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneDataView.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneRegExp.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneSymbol.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseCreate.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_initCloneObject.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isMap.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsMap.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseClone.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseAssign.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseAssignIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copySymbols.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copySymbolsIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getAllKeysIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_initCloneArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/clone.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/constant.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/graphlib.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseFor.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createBaseFor.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseForOwn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseEach.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createBaseEach.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/identity.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_castFunction.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/forEach.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/each.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_SetCache.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_setCacheAdd.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_setCacheHas.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cacheHas.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_equalArrays.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arraySome.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_setToArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_equalByTag.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapToArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsEqualDeep.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_equalObjects.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsEqual.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isStrictComparable.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_matchesStrictComparable.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseMatches.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsMatch.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getMatchData.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isSymbol.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isKey.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_memoizeCapped.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/memoize.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayMap.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/toString.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseToString.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_castPath.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stringToPath.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_toKey.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseGet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hasPath.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/hasIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseHasIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseMatchesProperty.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/get.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseProperty.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/property.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_basePropertyDeep.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIteratee.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/filter.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseFilter.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/has.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseHas.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isEmpty.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isUndefined.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseMap.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/map.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/reduce.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayReduce.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseReduce.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stringSize.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_asciiSize.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hasUnicode.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_unicodeSize.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/size.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isString.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/transform.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseFlatten.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isFlattenable.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_overRest.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_apply.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_setToString.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseSetToString.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_shortOut.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseRest.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseFindIndex.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIndexOf.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsNaN.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_strictIndexOf.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/noop.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseUniq.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayIncludes.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayIncludesWith.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isArrayLikeObject.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/union.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/values.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseValues.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/lodash.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/graph.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/index.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/version.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/json.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/components.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/data/priority-queue.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/dijkstra.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/dijkstra-all.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/tarjan.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/find-cycles.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/floyd-warshall.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/topsort.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/is-acyclic.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/dfs.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/postorder.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/preorder.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/prim.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/index.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/index.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/lodash.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isIterateeCall.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseTrim.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_trimmedEndIndex.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/toFinite.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/toNumber.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/findIndex.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/toInteger.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/flatten.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseExtremum.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_assignMergeValue.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_safeGet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseMergeDeep.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isPlainObject.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/toPlainObject.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseLt.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_basePickBy.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createRange.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseRange.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_compareMultiple.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_compareAscending.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseOrderBy.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseSortBy.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/cloneDeep.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/defaults.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/find.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createFind.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/forIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/last.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/mapValues.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/max.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseGt.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/merge.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseMerge.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createAssigner.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/min.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/minBy.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/now.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/pick.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_basePick.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_flatRest.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/range.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/sortBy.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/uniqueId.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/zipObject.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseZipObject.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/data/list.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/greedy-fas.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/acyclic.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/util.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/normalize.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/util.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/feasible-tree.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/network-simplex.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/index.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/parent-dummy-chains.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/nesting-graph.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/add-border-segments.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/coordinate-system.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/init-order.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/cross-count.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/barycenter.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/resolve-conflicts.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/sort.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/sort-subgraph.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/build-layer-graph.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/add-subgraph-constraints.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/index.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/position/bk.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/position/index.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/layout.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/debug.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/version.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/index.js","../src/dagre.ts"],"sourcesContent":["/*\n Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n \n @static\n * @memberOf _\n * @since 4.0.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 _.eq(object, object);\n * // => true\n \n _.eq(object, other);\n * // => false\n \n _.eq('a', 'a');\n * // => true\n \n _.eq('a', Object('a'));\n * // => false\n \n _.eq(NaN, NaN);\n * // => true\n /\nfunction eq(value, other) {\n return value === other \|\| (value !== value && other !== other);\n}\n\nmodule.exports = eq;\n","var eq = require('./eq');\n\n/\n Gets the index at which the `key` is found in `array` of key-value pairs.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {} key The key to search for.\n @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n}\n\nmodule.exports = assocIndexOf;\n","var listCacheClear = require('./_listCacheClear'),\n listCacheDelete = require('./_listCacheDelete'),\n listCacheGet = require('./_listCacheGet'),\n listCacheHas = require('./_listCacheHas'),\n listCacheSet = require('./_listCacheSet');\n\n/\n Creates an list cache object.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction ListCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nmodule.exports = ListCache;\n","/\n Removes all key-value entries from the list cache.\n \n @private\n * @name clear\n * @memberOf ListCache\n /\nfunction listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n}\n\nmodule.exports = listCacheClear;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/* Used for built-in method references. /\nvar arrayProto = Array.prototype;\n\n/* Built-in value references. /\nvar splice = arrayProto.splice;\n\n/\n Removes `key` and its value from the list cache.\n \n @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n --this.size;\n return true;\n}\n\nmodule.exports = listCacheDelete;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/\n Gets the list cache value for `key`.\n \n @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n}\n\nmodule.exports = listCacheGet;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/*\n Checks if a list cache value for `key` exists.\n \n @private\n * @name has\n * @memberOf ListCache\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 listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n}\n\nmodule.exports = listCacheHas;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/\n Sets the list cache `key` to `value`.\n \n @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the list cache instance.\n /\nfunction listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n ++this.size;\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n}\n\nmodule.exports = listCacheSet;\n","/* Detect free variable `global` from Node.js. /\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nmodule.exports = freeGlobal;\n","var freeGlobal = require('./_freeGlobal');\n\n/* Detect free variable `self`. /\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/* Used as a reference to the global object. /\nvar root = freeGlobal \|\| freeSelf \|\| Function('return this')();\n\nmodule.exports = root;\n","var root = require('./_root');\n\n/* Built-in value references. /\nvar Symbol = root.Symbol;\n\nmodule.exports = Symbol;\n","var Symbol = require('./_Symbol'),\n getRawTag = require('./_getRawTag'),\n objectToString = require('./_objectToString');\n\n/* `Object#toString` result references. /\nvar nullTag = '[object Null]',\n undefinedTag = '[object Undefined]';\n\n/* Built-in value references. /\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/\n The base implementation of `getTag` without fallbacks for buggy environments.\n \n @private\n * @param {} value The value to query.\n @returns {string} Returns the `toStringTag`.\n /\nfunction baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n}\n\nmodule.exports = baseGetTag;\n","var Symbol = require('./_Symbol');\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 Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n /\nvar nativeObjectToString = objectProto.toString;\n\n/* Built-in value references. /\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/\n A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n \n @private\n * @param {} value The value to query.\n @returns {string} Returns the raw `toStringTag`.\n /\nfunction getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag),\n tag = value[symToStringTag];\n\n try {\n value[symToStringTag] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag] = tag;\n } else {\n delete value[symToStringTag];\n }\n }\n return result;\n}\n\nmodule.exports = getRawTag;\n","/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/\n Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n /\nvar nativeObjectToString = objectProto.toString;\n\n/\n Converts `value` to a string using `Object.prototype.toString`.\n \n @private\n * @param {} value The value to convert.\n @returns {string} Returns the converted string.\n /\nfunction objectToString(value) {\n return nativeObjectToString.call(value);\n}\n\nmodule.exports = objectToString;\n","/\n Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\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 an object, else `false`.\n * @example\n \n _.isObject({});\n * // => true\n \n _.isObject([1, 2, 3]);\n * // => true\n \n _.isObject(_.noop);\n * // => true\n \n _.isObject(null);\n * // => false\n /\nfunction isObject(value) {\n var type = typeof value;\n return value != null && (type == 'object' \|\| type == 'function');\n}\n\nmodule.exports = isObject;\n","var baseGetTag = require('./_baseGetTag'),\n isObject = require('./isObject');\n\n/* `Object#toString` result references. /\nvar asyncTag = '[object AsyncFunction]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n proxyTag = '[object Proxy]';\n\n/\n Checks if `value` is classified as a `Function` object.\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 a function, else `false`.\n * @example\n \n _.isFunction(_);\n * // => true\n \n _.isFunction(/abc/);\n * // => false\n /\nfunction isFunction(value) {\n if (!isObject(value)) {\n return false;\n }\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 9 which returns 'object' for typed arrays and other constructors.\n var tag = baseGetTag(value);\n return tag == funcTag \|\| tag == genTag \|\| tag == asyncTag \|\| tag == proxyTag;\n}\n\nmodule.exports = isFunction;\n","var coreJsData = require('./_coreJsData');\n\n/* Used to detect methods masquerading as native. /\nvar maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO \|\| '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/\n Checks if `func` has its source masked.\n \n @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n /\nfunction isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n}\n\nmodule.exports = isMasked;\n","var root = require('./_root');\n\n/* Used to detect overreaching core-js shims. /\nvar coreJsData = root['__core-js_shared__'];\n\nmodule.exports = coreJsData;\n","/* Used for built-in method references. /\nvar funcProto = Function.prototype;\n\n/* Used to resolve the decompiled source of functions. /\nvar funcToString = funcProto.toString;\n\n/\n Converts `func` to its source code.\n \n @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n /\nfunction toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n}\n\nmodule.exports = toSource;\n","var baseIsNative = require('./_baseIsNative'),\n getValue = require('./_getValue');\n\n/\n Gets the native function at `key` of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {} Returns the function if it's native, else `undefined`.\n /\nfunction getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n}\n\nmodule.exports = getNative;\n","var isFunction = require('./isFunction'),\n isMasked = require('./_isMasked'),\n isObject = require('./isObject'),\n toSource = require('./_toSource');\n\n/*\n Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n /\nvar reRegExpChar = /[\\\\^$.+?()[\\]{}\|]/g;\n\n/** Used to detect host constructors (Safari). /\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\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 detect if a method is native. /\nvar reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty\|(function).?(?=\\\\\\()\| for .+?(?=\\\\\\])/g, '$1.?') + '$'\n);\n\n/\n The base implementation of `_.isNative` without bad shim checks.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n /\nfunction baseIsNative(value) {\n if (!isObject(value) \|\| isMasked(value)) {\n return false;\n }\n var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n}\n\nmodule.exports = baseIsNative;\n","/\n Gets the value at `key` of `object`.\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 getValue(object, key) {\n return object == null ? undefined : object[key];\n}\n\nmodule.exports = getValue;\n","var getNative = require('./_getNative'),\n root = require('./_root');\n\n/* Built-in method references that are verified to be native. /\nvar Map = getNative(root, 'Map');\n\nmodule.exports = Map;\n","var getNative = require('./_getNative');\n\n/ Built-in method references that are verified to be native. /\nvar nativeCreate = getNative(Object, 'create');\n\nmodule.exports = nativeCreate;\n","var hashClear = require('./_hashClear'),\n hashDelete = require('./_hashDelete'),\n hashGet = require('./_hashGet'),\n hashHas = require('./_hashHas'),\n hashSet = require('./_hashSet');\n\n/\n Creates a hash object.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction Hash(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nmodule.exports = Hash;\n","var nativeCreate = require('./_nativeCreate');\n\n/\n Removes all key-value entries from the hash.\n \n @private\n * @name clear\n * @memberOf Hash\n /\nfunction hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n}\n\nmodule.exports = hashClear;\n","/\n Removes `key` and its value from the hash.\n \n @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n}\n\nmodule.exports = hashDelete;\n","var nativeCreate = require('./_nativeCreate');\n\n/* Used to stand-in for `undefined` hash values. /\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\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 Gets the hash value for `key`.\n \n @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nmodule.exports = hashGet;\n","var nativeCreate = require('./_nativeCreate');\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 a hash value for `key` exists.\n \n @private\n * @name has\n * @memberOf Hash\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 hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nmodule.exports = hashHas;\n","var nativeCreate = require('./_nativeCreate');\n\n/* Used to stand-in for `undefined` hash values. /\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/\n Sets the hash `key` to `value`.\n \n @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the hash instance.\n /\nfunction hashSet(key, value) {\n var data = this.__data__;\n this.size += this.has(key) ? 0 : 1;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n}\n\nmodule.exports = hashSet;\n","var isKeyable = require('./_isKeyable');\n\n/\n Gets the data for `map`.\n \n @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {} Returns the map data.\n /\nfunction getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n}\n\nmodule.exports = getMapData;\n","/*\n Checks if `value` is suitable for use as unique object key.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n /\nfunction isKeyable(value) {\n var type = typeof value;\n return (type == 'string' \|\| type == 'number' \|\| type == 'symbol' \|\| type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n}\n\nmodule.exports = isKeyable;\n","var mapCacheClear = require('./_mapCacheClear'),\n mapCacheDelete = require('./_mapCacheDelete'),\n mapCacheGet = require('./_mapCacheGet'),\n mapCacheHas = require('./_mapCacheHas'),\n mapCacheSet = require('./_mapCacheSet');\n\n/\n Creates a map cache object to store key-value pairs.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction MapCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nmodule.exports = MapCache;\n","var Hash = require('./_Hash'),\n ListCache = require('./_ListCache'),\n Map = require('./_Map');\n\n/\n Removes all key-value entries from the map.\n \n @private\n * @name clear\n * @memberOf MapCache\n /\nfunction mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map \|\| ListCache),\n 'string': new Hash\n };\n}\n\nmodule.exports = mapCacheClear;\n","var getMapData = require('./_getMapData');\n\n/\n Removes `key` and its value from the map.\n \n @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n}\n\nmodule.exports = mapCacheDelete;\n","var getMapData = require('./_getMapData');\n\n/\n Gets the map value for `key`.\n \n @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction mapCacheGet(key) {\n return getMapData(this, key).get(key);\n}\n\nmodule.exports = mapCacheGet;\n","var getMapData = require('./_getMapData');\n\n/*\n Checks if a map value for `key` exists.\n \n @private\n * @name has\n * @memberOf MapCache\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 mapCacheHas(key) {\n return getMapData(this, key).has(key);\n}\n\nmodule.exports = mapCacheHas;\n","var getMapData = require('./_getMapData');\n\n/\n Sets the map `key` to `value`.\n \n @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the map cache instance.\n /\nfunction mapCacheSet(key, value) {\n var data = getMapData(this, key),\n size = data.size;\n\n data.set(key, value);\n this.size += data.size == size ? 0 : 1;\n return this;\n}\n\nmodule.exports = mapCacheSet;\n","var ListCache = require('./_ListCache'),\n stackClear = require('./_stackClear'),\n stackDelete = require('./_stackDelete'),\n stackGet = require('./_stackGet'),\n stackHas = require('./_stackHas'),\n stackSet = require('./_stackSet');\n\n/\n Creates a stack cache object to store key-value pairs.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction Stack(entries) {\n var data = this.__data__ = new ListCache(entries);\n this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nmodule.exports = Stack;\n","var ListCache = require('./_ListCache');\n\n/\n Removes all key-value entries from the stack.\n \n @private\n * @name clear\n * @memberOf Stack\n /\nfunction stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n}\n\nmodule.exports = stackClear;\n","/\n Removes `key` and its value from the stack.\n \n @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction stackDelete(key) {\n var data = this.__data__,\n result = data['delete'](key);\n\n this.size = data.size;\n return result;\n}\n\nmodule.exports = stackDelete;\n","/\n Gets the stack value for `key`.\n \n @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction stackGet(key) {\n return this.__data__.get(key);\n}\n\nmodule.exports = stackGet;\n","/*\n Checks if a stack value for `key` exists.\n \n @private\n * @name has\n * @memberOf Stack\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 stackHas(key) {\n return this.__data__.has(key);\n}\n\nmodule.exports = stackHas;\n","var ListCache = require('./_ListCache'),\n Map = require('./_Map'),\n MapCache = require('./_MapCache');\n\n/* Used as the size to enable large array optimizations. /\nvar LARGE_ARRAY_SIZE = 200;\n\n/\n Sets the stack `key` to `value`.\n \n @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the stack cache instance.\n /\nfunction stackSet(key, value) {\n var data = this.__data__;\n if (data instanceof ListCache) {\n var pairs = data.__data__;\n if (!Map \|\| (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n pairs.push([key, value]);\n this.size = ++data.size;\n return this;\n }\n data = this.__data__ = new MapCache(pairs);\n }\n data.set(key, value);\n this.size = data.size;\n return this;\n}\n\nmodule.exports = stackSet;\n","/\n A specialized version of `_.forEach` 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 * @returns {Array} Returns `array`.\n /\nfunction arrayEach(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n}\n\nmodule.exports = arrayEach;\n","var getNative = require('./_getNative');\n\nvar defineProperty = (function() {\n try {\n var func = getNative(Object, 'defineProperty');\n func({}, '', {});\n return func;\n } catch (e) {}\n}());\n\nmodule.exports = defineProperty;\n","var defineProperty = require('./_defineProperty');\n\n/\n The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\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 baseAssignValue(object, key, value) {\n if (key == '__proto__' && defineProperty) {\n defineProperty(object, key, {\n 'configurable': true,\n 'enumerable': true,\n 'value': value,\n 'writable': true\n });\n } else {\n object[key] = value;\n }\n}\n\nmodule.exports = baseAssignValue;\n","var baseAssignValue = require('./_baseAssignValue'),\n eq = require('./eq');\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 `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\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 assignValue(object, key, value) {\n var objValue = object[key];\n if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) \|\|\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n}\n\nmodule.exports = assignValue;\n","var assignValue = require('./_assignValue'),\n baseAssignValue = require('./_baseAssignValue');\n\n/*\n Copies properties of `source` to `object`.\n \n @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n /\nfunction copyObject(source, props, object, customizer) {\n var isNew = !object;\n object \|\| (object = {});\n\n var index = -1,\n length = props.length;\n\n while (++index < length) {\n var key = props[index];\n\n var newValue = customizer\n ? customizer(object[key], source[key], key, object, source)\n : undefined;\n\n if (newValue === undefined) {\n newValue = source[key];\n }\n if (isNew) {\n baseAssignValue(object, key, newValue);\n } else {\n assignValue(object, key, newValue);\n }\n }\n return object;\n}\n\nmodule.exports = copyObject;\n","/\n Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"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 object-like, else `false`.\n * @example\n \n _.isObjectLike({});\n * // => true\n \n _.isObjectLike([1, 2, 3]);\n * // => true\n \n _.isObjectLike(_.noop);\n * // => false\n \n _.isObjectLike(null);\n * // => false\n /\nfunction isObjectLike(value) {\n return value != null && typeof value == 'object';\n}\n\nmodule.exports = isObjectLike;\n","var baseIsArguments = require('./_baseIsArguments'),\n isObjectLike = require('./isObjectLike');\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/* Built-in value references. /\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/\n Checks if `value` is likely an `arguments` object.\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 an `arguments` object,\n * else `false`.\n * @example\n \n _.isArguments(function() { return arguments; }());\n * // => true\n \n _.isArguments([1, 2, 3]);\n * // => false\n /\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n !propertyIsEnumerable.call(value, 'callee');\n};\n\nmodule.exports = isArguments;\n","var baseGetTag = require('./_baseGetTag'),\n isObjectLike = require('./isObjectLike');\n\n/* `Object#toString` result references. /\nvar argsTag = '[object Arguments]';\n\n/\n The base implementation of `_.isArguments`.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an `arguments` object,\n /\nfunction baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nmodule.exports = baseIsArguments;\n","/\n Checks if `value` is classified as an `Array` object.\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 an array, else `false`.\n * @example\n \n _.isArray([1, 2, 3]);\n * // => true\n \n _.isArray(document.body.children);\n * // => false\n \n _.isArray('abc');\n * // => false\n \n _.isArray(_.noop);\n * // => false\n /\nvar isArray = Array.isArray;\n\nmodule.exports = isArray;\n","var root = require('./_root'),\n stubFalse = require('./stubFalse');\n\n/* Detect free variable `exports`. /\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/* Detect free variable `module`. /\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/* Detect the popular CommonJS extension `module.exports`. /\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/* Built-in value references. /\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/\n Checks if `value` is a buffer.\n \n @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n \n _.isBuffer(new Buffer(2));\n * // => true\n \n _.isBuffer(new Uint8Array(2));\n * // => false\n /\nvar isBuffer = nativeIsBuffer \|\| stubFalse;\n\nmodule.exports = isBuffer;\n","/\n This method returns `false`.\n \n @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n \n _.times(2, _.stubFalse);\n * // => [false, false]\n /\nfunction stubFalse() {\n return false;\n}\n\nmodule.exports = stubFalse;\n","/* Used as references for various `Number` constants. /\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/* Used to detect unsigned integer values. /\nvar reIsUint = /^(?:0\|[1-9]\\d)$/;\n\n/*\n Checks if `value` is a valid array-like index.\n \n @private\n * @param {} value The value to check.\n @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n /\nfunction isIndex(value, length) {\n var type = typeof value;\n length = length == null ? MAX_SAFE_INTEGER : length;\n\n return !!length &&\n (type == 'number' \|\|\n (type != 'symbol' && reIsUint.test(value))) &&\n (value > -1 && value % 1 == 0 && value < length);\n}\n\nmodule.exports = isIndex;\n","/* Used as references for various `Number` constants. /\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/\n Checks if `value` is a valid array-like length.\n \n Note: This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\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 valid length, else `false`.\n * @example\n \n _.isLength(3);\n * // => true\n \n _.isLength(Number.MIN_VALUE);\n * // => false\n \n _.isLength(Infinity);\n * // => false\n \n _.isLength('3');\n * // => false\n /\nfunction isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nmodule.exports = isLength;\n","/\n The base implementation of `_.unary` without support for storing metadata.\n \n @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n /\nfunction baseUnary(func) {\n return function(value) {\n return func(value);\n };\n}\n\nmodule.exports = baseUnary;\n","var freeGlobal = require('./_freeGlobal');\n\n/* Detect free variable `exports`. /\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/* Detect free variable `module`. /\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/* Detect the popular CommonJS extension `module.exports`. /\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/* Detect free variable `process` from Node.js. /\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/* Used to access faster Node.js helpers. /\nvar nodeUtil = (function() {\n try {\n // Use `util.types` for Node.js 10+.\n var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n if (types) {\n return types;\n }\n\n // Legacy `process.binding('util')` for Node.js < 10.\n return freeProcess && freeProcess.binding && freeProcess.binding('util');\n } catch (e) {}\n}());\n\nmodule.exports = nodeUtil;\n","var baseIsTypedArray = require('./_baseIsTypedArray'),\n baseUnary = require('./_baseUnary'),\n nodeUtil = require('./_nodeUtil');\n\n/ Node.js helper references. /\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/\n Checks if `value` is classified as a typed array.\n \n @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n \n _.isTypedArray(new Uint8Array);\n * // => true\n \n _.isTypedArray([]);\n * // => false\n /\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nmodule.exports = isTypedArray;\n","var baseGetTag = require('./_baseGetTag'),\n isLength = require('./isLength'),\n isObjectLike = require('./isObjectLike');\n\n/* `Object#toString` result references. /\nvar argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n objectTag = '[object Object]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n/* Used to identify `toStringTag` values of typed arrays. /\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/\n The base implementation of `_.isTypedArray` without Node.js optimizations.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n /\nfunction baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nmodule.exports = baseIsTypedArray;\n","var baseTimes = require('./_baseTimes'),\n isArguments = require('./isArguments'),\n isArray = require('./isArray'),\n isBuffer = require('./isBuffer'),\n isIndex = require('./_isIndex'),\n isTypedArray = require('./isTypedArray');\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 Creates an array of the enumerable property names of the array-like `value`.\n \n @private\n * @param {} value The value to query.\n @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n /\nfunction arrayLikeKeys(value, inherited) {\n var isArr = isArray(value),\n isArg = !isArr && isArguments(value),\n isBuff = !isArr && !isArg && isBuffer(value),\n isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n skipIndexes = isArr \|\| isArg \|\| isBuff \|\| isType,\n result = skipIndexes ? baseTimes(value.length, String) : [],\n length = result.length;\n\n for (var key in value) {\n if ((inherited \|\| hasOwnProperty.call(value, key)) &&\n !(skipIndexes && (\n // Safari 9 has enumerable `arguments.length` in strict mode.\n key == 'length' \|\|\n // Node.js 0.10 has enumerable non-index properties on buffers.\n (isBuff && (key == 'offset' \|\| key == 'parent')) \|\|\n // PhantomJS 2 has enumerable non-index properties on typed arrays.\n (isType && (key == 'buffer' \|\| key == 'byteLength' \|\| key == 'byteOffset')) \|\|\n // Skip index properties.\n isIndex(key, length)\n ))) {\n result.push(key);\n }\n }\n return result;\n}\n\nmodule.exports = arrayLikeKeys;\n","/\n The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n \n @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n /\nfunction baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n}\n\nmodule.exports = baseTimes;\n","/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/\n Checks if `value` is likely a prototype object.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n /\nfunction isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) \|\| objectProto;\n\n return value === proto;\n}\n\nmodule.exports = isPrototype;\n","/\n Creates a unary function that invokes `func` with its argument transformed.\n \n @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n /\nfunction overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n}\n\nmodule.exports = overArg;\n","var isPrototype = require('./_isPrototype'),\n nativeKeys = require('./_nativeKeys');\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 The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n /\nfunction baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n}\n\nmodule.exports = baseKeys;\n","var overArg = require('./_overArg');\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeKeys = overArg(Object.keys, Object);\n\nmodule.exports = nativeKeys;\n","var isFunction = require('./isFunction'),\n isLength = require('./isLength');\n\n/\n Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\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 array-like, else `false`.\n * @example\n \n _.isArrayLike([1, 2, 3]);\n * // => true\n \n _.isArrayLike(document.body.children);\n * // => true\n \n _.isArrayLike('abc');\n * // => true\n \n _.isArrayLike(_.noop);\n * // => false\n /\nfunction isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n}\n\nmodule.exports = isArrayLike;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n baseKeys = require('./_baseKeys'),\n isArrayLike = require('./isArrayLike');\n\n/\n Creates an array of the own enumerable property names of `object`.\n \n Note: Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\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 names.\n * @example\n \n function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n \n Foo.prototype.c = 3;\n \n _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n \n _.keys('hi');\n * // => ['0', '1']\n /\nfunction keys(object) {\n return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nmodule.exports = keys;\n","var isObject = require('./isObject'),\n isPrototype = require('./_isPrototype'),\n nativeKeysIn = require('./_nativeKeysIn');\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 The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n /\nfunction baseKeysIn(object) {\n if (!isObject(object)) {\n return nativeKeysIn(object);\n }\n var isProto = isPrototype(object),\n result = [];\n\n for (var key in object) {\n if (!(key == 'constructor' && (isProto \|\| !hasOwnProperty.call(object, key)))) {\n result.push(key);\n }\n }\n return result;\n}\n\nmodule.exports = baseKeysIn;\n","/\n This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n /\nfunction nativeKeysIn(object) {\n var result = [];\n if (object != null) {\n for (var key in Object(object)) {\n result.push(key);\n }\n }\n return result;\n}\n\nmodule.exports = nativeKeysIn;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n baseKeysIn = require('./_baseKeysIn'),\n isArrayLike = require('./isArrayLike');\n\n/\n Creates an array of the own and inherited enumerable property names of `object`.\n \n Note: Non-object values are coerced to objects.\n \n @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n \n function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n \n Foo.prototype.c = 3;\n \n _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n /\nfunction keysIn(object) {\n return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n}\n\nmodule.exports = keysIn;\n","var root = require('./_root');\n\n/* Detect free variable `exports`. /\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/* Detect free variable `module`. /\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/* Detect the popular CommonJS extension `module.exports`. /\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/* Built-in value references. /\nvar Buffer = moduleExports ? root.Buffer : undefined,\n allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined;\n\n/\n Creates a clone of `buffer`.\n \n @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n /\nfunction cloneBuffer(buffer, isDeep) {\n if (isDeep) {\n return buffer.slice();\n }\n var length = buffer.length,\n result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n buffer.copy(result);\n return result;\n}\n\nmodule.exports = cloneBuffer;\n","/\n Copies the values of `source` to `array`.\n \n @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n /\nfunction copyArray(source, array) {\n var index = -1,\n length = source.length;\n\n array \|\| (array = Array(length));\n while (++index < length) {\n array[index] = source[index];\n }\n return array;\n}\n\nmodule.exports = copyArray;\n","/\n A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n /\nfunction arrayFilter(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result[resIndex++] = value;\n }\n }\n return result;\n}\n\nmodule.exports = arrayFilter;\n","/\n This method returns a new empty array.\n \n @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n \n var arrays = _.times(2, _.stubArray);\n \n console.log(arrays);\n * // => [[], []]\n \n console.log(arrays[0] === arrays[1]);\n * // => false\n /\nfunction stubArray() {\n return [];\n}\n\nmodule.exports = stubArray;\n","var arrayFilter = require('./_arrayFilter'),\n stubArray = require('./stubArray');\n\n/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Built-in value references. /\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/\n Creates an array of the own enumerable symbols of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n /\nvar getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n if (object == null) {\n return [];\n }\n object = Object(object);\n return arrayFilter(nativeGetSymbols(object), function(symbol) {\n return propertyIsEnumerable.call(object, symbol);\n });\n};\n\nmodule.exports = getSymbols;\n","/\n Appends the elements of `values` to `array`.\n \n @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n /\nfunction arrayPush(array, values) {\n var index = -1,\n length = values.length,\n offset = array.length;\n\n while (++index < length) {\n array[offset + index] = values[index];\n }\n return array;\n}\n\nmodule.exports = arrayPush;\n","var overArg = require('./_overArg');\n\n/* Built-in value references. /\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\nmodule.exports = getPrototype;\n","var arrayPush = require('./_arrayPush'),\n getPrototype = require('./_getPrototype'),\n getSymbols = require('./_getSymbols'),\n stubArray = require('./stubArray');\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/\n Creates an array of the own and inherited enumerable symbols of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n /\nvar getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n var result = [];\n while (object) {\n arrayPush(result, getSymbols(object));\n object = getPrototype(object);\n }\n return result;\n};\n\nmodule.exports = getSymbolsIn;\n","var arrayPush = require('./_arrayPush'),\n isArray = require('./isArray');\n\n/\n The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n /\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\nmodule.exports = baseGetAllKeys;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n getSymbols = require('./_getSymbols'),\n keys = require('./keys');\n\n/\n Creates an array of own enumerable property names and symbols of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n /\nfunction getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n}\n\nmodule.exports = getAllKeys;\n","var getNative = require('./_getNative'),\n root = require('./_root');\n\n/ Built-in method references that are verified to be native. /\nvar Set = getNative(root, 'Set');\n\nmodule.exports = Set;\n","var DataView = require('./_DataView'),\n Map = require('./_Map'),\n Promise = require('./_Promise'),\n Set = require('./_Set'),\n WeakMap = require('./_WeakMap'),\n baseGetTag = require('./_baseGetTag'),\n toSource = require('./_toSource');\n\n/* `Object#toString` result references. /\nvar mapTag = '[object Map]',\n objectTag = '[object Object]',\n promiseTag = '[object Promise]',\n setTag = '[object Set]',\n weakMapTag = '[object WeakMap]';\n\nvar dataViewTag = '[object DataView]';\n\n/* Used to detect maps, sets, and weakmaps. /\nvar dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\n\n/\n Gets the `toStringTag` of `value`.\n \n @private\n * @param {} value The value to query.\n @returns {string} Returns the `toStringTag`.\n /\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) \|\|\n (Map && getTag(new Map) != mapTag) \|\|\n (Promise && getTag(Promise.resolve()) != promiseTag) \|\|\n (Set && getTag(new Set) != setTag) \|\|\n (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n getTag = function(value) {\n var result = baseGetTag(value),\n Ctor = result == objectTag ? value.constructor : undefined,\n ctorString = Ctor ? toSource(Ctor) : '';\n\n if (ctorString) {\n switch (ctorString) {\n case dataViewCtorString: return dataViewTag;\n case mapCtorString: return mapTag;\n case promiseCtorString: return promiseTag;\n case setCtorString: return setTag;\n case weakMapCtorString: return weakMapTag;\n }\n }\n return result;\n };\n}\n\nmodule.exports = getTag;\n","var getNative = require('./_getNative'),\n root = require('./_root');\n\n/ Built-in method references that are verified to be native. /\nvar DataView = getNative(root, 'DataView');\n\nmodule.exports = DataView;\n","var getNative = require('./_getNative'),\n root = require('./_root');\n\n/ Built-in method references that are verified to be native. /\nvar Promise = getNative(root, 'Promise');\n\nmodule.exports = Promise;\n","var getNative = require('./_getNative'),\n root = require('./_root');\n\n/ Built-in method references that are verified to be native. /\nvar WeakMap = getNative(root, 'WeakMap');\n\nmodule.exports = WeakMap;\n","var root = require('./_root');\n\n/* Built-in value references. /\nvar Uint8Array = root.Uint8Array;\n\nmodule.exports = Uint8Array;\n","var Uint8Array = require('./_Uint8Array');\n\n/\n Creates a clone of `arrayBuffer`.\n \n @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n /\nfunction cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n}\n\nmodule.exports = cloneArrayBuffer;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer');\n\n/\n Creates a clone of `typedArray`.\n \n @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n /\nfunction cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\nmodule.exports = cloneTypedArray;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer'),\n cloneDataView = require('./_cloneDataView'),\n cloneRegExp = require('./_cloneRegExp'),\n cloneSymbol = require('./_cloneSymbol'),\n cloneTypedArray = require('./_cloneTypedArray');\n\n/* `Object#toString` result references. /\nvar boolTag = '[object Boolean]',\n dateTag = '[object Date]',\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 float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n/\n Initializes an object clone based on its `toStringTag`.\n \n Note: This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n \n @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n /\nfunction initCloneByTag(object, tag, isDeep) {\n var Ctor = object.constructor;\n switch (tag) {\n case arrayBufferTag:\n return cloneArrayBuffer(object);\n\n case boolTag:\n case dateTag:\n return new Ctor(+object);\n\n case dataViewTag:\n return cloneDataView(object, isDeep);\n\n case float32Tag: case float64Tag:\n case int8Tag: case int16Tag: case int32Tag:\n case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n return cloneTypedArray(object, isDeep);\n\n case mapTag:\n return new Ctor;\n\n case numberTag:\n case stringTag:\n return new Ctor(object);\n\n case regexpTag:\n return cloneRegExp(object);\n\n case setTag:\n return new Ctor;\n\n case symbolTag:\n return cloneSymbol(object);\n }\n}\n\nmodule.exports = initCloneByTag;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer');\n\n/\n Creates a clone of `dataView`.\n \n @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n /\nfunction cloneDataView(dataView, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n}\n\nmodule.exports = cloneDataView;\n","/* Used to match `RegExp` flags from their coerced string values. /\nvar reFlags = /\\w$/;\n\n/*\n Creates a clone of `regexp`.\n \n @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n /\nfunction cloneRegExp(regexp) {\n var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n result.lastIndex = regexp.lastIndex;\n return result;\n}\n\nmodule.exports = cloneRegExp;\n","var Symbol = require('./_Symbol');\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 Creates a clone of the `symbol` object.\n \n @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n /\nfunction cloneSymbol(symbol) {\n return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n}\n\nmodule.exports = cloneSymbol;\n","var isObject = require('./isObject');\n\n/* Built-in value references. /\nvar objectCreate = Object.create;\n\n/\n The base implementation of `_.create` without support for assigning\n * properties to the created object.\n \n @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n /\nvar baseCreate = (function() {\n function object() {}\n return function(proto) {\n if (!isObject(proto)) {\n return {};\n }\n if (objectCreate) {\n return objectCreate(proto);\n }\n object.prototype = proto;\n var result = new object;\n object.prototype = undefined;\n return result;\n };\n}());\n\nmodule.exports = baseCreate;\n","var baseCreate = require('./_baseCreate'),\n getPrototype = require('./_getPrototype'),\n isPrototype = require('./_isPrototype');\n\n/\n Initializes an object clone.\n \n @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n /\nfunction initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n}\n\nmodule.exports = initCloneObject;\n","var baseIsMap = require('./_baseIsMap'),\n baseUnary = require('./_baseUnary'),\n nodeUtil = require('./_nodeUtil');\n\n/ Node.js helper references. /\nvar nodeIsMap = nodeUtil && nodeUtil.isMap;\n\n/\n Checks if `value` is classified as a `Map` object.\n \n @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n \n _.isMap(new Map);\n * // => true\n \n _.isMap(new WeakMap);\n * // => false\n /\nvar isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\nmodule.exports = isMap;\n","var getTag = require('./_getTag'),\n isObjectLike = require('./isObjectLike');\n\n/* `Object#toString` result references. /\nvar mapTag = '[object Map]';\n\n/\n The base implementation of `_.isMap` without Node.js optimizations.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a map, else `false`.\n /\nfunction baseIsMap(value) {\n return isObjectLike(value) && getTag(value) == mapTag;\n}\n\nmodule.exports = baseIsMap;\n","var baseIsSet = require('./_baseIsSet'),\n baseUnary = require('./_baseUnary'),\n nodeUtil = require('./_nodeUtil');\n\n/ Node.js helper references. /\nvar nodeIsSet = nodeUtil && nodeUtil.isSet;\n\n/\n Checks if `value` is classified as a `Set` object.\n \n @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n \n _.isSet(new Set);\n * // => true\n \n _.isSet(new WeakSet);\n * // => false\n /\nvar isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\nmodule.exports = isSet;\n","var getTag = require('./_getTag'),\n isObjectLike = require('./isObjectLike');\n\n/* `Object#toString` result references. /\nvar setTag = '[object Set]';\n\n/\n The base implementation of `_.isSet` without Node.js optimizations.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a set, else `false`.\n /\nfunction baseIsSet(value) {\n return isObjectLike(value) && getTag(value) == setTag;\n}\n\nmodule.exports = baseIsSet;\n","var Stack = require('./_Stack'),\n arrayEach = require('./_arrayEach'),\n assignValue = require('./_assignValue'),\n baseAssign = require('./_baseAssign'),\n baseAssignIn = require('./_baseAssignIn'),\n cloneBuffer = require('./_cloneBuffer'),\n copyArray = require('./_copyArray'),\n copySymbols = require('./_copySymbols'),\n copySymbolsIn = require('./_copySymbolsIn'),\n getAllKeys = require('./_getAllKeys'),\n getAllKeysIn = require('./_getAllKeysIn'),\n getTag = require('./_getTag'),\n initCloneArray = require('./_initCloneArray'),\n initCloneByTag = require('./_initCloneByTag'),\n initCloneObject = require('./_initCloneObject'),\n isArray = require('./isArray'),\n isBuffer = require('./isBuffer'),\n isMap = require('./isMap'),\n isObject = require('./isObject'),\n isSet = require('./isSet'),\n keys = require('./keys'),\n keysIn = require('./keysIn');\n\n/* Used to compose bitmasks for cloning. /\nvar CLONE_DEEP_FLAG = 1,\n CLONE_FLAT_FLAG = 2,\n CLONE_SYMBOLS_FLAG = 4;\n\n/* `Object#toString` result references. /\nvar argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n objectTag = '[object Object]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]',\n weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n/* Used to identify `toStringTag` values supported by `_.clone`. /\nvar cloneableTags = {};\ncloneableTags[argsTag] = cloneableTags[arrayTag] =\ncloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\ncloneableTags[boolTag] = cloneableTags[dateTag] =\ncloneableTags[float32Tag] = cloneableTags[float64Tag] =\ncloneableTags[int8Tag] = cloneableTags[int16Tag] =\ncloneableTags[int32Tag] = cloneableTags[mapTag] =\ncloneableTags[numberTag] = cloneableTags[objectTag] =\ncloneableTags[regexpTag] = cloneableTags[setTag] =\ncloneableTags[stringTag] = cloneableTags[symbolTag] =\ncloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\ncloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\ncloneableTags[errorTag] = cloneableTags[funcTag] =\ncloneableTags[weakMapTag] = false;\n\n/\n The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n \n @private\n * @param {} value The value to clone.\n @param {boolean} bitmask The bitmask flags.\n * 1 - Deep clone\n * 2 - Flatten inherited properties\n * 4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {} Returns the cloned value.\n /\nfunction baseClone(value, bitmask, customizer, key, object, stack) {\n var result,\n isDeep = bitmask & CLONE_DEEP_FLAG,\n isFlat = bitmask & CLONE_FLAT_FLAG,\n isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n if (customizer) {\n result = object ? customizer(value, key, object, stack) : customizer(value);\n }\n if (result !== undefined) {\n return result;\n }\n if (!isObject(value)) {\n return value;\n }\n var isArr = isArray(value);\n if (isArr) {\n result = initCloneArray(value);\n if (!isDeep) {\n return copyArray(value, result);\n }\n } else {\n var tag = getTag(value),\n isFunc = tag == funcTag \|\| tag == genTag;\n\n if (isBuffer(value)) {\n return cloneBuffer(value, isDeep);\n }\n if (tag == objectTag \|\| tag == argsTag \|\| (isFunc && !object)) {\n result = (isFlat \|\| isFunc) ? {} : initCloneObject(value);\n if (!isDeep) {\n return isFlat\n ? copySymbolsIn(value, baseAssignIn(result, value))\n : copySymbols(value, baseAssign(result, value));\n }\n } else {\n if (!cloneableTags[tag]) {\n return object ? value : {};\n }\n result = initCloneByTag(value, tag, isDeep);\n }\n }\n // Check for circular references and return its corresponding clone.\n stack \|\| (stack = new Stack);\n var stacked = stack.get(value);\n if (stacked) {\n return stacked;\n }\n stack.set(value, result);\n\n if (isSet(value)) {\n value.forEach(function(subValue) {\n result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n });\n } else if (isMap(value)) {\n value.forEach(function(subValue, key) {\n result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n }\n\n var keysFunc = isFull\n ? (isFlat ? getAllKeysIn : getAllKeys)\n : (isFlat ? keysIn : keys);\n\n var props = isArr ? undefined : keysFunc(value);\n arrayEach(props \|\| value, function(subValue, key) {\n if (props) {\n key = subValue;\n subValue = value[key];\n }\n // Recursively populate clone (susceptible to call stack limits).\n assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n return result;\n}\n\nmodule.exports = baseClone;\n","var copyObject = require('./_copyObject'),\n keys = require('./keys');\n\n/*\n The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n \n @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n /\nfunction baseAssign(object, source) {\n return object && copyObject(source, keys(source), object);\n}\n\nmodule.exports = baseAssign;\n","var copyObject = require('./_copyObject'),\n keysIn = require('./keysIn');\n\n/\n The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n \n @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n /\nfunction baseAssignIn(object, source) {\n return object && copyObject(source, keysIn(source), object);\n}\n\nmodule.exports = baseAssignIn;\n","var copyObject = require('./_copyObject'),\n getSymbols = require('./_getSymbols');\n\n/\n Copies own symbols of `source` to `object`.\n \n @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n /\nfunction copySymbols(source, object) {\n return copyObject(source, getSymbols(source), object);\n}\n\nmodule.exports = copySymbols;\n","var copyObject = require('./_copyObject'),\n getSymbolsIn = require('./_getSymbolsIn');\n\n/\n Copies own and inherited symbols of `source` to `object`.\n \n @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n /\nfunction copySymbolsIn(source, object) {\n return copyObject(source, getSymbolsIn(source), object);\n}\n\nmodule.exports = copySymbolsIn;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n getSymbolsIn = require('./_getSymbolsIn'),\n keysIn = require('./keysIn');\n\n/\n Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n /\nfunction getAllKeysIn(object) {\n return baseGetAllKeys(object, keysIn, getSymbolsIn);\n}\n\nmodule.exports = getAllKeysIn;\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 Initializes an array clone.\n \n @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n /\nfunction initCloneArray(array) {\n var length = array.length,\n result = new array.constructor(length);\n\n // Add properties assigned by `RegExp#exec`.\n if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n result.index = array.index;\n result.input = array.input;\n }\n return result;\n}\n\nmodule.exports = initCloneArray;\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","/ 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 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","/\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 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","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 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","/\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","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 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","/* 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","/\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 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 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","/\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","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 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 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 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","/\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 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 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","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 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 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","/\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 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 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 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 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","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 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","/\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 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","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 `_.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 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 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 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 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","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 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","/* 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 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","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","/\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 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 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 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 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 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 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","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 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","/\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 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 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 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","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","/\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 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","/\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 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 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","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 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","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","/ 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","// Includes only the \"core\" of graphlib\nmodule.exports = {\n Graph: require(\"./graph\"),\n version: require(\"./version\")\n};\n","module.exports = '2.1.8';\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","/\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","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","/ 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","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 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","/* 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 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 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 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 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 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 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","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","/*\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 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 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","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","/\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 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 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 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","/ 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 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 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 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","/\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 baseClone = require('./_baseClone');\n\n/* Used to compose bitmasks for cloning. /\nvar CLONE_DEEP_FLAG = 1,\n CLONE_SYMBOLS_FLAG = 4;\n\n/\n This method is like `_.clone` except that it recursively clones `value`.\n \n @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {} value The value to recursively clone.\n @returns {} Returns the deep cloned value.\n @see _.clone\n * @example\n \n var objects = [{ 'a': 1 }, { 'b': 2 }];\n \n var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n /\nfunction cloneDeep(value) {\n return baseClone(value, CLONE_DEEP_FLAG \| CLONE_SYMBOLS_FLAG);\n}\n\nmodule.exports = cloneDeep;\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 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 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","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 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","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","/\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 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","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 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 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","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 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","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","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","/\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","/\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","/\n @fileoverview Dagre布局插件 - 提供自动化图形布局功能\n \n 本插件基于dagre.js实现LogicFlow的自动化布局功能，支持多种布局方向\n * 可自动计算节点位置和连线路径，实现整洁的图形展示\n /\nimport LogicFlow, { BaseNodeModel, BaseEdgeModel } from '@logicflow/core'\nimport dagre, { GraphLabel, graphlib } from 'dagre'\n\nimport NodeConfig = LogicFlow.NodeConfig\nimport EdgeConfig = LogicFlow.EdgeConfig\nimport Point = LogicFlow.Point\n\n/\n Dagre布局配置选项接口\n * @interface DagreOption\n * @extends GraphLabel - 继承dagre原生配置\n /\nexport interface DagreOption extends GraphLabel {\n /\n 是否是默认锚点\n * true: 会根据布局方向自动计算边的路径点\n /\n isDefaultAnchor?: boolean\n}\n\n/\n Dagre插件接口定义\n /\nexport interface DagrePlugin {\n /\n 执行布局计算\n * @param option - 布局配置选项\n /\n layout(option: DagreOption): void\n}\n\n/\n Dagre布局类 - LogicFlow自动布局插件\n * 基于dagre.js提供图的自动布局能力\n /\nexport class Dagre {\n /* 插件名称，用于在LogicFlow中注册 /\n static pluginName = 'dagre'\n\n /* LogicFlow实例引用 /\n lf: LogicFlow\n\n /* 当前布局配置 /\n option: DagreOption // 使用已定义的DagreOption接口替代重复定义\n\n /\n 插件初始化方法，由LogicFlow自动调用\n * @param lf - LogicFlow实例\n /\n render(lf: LogicFlow) {\n this.lf = lf\n }\n\n /\n 执行布局算法，重新排列图中的节点和边\n * @param option - 布局配置选项\n /\n layout(option: DagreOption = {}) {\n const { nodes, edges, gridSize } = this.lf.graphModel\n\n // 根据网格大小调整节点间距\n let nodesep = 100\n let ranksep = 150\n if (gridSize > 20) {\n nodesep = gridSize 2\n ranksep = gridSize * 2\n }\n\n // 合并默认配置和用户配置\n this.option = {\n // 默认从左到右布局\n rankdir: 'LR',\n // 默认右下角对齐\n align: 'UL',\n // 紧凑树形排名算法\n ranker: 'tight-tree',\n // 层级间距\n ranksep,\n // 同层节点间距\n nodesep,\n // 图的水平边距\n marginx: 120,\n // 图的垂直边距\n marginy: 120,\n // 用户自定义选项覆盖默认值\n ...option,\n }\n\n // 创建dagre图实例\n const g = new graphlib.Graph()\n g.setGraph(this.option)\n g.setDefaultEdgeLabel(() => ({}))\n\n // 将LogicFlow节点添加到dagre图中\n nodes.forEach((node: BaseNodeModel) => {\n g.setNode(node.id, {\n width: node.width \|\| 150,\n height: node.height \|\| 50,\n id: node.id,\n })\n })\n\n // 将LogicFlow边添加到dagre图中\n edges.forEach((edge: BaseEdgeModel) => {\n g.setEdge(edge.sourceNodeId, edge.targetNodeId, {\n id: edge.id,\n })\n })\n\n // 执行dagre布局算法\n dagre.layout(g)\n\n // 存储新的节点和边数据\n const newNodes: NodeConfig[] = []\n const newEdges: EdgeConfig[] = []\n\n // 更新节点位置\n nodes.forEach((node: BaseNodeModel) => {\n const { x, y } = g.node(node.id)\n const lfNode = node.getData()\n if (!lfNode) {\n throw new Error(`布局错误：找不到ID为 ${node.id} 的节点`)\n }\n\n // 更新节点坐标\n lfNode.x = x\n lfNode.y = y\n\n // 更新节点文本位置\n if (lfNode?.text?.x) {\n lfNode.text.x = x\n lfNode.text.y = y\n }\n\n newNodes.push(lfNode)\n })\n\n // 处理边的路径和锚点\n edges.forEach((edge: BaseEdgeModel) => {\n const lfEdge: any = edge.getData()\n if (!lfEdge) {\n return\n }\n\n if (!option.isDefaultAnchor) {\n // 自定义锚点，不调整边的关联锚点，只清除路径相关数据，让LogicFlow自动计算\n delete lfEdge.pointsList\n delete lfEdge.startPoint\n delete lfEdge.endPoint\n } else {\n // 默认锚点，重新计算路径以及边的起点和终点（节点默认锚点为上下左右）\n delete lfEdge.pointsList\n delete lfEdge.startPoint\n delete lfEdge.endPoint\n delete lfEdge.sourceAnchorId\n delete lfEdge.targetAnchorId\n\n const model = this.lf.getEdgeModelById(edge.id)\n if (model) {\n // 计算自定义折线路径\n lfEdge.pointsList = this.calcPointsList(model, newNodes)\n }\n\n if (lfEdge.pointsList) {\n // 设置边的起点和终点\n const first = lfEdge.pointsList[0]\n const last = lfEdge.pointsList[lfEdge.pointsList.length - 1]\n lfEdge.startPoint = { x: first.x, y: first.y }\n lfEdge.endPoint = { x: last.x, y: last.y }\n\n // 调整边标签位置\n if (lfEdge.text && lfEdge.text.value) {\n lfEdge.text = {\n x: last.x - this.getBytesLength(lfEdge.text.value) * 6 - 10,\n y: last.y,\n value: lfEdge.text.value,\n }\n }\n } else if (lfEdge.text && lfEdge.text.value) {\n // 没有自定义路径时保留文本内容\n lfEdge.text = lfEdge.text.value\n }\n }\n\n newEdges.push(lfEdge)\n })\n // 将计算好的布局数据应用到画布\n this.lf.renderRawData({\n nodes: newNodes,\n edges: newEdges,\n })\n }\n\n /*\n 计算字符串显示宽度（用于文本定位）\n * @param word - 要计算的文本\n * @returns 估算的文本像素宽度\n /\n getBytesLength(word: string): number {\n if (!word) {\n return 0\n }\n\n let totalLength = 0\n for (let i = 0; i < word.length; i++) {\n const c = word.charCodeAt(i)\n // 大写字母宽度加权\n if (word.match(/[A-Z]/)) {\n totalLength += 1.5\n }\n // ASCII字符和半角字符\n else if ((c >= 0x0001 && c <= 0x007e) \|\| (c >= 0xff60 && c <= 0xff9f)) {\n totalLength += 1\n }\n // 其他字符（如中文）\n else {\n totalLength += 2\n }\n }\n\n return totalLength\n }\n\n /\n 优化折线路径点，移除冗余点\n * @param points - 原始路径点数组\n * @returns 优化后的路径点数组\n /\n pointFilter(points: Point[]): Point[] {\n const allPoints = [...points] // 创建副本避免修改原始数据\n let i = 1\n\n // 删除直线上的中间点（保持路径简洁）\n while (i < allPoints.length - 1) {\n const pre = allPoints[i - 1]\n const current = allPoints[i]\n const next = allPoints[i + 1]\n\n // 如果三点共线，移除中间点\n if (\n (pre.x === current.x && current.x === next.x) \|\| // 垂直线上的点\n (pre.y === current.y && current.y === next.y)\n ) {\n // 水平线上的点\n allPoints.splice(i, 1)\n } else {\n i++\n }\n }\n\n return allPoints\n }\n\n /\n 计算边的折线路径点\n * @param model - 边模型\n * @param nodes - 节点数据数组\n * @returns 计算后的路径点数组，如果无法计算则返回undefined\n */\n calcPointsList(\n model: BaseEdgeModel,\n nodes: NodeConfig[],\n ): Point[] \| undefined {\n const pointsList: Point[] = []\n\n // 获取源节点和目标节点的模型与布局数据\n const sourceNodeModel = this.lf.getNodeModelById(model.sourceNodeId)\n const targetNodeModel = this.lf.getNodeModelById(model.targetNodeId)\n const newSourceNodeData = nodes.find(\n (node: NodeConfig) => node.id === model.sourceNodeId,\n )\n const newTargetNodeData = nodes.find(\n (node: NodeConfig) => node.id === model.targetNodeId,\n )\n\n // 数据验证\n if (\n !sourceNodeModel \|\|\n !targetNodeModel \|\|\n !newSourceNodeData \|\|\n !newTargetNodeData\n ) {\n return undefined\n }\n\n // 折线偏移量（用于创建合适的转折点）\n const offset = Number(model.offset) \|\| 50\n\n // 处理从左到右(LR)布局的边路径\n if (this.option.rankdir === 'LR' && model.modelType === 'polyline-edge') {\n // 正向连线：源节点在目标节点左侧\n if (newSourceNodeData.x < newTargetNodeData.x) {\n // 从源节点右侧中心出发\n pointsList.push({\n x: newSourceNodeData.x + sourceNodeModel.width / 2,\n y: newSourceNodeData.y,\n })\n // 向右延伸一段距离\n pointsList.push({\n x: newSourceNodeData.x + sourceNodeModel.width / 2 + offset,\n y: newSourceNodeData.y,\n })\n // 垂直移动到目标节点的高度\n pointsList.push({\n x: newSourceNodeData.x + sourceNodeModel.width / 2 + offset,\n y: newTargetNodeData.y,\n })\n // 连接到目标节点左侧中心\n pointsList.push({\n x: newTargetNodeData.x - targetNodeModel.width / 2,\n y: newTargetNodeData.y,\n })\n\n return this.pointFilter(pointsList)\n }\n\n // 反向连线：源节点在目标节点右侧\n if (newSourceNodeData.x > newTargetNodeData.x) {\n // 根据节点相对Y轴位置选择不同路径\n if (newSourceNodeData.y >= newTargetNodeData.y) {\n // 源节点在目标节点的右下方，从源节点上方出发\n pointsList.push({\n x: newSourceNodeData.x,\n y: newSourceNodeData.y + sourceNodeModel.height / 2,\n })\n pointsList.push({\n x: newSourceNodeData.x,\n y: newSourceNodeData.y + sourceNodeModel.height / 2 + offset,\n })\n pointsList.push({\n x: newTargetNodeData.x,\n y: newSourceNodeData.y + sourceNodeModel.height / 2 + offset,\n })\n pointsList.push({\n x: newTargetNodeData.x,\n y: newTargetNodeData.y + targetNodeModel.height / 2,\n })\n } else {\n // 源节点在目标节点的右上方，从源节点下方出发\n pointsList.push({\n x: newSourceNodeData.x,\n y: newSourceNodeData.y - sourceNodeModel.height / 2,\n })\n pointsList.push({\n x: newSourceNodeData.x,\n y: newSourceNodeData.y - sourceNodeModel.height / 2 - offset,\n })\n pointsList.push({\n x: newTargetNodeData.x,\n y: newSourceNodeData.y - sourceNodeModel.height / 2 - offset,\n })\n pointsList.push({\n x: newTargetNodeData.x,\n y: newTargetNodeData.y - targetNodeModel.height / 2,\n })\n }\n\n return this.pointFilter(pointsList)\n }\n }\n\n // 处理从上到下(TB)布局的边路径\n if (this.option.rankdir === 'TB' && model.modelType === 'polyline-edge') {\n // 正向连线：源节点在目标节点上方\n if (newSourceNodeData.y < newTargetNodeData.y) {\n // 从源节点底部中心出发\n pointsList.push({\n x: newSourceNodeData.x,\n y: newSourceNodeData.y + sourceNodeModel.height / 2,\n })\n // 向下延伸一段距离\n pointsList.push({\n x: newSourceNodeData.x,\n y: newSourceNodeData.y + sourceNodeModel.height / 2 + offset,\n })\n // 水平移动到目标节点的位置\n pointsList.push({\n x: newTargetNodeData.x,\n y: newSourceNodeData.y + sourceNodeModel.height / 2 + offset,\n })\n // 连接到目标节点顶部中心\n pointsList.push({\n x: newTargetNodeData.x,\n y: newTargetNodeData.y - targetNodeModel.height / 2,\n })\n\n return this.pointFilter(pointsList)\n }\n\n // 反向连线：源节点在目标节点下方\n if (newSourceNodeData.y > newTargetNodeData.y) {\n if (newSourceNodeData.x >= newTargetNodeData.x) {\n // 源节点在目标节点右下方，从源节点右侧出发\n pointsList.push({\n x: newSourceNodeData.x + sourceNodeModel.width / 2,\n y: newSourceNodeData.y,\n })\n pointsList.push({\n x: newSourceNodeData.x + sourceNodeModel.width / 2 + offset,\n y: newSourceNodeData.y,\n })\n pointsList.push({\n x: newSourceNodeData.x + sourceNodeModel.width / 2 + offset,\n y: newTargetNodeData.y,\n })\n pointsList.push({\n x: newTargetNodeData.x + targetNodeModel.width / 2,\n y: newTargetNodeData.y,\n })\n } else {\n // 源节点在目标节点左下方，从源节点左侧出发\n pointsList.push({\n x: newSourceNodeData.x - sourceNodeModel.width / 2,\n y: newSourceNodeData.y,\n })\n pointsList.push({\n x: newSourceNodeData.x - sourceNodeModel.width / 2 - offset,\n y: newSourceNodeData.y,\n })\n pointsList.push({\n x: newSourceNodeData.x - sourceNodeModel.width / 2 - offset,\n y: newTargetNodeData.y,\n })\n pointsList.push({\n x: newTargetNodeData.x - targetNodeModel.width / 2,\n y: newTargetNodeData.y,\n })\n }\n\n return this.pointFilter(pointsList)\n }\n }\n\n // 无法确定路径时返回undefined，让LogicFlow自行处理\n return undefined\n }\n}\n"],"names":["module","value","other","eq","require","array","key","length","listCacheClear","this","__data__","size","listCacheDelete","assocIndexOf","splice","Array","prototype","data","index","pop","call","listCacheGet","undefined","listCacheHas","listCacheSet","push","ListCache","entries","clear","entry","set","get","has","freeGlobal","global","Object","freeSelf","self","root","Function","Symbol","getRawTag","objectProto","hasOwnProperty","nativeObjectToString","toString","symToStringTag","toStringTag","isOwn","tag","unmasked","e","result","objectToString","type","baseGetTag","isObject","uid","coreJsData","maskSrcKey","exec","keys","IE_PROTO","func","funcToString","baseIsNative","isFunction","isMasked","toSource","reIsHostCtor","funcProto","reIsNative","RegExp","replace","test","getValue","object","Map","getNative","nativeCreate","hashClear","hashDelete","hashGet","hashHas","hashSet","Hash","isKeyable","map","mapCacheClear","hash","string","mapCacheDelete","getMapData","mapCacheGet","mapCacheHas","mapCacheSet","MapCache","stackClear","stackDelete","stackGet","stackHas","stackSet","pairs","LARGE_ARRAY_SIZE","Stack","iteratee","defineProperty","configurable","enumerable","writable","baseAssignValue","objValue","assignValue","source","props","customizer","isNew","newValue","baseIsArguments","isObjectLike","propertyIsEnumerable","isArguments","arguments","isArray","stubFalse","freeExports","exports","nodeType","freeModule","Buffer","isBuffer","reIsUint","freeProcess","process","nodeUtil","types","binding","baseIsTypedArray","isLength","typedArrayTags","baseUnary","nodeIsTypedArray","isTypedArray","baseTimes","n","isIndex","inherited","isArr","isArg","isBuff","isType","skipIndexes","String","Ctor","constructor","transform","arg","isPrototype","nativeKeys","overArg","arrayLikeKeys","baseKeys","isArrayLike","nativeKeysIn","isProto","baseKeysIn","allocUnsafe","buffer","isDeep","slice","copy","predicate","resIndex","arrayFilter","stubArray","nativeGetSymbols","getOwnPropertySymbols","symbol","values","offset","getPrototype","getPrototypeOf","arrayPush","getSymbols","keysFunc","symbolsFunc","baseGetAllKeys","Set","DataView","Promise","WeakMap","mapTag","promiseTag","setTag","weakMapTag","dataViewTag","dataViewCtorString","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","getTag","ArrayBuffer","resolve","ctorString","Uint8Array","arrayBuffer","byteLength","cloneArrayBuffer","typedArray","byteOffset","cloneDataView","dataView","cloneRegExp","reFlags","regexp","lastIndex","cloneSymbol","symbolProto","symbolValueOf","valueOf","cloneTypedArray","objectCreate","create","baseCreate","proto","baseIsMap","nodeIsMap","isMap","baseIsSet","nodeIsSet","isSet","arrayEach","baseAssign","copyObject","baseAssignIn","keysIn","cloneBuffer","copyArray","copySymbols","copySymbolsIn","getSymbolsIn","getAllKeys","getAllKeysIn","initCloneArray","input","initCloneByTag","initCloneObject","argsTag","funcTag","objectTag","cloneableTags","baseClone","bitmask","stack","isFlat","isFull","isFunc","stacked","forEach","subValue","add","graphlib","baseFor","fromRight","iterable","baseForOwn","baseEach","eachFunc","collection","createBaseEach","identity","castFunction","setCacheAdd","setCacheHas","SetCache","cache","arraySome","cacheHas","equalFunc","isPartial","arrLength","othLength","arrStacked","othStacked","seen","arrValue","othValue","compared","othIndex","equalArrays","mapToArray","setToArray","name","message","convert","equalByTag","equalObjects","objProps","objLength","objStacked","skipCtor","objCtor","othCtor","arrayTag","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","baseIsEqualDeep","baseIsEqual","srcValue","baseIsMatch","matchData","noCustomizer","COMPARE_PARTIAL_FLAG","getMatchData","isStrictComparable","matchesStrictComparable","isSymbol","reIsDeepProp","reIsPlainProp","memoize","resolver","TypeError","memoized","args","apply","Cache","baseToString","arrayMap","symbolToString","isKey","stringToPath","memoizeCapped","rePropName","reEscapeChar","charCodeAt","match","number","quote","subString","castPath","toKey","path","hasFunc","baseHasIn","hasPath","baseGet","defaultValue","hasIn","baseProperty","basePropertyDeep","baseMatches","baseMatchesProperty","property","baseFilter","baseIteratee","baseHas","baseMap","arrayReduce","accumulator","initAccum","baseReduce","asciiSize","hasUnicode","reHasUnicode","unicodeSize","rsAstralRange","rsAstral","rsCombo","rsFitz","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsModifier","rsOptVar","rsSeq","join","rsSymbol","reUnicode","isString","stringSize","isArrLike","isFlattenable","spreadableSymbol","isConcatSpreadable","baseFlatten","depth","isStrict","thisArg","nativeMax","Math","max","start","otherArgs","baseSetToString","constant","shortOut","nativeNow","Date","now","count","lastCalled","stamp","remaining","setToString","overRest","fromIndex","baseFindIndex","baseIsNaN","strictIndexOf","noop","createSet","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","includes","isCommon","outer","computed","seenIndex","baseRest","baseUniq","isArrayLikeObject","union","arrays","baseValues","lodash","clone","each","filter","isEmpty","isUndefined","reduce","window","_","graph","Graph","DEFAULT_EDGE_NAME","GRAPH_NODE","EDGE_KEY_DELIM","opts","_isDirected","directed","_isMultigraph","multigraph","_isCompound","compound","_label","_defaultNodeLabelFn","_defaultEdgeLabelFn","_nodes","_parent","_children","_in","_preds","_out","_sucs","_edgeObjs","_edgeLabels","incrementOrInitEntry","k","decrementOrRemoveEntry","edgeArgsToId","isDirected","v_","w_","v","w","tmp","edgeObjToId","edgeObj","_nodeCount","_edgeCount","isMultigraph","isCompound","setGraph","label","setDefaultNodeLabel","newDefault","nodeCount","nodes","sources","sinks","setNodes","vs","setNode","node","hasNode","removeNode","removeEdge","_removeFromParentsChildList","children","child","setParent","parent","Error","ancestor","predecessors","predsV","successors","sucsV","neighbors","preds","isLeaf","filterNodes","setEdge","edge","parents","findParent","setDefaultEdgeLabel","edgeCount","edges","setPath","valueSpecified","arg0","edgeArgsToObj","freeze","hasEdge","inEdges","u","inV","outEdges","outV","nodeEdges","concat","version","writeNodes","g","nodeValue","writeEdges","edgeValue","write","json","options","read","components_1","cmpt","visited","cmpts","dfs","PriorityQueue","_arr","_keyIndices","priorityQueue","x","priority","min","keyIndices","arr","_decrease","removeMin","_swap","_heapify","decrease","i","l","r","largest","j","origArrI","origArrJ","dijkstra_1","weightFn","edgeFn","vEntry","results","pq","updateNeighbors","wEntry","weight","distance","predecessor","Number","POSITIVE_INFINITY","runDijkstra","DEFAULT_WEIGHT_FUNC","dijkstra","dijkstraAll_1","weightFunc","edgeFunc","acc","tarjan_1","onStack","lowlink","tarjan","findCycles_1","floydWarshall_1","d","rowK","rowI","ik","kj","ij","altDistance","runFloydWarshall","topsort","visit","CycleException","topsort_1","isAcyclic_1","doDfs","postorder","navigation","dfs_1","order","bind","postorder_1","preorder_1","prim_1","pri","edgeWeight","init","lib","alg","components","dijkstraAll","findCycles","floydWarshall","isAcyclic","preorder","prim","trimmedEndIndex","reWhitespace","charAt","reTrimStart","toNumber","baseTrim","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","parseInt","isBinary","INFINITY","toInteger","toFinite","remainder","current","assignMergeValue","isPlainObject","objectCtorString","safeGet","toPlainObject","srcIndex","mergeFunc","isTyped","baseSet","nested","paths","baseRange","nativeCeil","ceil","end","step","isIterateeCall","compareAscending","valIsDefined","valIsNull","valIsReflexive","valIsSymbol","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","orders","objCriteria","criteria","othCriteria","ordersLength","baseSortBy","comparer","sort","compareMultiple","iteratees","cloneDeep","CLONE_DEEP_FLAG","defaults","guard","propsIndex","propsLength","find","findIndexFunc","createFind","flatten","forIn","last","mapValues","baseExtremum","baseGt","merge","baseMerge","baseMergeDeep","assigner","createAssigner","baseLt","minBy","pick","basePick","basePickBy","flatRest","range","createRange","sortBy","baseOrderBy","uniqueId","idCounter","prefix","id","zipObject","baseZipObject","assignFunc","valsLength","List","sentinel","_next","_prev","_sentinel","unlink","filterOutLinks","dequeue","enqueue","strs","curr","JSON","stringify","state","fasGraph","maxIn","maxOut","in","out","prevWeight","buckets","zeroIdx","assignBucket","buildState","DEFAULT_WEIGHT_FN","doGreedyFAS","collectPredecessors","uEntry","greedyFAS","run","fas","acyclicer","dfsFAS","forwardName","reversed","undo","addDummyNode","simplify","simplified","simpleLabel","minlen","asNonCompoundGraph","successorWeights","weightMap","sucs","predecessorWeights","intersectRect","rect","point","sx","sy","y","dx","dy","width","h","height","abs","buildLayerMatrix","layering","maxRank","rank","normalizeRanks","removeEmptyRanks","layers","delta","nodeRankFactor","addBorderNode","partition","fn","lhs","rhs","time","notime","attrs","dummy","util","dummyChains","vRank","wRank","edgeLabel","labelRank","points","labelpos","normalizeEdge","origLabel","longestPath","slack","t","tightTree","findMinSlackEdge","shiftRanks","edgeV","feasibleTree","initRank","networkSimplex","initLowLimValues","initCutValues","leaveEdge","exchangeEdges","enterEdge","childLab","cutvalue","calcCutValue","assignCutValue","childIsTail","graphEdge","cutValue","isOutEdge","pointsToHead","otherWeight","otherCutValue","tree","dfsAssignLowLim","nextLim","low","lim","vLabel","wLabel","tailLabel","flip","candidates","isDescendant","f","flipped","updateRanks","rootLabel","ranker","networkSimplexRanker","tightTreeRanker","longestPathRanker","postorderNums","pathData","lca","vPath","wPath","reverse","findPath","pathIdx","pathV","ascending","minRank","depths","treeDepths","nodeSep","nestingRoot","sumWeights","cleanup","graphLabel","nestingEdge","top","bottom","borderTop","borderBottom","childNode","childTop","childBottom","thisWeight","borderLeft","borderRight","prop","sg","sgNode","borderType","prev","adjust","rankDir","rankdir","toLowerCase","swapWidthHeight","reverseYOne","reverseY","swapXYOne","swapXY","swapWidthHeightOne","simpleNodes","orderedVs","cc","twoLayerCrossCount","northLayer","southLayer","southPos","southEntries","pos","firstIndex","treeSize","weightSum","consumeUnsortable","unsortable","barycenter","movable","nodeU","sum","resolveConflicts","cg","mappedEntries","indegree","entryV","entryW","sourceSet","handleIn","merged","target","mergeEntries","handleOut","doResolveConflicts","biasRight","parts","sortable","vsIndex","bias","sortSubgraph","bl","br","subgraphs","barycenters","subgraphResult","expandSubgraphs","blPred","brPred","relationship","createRootNode","initOrder","crossCount","buildLayerGraph","addSubgraphConstraints","rootPrev","prevChild","downLayerGraphs","buildLayerGraphs","upLayerGraphs","assignOrder","best","bestCC","lastBest","sweepLayerGraphs","ranks","layerGraphs","lg","sorted","layer","adjustedLayering","conflicts","findType1Conflicts","findType2Conflicts","xss","vert","horiz","inner","neighborFn","align","verticalAlignment","xs","horizontalCompaction","smallestWidth","findSmallestWidthAlignment","alignCoordinates","balance","prevLayer","k0","scanPos","prevLayerLength","lastNode","findOtherInnerSegmentNode","k1","scanNode","uLabel","uPos","addConflict","scan","south","southEnd","prevNorthBorder","nextNorthBorder","uNode","north","nextNorthPos","prevNorthPos","southLookahead","conflictsV","hasConflict","prevIdx","ws","mp","floor","il","reverseSep","blockG","blockGraph","sepFn","edgeSep","sep","nodesep","edgesep","vRoot","uRoot","prevMax","buildBlockGraph","iterate","setXsFunc","nextNodesFunc","elem","NEGATIVE_INFINITY","halfWidth","alignTo","alignToVals","alignToMin","alignToMax","alignment","xsVals","ul","ignore","positionX","acyclic","normalize","parentDummyChains","nestingGraph","addBorderSegments","coordinateSystem","position","rankSep","ranksep","prevY","maxHeight","positionY","debugTiming","layoutGraph","inputGraph","canonicalize","graphDefaults","selectNumberAttrs","graphNumAttrs","graphAttrs","nodeNumAttrs","nodeDefaults","edgeDefaults","edgeNumAttrs","edgeAttrs","buildLayoutGraph","labeloffset","makeSpaceForEdgeLabels","selfEdges","removeSelfEdges","injectEdgeLabelProxies","assignRankMinMax","removeEdgeLabelProxies","orderShift","selfEdge","insertSelfEdges","selfNode","positionSelfEdges","b","removeBorderNodes","fixupEdgeLabelCoords","minX","maxX","minY","maxY","marginX","marginx","marginY","marginy","getExtremes","p","translateGraph","p1","p2","nodeV","nodeW","unshift","assignNodeIntersects","reversePointsForReversedEdges","runLayout","inputLabel","layoutLabel","updateInputGraph","obj","newAttrs","layout","debug","debugOrdering","layerMatrix","layerV","style","Dagre","render","lf","option","gridSize","graphModel","assign","sourceNodeId","targetNodeId","dagre","newNodes","newEdges","lfNode","getData","_a","text","lfEdge","isDefaultAnchor","pointsList","startPoint","endPoint","sourceAnchorId","targetAnchorId","model","getEdgeModelById","calcPointsList","first","getBytesLength","renderRawData","word","totalLength","c","pointFilter","allPoints","pre","next","sourceNodeModel","getNodeModelById","targetNodeModel","newSourceNodeData","newTargetNodeData","modelType","pluginName"],"mappings":"0rBAoCAA,EAJA,SAAYC,EAAOC,GACjB,OAAOD,IAAUC,GAAUD,GAAUA,GAASC,GAAUA,CAC1D,kCClCA,IAAIC,EAAKC,YAoBTJ,EAVA,SAAsBK,EAAOC,GAE3B,IADA,IAAIC,EAASF,EAAME,OACZA,KACL,GAAIJ,EAAGE,EAAME,GAAQ,GAAID,GACvB,OAAOC,EAGX,OAAQ,CACV,kCClBA,IAAIC,WCYJR,EALA,WACES,KAAKC,SAAW,GAChBD,KAAKE,KAAO,CACd,GDTIC,+BEDJ,IAAIC,EAAeT,KAMfU,EAHaC,MAAMC,UAGCF,cA4BxBd,EAjBA,SAAyBM,GACvB,IAAIW,EAAOR,KAAKC,SACZQ,EAAQL,EAAaI,EAAMX,GAE/B,QAAIY,EAAQ,IAIRA,GADYD,EAAKV,OAAS,EAE5BU,EAAKE,MAELL,EAAOM,KAAKH,EAAMC,EAAO,KAEzBT,KAAKE,KACA,GACT,EF/BsBP,GAClBiB,+BGFJ,IAAIR,EAAeT,YAkBnBJ,EAPA,SAAsBM,GACpB,IAAIW,EAAOR,KAAKC,SACZQ,EAAQL,EAAaI,EAAMX,GAE/B,OAAOY,EAAQ,OAAII,EAAYL,EAAKC,GAAO,EAC7C,EHdmBd,GACfmB,+BIHJ,IAAIV,EAAeT,YAenBJ,EAJA,SAAsBM,GACpB,OAAOO,EAAaJ,KAAKC,SAAUJ,IAAQ,CAC7C,EJVmBF,GACfoB,+BKJJ,IAAIX,EAAeT,YAyBnBJ,EAbA,SAAsBM,EAAKL,GACzB,IAAIgB,EAAOR,KAAKC,SACZQ,EAAQL,EAAaI,EAAMX,GAQ/B,OANIY,EAAQ,KACRT,KAAKE,KACPM,EAAKQ,KAAK,CAACnB,EAAKL,KAEhBgB,EAAKC,GAAO,GAAKjB,EAEZQ,IACT,ELnBmBL,GASnB,SAASsB,EAAUC,GACjB,IAAIT,GAAS,EACTX,EAAoB,MAAXoB,EAAkB,EAAIA,EAAQpB,OAG3C,IADAE,KAAKmB,UACIV,EAAQX,GAAQ,CACvB,IAAIsB,EAAQF,EAAQT,GACpBT,KAAKqB,IAAID,EAAM,GAAIA,EAAM,GAC3B,CACF,QAGAH,EAAUV,UAAUY,MAAQpB,EAC5BkB,EAAUV,UAAkB,OAAIJ,EAChCc,EAAUV,UAAUe,IAAMV,EAC1BK,EAAUV,UAAUgB,IAAMT,EAC1BG,EAAUV,UAAUc,IAAMN,EAE1BxB,EAAiB0B,kCM9BjB,IAAIO,EAA8B,iBAAVC,IAAsBA,IAAUA,GAAOC,SAAWA,QAAUD,UAEpFlC,EAAiBiC,kCCHjB,IAAIA,EAAa7B,KAGbgC,EAA0B,iBAARC,MAAoBA,MAAQA,KAAKF,SAAWA,QAAUE,KAGxEC,EAAOL,GAAcG,GAAYG,SAAS,cAATA,UAErCvC,EAAiBsC,kCCRjB,IAGIE,EAHOpC,KAGOoC,cAElBxC,EAAiBwC,kCCLjB,IAAIA,EAASpC,KACTqC,+BCDJ,IAAID,EAASpC,KAGTsC,EAAcP,OAAOnB,UAGrB2B,EAAiBD,EAAYC,eAO7BC,EAAuBF,EAAYG,SAGnCC,EAAiBN,EAASA,EAAOO,iBAAczB,SA6BnDtB,EApBA,SAAmBC,GACjB,IAAI+C,EAAQL,EAAevB,KAAKnB,EAAO6C,GACnCG,EAAMhD,EAAM6C,GAEhB,IACE7C,EAAM6C,QAAkBxB,EACxB,IAAI4B,GAAW,CACjB,CAAE,MAAOC,GAAI,CAEb,IAAIC,EAASR,EAAqBxB,KAAKnB,GAQvC,OAPIiD,IACEF,EACF/C,EAAM6C,GAAkBG,SAEjBhD,EAAM6C,IAGVM,CACT,ED1CgBhD,GACZiD,+BEDJ,IAOIT,EAPcT,OAAOnB,UAOc6B,gBAavC7C,EAJA,SAAwBC,GACtB,OAAO2C,EAAqBxB,KAAKnB,EACnC,EFjBqBG,GAOjB0C,EAAiBN,EAASA,EAAOO,iBAAczB,SAkBnDtB,EATA,SAAoBC,GAClB,OAAa,MAATA,OACeqB,IAAVrB,EAdQ,qBADL,gBAiBJ6C,GAAkBA,KAAkBX,OAAOlC,GAC/CwC,EAAUxC,GACVoD,EAAepD,EACrB,yCGKAD,EALA,SAAkBC,GAChB,IAAIqD,SAAcrD,EAClB,OAAgB,MAATA,IAA0B,UAARqD,GAA4B,YAARA,EAC/C,kCC5BA,IAAIC,EAAanD,KACboD,EAAWpD,YAmCfJ,EAVA,SAAoBC,GAClB,IAAKuD,EAASvD,GACZ,OAAO,EAIT,IAAIgD,EAAMM,EAAWtD,GACrB,MA5BY,qBA4BLgD,GA3BI,8BA2BcA,GA7BZ,0BA6B6BA,GA1B7B,kBA0BgDA,CAC/D,kCClCA,IAIMQ,EAJFC,+BCAJ,IAGIA,EAHOtD,KAGW,6BAEtBJ,EAAiB0D,EDLAtD,GAGbuD,GACEF,EAAM,SAASG,KAAKF,GAAcA,EAAWG,MAAQH,EAAWG,KAAKC,UAAY,KACvE,iBAAmBL,EAAO,UAc1CzD,EAJA,SAAkB+D,GAChB,QAASJ,GAAeA,KAAcI,CACxC,kCEhBA,IAGIC,EAHYzB,SAASvB,UAGI6B,gBAqB7B7C,EAZA,SAAkB+D,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOC,EAAa5C,KAAK2C,EAC3B,CAAE,MAAOZ,GAAI,CACb,IACE,OAAQY,EAAO,EACjB,CAAE,MAAOZ,GAAI,CACf,CACA,MAAO,EACT,kCCvBA,IAAIc,+BCAJ,IAAIC,EAAa9D,KACb+D,EAAW/D,KACXoD,EAAWpD,KACXgE,EAAWhE,KASXiE,EAAe,8BAGfC,EAAY/B,SAASvB,UACrB0B,EAAcP,OAAOnB,UAGrBgD,EAAeM,EAAUzB,SAGzBF,EAAiBD,EAAYC,eAG7B4B,EAAaC,OAAO,IACtBR,EAAa5C,KAAKuB,GAAgB8B,QAjBjB,sBAiBuC,QACvDA,QAAQ,yDAA0D,SAAW,YAmBhFzE,EARA,SAAsBC,GACpB,SAAKuD,EAASvD,IAAUkE,EAASlE,MAGnBiE,EAAWjE,GAASsE,EAAaF,GAChCK,KAAKN,EAASnE,GAC/B,ED5CmBG,GACfuE,WEWJ3E,EAJA,SAAkB4E,EAAQtE,GACxB,OAAiB,MAAVsE,OAAiBtD,EAAYsD,EAAOtE,EAC7C,UFMAN,EALA,SAAmB4E,EAAQtE,GACzB,IAAIL,EAAQ0E,EAASC,EAAQtE,GAC7B,OAAO2D,EAAahE,GAASA,OAAQqB,CACvC,oCGdA,IAIIuD,EAJYzE,IAIN0E,CAHC1E,KAGe,cAE1BJ,EAAiB6E,qCCNjB,IAGIE,EAHY3E,IAGG0E,CAAU3C,OAAQ,iBAErCnC,GAAiB+E,qCCLjB,IAAIC,kCCAJ,IAAID,EAAe3E,YAcnBJ,GALA,WACES,KAAKC,SAAWqE,EAAeA,EAAa,MAAQ,CAAA,EACpDtE,KAAKE,KAAO,CACd,EDZgBP,GACZ6E,cEeJjF,GANA,SAAoBM,GAClB,IAAI8C,EAAS3C,KAAKuB,IAAI1B,WAAeG,KAAKC,SAASJ,GAEnD,OADAG,KAAKE,MAAQyC,EAAS,EAAI,EACnBA,CACT,GFZI8B,kCGFJ,IAAIH,EAAe3E,KASfuC,EAHcR,OAAOnB,UAGQ2B,sBAoBjC3C,GATA,SAAiBM,GACf,IAAIW,EAAOR,KAAKC,SAChB,GAAIqE,EAAc,CAChB,IAAI3B,EAASnC,EAAKX,GAClB,MArBiB,8BAqBV8C,OAA4B9B,EAAY8B,CACjD,CACA,OAAOT,EAAevB,KAAKH,EAAMX,GAAOW,EAAKX,QAAOgB,CACtD,EHzBclB,GACV+E,kCIHJ,IAAIJ,EAAe3E,KAMfuC,EAHcR,OAAOnB,UAGQ2B,sBAgBjC3C,GALA,SAAiBM,GACf,IAAIW,EAAOR,KAAKC,SAChB,OAAOqE,OAA8BzD,IAAdL,EAAKX,GAAsBqC,EAAevB,KAAKH,EAAMX,EAC9E,EJjBcF,GACVgF,kCKJJ,IAAIL,EAAe3E,YAsBnBJ,GAPA,SAAiBM,EAAKL,GACpB,IAAIgB,EAAOR,KAAKC,SAGhB,OAFAD,KAAKE,MAAQF,KAAKuB,IAAI1B,GAAO,EAAI,EACjCW,EAAKX,GAAQyE,QAA0BzD,IAAVrB,EAfV,4BAekDA,EAC9DQ,IACT,ELhBcL,GASd,SAASiF,EAAK1D,GACZ,IAAIT,GAAS,EACTX,EAAoB,MAAXoB,EAAkB,EAAIA,EAAQpB,OAG3C,IADAE,KAAKmB,UACIV,EAAQX,GAAQ,CACvB,IAAIsB,EAAQF,EAAQT,GACpBT,KAAKqB,IAAID,EAAM,GAAIA,EAAM,GAC3B,CACF,QAGAwD,EAAKrE,UAAUY,MAAQoD,EACvBK,EAAKrE,UAAkB,OAAIiE,EAC3BI,EAAKrE,UAAUe,IAAMmD,EACrBG,EAAKrE,UAAUgB,IAAMmD,EACrBE,EAAKrE,UAAUc,IAAMsD,EAErBpF,GAAiBqF,qCM/BjB,IAAIC,cCcJtF,GAPA,SAAmBC,GACjB,IAAIqD,SAAcrD,EAClB,MAAgB,UAARqD,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVrD,EACU,OAAVA,CACP,UDKAD,GAPA,SAAoBuF,EAAKjF,GACvB,IAAIW,EAAOsE,EAAI7E,SACf,OAAO4E,EAAUhF,GACbW,EAAmB,iBAAPX,EAAkB,SAAW,QACzCW,EAAKsE,GACX,qCEfA,IAAIC,kCCAJ,IAAIH,EAAOjF,KACPsB,EAAYtB,KACZyE,EAAMzE,YAkBVJ,GATA,WACES,KAAKE,KAAO,EACZF,KAAKC,SAAW,CACd+E,KAAQ,IAAIJ,EACZE,IAAO,IAAKV,GAAOnD,GACnBgE,OAAU,IAAIL,EAElB,EDlBoBjF,GAChBuF,kCEDJ,IAAIC,EAAaxF,YAiBjBJ,GANA,SAAwBM,GACtB,IAAI8C,EAASwC,EAAWnF,KAAMH,GAAa,OAAEA,GAE7C,OADAG,KAAKE,MAAQyC,EAAS,EAAI,EACnBA,CACT,EFdqBhD,GACjByF,kCGFJ,IAAID,EAAaxF,YAejBJ,GAJA,SAAqBM,GACnB,OAAOsF,EAAWnF,KAAMH,GAAKyB,IAAIzB,EACnC,EHXkBF,GACd0F,kCIHJ,IAAIF,EAAaxF,YAejBJ,GAJA,SAAqBM,GACnB,OAAOsF,EAAWnF,KAAMH,GAAK0B,IAAI1B,EACnC,EJVkBF,GACd2F,kCKJJ,IAAIH,EAAaxF,YAqBjBJ,GATA,SAAqBM,EAAKL,GACxB,IAAIgB,EAAO2E,EAAWnF,KAAMH,GACxBK,EAAOM,EAAKN,KAIhB,OAFAM,EAAKa,IAAIxB,EAAKL,GACdQ,KAAKE,MAAQM,EAAKN,MAAQA,EAAO,EAAI,EAC9BF,IACT,ELfkBL,GASlB,SAAS4F,EAASrE,GAChB,IAAIT,GAAS,EACTX,EAAoB,MAAXoB,EAAkB,EAAIA,EAAQpB,OAG3C,IADAE,KAAKmB,UACIV,EAAQX,GAAQ,CACvB,IAAIsB,EAAQF,EAAQT,GACpBT,KAAKqB,IAAID,EAAM,GAAIA,EAAM,GAC3B,CACF,QAGAmE,EAAShF,UAAUY,MAAQ4D,EAC3BQ,EAAShF,UAAkB,OAAI2E,EAC/BK,EAAShF,UAAUe,IAAM8D,EACzBG,EAAShF,UAAUgB,IAAM8D,EACzBE,EAAShF,UAAUc,IAAMiE,EAEzB/F,GAAiBgG,qCM/BjB,IAAItE,EAAYtB,KACZ6F,+BCDJ,IAAIvE,EAAYtB,YAchBJ,EALA,WACES,KAAKC,SAAW,IAAIgB,EACpBjB,KAAKE,KAAO,CACd,EDXiBP,GACb8F,WEeJlG,EARA,SAAqBM,GACnB,IAAIW,EAAOR,KAAKC,SACZ0C,EAASnC,EAAa,OAAEX,GAG5B,OADAG,KAAKE,KAAOM,EAAKN,KACVyC,CACT,GFZI+C,WGUJnG,EAJA,SAAkBM,GAChB,OAAOG,KAAKC,SAASqB,IAAIzB,EAC3B,GHPI8F,WISJpG,EAJA,SAAkBM,GAChB,OAAOG,KAAKC,SAASsB,IAAI1B,EAC3B,GJNI+F,kCKLJ,IAAI3E,EAAYtB,KACZyE,EAAMzE,KACN4F,EAAW5F,YA+BfJ,GAhBA,SAAkBM,EAAKL,GACrB,IAAIgB,EAAOR,KAAKC,SAChB,GAAIO,aAAgBS,EAAW,CAC7B,IAAI4E,EAAQrF,EAAKP,SACjB,IAAKmE,GAAQyB,EAAM/F,OAASgG,IAG1B,OAFAD,EAAM7E,KAAK,CAACnB,EAAKL,IACjBQ,KAAKE,OAASM,EAAKN,KACZF,KAETQ,EAAOR,KAAKC,SAAW,IAAIsF,EAASM,EACtC,CAGA,OAFArF,EAAKa,IAAIxB,EAAKL,GACdQ,KAAKE,KAAOM,EAAKN,KACVF,IACT,EL1BeL,GASf,SAASoG,EAAM7E,GACb,IAAIV,EAAOR,KAAKC,SAAW,IAAIgB,EAAUC,GACzClB,KAAKE,KAAOM,EAAKN,IACnB,QAGA6F,EAAMxF,UAAUY,MAAQqE,EACxBO,EAAMxF,UAAkB,OAAIkF,EAC5BM,EAAMxF,UAAUe,IAAMoE,EACtBK,EAAMxF,UAAUgB,IAAMoE,EACtBI,EAAMxF,UAAUc,IAAMuE,EAEtBrG,GAAiBwG,4CMLjBxG,GAZA,SAAmBK,EAAOoG,GAIxB,IAHA,IAAIvF,GAAS,EACTX,EAAkB,MAATF,EAAgB,EAAIA,EAAME,SAE9BW,EAAQX,IAC8B,IAAzCkG,EAASpG,EAAMa,GAAQA,EAAOb,KAIpC,OAAOA,CACT,qCCnBA,IAAIyE,EAAY1E,KAEZsG,EAAkB,WACpB,IACE,IAAI3C,EAAOe,EAAU3C,OAAQ,kBAE7B,OADA4B,EAAK,CAAE,EAAE,GAAI,CAAA,GACNA,CACT,CAAE,MAAOZ,GAAI,CACf,CANsB,UAQtBnD,GAAiB0G,qCCVjB,IAAIA,EAAiBtG,YAwBrBJ,GAbA,SAAyB4E,EAAQtE,EAAKL,GACzB,aAAPK,GAAsBoG,EACxBA,EAAe9B,EAAQtE,EAAK,CAC1BqG,cAAgB,EAChBC,YAAc,EACd3G,MAASA,EACT4G,UAAY,IAGdjC,EAAOtE,GAAOL,CAElB,qCCtBA,IAAI6G,EAAkB1G,KAClBD,EAAKC,KAMLuC,EAHcR,OAAOnB,UAGQ2B,sBAoBjC3C,GARA,SAAqB4E,EAAQtE,EAAKL,GAChC,IAAI8G,EAAWnC,EAAOtE,GAChBqC,EAAevB,KAAKwD,EAAQtE,IAAQH,EAAG4G,EAAU9G,UACxCqB,IAAVrB,GAAyBK,KAAOsE,IACnCkC,EAAgBlC,EAAQtE,EAAKL,EAEjC,qCCzBA,IAAI+G,EAAc5G,KACd0G,EAAkB1G,YAsCtBJ,GA1BA,SAAoBiH,EAAQC,EAAOtC,EAAQuC,GACzC,IAAIC,GAASxC,EACbA,IAAWA,EAAS,CAAA,GAKpB,IAHA,IAAI1D,GAAS,EACTX,EAAS2G,EAAM3G,SAEVW,EAAQX,GAAQ,CACvB,IAAID,EAAM4G,EAAMhG,GAEZmG,EAAWF,EACXA,EAAWvC,EAAOtE,GAAM2G,EAAO3G,GAAMA,EAAKsE,EAAQqC,QAClD3F,OAEaA,IAAb+F,IACFA,EAAWJ,EAAO3G,IAEhB8G,EACFN,EAAgBlC,EAAQtE,EAAK+G,GAE7BL,EAAYpC,EAAQtE,EAAK+G,EAE7B,CACA,OAAOzC,CACT,4CCTA5E,GAJA,SAAsBC,GACpB,OAAgB,MAATA,GAAiC,iBAATA,CACjC,qCC1BA,IAAIqH,kCCAJ,IAAI/D,EAAanD,KACbmH,EAAenH,YAgBnBJ,GAJA,SAAyBC,GACvB,OAAOsH,EAAatH,IAVR,sBAUkBsD,EAAWtD,EAC3C,EDfsBG,GAClBmH,EAAenH,KAGfsC,EAAcP,OAAOnB,UAGrB2B,EAAiBD,EAAYC,eAG7B6E,EAAuB9E,EAAY8E,qBAoBnCC,EAAcH,EAAgB,WAAa,OAAOI,SAAW,CAA/B,IAAsCJ,EAAkB,SAASrH,GACjG,OAAOsH,EAAatH,IAAU0C,EAAevB,KAAKnB,EAAO,YACtDuH,EAAqBpG,KAAKnB,EAAO,SACtC,SAEAD,GAAiByH,qCEZjB,IAAIE,EAAU5G,MAAM4G,eAEpB3H,GAAiB2H,6ICzBjB,IAAIrF,EAAOlC,KACPwH,cCgBJ5H,GAJA,WACE,OAAO,CACT,GDXI6H,EAA4CC,IAAYA,EAAQC,UAAYD,EAG5EE,EAAaH,GAA4C7H,IAAWA,EAAO+H,UAAY/H,EAMvFiI,EAHgBD,GAAcA,EAAWF,UAAYD,EAG5BvF,EAAK2F,YAAS3G,EAsBvC4G,GAnBiBD,EAASA,EAAOC,cAAW5G,IAmBfsG,EAEjC5H,EAAAA,QAAiBkI,iDEpCjB,IAGIC,EAAW,0BAoBfnI,GAVA,SAAiBC,EAAOM,GACtB,IAAI+C,SAAcrD,EAGlB,SAFAM,EAAmB,MAAVA,EAfY,iBAewBA,KAGlC,UAAR+C,GACU,UAARA,GAAoB6E,EAASzD,KAAKzE,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQM,CACjD,4CCYAP,GALA,SAAkBC,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GA9Bb,gBA+BvB,4CCnBAD,GANA,SAAmB+D,GACjB,OAAO,SAAS9D,GACd,OAAO8D,EAAK9D,GAEhB,6LCXA,IAAIgC,EAAa7B,KAGbyH,EAA4CC,IAAYA,EAAQC,UAAYD,EAG5EE,EAAaH,GAA4C7H,IAAWA,EAAO+H,UAAY/H,EAMvFoI,EAHgBJ,GAAcA,EAAWF,UAAYD,GAGtB5F,EAAWoG,QAG1CC,EAAY,WACd,IAEE,IAAIC,EAAQP,GAAcA,EAAW5H,SAAW4H,EAAW5H,QAAQ,QAAQmI,MAE3E,OAAIA,GAKGH,GAAeA,EAAYI,SAAWJ,EAAYI,QAAQ,OACnE,CAAE,MAAOrF,GAAI,CACf,CAZgB,GAchBnD,EAAAA,QAAiBsI,iDC7BjB,IAAIG,kCCAJ,IAAIlF,EAAanD,KACbsI,EAAWtI,KACXmH,EAAenH,KA8BfuI,EAAiB,CAAA,SACrBA,EAZiB,yBAYYA,EAXZ,yBAYjBA,EAXc,sBAWYA,EAVX,uBAWfA,EAVe,uBAUYA,EATZ,uBAUfA,EATsB,8BASYA,EARlB,wBAShBA,EARgB,yBAQY,EAC5BA,EAjCc,sBAiCYA,EAhCX,kBAiCfA,EApBqB,wBAoBYA,EAhCnB,oBAiCdA,EApBkB,qBAoBYA,EAhChB,iBAiCdA,EAhCe,kBAgCYA,EA/Bb,qBAgCdA,EA/Ba,gBA+BYA,EA9BT,mBA+BhBA,EA9BgB,mBA8BYA,EA7BZ,mBA8BhBA,EA7Ba,gBA6BYA,EA5BT,mBA6BhBA,EA5BiB,qBA4BY,EAc7B3I,GALA,SAA0BC,GACxB,OAAOsH,EAAatH,IAClByI,EAASzI,EAAMM,WAAaoI,EAAepF,EAAWtD,GAC1D,EDzDuBG,GACnBwI,EAAYxI,KACZkI,EAAWlI,KAGXyI,EAAmBP,GAAYA,EAASQ,aAmBxCA,EAAeD,EAAmBD,EAAUC,GAAoBJ,SAEpEzI,GAAiB8I,qCE1BjB,IAAIC,cCmBJ/I,GAVA,SAAmBgJ,EAAGvC,GAIpB,IAHA,IAAIvF,GAAS,EACTkC,EAASrC,MAAMiI,KAEV9H,EAAQ8H,GACf5F,EAAOlC,GAASuF,EAASvF,GAE3B,OAAOkC,CACT,GDhBIqE,EAAcrH,KACduH,EAAUvH,KACV8H,EAAW9H,KACX6I,EAAU7I,KACV0I,EAAe1I,KAMfuC,EAHcR,OAAOnB,UAGQ2B,sBAqCjC3C,GA3BA,SAAuBC,EAAOiJ,GAC5B,IAAIC,EAAQxB,EAAQ1H,GAChBmJ,GAASD,GAAS1B,EAAYxH,GAC9BoJ,GAAUF,IAAUC,GAASlB,EAASjI,GACtCqJ,GAAUH,IAAUC,IAAUC,GAAUP,EAAa7I,GACrDsJ,EAAcJ,GAASC,GAASC,GAAUC,EAC1ClG,EAASmG,EAAcR,EAAU9I,EAAMM,OAAQiJ,QAAU,GACzDjJ,EAAS6C,EAAO7C,OAEpB,IAAK,IAAID,KAAOL,GACTiJ,IAAavG,EAAevB,KAAKnB,EAAOK,IACvCiJ,IAEQ,UAAPjJ,GAEC+I,IAAkB,UAAP/I,GAA0B,UAAPA,IAE9BgJ,IAAkB,UAAPhJ,GAA0B,cAAPA,GAA8B,cAAPA,IAEtD2I,EAAQ3I,EAAKC,KAElB6C,EAAO3B,KAAKnB,GAGhB,OAAO8C,CACT,qCE7CA,IAAIV,EAAcP,OAAOnB,iBAgBzBhB,GAPA,SAAqBC,GACnB,IAAIwJ,EAAOxJ,GAASA,EAAMyJ,YAG1B,OAAOzJ,KAFqB,mBAARwJ,GAAsBA,EAAKzI,WAAc0B,EAG/D,4CCDA1C,GANA,SAAiB+D,EAAM4F,GACrB,OAAO,SAASC,GACd,OAAO7F,EAAK4F,EAAUC,IAE1B,qCCZA,IAAIC,EAAczJ,KACd0J,kCCDJ,IAGIA,EAHU1J,IAGG2J,CAAQ5H,OAAO0B,KAAM1B,eAEtCnC,GAAiB8J,EDJA1J,GAMbuC,EAHcR,OAAOnB,UAGQ2B,sBAsBjC3C,GAbA,SAAkB4E,GAChB,IAAKiF,EAAYjF,GACf,OAAOkF,EAAWlF,GAEpB,IAAIxB,EAAS,GACb,IAAK,IAAI9C,KAAO6B,OAAOyC,GACjBjC,EAAevB,KAAKwD,EAAQtE,IAAe,eAAPA,GACtC8C,EAAO3B,KAAKnB,GAGhB,OAAO8C,CACT,qCE3BA,IAAIc,EAAa9D,KACbsI,EAAWtI,YA+BfJ,GAJA,SAAqBC,GACnB,OAAgB,MAATA,GAAiByI,EAASzI,EAAMM,UAAY2D,EAAWjE,EAChE,qCC9BA,IAAI+J,EAAgB5J,KAChB6J,EAAW7J,KACX8J,EAAc9J,YAkClBJ,GAJA,SAAc4E,GACZ,OAAOsF,EAAYtF,GAAUoF,EAAcpF,GAAUqF,EAASrF,EAChE,qCClCA,IAAIpB,EAAWpD,KACXyJ,EAAczJ,KACd+J,cCiBJnK,GAVA,SAAsB4E,GACpB,IAAIxB,EAAS,GACb,GAAc,MAAVwB,EACF,IAAK,IAAItE,KAAO6B,OAAOyC,GACrBxB,EAAO3B,KAAKnB,GAGhB,OAAO8C,CACT,GDTIT,EAHcR,OAAOnB,UAGQ2B,sBAwBjC3C,GAfA,SAAoB4E,GAClB,IAAKpB,EAASoB,GACZ,OAAOuF,EAAavF,GAEtB,IAAIwF,EAAUP,EAAYjF,GACtBxB,EAAS,GAEb,IAAK,IAAI9C,KAAOsE,GACD,eAAPtE,IAAyB8J,GAAYzH,EAAevB,KAAKwD,EAAQtE,KACrE8C,EAAO3B,KAAKnB,GAGhB,OAAO8C,CACT,qCE9BA,IAAI4G,EAAgB5J,KAChBiK,EAAajK,KACb8J,EAAc9J,YA6BlBJ,GAJA,SAAgB4E,GACd,OAAOsF,EAAYtF,GAAUoF,EAAcpF,GAAQ,GAAQyF,EAAWzF,EACxE,2TC7BA,IAAItC,EAAOlC,KAGPyH,EAA4CC,IAAYA,EAAQC,UAAYD,EAG5EE,EAAaH,GAA4C7H,IAAWA,EAAO+H,UAAY/H,EAMvFiI,EAHgBD,GAAcA,EAAWF,UAAYD,EAG5BvF,EAAK2F,YAAS3G,EACvCgJ,EAAcrC,EAASA,EAAOqC,iBAAchJ,EAqBhDtB,EAAAA,QAXA,SAAqBuK,EAAQC,GAC3B,GAAIA,EACF,OAAOD,EAAOE,QAEhB,IAAIlK,EAASgK,EAAOhK,OAChB6C,EAASkH,EAAcA,EAAY/J,GAAU,IAAIgK,EAAOb,YAAYnJ,GAGxE,OADAgK,EAAOG,KAAKtH,GACLA,CACT,wDCbApD,GAXA,SAAmBiH,EAAQ5G,GACzB,IAAIa,GAAS,EACTX,EAAS0G,EAAO1G,OAGpB,IADAF,IAAUA,EAAQU,MAAMR,MACfW,EAAQX,GACfF,EAAMa,GAAS+F,EAAO/F,GAExB,OAAOb,CACT,4CCOAL,GAfA,SAAqBK,EAAOsK,GAM1B,IALA,IAAIzJ,GAAS,EACTX,EAAkB,MAATF,EAAgB,EAAIA,EAAME,OACnCqK,EAAW,EACXxH,EAAS,KAEJlC,EAAQX,GAAQ,CACvB,IAAIN,EAAQI,EAAMa,GACdyJ,EAAU1K,EAAOiB,EAAOb,KAC1B+C,EAAOwH,KAAc3K,EAEzB,CACA,OAAOmD,CACT,4CCAApD,GAJA,WACE,MAAO,EACT,qCCpBA,IAAI6K,EAAczK,KACd0K,EAAY1K,KAMZoH,EAHcrF,OAAOnB,UAGcwG,qBAGnCuD,EAAmB5I,OAAO6I,6BAmB9BhL,GAVkB+K,EAA+B,SAASnG,GACxD,OAAc,MAAVA,EACK,IAETA,EAASzC,OAAOyC,GACTiG,EAAYE,EAAiBnG,IAAS,SAASqG,GACpD,OAAOzD,EAAqBpG,KAAKwD,EAAQqG,EAC3C,IACF,EARqCH,4CCArC9K,GAXA,SAAmBK,EAAO6K,GAKxB,IAJA,IAAIhK,GAAS,EACTX,EAAS2K,EAAO3K,OAChB4K,EAAS9K,EAAME,SAEVW,EAAQX,GACfF,EAAM8K,EAASjK,GAASgK,EAAOhK,GAEjC,OAAOb,CACT,qCCjBA,IAGI+K,EAHUhL,IAGK2J,CAAQ5H,OAAOkJ,eAAgBlJ,eAElDnC,GAAiBoL,qCCLjB,IAAIE,EAAYlL,KACZgL,EAAehL,KACfmL,EAAanL,KACb0K,EAAY1K,KAGZ2K,EAAmB5I,OAAO6I,6BAkB9BhL,GAToB+K,EAA+B,SAASnG,GAE1D,IADA,IAAIxB,EAAS,GACNwB,GACL0G,EAAUlI,EAAQmI,EAAW3G,IAC7BA,EAASwG,EAAaxG,GAExB,OAAOxB,CACT,EAPuC0H,qCCfvC,IAAIQ,EAAYlL,KACZuH,EAAUvH,YAkBdJ,GALA,SAAwB4E,EAAQ4G,EAAUC,GACxC,IAAIrI,EAASoI,EAAS5G,GACtB,OAAO+C,EAAQ/C,GAAUxB,EAASkI,EAAUlI,EAAQqI,EAAY7G,GAClE,qCCjBA,IAAI8G,EAAiBtL,KACjBmL,EAAanL,KACbyD,EAAOzD,YAaXJ,GAJA,SAAoB4E,GAClB,OAAO8G,EAAe9G,EAAQf,EAAM0H,EACtC,qCCbA,IAIII,EAJYvL,IAIN0E,CAHC1E,KAGe,cAE1BJ,GAAiB2L,qCCNjB,IAAIC,kCCAJ,IAIIA,EAJYxL,IAID0E,CAHJ1E,KAGoB,mBAE/BJ,GAAiB4L,EDNFxL,GACXyE,EAAMzE,KACNyL,kCEFJ,IAIIA,EAJYzL,IAIF0E,CAHH1E,KAGmB,kBAE9BJ,GAAiB6L,EFJHzL,GACVuL,EAAMvL,KACN0L,kCGJJ,IAIIA,EAJY1L,IAIF0E,CAHH1E,KAGmB,kBAE9BJ,GAAiB8L,EHFH1L,GACVmD,EAAanD,KACbgE,EAAWhE,KAGX2L,EAAS,eAETC,EAAa,mBACbC,EAAS,eACTC,EAAa,mBAEbC,EAAc,oBAGdC,EAAqBhI,EAASwH,GAC9BS,EAAgBjI,EAASS,GACzByH,EAAoBlI,EAASyH,GAC7BU,EAAgBnI,EAASuH,GACzBa,EAAoBpI,EAAS0H,GAS7BW,EAASlJ,SAGRqI,GAAYa,EAAO,IAAIb,EAAS,IAAIc,YAAY,MAAQP,GACxDtH,GAAO4H,EAAO,IAAI5H,IAAQkH,GAC1BF,GAAWY,EAAOZ,EAAQc,YAAcX,GACxCL,GAAOc,EAAO,IAAId,IAAQM,GAC1BH,GAAWW,EAAO,IAAIX,IAAYI,KACrCO,EAAS,SAASxM,GAChB,IAAImD,EAASG,EAAWtD,GACpBwJ,EA/BQ,mBA+BDrG,EAAsBnD,EAAMyJ,iBAAcpI,EACjDsL,EAAanD,EAAOrF,EAASqF,GAAQ,GAEzC,GAAImD,EACF,OAAQA,GACN,KAAKR,EAAoB,OAAOD,EAChC,KAAKE,EAAe,OAAON,EAC3B,KAAKO,EAAmB,OAAON,EAC/B,KAAKO,EAAe,OAAON,EAC3B,KAAKO,EAAmB,OAAON,EAGnC,OAAO9I,IAIXpD,GAAiByM,qCIzDjB,IAGII,EAHOzM,KAGWyM,kBAEtB7M,GAAiB6M,qCCLjB,IAAIA,EAAazM,YAejBJ,GANA,SAA0B8M,GACxB,IAAI1J,EAAS,IAAI0J,EAAYpD,YAAYoD,EAAYC,YAErD,OADA,IAAIF,EAAWzJ,GAAQtB,IAAI,IAAI+K,EAAWC,IACnC1J,CACT,qCCbA,IAAI4J,EAAmB5M,YAevBJ,GALA,SAAyBiN,EAAYzC,GACnC,IAAID,EAASC,EAASwC,EAAiBC,EAAW1C,QAAU0C,EAAW1C,OACvE,OAAO,IAAI0C,EAAWvD,YAAYa,EAAQ0C,EAAWC,WAAYD,EAAW1M,OAC9E,qCCbA,IAAIyM,EAAmB5M,KACnB+M,kCCDJ,IAAIH,EAAmB5M,YAevBJ,GALA,SAAuBoN,EAAU5C,GAC/B,IAAID,EAASC,EAASwC,EAAiBI,EAAS7C,QAAU6C,EAAS7C,OACnE,OAAO,IAAI6C,EAAS1D,YAAYa,EAAQ6C,EAASF,WAAYE,EAASL,WACxE,EDZoB3M,GAChBiN,kCEDJ,IAAIC,EAAU,cAedtN,GANA,SAAqBuN,GACnB,IAAInK,EAAS,IAAImK,EAAO7D,YAAY6D,EAAOtG,OAAQqG,EAAQ1J,KAAK2J,IAEhE,OADAnK,EAAOoK,UAAYD,EAAOC,UACnBpK,CACT,EFZkBhD,GACdqN,kCGHJ,IAAIjL,EAASpC,KAGTsN,EAAclL,EAASA,EAAOxB,eAAYM,EAC1CqM,EAAgBD,EAAcA,EAAYE,aAAUtM,SAaxDtB,GAJA,SAAqBiL,GACnB,OAAO0C,EAAgBxL,OAAOwL,EAAcvM,KAAK6J,IAAW,EAC9D,EHZkB7K,GACdyN,EAAkBzN,YAwEtBJ,GApCA,SAAwB4E,EAAQ3B,EAAKuH,GACnC,IAAIf,EAAO7E,EAAO8E,YAClB,OAAQzG,GACN,IA3BiB,uBA4Bf,OAAO+J,EAAiBpI,GAE1B,IAvCU,mBAwCV,IAvCU,gBAwCR,OAAO,IAAI6E,GAAM7E,GAEnB,IAjCc,oBAkCZ,OAAOuI,EAAcvI,EAAQ4F,GAE/B,IAnCa,wBAmCI,IAlCJ,wBAmCb,IAlCU,qBAkCI,IAjCH,sBAiCkB,IAhClB,sBAiCX,IAhCW,sBAgCI,IA/BG,6BA+BmB,IA9BzB,uBA8ByC,IA7BzC,uBA8BV,OAAOqD,EAAgBjJ,EAAQ4F,GAEjC,IAjDS,eA2DT,IAxDS,eAyDP,OAAO,IAAIf,EARb,IAnDY,kBAoDZ,IAjDY,kBAkDV,OAAO,IAAIA,EAAK7E,GAElB,IAtDY,kBAuDV,OAAOyI,EAAYzI,GAKrB,IAzDY,kBA0DV,OAAO6I,EAAY7I,GAEzB,qCI1EA,IAAIpB,EAAWpD,KAGX0N,EAAe3L,OAAO4L,OAUtBC,EAAc,WAChB,SAASpJ,IAAU,CACnB,OAAO,SAASqJ,GACd,IAAKzK,EAASyK,GACZ,MAAO,GAET,GAAIH,EACF,OAAOA,EAAaG,GAEtBrJ,EAAO5D,UAAYiN,EACnB,IAAI7K,EAAS,IAAIwB,EAEjB,OADAA,EAAO5D,eAAYM,EACZ8B,EAEX,CAdkB,UAgBlBpD,GAAiBgO,qCC7BjB,IAAIA,EAAa5N,KACbgL,EAAehL,KACfyJ,EAAczJ,YAelBJ,GANA,SAAyB4E,GACvB,MAAqC,mBAAtBA,EAAO8E,aAA8BG,EAAYjF,GAE5D,CAAA,EADAoJ,EAAW5C,EAAaxG,GAE9B,qCCfA,IAAIsJ,kCCAJ,IAAIzB,EAASrM,KACTmH,EAAenH,YAgBnBJ,GAJA,SAAmBC,GACjB,OAAOsH,EAAatH,IAVT,gBAUmBwM,EAAOxM,EACvC,EDfgBG,GACZwI,EAAYxI,KACZkI,EAAWlI,KAGX+N,EAAY7F,GAAYA,EAAS8F,MAmBjCA,EAAQD,EAAYvF,EAAUuF,GAAaD,SAE/ClO,GAAiBoO,qCE1BjB,IAAIC,kCCAJ,IAAI5B,EAASrM,KACTmH,EAAenH,YAgBnBJ,GAJA,SAAmBC,GACjB,OAAOsH,EAAatH,IAVT,gBAUmBwM,EAAOxM,EACvC,EDfgBG,GACZwI,EAAYxI,KACZkI,EAAWlI,KAGXkO,EAAYhG,GAAYA,EAASiG,MAmBjCA,EAAQD,EAAY1F,EAAU0F,GAAaD,SAE/CrO,GAAiBuO,qCE1BjB,IAAI/H,EAAQpG,KACRoO,EAAYpO,KACZ4G,EAAc5G,KACdqO,kCCHJ,IAAIC,EAAatO,KACbyD,EAAOzD,YAeXJ,GAJA,SAAoB4E,EAAQqC,GAC1B,OAAOrC,GAAU8J,EAAWzH,EAAQpD,EAAKoD,GAASrC,EACpD,EDXiBxE,GACbuO,kCEJJ,IAAID,EAAatO,KACbwO,EAASxO,YAebJ,GAJA,SAAsB4E,EAAQqC,GAC5B,OAAOrC,GAAU8J,EAAWzH,EAAQ2H,EAAO3H,GAASrC,EACtD,EFVmBxE,GACfyO,EAAczO,KACd0O,EAAY1O,KACZ2O,kCGPJ,IAAIL,EAAatO,KACbmL,EAAanL,YAcjBJ,GAJA,SAAqBiH,EAAQrC,GAC3B,OAAO8J,EAAWzH,EAAQsE,EAAWtE,GAASrC,EAChD,EHNkBxE,GACd4O,kCIRJ,IAAIN,EAAatO,KACb6O,EAAe7O,YAcnBJ,GAJA,SAAuBiH,EAAQrC,GAC7B,OAAO8J,EAAWzH,EAAQgI,EAAahI,GAASrC,EAClD,EJLoBxE,GAChB8O,EAAa9O,KACb+O,kCKVJ,IAAIzD,EAAiBtL,KACjB6O,EAAe7O,KACfwO,EAASxO,YAcbJ,GAJA,SAAsB4E,GACpB,OAAO8G,EAAe9G,EAAQgK,EAAQK,EACxC,ELJmB7O,GACfqM,EAASrM,KACTgP,kCMXJ,IAGIzM,EAHcR,OAAOnB,UAGQ2B,sBAqBjC3C,GAZA,SAAwBK,GACtB,IAAIE,EAASF,EAAME,OACf6C,EAAS,IAAI/C,EAAMqJ,YAAYnJ,GAOnC,OAJIA,GAA6B,iBAAZF,EAAM,IAAkBsC,EAAevB,KAAKf,EAAO,WACtE+C,EAAOlC,MAAQb,EAAMa,MACrBkC,EAAOiM,MAAQhP,EAAMgP,OAEhBjM,CACT,ENXqBhD,GACjBkP,EAAiBlP,KACjBmP,EAAkBnP,KAClBuH,EAAUvH,KACV8H,EAAW9H,KACXgO,EAAQhO,KACRoD,EAAWpD,KACXmO,EAAQnO,KACRyD,EAAOzD,KACPwO,EAASxO,KAQToP,EAAU,qBAKVC,EAAU,oBAIVC,EAAY,kBAoBZC,EAAgB,CAAA,SACpBA,EAAcH,GAAWG,EA7BV,kBA8BfA,EAfqB,wBAeWA,EAdd,qBAelBA,EA9Bc,oBA8BWA,EA7BX,iBA8BdA,EAfiB,yBAeWA,EAdX,yBAejBA,EAdc,sBAcWA,EAbV,uBAcfA,EAbe,uBAaWA,EA5Bb,gBA6BbA,EA5BgB,mBA4BWA,EAAcD,GACzCC,EA3BgB,mBA2BWA,EA1Bd,gBA2BbA,EA1BgB,mBA0BWA,EAzBX,mBA0BhBA,EAhBe,uBAgBWA,EAfJ,8BAgBtBA,EAfgB,wBAeWA,EAdX,yBAcsC,EACtDA,EArCe,kBAqCWA,EAAcF,GACxCE,EA5BiB,qBA4BW,EA8F5B3P,GA5EA,SAAS4P,EAAU3P,EAAO4P,EAAS1I,EAAY7G,EAAKsE,EAAQkL,GAC1D,IAAI1M,EACAoH,EAnEgB,EAmEPqF,EACTE,EAnEgB,EAmEPF,EACTG,EAnEmB,EAmEVH,EAKb,GAHI1I,IACF/D,EAASwB,EAASuC,EAAWlH,EAAOK,EAAKsE,EAAQkL,GAAS3I,EAAWlH,SAExDqB,IAAX8B,EACF,OAAOA,EAET,IAAKI,EAASvD,GACZ,OAAOA,EAET,IAAIkJ,EAAQxB,EAAQ1H,GACpB,GAAIkJ,GAEF,GADA/F,EAASgM,EAAenP,IACnBuK,EACH,OAAOsE,EAAU7O,EAAOmD,OAErB,CACL,IAAIH,EAAMwJ,EAAOxM,GACbgQ,EAAShN,GAAOwM,GA7EX,8BA6EsBxM,EAE/B,GAAIiF,EAASjI,GACX,OAAO4O,EAAY5O,EAAOuK,GAE5B,GAAIvH,GAAOyM,GAAazM,GAAOuM,GAAYS,IAAWrL,GAEpD,GADAxB,EAAU2M,GAAUE,EAAU,CAAE,EAAGV,EAAgBtP,IAC9CuK,EACH,OAAOuF,EACHf,EAAc/O,EAAO0O,EAAavL,EAAQnD,IAC1C8O,EAAY9O,EAAOwO,EAAWrL,EAAQnD,QAEvC,CACL,IAAK0P,EAAc1M,GACjB,OAAO2B,EAAS3E,EAAQ,GAE1BmD,EAASkM,EAAerP,EAAOgD,EAAKuH,EACtC,CACF,CAEAsF,IAAUA,EAAQ,IAAItJ,GACtB,IAAI0J,EAAUJ,EAAM/N,IAAI9B,GACxB,GAAIiQ,EACF,OAAOA,EAETJ,EAAMhO,IAAI7B,EAAOmD,GAEbmL,EAAMtO,GACRA,EAAMkQ,SAAQ,SAASC,GACrBhN,EAAOiN,IAAIT,EAAUQ,EAAUP,EAAS1I,EAAYiJ,EAAUnQ,EAAO6P,GACvE,IACS1B,EAAMnO,IACfA,EAAMkQ,SAAQ,SAASC,EAAU9P,GAC/B8C,EAAOtB,IAAIxB,EAAKsP,EAAUQ,EAAUP,EAAS1I,EAAY7G,EAAKL,EAAO6P,GACvE,IAGF,IAII5I,EAAQiC,OAAQ7H,GAJL0O,EACVD,EAASZ,EAAeD,EACxBa,EAASnB,EAAS/K,GAEkB5D,GASzC,OARAuO,EAAUtH,GAASjH,GAAO,SAASmQ,EAAU9P,GACvC4G,IAEFkJ,EAAWnQ,EADXK,EAAM8P,IAIRpJ,EAAY5D,EAAQ9C,EAAKsP,EAAUQ,EAAUP,EAAS1I,EAAY7G,EAAKL,EAAO6P,GAChF,IACO1M,CACT,wCOnKA,IAAIwM,EAAYxP,YAmChBJ,GAJA,SAAeC,GACb,OAAO2P,EAAU3P,EA7BM,EA8BzB,4CCRAD,GANA,SAAkBC,GAChB,OAAO,WACL,OAAOA,EAEX,ynBCrBIqQ,+FCFJ,IAaIC,eCWJvQ,GAjBA,SAAuBwQ,GACrB,OAAO,SAAS5L,EAAQ6B,EAAU+E,GAMhC,IALA,IAAItK,GAAS,EACTuP,EAAWtO,OAAOyC,GAClBsC,EAAQsE,EAAS5G,GACjBrE,EAAS2G,EAAM3G,OAEZA,KAAU,CACf,IAAID,EAAM4G,EAAMsJ,EAAYjQ,IAAWW,GACvC,IAA+C,IAA3CuF,EAASgK,EAASnQ,GAAMA,EAAKmQ,GAC/B,KAEJ,CACA,OAAO7L,EAEX,aDPA5E,GAAiBuQ,qCEfjB,IAAIA,EAAUnQ,KACVyD,EAAOzD,YAcXJ,GAJA,SAAoB4E,EAAQ6B,GAC1B,OAAO7B,GAAU2L,EAAQ3L,EAAQ6B,EAAU5C,EAC7C,qCCbA,IAAI6M,EAAatQ,KAWbuQ,kCCXJ,IAAIzG,EAAc9J,YA+BlBJ,GArBA,SAAwB4Q,EAAUJ,GAChC,OAAO,SAASK,EAAYpK,GAC1B,GAAkB,MAAdoK,EACF,OAAOA,EAET,IAAK3G,EAAY2G,GACf,OAAOD,EAASC,EAAYpK,GAM9B,IAJA,IAAIlG,EAASsQ,EAAWtQ,OACpBW,EAAQsP,EAAYjQ,GAAU,EAC9BkQ,EAAWtO,OAAO0O,IAEdL,EAAYtP,MAAYA,EAAQX,KACa,IAA/CkG,EAASgK,EAASvP,GAAQA,EAAOuP,KAIvC,OAAOI,EAEX,ED5BqBzQ,EAUN0Q,CAAeJ,UAE9B1Q,GAAiB2Q,4CEOjB3Q,GAJA,SAAkBC,GAChB,OAAOA,CACT,qCClBA,IAAI8Q,EAAW3Q,YAafJ,GAJA,SAAsBC,GACpB,MAAuB,mBAATA,EAAsBA,EAAQ8Q,CAC9C,qCCXA,IAAIvC,EAAYpO,KACZuQ,EAAWvQ,KACX4Q,EAAe5Q,KACfuH,EAAUvH,YAqCdJ,GALA,SAAiB6Q,EAAYpK,GAE3B,OADWkB,EAAQkJ,GAAcrC,EAAYmC,GACjCE,EAAYG,EAAavK,GACvC,6CCtCAzG,EAAAA,QAAiBI,iDCAjB,IAAI4F,EAAW5F,KACX6Q,cCiBJjR,GALA,SAAqBC,GAEnB,OADAQ,KAAKC,SAASoB,IAAI7B,EAbC,6BAcZQ,IACT,GDdIyQ,cEWJlR,GAJA,SAAqBC,GACnB,OAAOQ,KAAKC,SAASsB,IAAI/B,EAC3B,GFCA,SAASkR,EAASjG,GAChB,IAAIhK,GAAS,EACTX,EAAmB,MAAV2K,EAAiB,EAAIA,EAAO3K,OAGzC,IADAE,KAAKC,SAAW,IAAIsF,IACX9E,EAAQX,GACfE,KAAK4P,IAAInF,EAAOhK,GAEpB,QAGAiQ,EAASnQ,UAAUqP,IAAMc,EAASnQ,UAAUS,KAAOwP,EACnDE,EAASnQ,UAAUgB,IAAMkP,EAEzBlR,GAAiBmR,4CGdjBnR,GAJA,SAAkBoR,EAAO9Q,GACvB,OAAO8Q,EAAMpP,IAAI1B,EACnB,qCCVA,IAAI6Q,EAAW/Q,KACXiR,cCqBJrR,GAZA,SAAmBK,EAAOsK,GAIxB,IAHA,IAAIzJ,GAAS,EACTX,EAAkB,MAATF,EAAgB,EAAIA,EAAME,SAE9BW,EAAQX,GACf,GAAIoK,EAAUtK,EAAMa,GAAQA,EAAOb,GACjC,OAAO,EAGX,OAAO,CACT,GDlBIiR,EAAWlR,YAiFfJ,GA9DA,SAAqBK,EAAOH,EAAO2P,EAAS1I,EAAYoK,EAAWzB,GACjE,IAAI0B,EAjBqB,EAiBT3B,EACZ4B,EAAYpR,EAAME,OAClBmR,EAAYxR,EAAMK,OAEtB,GAAIkR,GAAaC,KAAeF,GAAaE,EAAYD,GACvD,OAAO,EAGT,IAAIE,EAAa7B,EAAM/N,IAAI1B,GACvBuR,EAAa9B,EAAM/N,IAAI7B,GAC3B,GAAIyR,GAAcC,EAChB,OAAOD,GAAczR,GAAS0R,GAAcvR,EAE9C,IAAIa,GAAS,EACTkC,GAAS,EACTyO,EA/BuB,EA+BfhC,EAAoC,IAAIsB,OAAW7P,EAM/D,IAJAwO,EAAMhO,IAAIzB,EAAOH,GACjB4P,EAAMhO,IAAI5B,EAAOG,KAGRa,EAAQuQ,GAAW,CAC1B,IAAIK,EAAWzR,EAAMa,GACjB6Q,EAAW7R,EAAMgB,GAErB,GAAIiG,EACF,IAAI6K,EAAWR,EACXrK,EAAW4K,EAAUD,EAAU5Q,EAAOhB,EAAOG,EAAOyP,GACpD3I,EAAW2K,EAAUC,EAAU7Q,EAAOb,EAAOH,EAAO4P,GAE1D,QAAiBxO,IAAb0Q,EAAwB,CAC1B,GAAIA,EACF,SAEF5O,GAAS,EACT,KACF,CAEA,GAAIyO,GACF,IAAKR,EAAUnR,GAAO,SAAS6R,EAAUE,GACnC,IAAKX,EAASO,EAAMI,KACfH,IAAaC,GAAYR,EAAUO,EAAUC,EAAUlC,EAAS1I,EAAY2I,IAC/E,OAAO+B,EAAKpQ,KAAKwQ,EAErB,IAAI,CACN7O,GAAS,EACT,KACF,OACK,GACD0O,IAAaC,IACXR,EAAUO,EAAUC,EAAUlC,EAAS1I,EAAY2I,GACpD,CACL1M,GAAS,EACT,KACF,CACF,CAGA,OAFA0M,EAAc,OAAEzP,GAChByP,EAAc,OAAE5P,GACTkD,CACT,4CEhEApD,GAVA,SAAoB8B,GAClB,IAAIZ,GAAS,EACTkC,EAASrC,MAAMe,EAAInB,MAKvB,OAHAmB,EAAIqO,SAAQ,SAASlQ,GACnBmD,IAASlC,GAASjB,CACpB,IACOmD,CACT,qCCfA,IAAIZ,EAASpC,KACTyM,EAAazM,KACbD,EAAKC,KACL8R,EAAc9R,KACd+R,cCaJnS,GAVA,SAAoBuF,GAClB,IAAIrE,GAAS,EACTkC,EAASrC,MAAMwE,EAAI5E,MAKvB,OAHA4E,EAAI4K,SAAQ,SAASlQ,EAAOK,GAC1B8C,IAASlC,GAAS,CAACZ,EAAKL,EAC1B,IACOmD,CACT,GDVIgP,EAAahS,KAqBbsN,EAAclL,EAASA,EAAOxB,eAAYM,EAC1CqM,EAAgBD,EAAcA,EAAYE,aAAUtM,SAoFxDtB,GAjEA,SAAoB4E,EAAQ1E,EAAO+C,EAAK4M,EAAS1I,EAAYoK,EAAWzB,GACtE,OAAQ7M,GACN,IAzBc,oBA0BZ,GAAK2B,EAAOmI,YAAc7M,EAAM6M,YAC3BnI,EAAOsI,YAAchN,EAAMgN,WAC9B,OAAO,EAETtI,EAASA,EAAO2F,OAChBrK,EAAQA,EAAMqK,OAEhB,IAlCiB,uBAmCf,QAAK3F,EAAOmI,YAAc7M,EAAM6M,aAC3BwE,EAAU,IAAI1E,EAAWjI,GAAS,IAAIiI,EAAW3M,KAKxD,IAnDU,mBAoDV,IAnDU,gBAoDV,IAjDY,kBAoDV,OAAOC,GAAIyE,GAAS1E,GAEtB,IAxDW,iBAyDT,OAAO0E,EAAOyN,MAAQnS,EAAMmS,MAAQzN,EAAO0N,SAAWpS,EAAMoS,QAE9D,IAxDY,kBAyDZ,IAvDY,kBA2DV,OAAO1N,GAAW1E,EAAQ,GAE5B,IAjES,eAkEP,IAAIqS,EAAUJ,EAEhB,IAjES,eAkEP,IAAIX,EA5EiB,EA4EL3B,EAGhB,GAFA0C,IAAYA,EAAUH,GAElBxN,EAAOjE,MAAQT,EAAMS,OAAS6Q,EAChC,OAAO,EAGT,IAAItB,EAAUJ,EAAM/N,IAAI6C,GACxB,GAAIsL,EACF,OAAOA,GAAWhQ,EAEpB2P,GAtFuB,EAyFvBC,EAAMhO,IAAI8C,EAAQ1E,GAClB,IAAIkD,EAAS8O,EAAYK,EAAQ3N,GAAS2N,EAAQrS,GAAQ2P,EAAS1I,EAAYoK,EAAWzB,GAE1F,OADAA,EAAc,OAAElL,GACTxB,EAET,IAnFY,kBAoFV,GAAIuK,EACF,OAAOA,EAAcvM,KAAKwD,IAAW+I,EAAcvM,KAAKlB,GAG9D,OAAO,CACT,qCE7GA,IAAIsG,EAAQpG,KACR8R,EAAc9R,KACdoS,EAAapS,KACbqS,kCCHJ,IAAIvD,EAAa9O,KASbuC,EAHcR,OAAOnB,UAGQ2B,sBAgFjC3C,GAjEA,SAAsB4E,EAAQ1E,EAAO2P,EAAS1I,EAAYoK,EAAWzB,GACnE,IAAI0B,EAtBqB,EAsBT3B,EACZ6C,EAAWxD,EAAWtK,GACtB+N,EAAYD,EAASnS,OAIzB,GAAIoS,GAHWzD,EAAWhP,GACDK,SAEMiR,EAC7B,OAAO,EAGT,IADA,IAAItQ,EAAQyR,EACLzR,KAAS,CACd,IAAIZ,EAAMoS,EAASxR,GACnB,KAAMsQ,EAAYlR,KAAOJ,EAAQyC,EAAevB,KAAKlB,EAAOI,IAC1D,OAAO,CAEX,CAEA,IAAIsS,EAAa9C,EAAM/N,IAAI6C,GACvBgN,EAAa9B,EAAM/N,IAAI7B,GAC3B,GAAI0S,GAAchB,EAChB,OAAOgB,GAAc1S,GAAS0R,GAAchN,EAE9C,IAAIxB,GAAS,EACb0M,EAAMhO,IAAI8C,EAAQ1E,GAClB4P,EAAMhO,IAAI5B,EAAO0E,GAGjB,IADA,IAAIiO,EAAWrB,IACNtQ,EAAQyR,GAAW,CAE1B,IAAI5L,EAAWnC,EADftE,EAAMoS,EAASxR,IAEX6Q,EAAW7R,EAAMI,GAErB,GAAI6G,EACF,IAAI6K,EAAWR,EACXrK,EAAW4K,EAAUhL,EAAUzG,EAAKJ,EAAO0E,EAAQkL,GACnD3I,EAAWJ,EAAUgL,EAAUzR,EAAKsE,EAAQ1E,EAAO4P,GAGzD,UAAmBxO,IAAb0Q,EACGjL,IAAagL,GAAYR,EAAUxK,EAAUgL,EAAUlC,EAAS1I,EAAY2I,GAC7EkC,GACD,CACL5O,GAAS,EACT,KACF,CACAyP,IAAaA,EAAkB,eAAPvS,EAC1B,CACA,GAAI8C,IAAWyP,EAAU,CACvB,IAAIC,EAAUlO,EAAO8E,YACjBqJ,EAAU7S,EAAMwJ,YAGhBoJ,GAAWC,KACV,gBAAiBnO,MAAU,gBAAiB1E,IACzB,mBAAX4S,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvD3P,GAAS,EAEb,CAGA,OAFA0M,EAAc,OAAElL,GAChBkL,EAAc,OAAE5P,GACTkD,CACT,EDpFmBhD,GACfqM,EAASrM,KACTuH,EAAUvH,KACV8H,EAAW9H,KACX0I,EAAe1I,KAMfoP,EAAU,qBACVwD,EAAW,iBACXtD,EAAY,kBAMZ/M,EAHcR,OAAOnB,UAGQ2B,sBA6DjC3C,GA7CA,SAAyB4E,EAAQ1E,EAAO2P,EAAS1I,EAAYoK,EAAWzB,GACtE,IAAImD,EAAWtL,EAAQ/C,GACnBsO,EAAWvL,EAAQzH,GACnBiT,EAASF,EAAWD,EAAWvG,EAAO7H,GACtCwO,EAASF,EAAWF,EAAWvG,EAAOvM,GAKtCmT,GAHJF,EAASA,GAAU3D,EAAUE,EAAYyD,IAGhBzD,EACrB4D,GAHJF,EAASA,GAAU5D,EAAUE,EAAY0D,IAGhB1D,EACrB6D,EAAYJ,GAAUC,EAE1B,GAAIG,GAAarL,EAAStD,GAAS,CACjC,IAAKsD,EAAShI,GACZ,OAAO,EAET+S,GAAW,EACXI,GAAW,CACb,CACA,GAAIE,IAAcF,EAEhB,OADAvD,IAAUA,EAAQ,IAAItJ,GACdyM,GAAYnK,EAAalE,GAC7BsN,EAAYtN,EAAQ1E,EAAO2P,EAAS1I,EAAYoK,EAAWzB,GAC3D0C,EAAW5N,EAAQ1E,EAAOiT,EAAQtD,EAAS1I,EAAYoK,EAAWzB,GAExE,KArDyB,EAqDnBD,GAAiC,CACrC,IAAI2D,EAAeH,GAAY1Q,EAAevB,KAAKwD,EAAQ,eACvD6O,EAAeH,GAAY3Q,EAAevB,KAAKlB,EAAO,eAE1D,GAAIsT,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAe5O,EAAO3E,QAAU2E,EAC/C+O,EAAeF,EAAevT,EAAMD,QAAUC,EAGlD,OADA4P,IAAUA,EAAQ,IAAItJ,GACf+K,EAAUmC,EAAcC,EAAc9D,EAAS1I,EAAY2I,EACpE,CACF,CACA,QAAKyD,IAGLzD,IAAUA,EAAQ,IAAItJ,GACfiM,EAAa7N,EAAQ1E,EAAO2P,EAAS1I,EAAYoK,EAAWzB,GACrE,qCEhFA,IAAI8D,EAAkBxT,KAClBmH,EAAenH,YA0BnBJ,GAVA,SAAS6T,EAAY5T,EAAOC,EAAO2P,EAAS1I,EAAY2I,GACtD,OAAI7P,IAAUC,IAGD,MAATD,GAA0B,MAATC,IAAmBqH,EAAatH,KAAWsH,EAAarH,GACpED,GAAUA,GAASC,GAAUA,EAE/B0T,EAAgB3T,EAAOC,EAAO2P,EAAS1I,EAAY0M,EAAa/D,GACzE,wCCzBA,IAAItM,EAAWpD,YAcfJ,GAJA,SAA4BC,GAC1B,OAAOA,GAAUA,IAAUuD,EAASvD,EACtC,4CCOAD,GAVA,SAAiCM,EAAKwT,GACpC,OAAO,SAASlP,GACd,OAAc,MAAVA,IAGGA,EAAOtE,KAASwT,SACPxS,IAAbwS,GAA2BxT,KAAO6B,OAAOyC,KAEhD,qCCjBA,IAAImP,kCCAJ,IAAIvN,EAAQpG,KACRyT,EAAczT,YA4DlBJ,GA5CA,SAAqB4E,EAAQqC,EAAQ+M,EAAW7M,GAC9C,IAAIjG,EAAQ8S,EAAUzT,OAClBA,EAASW,EACT+S,GAAgB9M,EAEpB,GAAc,MAAVvC,EACF,OAAQrE,EAGV,IADAqE,EAASzC,OAAOyC,GACT1D,KAAS,CACd,IAAID,EAAO+S,EAAU9S,GACrB,GAAK+S,GAAgBhT,EAAK,GAClBA,EAAK,KAAO2D,EAAO3D,EAAK,MACtBA,EAAK,KAAM2D,GAEnB,OAAO,CAEX,CACA,OAAS1D,EAAQX,GAAQ,CAEvB,IAAID,GADJW,EAAO+S,EAAU9S,IACF,GACX6F,EAAWnC,EAAOtE,GAClBwT,EAAW7S,EAAK,GAEpB,GAAIgT,GAAgBhT,EAAK,IACvB,QAAiBK,IAAbyF,KAA4BzG,KAAOsE,GACrC,OAAO,MAEJ,CACL,IAAIkL,EAAQ,IAAItJ,EAChB,GAAIW,EACF,IAAI/D,EAAS+D,EAAWJ,EAAU+M,EAAUxT,EAAKsE,EAAQqC,EAAQ6I,GAEnE,UAAiBxO,IAAX8B,EACEyQ,EAAYC,EAAU/M,EAAUmN,EAA+C/M,EAAY2I,GAC3F1M,GAEN,OAAO,CAEX,CACF,CACA,OAAO,CACT,ED3DkBhD,GACd+T,kCEDJ,IAAIC,EAAqBhU,KACrByD,EAAOzD,YAsBXJ,GAbA,SAAsB4E,GAIpB,IAHA,IAAIxB,EAASS,EAAKe,GACdrE,EAAS6C,EAAO7C,OAEbA,KAAU,CACf,IAAID,EAAM8C,EAAO7C,GACbN,EAAQ2E,EAAOtE,GAEnB8C,EAAO7C,GAAU,CAACD,EAAKL,EAAOmU,EAAmBnU,GACnD,CACA,OAAOmD,CACT,EFpBmBhD,GACfiU,EAA0BjU,YAmB9BJ,GAVA,SAAqBiH,GACnB,IAAI+M,EAAYG,EAAalN,GAC7B,OAAwB,GAApB+M,EAAUzT,QAAeyT,EAAU,GAAG,GACjCK,EAAwBL,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAASpP,GACd,OAAOA,IAAWqC,GAAU8M,EAAYnP,EAAQqC,EAAQ+M,GAE5D,qCGnBA,IAAIzQ,EAAanD,KACbmH,EAAenH,YA2BnBJ,GALA,SAAkBC,GAChB,MAAuB,iBAATA,GACXsH,EAAatH,IArBF,mBAqBYsD,EAAWtD,EACvC,qCC1BA,IAAI0H,EAAUvH,KACVkU,EAAWlU,KAGXmU,EAAe,mDACfC,EAAgB,eAuBpBxU,GAbA,SAAeC,EAAO2E,GACpB,GAAI+C,EAAQ1H,GACV,OAAO,EAET,IAAIqD,SAAcrD,EAClB,QAAY,UAARqD,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATrD,IAAiBqU,EAASrU,MAGvBuU,EAAc9P,KAAKzE,KAAWsU,EAAa7P,KAAKzE,IAC1C,MAAV2E,GAAkB3E,KAASkC,OAAOyC,GACvC,qCC1BA,IAAI6P,kCCAJ,IAAIzO,EAAW5F,KAiDf,SAASqU,EAAQ1Q,EAAM2Q,GACrB,GAAmB,mBAAR3Q,GAAmC,MAAZ2Q,GAAuC,mBAAZA,EAC3D,MAAM,IAAIC,UAhDQ,uBAkDpB,IAAIC,EAAW,WACb,IAAIC,EAAOnN,UACPpH,EAAMoU,EAAWA,EAASI,MAAMrU,KAAMoU,GAAQA,EAAK,GACnDzD,EAAQwD,EAASxD,MAErB,GAAIA,EAAMpP,IAAI1B,GACZ,OAAO8Q,EAAMrP,IAAIzB,GAEnB,IAAI8C,EAASW,EAAK+Q,MAAMrU,KAAMoU,GAE9B,OADAD,EAASxD,MAAQA,EAAMtP,IAAIxB,EAAK8C,IAAWgO,EACpChO,GAGT,OADAwR,EAASxD,MAAQ,IAAKqD,EAAQM,OAAS/O,GAChC4O,CACT,QAGAH,EAAQM,MAAQ/O,EAEhBhG,GAAiByU,EDxEHrU,UAyBdJ,GAZA,SAAuB+D,GACrB,IAAIX,EAASqR,EAAQ1Q,GAAM,SAASzD,GAIlC,OAfmB,MAYf8Q,EAAMzQ,MACRyQ,EAAMxP,QAEDtB,CACT,IAEI8Q,EAAQhO,EAAOgO,MACnB,OAAOhO,CACT,4CEHApD,GAXA,SAAkBK,EAAOoG,GAKvB,IAJA,IAAIvF,GAAS,EACTX,EAAkB,MAATF,EAAgB,EAAIA,EAAME,OACnC6C,EAASrC,MAAMR,KAEVW,EAAQX,GACf6C,EAAOlC,GAASuF,EAASpG,EAAMa,GAAQA,EAAOb,GAEhD,OAAO+C,CACT,qCClBA,IAAI4R,kCCAJ,IAAIxS,EAASpC,KACT6U,EAAW7U,KACXuH,EAAUvH,KACVkU,EAAWlU,KAMXsN,EAAclL,EAASA,EAAOxB,eAAYM,EAC1C4T,EAAiBxH,EAAcA,EAAY7K,cAAWvB,SA0B1DtB,GAhBA,SAASgV,EAAa/U,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI0H,EAAQ1H,GAEV,OAAOgV,EAAShV,EAAO+U,GAAgB,GAEzC,GAAIV,EAASrU,GACX,OAAOiV,EAAiBA,EAAe9T,KAAKnB,GAAS,GAEvD,IAAImD,EAAUnD,EAAQ,GACtB,MAAkB,KAAVmD,GAAkB,EAAInD,IAAU,IAAa,KAAOmD,CAC9D,KDlCmBhD,UA2BnBJ,GAJA,SAAkBC,GAChB,OAAgB,MAATA,EAAgB,GAAK+U,EAAa/U,EAC3C,qCEzBA,IAAI0H,EAAUvH,KACV+U,EAAQ/U,KACRgV,kCCFJ,IAAIC,EAAgBjV,KAGhBkV,EAAa,mGAGbC,EAAe,WASfH,EAAeC,GAAc,SAAS3P,GACxC,IAAItC,EAAS,GAOb,OAN6B,KAAzBsC,EAAO8P,WAAW,IACpBpS,EAAO3B,KAAK,IAEdiE,EAAOjB,QAAQ6Q,GAAY,SAASG,EAAOC,EAAQC,EAAOC,GACxDxS,EAAO3B,KAAKkU,EAAQC,EAAUnR,QAAQ8Q,EAAc,MAASG,GAAUD,EACzE,IACOrS,CACT,WAEApD,GAAiBoV,EDxBEhV,GACfyC,EAAWzC,YAiBfJ,GAPA,SAAkBC,EAAO2E,GACvB,OAAI+C,EAAQ1H,GACHA,EAEFkV,EAAMlV,EAAO2E,GAAU,CAAC3E,GAASmV,EAAavS,EAAS5C,GAChE,qCElBA,IAAIqU,EAAWlU,YAoBfJ,GARA,SAAeC,GACb,GAAoB,iBAATA,GAAqBqU,EAASrU,GACvC,OAAOA,EAET,IAAImD,EAAUnD,EAAQ,GACtB,MAAkB,KAAVmD,GAAkB,EAAInD,IAAU,IAAa,KAAOmD,CAC9D,qCClBA,IAAIyS,EAAWzV,KACX0V,EAAQ1V,YAsBZJ,GAZA,SAAiB4E,EAAQmR,GAMvB,IAHA,IAAI7U,EAAQ,EACRX,GAHJwV,EAAOF,EAASE,EAAMnR,IAGJrE,OAED,MAAVqE,GAAkB1D,EAAQX,GAC/BqE,EAASA,EAAOkR,EAAMC,EAAK7U,OAE7B,OAAQA,GAASA,GAASX,EAAUqE,OAAStD,CAC/C,qCCrBA,IAAIuU,EAAWzV,KACXqH,EAAcrH,KACduH,EAAUvH,KACV6I,EAAU7I,KACVsI,EAAWtI,KACX0V,EAAQ1V,YAiCZJ,GAtBA,SAAiB4E,EAAQmR,EAAMC,GAO7B,IAJA,IAAI9U,GAAS,EACTX,GAHJwV,EAAOF,EAASE,EAAMnR,IAGJrE,OACd6C,GAAS,IAEJlC,EAAQX,GAAQ,CACvB,IAAID,EAAMwV,EAAMC,EAAK7U,IACrB,KAAMkC,EAAmB,MAAVwB,GAAkBoR,EAAQpR,EAAQtE,IAC/C,MAEFsE,EAASA,EAAOtE,EAClB,CACA,OAAI8C,KAAYlC,GAASX,EAChB6C,KAET7C,EAAmB,MAAVqE,EAAiB,EAAIA,EAAOrE,SAClBmI,EAASnI,IAAW0I,EAAQ3I,EAAKC,KACjDoH,EAAQ/C,IAAW6C,EAAY7C,GACpC,qCCpCA,IAAIqR,cCYJjW,GAJA,SAAmB4E,EAAQtE,GACzB,OAAiB,MAAVsE,GAAkBtE,KAAO6B,OAAOyC,EACzC,GDTIsR,EAAU9V,YAgCdJ,GAJA,SAAe4E,EAAQmR,GACrB,OAAiB,MAAVnR,GAAkBsR,EAAQtR,EAAQmR,EAAME,EACjD,qCE/BA,IAAIpC,EAAczT,KACd2B,kCCDJ,IAAIoU,EAAU/V,YAgCdJ,GALA,SAAa4E,EAAQmR,EAAMK,GACzB,IAAIhT,EAAmB,MAAVwB,OAAiBtD,EAAY6U,EAAQvR,EAAQmR,GAC1D,YAAkBzU,IAAX8B,EAAuBgT,EAAehT,CAC/C,ED7BUhD,GACNiW,EAAQjW,KACR+U,EAAQ/U,KACRgU,EAAqBhU,KACrBiU,EAA0BjU,KAC1B0V,EAAQ1V,YA0BZJ,GAZA,SAA6B+V,EAAMjC,GACjC,OAAIqB,EAAMY,IAAS3B,EAAmBN,GAC7BO,EAAwByB,EAAMC,GAAOjC,GAEvC,SAASlP,GACd,IAAImC,EAAWhF,EAAI6C,EAAQmR,GAC3B,YAAqBzU,IAAbyF,GAA0BA,IAAa+M,EAC3CuC,EAAMzR,EAAQmR,GACdlC,EAAYC,EAAU/M,EAAUmN,GAExC,4CEjBAlU,GANA,SAAsBM,GACpB,OAAO,SAASsE,GACd,OAAiB,MAAVA,OAAiBtD,EAAYsD,EAAOtE,GAE/C,qCCXA,IAAIgW,EAAelW,KACfmW,kCCDJ,IAAIJ,EAAU/V,YAedJ,GANA,SAA0B+V,GACxB,OAAO,SAASnR,GACd,OAAOuR,EAAQvR,EAAQmR,GAE3B,EDZuB3V,GACnB+U,EAAQ/U,KACR0V,EAAQ1V,YA4BZJ,GAJA,SAAkB+V,GAChB,OAAOZ,EAAMY,GAAQO,EAAaR,EAAMC,IAASQ,EAAiBR,EACpE,qCE7BA,IAAIS,EAAcpW,KACdqW,EAAsBrW,KACtB2Q,EAAW3Q,KACXuH,EAAUvH,KACVsW,EAAWtW,YA0BfJ,GAjBA,SAAsBC,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACK8Q,EAEW,iBAAT9Q,EACF0H,EAAQ1H,GACXwW,EAAoBxW,EAAM,GAAIA,EAAM,IACpCuW,EAAYvW,GAEXyW,EAASzW,EAClB,qCC5BA,IAAI4K,EAAczK,KACduW,kCCDJ,IAAIhG,EAAWvQ,YAoBfJ,GAVA,SAAoB6Q,EAAYlG,GAC9B,IAAIvH,EAAS,GAMb,OALAuN,EAASE,GAAY,SAAS5Q,EAAOiB,EAAO2P,GACtClG,EAAU1K,EAAOiB,EAAO2P,IAC1BzN,EAAO3B,KAAKxB,EAEhB,IACOmD,CACT,EDjBiBhD,GACbwW,EAAexW,KACfuH,EAAUvH,YAgDdJ,GALA,SAAgB6Q,EAAYlG,GAE1B,OADWhD,EAAQkJ,GAAchG,EAAc8L,GACnC9F,EAAY+F,EAAajM,EAAW,GAClD,qCEjDA,IAAIkM,kCCCJ,IAGIlU,EAHcR,OAAOnB,UAGQ2B,sBAcjC3C,GAJA,SAAiB4E,EAAQtE,GACvB,OAAiB,MAAVsE,GAAkBjC,EAAevB,KAAKwD,EAAQtE,EACvD,EDhBcF,GACV8V,EAAU9V,YAiCdJ,GAJA,SAAa4E,EAAQmR,GACnB,OAAiB,MAAVnR,GAAkBsR,EAAQtR,EAAQmR,EAAMc,EACjD,qCEhCA,IAAI5M,EAAW7J,KACXqM,EAASrM,KACTqH,EAAcrH,KACduH,EAAUvH,KACV8J,EAAc9J,KACd8H,EAAW9H,KACXyJ,EAAczJ,KACd0I,EAAe1I,KAUfuC,EAHcR,OAAOnB,UAGQ2B,sBA2DjC3C,GAxBA,SAAiBC,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIiK,EAAYjK,KACX0H,EAAQ1H,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAMa,QAC1DoH,EAASjI,IAAU6I,EAAa7I,IAAUwH,EAAYxH,IAC1D,OAAQA,EAAMM,OAEhB,IAAI0C,EAAMwJ,EAAOxM,GACjB,GApDW,gBAoDPgD,GAnDO,gBAmDUA,EACnB,OAAQhD,EAAMU,KAEhB,GAAIkJ,EAAY5J,GACd,OAAQgK,EAAShK,GAAOM,OAE1B,IAAK,IAAID,KAAOL,EACd,GAAI0C,EAAevB,KAAKnB,EAAOK,GAC7B,OAAO,EAGX,OAAO,CACT,4CCrDAN,GAJA,SAAqBC,GACnB,YAAiBqB,IAAVrB,CACT,qCCnBA,IAAI0Q,EAAWvQ,KACX8J,EAAc9J,YAoBlBJ,GAVA,SAAiB6Q,EAAYpK,GAC3B,IAAIvF,GAAS,EACTkC,EAAS8G,EAAY2G,GAAc9P,MAAM8P,EAAWtQ,QAAU,GAKlE,OAHAoQ,EAASE,GAAY,SAAS5Q,EAAOK,EAAKuQ,GACxCzN,IAASlC,GAASuF,EAASxG,EAAOK,EAAKuQ,EACzC,IACOzN,CACT,qCCnBA,IAAI6R,EAAW7U,KACXwW,EAAexW,KACf0W,EAAU1W,KACVuH,EAAUvH,YAiDdJ,GALA,SAAa6Q,EAAYpK,GAEvB,OADWkB,EAAQkJ,GAAcoE,EAAW6B,GAChCjG,EAAY+F,EAAanQ,EAAU,GACjD,qCClDA,IAAIsQ,cCyBJ/W,GAbA,SAAqBK,EAAOoG,EAAUuQ,EAAaC,GACjD,IAAI/V,GAAS,EACTX,EAAkB,MAATF,EAAgB,EAAIA,EAAME,OAKvC,IAHI0W,GAAa1W,IACfyW,EAAc3W,IAAQa,MAEfA,EAAQX,GACfyW,EAAcvQ,EAASuQ,EAAa3W,EAAMa,GAAQA,EAAOb,GAE3D,OAAO2W,CACT,GDtBIrG,EAAWvQ,KACXwW,EAAexW,KACf8W,cEmBJlX,GATA,SAAoB6Q,EAAYpK,EAAUuQ,EAAaC,EAAWrG,GAMhE,OALAA,EAASC,GAAY,SAAS5Q,EAAOiB,EAAO2P,GAC1CmG,EAAcC,GACTA,GAAY,EAAOhX,GACpBwG,EAASuQ,EAAa/W,EAAOiB,EAAO2P,EAC1C,IACOmG,CACT,GFhBIrP,EAAUvH,YA8CdJ,GAPA,SAAgB6Q,EAAYpK,EAAUuQ,GACpC,IAAIjT,EAAO4D,EAAQkJ,GAAckG,EAAcG,EAC3CD,EAAYvP,UAAUnH,OAAS,EAEnC,OAAOwD,EAAK8M,EAAY+F,EAAanQ,EAAU,GAAIuQ,EAAaC,EAAWtG,EAC7E,wCGhDA,IAAIwG,kCCAJ,IASIA,EATe/W,IASHkW,CAAa,iBAE7BtW,GAAiBmX,EDXD/W,GACZgX,kCEAJ,IAWIC,EAAe7S,OAAO,8FAa1BxE,GAJA,SAAoB0F,GAClB,OAAO2R,EAAa3S,KAAKgB,EAC3B,EFtBiBtF,GACbkX,kCGDJ,IAAIC,EAAgB,kBAQhBC,EAAW,IAAMD,EAAgB,IACjCE,EAAU,kDACVC,EAAS,2BAETC,EAAc,KAAOJ,EAAgB,IACrCK,EAAa,kCACbC,EAAa,qCAIbC,EAPa,MAAQL,EAAU,IAAMC,EAO1BK,KACXC,EAAW,oBAEXC,EAAQD,EAAWF,EADP,gBAAwB,CAACH,EAAaC,EAAYC,GAAYK,KAAK,KAAO,IAAMF,EAAWF,EAAW,KAElHK,EAAW,MAAQ,CAACR,EAAcF,EAAU,IAAKA,EAASG,EAAYC,EAAYL,GAAUU,KAAK,KAAO,IAGxGE,EAAY5T,OAAOkT,EAAS,MAAQA,EAAS,KAAOS,EAAWF,EAAO,YAiB1EjY,GARA,SAAqB0F,GAEnB,IADA,IAAItC,EAASgV,EAAU5K,UAAY,EAC5B4K,EAAU1T,KAAKgB,MAClBtC,EAEJ,OAAOA,CACT,EHvCkBhD,UAelBJ,GANA,SAAoB0F,GAClB,OAAO0R,EAAW1R,GACd4R,EAAY5R,GACZyR,EAAUzR,EAChB,qCIfA,IAAIuE,EAAW7J,KACXqM,EAASrM,KACT8J,EAAc9J,KACdiY,kCCHJ,IAAI9U,EAAanD,KACbuH,EAAUvH,KACVmH,EAAenH,YA2BnBJ,GALA,SAAkBC,GAChB,MAAuB,iBAATA,IACV0H,EAAQ1H,IAAUsH,EAAatH,IArBrB,mBAqB+BsD,EAAWtD,EAC1D,EDxBeG,GACXkY,EAAalY,YAyCjBJ,GAdA,SAAc6Q,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAI3G,EAAY2G,GACd,OAAOwH,EAASxH,GAAcyH,EAAWzH,GAAcA,EAAWtQ,OAEpE,IAAI0C,EAAMwJ,EAAOoE,GACjB,MAhCW,gBAgCP5N,GA/BO,gBA+BUA,EACZ4N,EAAWlQ,KAEbsJ,EAAS4G,GAAYtQ,MAC9B,qCE3CA,IAAIiO,EAAYpO,KACZ4N,EAAa5N,KACbsQ,EAAatQ,KACbwW,EAAexW,KACfgL,EAAehL,KACfuH,EAAUvH,KACV8H,EAAW9H,KACX8D,EAAa9D,KACboD,EAAWpD,KACX0I,EAAe1I,YAuDnBJ,GAvBA,SAAmB4E,EAAQ6B,EAAUuQ,GACnC,IAAI7N,EAAQxB,EAAQ/C,GAChB2T,EAAYpP,GAASjB,EAAStD,IAAWkE,EAAalE,GAG1D,GADA6B,EAAWmQ,EAAanQ,EAAU,GACf,MAAfuQ,EAAqB,CACvB,IAAIvN,EAAO7E,GAAUA,EAAO8E,YAE1BsN,EADEuB,EACYpP,EAAQ,IAAIM,EAAO,GAE1BjG,EAASoB,IACFV,EAAWuF,GAAQuE,EAAW5C,EAAaxG,IAG3C,CAAA,CAElB,CAIA,OAHC2T,EAAY/J,EAAYkC,GAAY9L,GAAQ,SAAS3E,EAAOiB,EAAO0D,GAClE,OAAO6B,EAASuQ,EAAa/W,EAAOiB,EAAO0D,EAC7C,IACOoS,CACT,qCC9DA,IAAI1L,EAAYlL,KACZoY,kCCDJ,IAAIhW,EAASpC,KACTqH,EAAcrH,KACduH,EAAUvH,KAGVqY,EAAmBjW,EAASA,EAAOkW,wBAAqBpX,SAc5DtB,GALA,SAAuBC,GACrB,OAAO0H,EAAQ1H,IAAUwH,EAAYxH,OAChCwY,GAAoBxY,GAASA,EAAMwY,GAC1C,EDhBoBrY,UAoCpBJ,GAvBA,SAAS2Y,EAAYtY,EAAOuY,EAAOjO,EAAWkO,EAAUzV,GACtD,IAAIlC,GAAS,EACTX,EAASF,EAAME,OAKnB,IAHAoK,IAAcA,EAAY6N,GAC1BpV,IAAWA,EAAS,MAEXlC,EAAQX,GAAQ,CACvB,IAAIN,EAAQI,EAAMa,GACd0X,EAAQ,GAAKjO,EAAU1K,GACrB2Y,EAAQ,EAEVD,EAAY1Y,EAAO2Y,EAAQ,EAAGjO,EAAWkO,EAAUzV,GAEnDkI,EAAUlI,EAAQnD,GAEV4Y,IACVzV,EAAOA,EAAO7C,QAAUN,EAE5B,CACA,OAAOmD,CACT,wCEnCA,IAAI0R,cCoBJ9U,GAVA,SAAe+D,EAAM+U,EAASjE,GAC5B,OAAQA,EAAKtU,QACX,KAAK,EAAG,OAAOwD,EAAK3C,KAAK0X,GACzB,KAAK,EAAG,OAAO/U,EAAK3C,KAAK0X,EAASjE,EAAK,IACvC,KAAK,EAAG,OAAO9Q,EAAK3C,KAAK0X,EAASjE,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAO9Q,EAAK3C,KAAK0X,EAASjE,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAO9Q,EAAK+Q,MAAMgE,EAASjE,EAC7B,GDfIkE,EAAYC,KAAKC,WAgCrBjZ,GArBA,SAAkB+D,EAAMmV,EAAOvP,GAE7B,OADAuP,EAAQH,OAAoBzX,IAAV4X,EAAuBnV,EAAKxD,OAAS,EAAK2Y,EAAO,GAC5D,WAML,IALA,IAAIrE,EAAOnN,UACPxG,GAAS,EACTX,EAASwY,EAAUlE,EAAKtU,OAAS2Y,EAAO,GACxC7Y,EAAQU,MAAMR,KAETW,EAAQX,GACfF,EAAMa,GAAS2T,EAAKqE,EAAQhY,GAE9BA,GAAS,EAET,IADA,IAAIiY,EAAYpY,MAAMmY,EAAQ,KACrBhY,EAAQgY,GACfC,EAAUjY,GAAS2T,EAAK3T,GAG1B,OADAiY,EAAUD,GAASvP,EAAUtJ,GACtByU,EAAM/Q,EAAMtD,KAAM0Y,GAE7B,wCEjCA,IAAIC,kCCAJ,IAAIC,EAAWjZ,KACXsG,EAAiBtG,KACjB2Q,EAAW3Q,YAmBfJ,GATuB0G,EAA4B,SAAS3C,EAAM2B,GAChE,OAAOgB,EAAe3C,EAAM,WAAY,CACtC4C,cAAgB,EAChBC,YAAc,EACd3G,MAASoZ,EAAS3T,GAClBmB,UAAY,GAEhB,EAPwCkK,EDZlB3Q,GAClBkZ,kCEAJ,IAIIC,EAAYC,KAAKC,WA+BrBzZ,GApBA,SAAkB+D,GAChB,IAAI2V,EAAQ,EACRC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQL,IACRM,EApBO,IAoBiBD,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMH,GAzBI,IA0BR,OAAOhS,UAAU,QAGnBgS,EAAQ,EAEV,OAAO3V,EAAK+Q,WAAMxT,EAAWoG,WAEjC,KFjCetH,GAUX0Z,EAAcR,EAASF,UAE3BpZ,GAAiB8Z,qCGbjB,IAAI/I,EAAW3Q,KACX2Z,EAAW3Z,KACX0Z,EAAc1Z,YAclBJ,GAJA,SAAkB+D,EAAMmV,GACtB,OAAOY,EAAYC,EAAShW,EAAMmV,EAAOnI,GAAWhN,EAAO,GAC7D,4CCSA/D,GAZA,SAAuBK,EAAOsK,EAAWqP,EAAWxJ,GAIlD,IAHA,IAAIjQ,EAASF,EAAME,OACfW,EAAQ8Y,GAAaxJ,EAAY,GAAK,GAElCA,EAAYtP,MAAYA,EAAQX,GACtC,GAAIoK,EAAUtK,EAAMa,GAAQA,EAAOb,GACjC,OAAOa,EAGX,OAAQ,CACV,qCCrBA,IAAI+Y,EAAgB7Z,KAChB8Z,cCUJla,GAJA,SAAmBC,GACjB,OAAOA,GAAUA,CACnB,GDPIka,cEoBJna,GAZA,SAAuBK,EAAOJ,EAAO+Z,GAInC,IAHA,IAAI9Y,EAAQ8Y,EAAY,EACpBzZ,EAASF,EAAME,SAEVW,EAAQX,GACf,GAAIF,EAAMa,KAAWjB,EACnB,OAAOiB,EAGX,OAAQ,CACV,UFDAlB,GANA,SAAqBK,EAAOJ,EAAO+Z,GACjC,OAAO/Z,GAAUA,EACbka,EAAc9Z,EAAOJ,EAAO+Z,GAC5BC,EAAc5Z,EAAO6Z,EAAWF,EACtC,qCGjBA,IAAIrO,EAAMvL,KACNga,cCeJpa,GAJA,WACE,GDXEoS,EAAahS,KAYbia,EAAc1O,GAAQ,EAAIyG,EAAW,IAAIzG,EAAI,CAAE,EAAC,KAAK,IAT1C,IASoE,SAAST,GAC1F,OAAO,IAAIS,EAAIT,EACjB,EAF4EkP,SAI5Epa,GAAiBqa,qCElBjB,IAAIlJ,EAAW/Q,KACXka,kCCDJ,IAAIC,EAAcna,YAgBlBJ,GALA,SAAuBK,EAAOJ,GAE5B,QADsB,MAATI,IAAoBA,EAAME,SACpBga,EAAYla,EAAOJ,EAAO,IAAM,CACrD,EDboBG,GAChBoa,cEmBJxa,GAZA,SAA2BK,EAAOJ,EAAOwa,GAIvC,IAHA,IAAIvZ,GAAS,EACTX,EAAkB,MAATF,EAAgB,EAAIA,EAAME,SAE9BW,EAAQX,GACf,GAAIka,EAAWxa,EAAOI,EAAMa,IAC1B,OAAO,EAGX,OAAO,CACT,GFhBIoQ,EAAWlR,KACXia,EAAYja,KACZgS,EAAahS,YAkEjBJ,GApDA,SAAkBK,EAAOoG,EAAUgU,GACjC,IAAIvZ,GAAS,EACTwZ,EAAWJ,EACX/Z,EAASF,EAAME,OACfoa,GAAW,EACXvX,EAAS,GACTyO,EAAOzO,EAEX,GAAIqX,EACFE,GAAW,EACXD,EAAWF,OAER,GAAIja,GAvBY,IAuBgB,CACnC,IAAIuB,EAAM2E,EAAW,KAAO4T,EAAUha,GACtC,GAAIyB,EACF,OAAOsQ,EAAWtQ,GAEpB6Y,GAAW,EACXD,EAAWpJ,EACXO,EAAO,IAAIV,CACb,MAEEU,EAAOpL,EAAW,GAAKrD,EAEzBwX,EACA,OAAS1Z,EAAQX,GAAQ,CACvB,IAAIN,EAAQI,EAAMa,GACd2Z,EAAWpU,EAAWA,EAASxG,GAASA,EAG5C,GADAA,EAASwa,GAAwB,IAAVxa,EAAeA,EAAQ,EAC1C0a,GAAYE,GAAaA,EAAU,CAErC,IADA,IAAIC,EAAYjJ,EAAKtR,OACdua,KACL,GAAIjJ,EAAKiJ,KAAeD,EACtB,SAASD,EAGTnU,GACFoL,EAAKpQ,KAAKoZ,GAEZzX,EAAO3B,KAAKxB,EACb,MACSya,EAAS7I,EAAMgJ,EAAUJ,KAC7B5I,IAASzO,GACXyO,EAAKpQ,KAAKoZ,GAEZzX,EAAO3B,KAAKxB,GAEhB,CACA,OAAOmD,CACT,qCGrEA,IAAI8G,EAAc9J,KACdmH,EAAenH,YA+BnBJ,GAJA,SAA2BC,GACzB,OAAOsH,EAAatH,IAAUiK,EAAYjK,EAC5C,qCC9BA,IAAI0Y,EAAcvY,KACd2a,EAAW3a,KACX4a,EAAW5a,KACX6a,EAAoB7a,KAkBpB8a,EAAQH,GAAS,SAASI,GAC5B,OAAOH,EAASrC,EAAYwC,EAAQ,EAAGF,GAAmB,GAC5D,WAEAjb,GAAiBkb,qCCzBjB,IAAIE,kCCAJ,IAAInG,EAAW7U,YAkBfJ,GANA,SAAoB4E,EAAQsC,GAC1B,OAAO+N,EAAS/N,GAAO,SAAS5G,GAC9B,OAAOsE,EAAOtE,EAChB,GACF,EDhBiBF,GACbyD,EAAOzD,YAgCXJ,GAJA,SAAgB4E,GACd,OAAiB,MAAVA,EAAiB,GAAKwW,EAAWxW,EAAQf,EAAKe,GACvD,gCE7BA,IAAIyW,OAGF,IACEA,EAAS,CACPC,MAAOlb,KACPiZ,SAAUjZ,KACVmb,KAAMnb,KACNob,OAAQpb,KACR4B,IAAM5B,KACNuH,QAASvH,KACTqb,QAASrb,KACT8D,WAAY9D,KACZsb,YAAatb,KACbyD,KAAMzD,KACNmF,IAAKnF,KACLub,OAAQvb,KACRO,KAAMP,KACNuJ,UAAWvJ,KACX8a,MAAO9a,KACP8K,OAAQ9K,KAEX,CAAC,MAAO+C,GACP,QAICkY,IACHA,EAASO,OAAOC,GAGlB7b,GAAiBqb,qCC/BjB,IAAIQ,EAAIzb,KAEM0b,GAAGC,EAEjB,IAAIC,EAAoB,KACpBC,EAAa,KACbC,EAAiB,IAYrB,SAASH,EAAMI,GACb1b,KAAK2b,aAAcP,EAAE7Z,IAAIma,EAAM,aAAcA,EAAKE,SAClD5b,KAAK6b,gBAAgBT,EAAE7Z,IAAIma,EAAM,eAAgBA,EAAKI,WACtD9b,KAAK+b,cAAcX,EAAE7Z,IAAIma,EAAM,aAAcA,EAAKM,SAGlDhc,KAAKic,YAASpb,EAGdb,KAAKkc,oBAAsBd,EAAExC,cAAS/X,GAGtCb,KAAKmc,oBAAsBf,EAAExC,cAAS/X,GAGtCb,KAAKoc,OAAS,GAEVpc,KAAK+b,cAEP/b,KAAKqc,QAAU,GAGfrc,KAAKsc,UAAY,GACjBtc,KAAKsc,UAAUd,GAAc,IAI/Bxb,KAAKuc,IAAM,GAGXvc,KAAKwc,OAAS,GAGdxc,KAAKyc,KAAO,GAGZzc,KAAK0c,MAAQ,GAGb1c,KAAK2c,UAAY,GAGjB3c,KAAK4c,YAAc,EACrB,CA2aA,SAASC,EAAqB/X,EAAKgY,GAC7BhY,EAAIgY,GACNhY,EAAIgY,KAEJhY,EAAIgY,GAAK,CAEb,CAEA,SAASC,EAAuBjY,EAAKgY,KAC5BhY,EAAIgY,WAAahY,EAAIgY,EAC9B,CAEA,SAASE,EAAaC,EAAYC,EAAIC,EAAIvL,GACxC,IAAIwL,EAAI,GAAKF,EACTG,EAAI,GAAKF,EACb,IAAKF,GAAcG,EAAIC,EAAG,CACxB,IAAIC,EAAMF,EACVA,EAAIC,EACJA,EAAIC,CACN,CACA,OAAOF,EAAI3B,EAAiB4B,EAAI5B,GACpBL,EAAEH,YAAYrJ,GAAQ2J,EAAoB3J,EACxD,CAiBA,SAAS2L,EAAYN,EAAYO,GAC/B,OAAOR,EAAaC,EAAYO,EAAQJ,EAAGI,EAAQH,EAAGG,EAAQ5L,KAChE,QAjdA0J,EAAM/a,UAAUkd,WAAa,EAG7BnC,EAAM/a,UAAUmd,WAAa,EAK7BpC,EAAM/a,UAAU0c,WAAa,WAC3B,OAAOjd,KAAK2b,WACd,EAEAL,EAAM/a,UAAUod,aAAe,WAC7B,OAAO3d,KAAK6b,aACd,EAEAP,EAAM/a,UAAUqd,WAAa,WAC3B,OAAO5d,KAAK+b,WACd,EAEAT,EAAM/a,UAAUsd,SAAW,SAASC,GAElC,OADA9d,KAAKic,OAAS6B,EACP9d,IACT,EAEAsb,EAAM/a,UAAU8a,MAAQ,WACtB,OAAOrb,KAAKic,MACd,EAKAX,EAAM/a,UAAUwd,oBAAsB,SAASC,GAK7C,OAJK5C,EAAE3X,WAAWua,KAChBA,EAAa5C,EAAExC,SAASoF,IAE1Bhe,KAAKkc,oBAAsB8B,EACpBhe,IACT,EAEAsb,EAAM/a,UAAU0d,UAAY,WAC1B,OAAOje,KAAKyd,UACd,EAEAnC,EAAM/a,UAAU2d,MAAQ,WACtB,OAAO9C,EAAEhY,KAAKpD,KAAKoc,OACrB,EAEAd,EAAM/a,UAAU4d,QAAU,WACxB,IAAIvc,EAAO5B,KACX,OAAOob,EAAEL,OAAO/a,KAAKke,SAAS,SAASd,GACrC,OAAOhC,EAAEJ,QAAQpZ,EAAK2a,IAAIa,GAC5B,GACF,EAEA9B,EAAM/a,UAAU6d,MAAQ,WACtB,IAAIxc,EAAO5B,KACX,OAAOob,EAAEL,OAAO/a,KAAKke,SAAS,SAASd,GACrC,OAAOhC,EAAEJ,QAAQpZ,EAAK6a,KAAKW,GAC7B,GACF,EAEA9B,EAAM/a,UAAU8d,SAAW,SAASC,EAAI9e,GACtC,IAAI4U,EAAOnN,UACPrF,EAAO5B,KAQX,OAPAob,EAAEN,KAAKwD,GAAI,SAASlB,GACdhJ,EAAKtU,OAAS,EAChB8B,EAAK2c,QAAQnB,EAAG5d,GAEhBoC,EAAK2c,QAAQnB,EAEjB,IACOpd,IACT,EAEAsb,EAAM/a,UAAUge,QAAU,SAASnB,EAAG5d,GACpC,OAAI4b,EAAE7Z,IAAIvB,KAAKoc,OAAQgB,IACjBnW,UAAUnH,OAAS,IACrBE,KAAKoc,OAAOgB,GAAK5d,GAEZQ,OAGTA,KAAKoc,OAAOgB,GAAKnW,UAAUnH,OAAS,EAAIN,EAAQQ,KAAKkc,oBAAoBkB,GACrEpd,KAAK+b,cACP/b,KAAKqc,QAAQe,GAAK5B,EAClBxb,KAAKsc,UAAUc,GAAK,GACpBpd,KAAKsc,UAAUd,GAAY4B,IAAK,GAElCpd,KAAKuc,IAAIa,GAAK,GACdpd,KAAKwc,OAAOY,GAAK,GACjBpd,KAAKyc,KAAKW,GAAK,GACfpd,KAAK0c,MAAMU,GAAK,KACdpd,KAAKyd,WACAzd,KACT,EAEAsb,EAAM/a,UAAUie,KAAO,SAASpB,GAC9B,OAAOpd,KAAKoc,OAAOgB,EACrB,EAEA9B,EAAM/a,UAAUke,QAAU,SAASrB,GACjC,OAAOhC,EAAE7Z,IAAIvB,KAAKoc,OAAQgB,EAC5B,EAEA9B,EAAM/a,UAAUme,WAAc,SAAStB,GACrC,IAAIxb,EAAO5B,KACX,GAAIob,EAAE7Z,IAAIvB,KAAKoc,OAAQgB,GAAI,CACzB,IAAIuB,EAAa,SAASjc,GAAKd,EAAK+c,WAAW/c,EAAK+a,UAAUja,YACvD1C,KAAKoc,OAAOgB,GACfpd,KAAK+b,cACP/b,KAAK4e,4BAA4BxB,UAC1Bpd,KAAKqc,QAAQe,GACpBhC,EAAEN,KAAK9a,KAAK6e,SAASzB,IAAI,SAAS0B,GAChCld,EAAKmd,UAAUD,EACjB,WACO9e,KAAKsc,UAAUc,IAExBhC,EAAEN,KAAKM,EAAEhY,KAAKpD,KAAKuc,IAAIa,IAAKuB,UACrB3e,KAAKuc,IAAIa,UACTpd,KAAKwc,OAAOY,GACnBhC,EAAEN,KAAKM,EAAEhY,KAAKpD,KAAKyc,KAAKW,IAAKuB,UACtB3e,KAAKyc,KAAKW,UACVpd,KAAK0c,MAAMU,KAChBpd,KAAKyd,UACT,CACA,OAAOzd,IACT,EAEAsb,EAAM/a,UAAUwe,UAAY,SAAS3B,EAAG4B,GACtC,IAAKhf,KAAK+b,YACR,MAAM,IAAIkD,MAAM,6CAGlB,GAAI7D,EAAEH,YAAY+D,GAChBA,EAASxD,MACJ,CAGL,IAAK,IAAI0D,EADTF,GAAU,IAEP5D,EAAEH,YAAYiE,GACfA,EAAWlf,KAAKgf,OAAOE,GACvB,GAAIA,IAAa9B,EACf,MAAM,IAAI6B,MAAM,WAAaD,EAAQ,iBAAmB5B,EACxC,yBAIpBpd,KAAKue,QAAQS,EACf,CAMA,OAJAhf,KAAKue,QAAQnB,GACbpd,KAAK4e,4BAA4BxB,GACjCpd,KAAKqc,QAAQe,GAAK4B,EAClBhf,KAAKsc,UAAU0C,GAAQ5B,IAAK,EACrBpd,IACT,EAEAsb,EAAM/a,UAAUqe,4BAA8B,SAASxB,UAC9Cpd,KAAKsc,UAAUtc,KAAKqc,QAAQe,IAAIA,EACzC,EAEA9B,EAAM/a,UAAUye,OAAS,SAAS5B,GAChC,GAAIpd,KAAK+b,YAAa,CACpB,IAAIiD,EAAShf,KAAKqc,QAAQe,GAC1B,GAAI4B,IAAWxD,EACb,OAAOwD,CAEX,CACF,EAEA1D,EAAM/a,UAAUse,SAAW,SAASzB,GAKlC,GAJIhC,EAAEH,YAAYmC,KAChBA,EAAI5B,GAGFxb,KAAK+b,YAAa,CACpB,IAAI8C,EAAW7e,KAAKsc,UAAUc,GAC9B,GAAIyB,EACF,OAAOzD,EAAEhY,KAAKyb,EAElB,KAAO,IAAIzB,IAAM5B,EACf,OAAOxb,KAAKke,QACP,GAAIle,KAAKye,QAAQrB,GACtB,MAAO,EACT,CACF,EAEA9B,EAAM/a,UAAU4e,aAAe,SAAS/B,GACtC,IAAIgC,EAASpf,KAAKwc,OAAOY,GACzB,GAAIgC,EACF,OAAOhE,EAAEhY,KAAKgc,EAElB,EAEA9D,EAAM/a,UAAU8e,WAAa,SAASjC,GACpC,IAAIkC,EAAQtf,KAAK0c,MAAMU,GACvB,GAAIkC,EACF,OAAOlE,EAAEhY,KAAKkc,EAElB,EAEAhE,EAAM/a,UAAUgf,UAAY,SAASnC,GACnC,IAAIoC,EAAQxf,KAAKmf,aAAa/B,GAC9B,GAAIoC,EACF,OAAOpE,EAAEX,MAAM+E,EAAOxf,KAAKqf,WAAWjC,GAE1C,EAEA9B,EAAM/a,UAAUkf,OAAS,SAAUrC,GAOjC,OAA4B,KALxBpd,KAAKid,aACKjd,KAAKqf,WAAWjC,GAEhBpd,KAAKuf,UAAUnC,IAEZtd,MACnB,EAEAwb,EAAM/a,UAAUmf,YAAc,SAAS3E,GACrC,IAAI9Q,EAAO,IAAIjK,KAAKiJ,YAAY,CAC9B2S,SAAU5b,KAAK2b,YACfG,WAAY9b,KAAK6b,cACjBG,SAAUhc,KAAK+b,cAGjB9R,EAAK4T,SAAS7d,KAAKqb,SAEnB,IAAIzZ,EAAO5B,KACXob,EAAEN,KAAK9a,KAAKoc,QAAQ,SAAS5c,EAAO4d,GAC9BrC,EAAOqC,IACTnT,EAAKsU,QAAQnB,EAAG5d,EAEpB,IAEA4b,EAAEN,KAAK9a,KAAK2c,WAAW,SAASja,GAC1BuH,EAAKwU,QAAQ/b,EAAE0a,IAAMnT,EAAKwU,QAAQ/b,EAAE2a,IACtCpT,EAAK0V,QAAQjd,EAAGd,EAAKge,KAAKld,GAE9B,IAEA,IAAImd,EAAU,CAAA,EACd,SAASC,EAAW1C,GAClB,IAAI4B,EAASpd,EAAKod,OAAO5B,GACzB,YAAevc,IAAXme,GAAwB/U,EAAKwU,QAAQO,IACvCa,EAAQzC,GAAK4B,EACNA,GACEA,KAAUa,EACZA,EAAQb,GAERc,EAAWd,EAEtB,CAQA,OANIhf,KAAK+b,aACPX,EAAEN,KAAK7Q,EAAKiU,SAAS,SAASd,GAC5BnT,EAAK8U,UAAU3B,EAAG0C,EAAW1C,GAC/B,IAGKnT,CACT,EAIAqR,EAAM/a,UAAUwf,oBAAsB,SAAS/B,GAK7C,OAJK5C,EAAE3X,WAAWua,KAChBA,EAAa5C,EAAExC,SAASoF,IAE1Bhe,KAAKmc,oBAAsB6B,EACpBhe,IACT,EAEAsb,EAAM/a,UAAUyf,UAAY,WAC1B,OAAOhgB,KAAK0d,UACd,EAEApC,EAAM/a,UAAU0f,MAAQ,WACtB,OAAO7E,EAAE3Q,OAAOzK,KAAK2c,UACvB,EAEArB,EAAM/a,UAAU2f,QAAU,SAAS5B,EAAI9e,GACrC,IAAIoC,EAAO5B,KACPoU,EAAOnN,UASX,OARAmU,EAAEF,OAAOoD,GAAI,SAASlB,EAAGC,GAMvB,OALIjJ,EAAKtU,OAAS,EAChB8B,EAAK+d,QAAQvC,EAAGC,EAAG7d,GAEnBoC,EAAK+d,QAAQvC,EAAGC,GAEXA,CACT,IACOrd,IACT,EAMAsb,EAAM/a,UAAUof,QAAU,WACxB,IAAIvC,EAAGC,EAAGzL,EAAMpS,EACZ2gB,GAAiB,EACjBC,EAAOnZ,UAAU,GAED,iBAATmZ,GAA8B,OAATA,GAAiB,MAAOA,GACtDhD,EAAIgD,EAAKhD,EACTC,EAAI+C,EAAK/C,EACTzL,EAAOwO,EAAKxO,KACa,IAArB3K,UAAUnH,SACZN,EAAQyH,UAAU,GAClBkZ,GAAiB,KAGnB/C,EAAIgD,EACJ/C,EAAIpW,UAAU,GACd2K,EAAO3K,UAAU,GACbA,UAAUnH,OAAS,IACrBN,EAAQyH,UAAU,GAClBkZ,GAAiB,IAIrB/C,EAAI,GAAKA,EACTC,EAAI,GAAKA,EACJjC,EAAEH,YAAYrJ,KACjBA,EAAO,GAAKA,GAGd,IAAIlP,EAAIsa,EAAahd,KAAK2b,YAAayB,EAAGC,EAAGzL,GAC7C,GAAIwJ,EAAE7Z,IAAIvB,KAAK4c,YAAala,GAI1B,OAHIyd,IACFngB,KAAK4c,YAAYla,GAAKlD,GAEjBQ,KAGT,IAAKob,EAAEH,YAAYrJ,KAAU5R,KAAK6b,cAChC,MAAM,IAAIoD,MAAM,qDAKlBjf,KAAKue,QAAQnB,GACbpd,KAAKue,QAAQlB,GAEbrd,KAAK4c,YAAYla,GAAKyd,EAAiB3gB,EAAQQ,KAAKmc,oBAAoBiB,EAAGC,EAAGzL,GAE9E,IAAI4L,EAqGN,SAAuBP,EAAYC,EAAIC,EAAIvL,GACzC,IAAIwL,EAAI,GAAKF,EACTG,EAAI,GAAKF,EACb,IAAKF,GAAcG,EAAIC,EAAG,CACxB,IAAIC,EAAMF,EACVA,EAAIC,EACJA,EAAIC,CACN,CACA,IAAIE,EAAW,CAAEJ,EAAGA,EAAGC,EAAGA,GACtBzL,IACF4L,EAAQ5L,KAAOA,GAEjB,OAAO4L,CACT,CAlHgB6C,CAAcrgB,KAAK2b,YAAayB,EAAGC,EAAGzL,GAYpD,OAVAwL,EAAII,EAAQJ,EACZC,EAAIG,EAAQH,EAEZ3b,OAAO4e,OAAO9C,GACdxd,KAAK2c,UAAUja,GAAK8a,EACpBX,EAAqB7c,KAAKwc,OAAOa,GAAID,GACrCP,EAAqB7c,KAAK0c,MAAMU,GAAIC,GACpCrd,KAAKuc,IAAIc,GAAG3a,GAAK8a,EACjBxd,KAAKyc,KAAKW,GAAG1a,GAAK8a,EAClBxd,KAAK0d,aACE1d,IACT,EAEAsb,EAAM/a,UAAUqf,KAAO,SAASxC,EAAGC,EAAGzL,GACpC,IAAIlP,EAA0B,IAArBuE,UAAUnH,OACfyd,EAAYvd,KAAK2b,YAAa1U,UAAU,IACxC+V,EAAahd,KAAK2b,YAAayB,EAAGC,EAAGzL,GACzC,OAAO5R,KAAK4c,YAAYla,EAC1B,EAEA4Y,EAAM/a,UAAUggB,QAAU,SAASnD,EAAGC,EAAGzL,GACvC,IAAIlP,EAA0B,IAArBuE,UAAUnH,OACfyd,EAAYvd,KAAK2b,YAAa1U,UAAU,IACxC+V,EAAahd,KAAK2b,YAAayB,EAAGC,EAAGzL,GACzC,OAAOwJ,EAAE7Z,IAAIvB,KAAK4c,YAAala,EACjC,EAEA4Y,EAAM/a,UAAUoe,WAAa,SAASvB,EAAGC,EAAGzL,GAC1C,IAAIlP,EAA0B,IAArBuE,UAAUnH,OACfyd,EAAYvd,KAAK2b,YAAa1U,UAAU,IACxC+V,EAAahd,KAAK2b,YAAayB,EAAGC,EAAGzL,GACrCgO,EAAO5f,KAAK2c,UAAUja,GAY1B,OAXIkd,IACFxC,EAAIwC,EAAKxC,EACTC,EAAIuC,EAAKvC,SACFrd,KAAK4c,YAAYla,UACjB1C,KAAK2c,UAAUja,GACtBqa,EAAuB/c,KAAKwc,OAAOa,GAAID,GACvCL,EAAuB/c,KAAK0c,MAAMU,GAAIC,UAC/Brd,KAAKuc,IAAIc,GAAG3a,UACZ1C,KAAKyc,KAAKW,GAAG1a,GACpB1C,KAAK0d,cAEA1d,IACT,EAEAsb,EAAM/a,UAAUigB,QAAU,SAASpD,EAAGqD,GACpC,IAAIC,EAAM1gB,KAAKuc,IAAIa,GACnB,GAAIsD,EAAK,CACP,IAAIT,EAAQ7E,EAAE3Q,OAAOiW,GACrB,OAAKD,EAGErF,EAAEL,OAAOkF,GAAO,SAASL,GAAQ,OAAOA,EAAKxC,IAAMqD,CAAG,IAFpDR,CAGX,CACF,EAEA3E,EAAM/a,UAAUogB,SAAW,SAASvD,EAAGC,GACrC,IAAIuD,EAAO5gB,KAAKyc,KAAKW,GACrB,GAAIwD,EAAM,CACR,IAAIX,EAAQ7E,EAAE3Q,OAAOmW,GACrB,OAAKvD,EAGEjC,EAAEL,OAAOkF,GAAO,SAASL,GAAQ,OAAOA,EAAKvC,IAAMA,CAAG,IAFpD4C,CAGX,CACF,EAEA3E,EAAM/a,UAAUsgB,UAAY,SAASzD,EAAGC,GACtC,IAAImD,EAAUxgB,KAAKwgB,QAAQpD,EAAGC,GAC9B,GAAImD,EACF,OAAOA,EAAQM,OAAO9gB,KAAK2gB,SAASvD,EAAGC,GAE3C,sCCveA9d,GAAiB,CACf+b,MAAO3b,KACPohB,oBCHFxhB,GAAiB,8CCAjB,IAAI6b,EAAIzb,KACJ2b,EAAQ3b,KAuBZ,SAASqhB,EAAWC,GAClB,OAAO7F,EAAEtW,IAAImc,EAAE/C,SAAS,SAASd,GAC/B,IAAI8D,EAAYD,EAAEzC,KAAKpB,GACnB4B,EAASiC,EAAEjC,OAAO5B,GAClBoB,EAAO,CAAEpB,EAAGA,GAOhB,OANKhC,EAAEH,YAAYiG,KACjB1C,EAAKhf,MAAQ0hB,GAEV9F,EAAEH,YAAY+D,KACjBR,EAAKQ,OAASA,GAETR,CACT,GACF,CAEA,SAAS2C,EAAWF,GAClB,OAAO7F,EAAEtW,IAAImc,EAAEhB,SAAS,SAASvd,GAC/B,IAAI0e,EAAYH,EAAErB,KAAKld,GACnBkd,EAAO,CAAExC,EAAG1a,EAAE0a,EAAGC,EAAG3a,EAAE2a,GAO1B,OANKjC,EAAEH,YAAYvY,EAAEkP,QACnBgO,EAAKhO,KAAOlP,EAAEkP,MAEXwJ,EAAEH,YAAYmG,KACjBxB,EAAKpgB,MAAQ4hB,GAERxB,CACT,GACF,QAhDArgB,GAAiB,CACf8hB,MAIF,SAAeJ,GACb,IAAIK,EAAO,CACTC,QAAS,CACP3F,SAAUqF,EAAEhE,aACZnB,WAAYmF,EAAEtD,eACd3B,SAAUiF,EAAErD,cAEdM,MAAO8C,EAAWC,GAClBhB,MAAOkB,EAAWF,IAEf7F,EAAEH,YAAYgG,EAAE5F,WACnBiG,EAAK9hB,MAAQ4b,EAAEP,MAAMoG,EAAE5F,UAEzB,OAAOiG,CACT,EAjBEE,KAgDF,SAAcF,GACZ,IAAIL,EAAI,IAAI3F,EAAMgG,EAAKC,SAAS1D,SAASyD,EAAK9hB,OAU9C,OATA4b,EAAEN,KAAKwG,EAAKpD,OAAO,SAAS9c,GAC1B6f,EAAE1C,QAAQnd,EAAMgc,EAAGhc,EAAM5B,OACrB4B,EAAM4d,QACRiC,EAAElC,UAAU3d,EAAMgc,EAAGhc,EAAM4d,OAE/B,IACA5D,EAAEN,KAAKwG,EAAKrB,OAAO,SAAS7e,GAC1B6f,EAAEtB,QAAQ,CAAEvC,EAAGhc,EAAMgc,EAAGC,EAAGjc,EAAMic,EAAGzL,KAAMxQ,EAAMwQ,MAAQxQ,EAAM5B,MAChE,IACOyhB,CACT,sCCjEA,IAAI7F,EAAIzb,YAEM8hB,GAEd,SAAoBR,GAClB,IAEIS,EAFAC,EAAU,CAAA,EACVC,EAAQ,GAGZ,SAASC,EAAIzE,GACPhC,EAAE7Z,IAAIogB,EAASvE,KACnBuE,EAAQvE,IAAK,EACbsE,EAAK1gB,KAAKoc,GACVhC,EAAEN,KAAKmG,EAAE5B,WAAWjC,GAAIyE,GACxBzG,EAAEN,KAAKmG,EAAE9B,aAAa/B,GAAIyE,GAC5B,CAUA,OARAzG,EAAEN,KAAKmG,EAAE/C,SAAS,SAASd,GACzBsE,EAAO,GACPG,EAAIzE,GACAsE,EAAK5hB,QACP8hB,EAAM5gB,KAAK0gB,EAEf,IAEOE,CACT,wCC1BA,IAAIxG,EAAIzb,KAWR,SAASmiB,IACP9hB,KAAK+hB,KAAO,GACZ/hB,KAAKgiB,YAAc,EACrB,QAZcC,GAAGH,EAiBjBA,EAAcvhB,UAAUL,KAAO,WAC7B,OAAOF,KAAK+hB,KAAKjiB,MACnB,EAKAgiB,EAAcvhB,UAAU6C,KAAO,WAC7B,OAAOpD,KAAK+hB,KAAKjd,KAAI,SAASod,GAAK,OAAOA,EAAEriB,GAAK,GACnD,EAKAiiB,EAAcvhB,UAAUgB,IAAM,SAAS1B,GACrC,OAAOub,EAAE7Z,IAAIvB,KAAKgiB,YAAaniB,EACjC,EAQAiiB,EAAcvhB,UAAU4hB,SAAW,SAAStiB,GAC1C,IAAIY,EAAQT,KAAKgiB,YAAYniB,GAC7B,QAAcgB,IAAVJ,EACF,OAAOT,KAAK+hB,KAAKthB,GAAO0hB,QAE5B,EAMAL,EAAcvhB,UAAU6hB,IAAM,WAC5B,GAAoB,IAAhBpiB,KAAKE,OACP,MAAM,IAAI+e,MAAM,mBAElB,OAAOjf,KAAK+hB,KAAK,GAAGliB,GACtB,EAUAiiB,EAAcvhB,UAAUqP,IAAM,SAAS/P,EAAKsiB,GAC1C,IAAIE,EAAariB,KAAKgiB,YAEtB,GADAniB,EAAMkJ,OAAOlJ,IACRub,EAAE7Z,IAAI8gB,EAAYxiB,GAAM,CAC3B,IAAIyiB,EAAMtiB,KAAK+hB,KACXthB,EAAQ6hB,EAAIxiB,OAIhB,OAHAuiB,EAAWxiB,GAAOY,EAClB6hB,EAAIthB,KAAK,CAACnB,IAAKA,EAAKsiB,SAAUA,IAC9BniB,KAAKuiB,UAAU9hB,IACR,CACT,CACA,OAAO,CACT,EAKAqhB,EAAcvhB,UAAUiiB,UAAY,WAClCxiB,KAAKyiB,MAAM,EAAGziB,KAAK+hB,KAAKjiB,OAAS,GACjC,IAAIsiB,EAAMpiB,KAAK+hB,KAAKrhB,MAGpB,cAFOV,KAAKgiB,YAAYI,EAAIviB,KAC5BG,KAAK0iB,SAAS,GACPN,EAAIviB,GACb,EASAiiB,EAAcvhB,UAAUoiB,SAAW,SAAS9iB,EAAKsiB,GAC/C,IAAI1hB,EAAQT,KAAKgiB,YAAYniB,GAC7B,GAAIsiB,EAAWniB,KAAK+hB,KAAKthB,GAAO0hB,SAC9B,MAAM,IAAIlD,MAAM,uDACFpf,EAAM,SAAWG,KAAK+hB,KAAKthB,GAAO0hB,SAAW,SAAWA,GAExEniB,KAAK+hB,KAAKthB,GAAO0hB,SAAWA,EAC5BniB,KAAKuiB,UAAU9hB,EACjB,EAEAqhB,EAAcvhB,UAAUmiB,SAAW,SAASE,GAC1C,IAAIN,EAAMtiB,KAAK+hB,KACXc,EAAI,EAAID,EACRE,EAAID,EAAI,EACRE,EAAUH,EACVC,EAAIP,EAAIxiB,SACVijB,EAAUT,EAAIO,GAAGV,SAAWG,EAAIS,GAASZ,SAAWU,EAAIE,EACpDD,EAAIR,EAAIxiB,SACVijB,EAAUT,EAAIQ,GAAGX,SAAWG,EAAIS,GAASZ,SAAWW,EAAIC,GAEtDA,IAAYH,IACd5iB,KAAKyiB,MAAMG,EAAGG,GACd/iB,KAAK0iB,SAASK,IAGpB,EAEAjB,EAAcvhB,UAAUgiB,UAAY,SAAS9hB,GAI3C,IAHA,IAEIue,EAFAsD,EAAMtiB,KAAK+hB,KACXI,EAAWG,EAAI7hB,GAAO0hB,SAET,IAAV1hB,KAED6hB,EADJtD,EAASve,GAAS,GACF0hB,SAAWA,IAG3BniB,KAAKyiB,MAAMhiB,EAAOue,GAClBve,EAAQue,CAEZ,EAEA8C,EAAcvhB,UAAUkiB,MAAQ,SAASG,EAAGI,GAC1C,IAAIV,EAAMtiB,KAAK+hB,KACXM,EAAariB,KAAKgiB,YAClBiB,EAAWX,EAAIM,GACfM,EAAWZ,EAAIU,GACnBV,EAAIM,GAAKM,EACTZ,EAAIU,GAAKC,EACTZ,EAAWa,EAASrjB,KAAO+iB,EAC3BP,EAAWY,EAASpjB,KAAOmjB,yCCtJ7B,IAAI5H,EAAIzb,KACJmiB,EAAgBniB,KAENwjB,GAId,SAAkBlC,EAAGza,EAAQ4c,EAAUC,GACrC,OAKF,SAAqBpC,EAAGza,EAAQ4c,EAAUC,GACxC,IAEIjG,EAAGkG,EAFHC,EAAU,CAAA,EACVC,EAAK,IAAI1B,EAGT2B,EAAkB,SAAS7D,GAC7B,IAAIvC,EAAIuC,EAAKxC,IAAMA,EAAIwC,EAAKxC,EAAIwC,EAAKvC,EACjCqG,EAASH,EAAQlG,GACjBsG,EAASP,EAASxD,GAClBgE,EAAWN,EAAOM,SAAWD,EAEjC,GAAIA,EAAS,EACX,MAAM,IAAI1E,MAAM,4DACeW,EAAO,YAAc+D,GAGlDC,EAAWF,EAAOE,WACpBF,EAAOE,SAAWA,EAClBF,EAAOG,YAAczG,EACrBoG,EAAGb,SAAStF,EAAGuG,KAInB3C,EAAE/C,QAAQxO,SAAQ,SAAS0N,GACzB,IAAIwG,EAAWxG,IAAM5W,EAAS,EAAIsd,OAAOC,kBACzCR,EAAQnG,GAAK,CAAEwG,SAAUA,GACzBJ,EAAG5T,IAAIwN,EAAGwG,EACZ,IAEA,KAAOJ,EAAGtjB,OAAS,IACjBkd,EAAIoG,EAAGhB,aACPc,EAASC,EAAQnG,IACNwG,WAAaE,OAAOC,oBAI/BV,EAAOjG,GAAG1N,QAAQ+T,GAGpB,OAAOF,CACT,CA7CSS,CAAY/C,EAAGlY,OAAOvC,GAC3B4c,GAAYa,EACZZ,GAAU,SAASjG,GAAK,OAAO6D,EAAEN,SAASvD,EAAI,EAClD,EANA,IAAI6G,EAAsB7I,EAAExC,SAAS,gDCLrC,IAAIsL,EAAWvkB,KACXyb,EAAIzb,YAEMwkB,GAEd,SAAqBlD,EAAGmD,EAAYC,GAClC,OAAOjJ,EAAElS,UAAU+X,EAAE/C,SAAS,SAASoG,EAAKlH,GAC1CkH,EAAIlH,GAAK8G,EAASjD,EAAG7D,EAAGgH,EAAYC,EACrC,GAAE,CAAE,EACP,qCCTA,IAAIjJ,EAAIzb,YAEM4kB,GAEd,SAAgBtD,GACd,IAAIxgB,EAAQ,EACR4O,EAAQ,GACRsS,EAAU,CAAA,EACV4B,EAAU,GAEd,SAAS1B,EAAIzE,GACX,IAAIhc,EAAQugB,EAAQvE,GAAK,CACvBoH,SAAS,EACTC,QAAShkB,EACTA,MAAOA,KAaT,GAXA4O,EAAMrO,KAAKoc,GAEX6D,EAAE5B,WAAWjC,GAAG1N,SAAQ,SAAS2N,GAC1BjC,EAAE7Z,IAAIogB,EAAStE,GAGTsE,EAAQtE,GAAGmH,UACpBpjB,EAAMqjB,QAAUlM,KAAK6J,IAAIhhB,EAAMqjB,QAAS9C,EAAQtE,GAAG5c,SAHnDohB,EAAIxE,GACJjc,EAAMqjB,QAAUlM,KAAK6J,IAAIhhB,EAAMqjB,QAAS9C,EAAQtE,GAAGoH,SAIvD,IAEIrjB,EAAMqjB,UAAYrjB,EAAMX,MAAO,CACjC,IACI4c,EADAqE,EAAO,GAEX,GACErE,EAAIhO,EAAM3O,MACVihB,EAAQtE,GAAGmH,SAAU,EACrB9C,EAAK1gB,KAAKqc,SACHD,IAAMC,GACfkG,EAAQviB,KAAK0gB,EACf,CACF,CAQA,OANAT,EAAE/C,QAAQxO,SAAQ,SAAS0N,GACpBhC,EAAE7Z,IAAIogB,EAASvE,IAClByE,EAAIzE,EAER,IAEOmG,CACT,wCC9CA,IAAInI,EAAIzb,KACJ+kB,EAAS/kB,YAECglB,GAEd,SAAoB1D,GAClB,OAAO7F,EAAEL,OAAO2J,EAAOzD,IAAI,SAASS,GAClC,OAAOA,EAAK5hB,OAAS,GAAsB,IAAhB4hB,EAAK5hB,QAAgBmhB,EAAEV,QAAQmB,EAAK,GAAIA,EAAK,GAC1E,GACF,qCCTA,IAAItG,EAAIzb,KAEMilB,GAId,SAAuB3D,EAAGmC,EAAUC,GAClC,OAKF,SAA0BpC,EAAGmC,EAAUC,GACrC,IAAIE,EAAU,CAAA,EACVrF,EAAQ+C,EAAE/C,QAkCd,OAhCAA,EAAMxO,SAAQ,SAAS0N,GACrBmG,EAAQnG,GAAK,GACbmG,EAAQnG,GAAGA,GAAK,CAAEwG,SAAU,GAC5B1F,EAAMxO,SAAQ,SAAS2N,GACjBD,IAAMC,IACRkG,EAAQnG,GAAGC,GAAK,CAAEuG,SAAUE,OAAOC,mBAEvC,IACAV,EAAOjG,GAAG1N,SAAQ,SAASkQ,GACzB,IAAIvC,EAAIuC,EAAKxC,IAAMA,EAAIwC,EAAKvC,EAAIuC,EAAKxC,EACjCyH,EAAIzB,EAASxD,GACjB2D,EAAQnG,GAAGC,GAAK,CAAEuG,SAAUiB,EAAGhB,YAAazG,EAC9C,GACF,IAEAc,EAAMxO,SAAQ,SAASoN,GACrB,IAAIgI,EAAOvB,EAAQzG,GACnBoB,EAAMxO,SAAQ,SAASkT,GACrB,IAAImC,EAAOxB,EAAQX,GACnB1E,EAAMxO,SAAQ,SAASsT,GACrB,IAAIgC,EAAKD,EAAKjI,GACVmI,EAAKH,EAAK9B,GACVkC,EAAKH,EAAK/B,GACVmC,EAAcH,EAAGpB,SAAWqB,EAAGrB,SAC/BuB,EAAcD,EAAGtB,WACnBsB,EAAGtB,SAAWuB,EACdD,EAAGrB,YAAcoB,EAAGpB,YAExB,GACF,GACF,IAEON,CACT,CA1CS6B,CAAiBnE,EACtBmC,GAAYa,EACZZ,GAAU,SAASjG,GAAK,OAAO6D,EAAEN,SAASvD,EAAI,EAClD,EANA,IAAI6G,EAAsB7I,EAAExC,SAAS,gDCJrC,IAAIwC,EAAIzb,KAKR,SAAS0lB,EAAQpE,GACf,IAAIU,EAAU,CAAA,EACVtS,EAAQ,CAAA,EACRkU,EAAU,GAkBd,GAFAnI,EAAEN,KAAKmG,EAAE7C,SAdT,SAASkH,EAAM9G,GACb,GAAIpD,EAAE7Z,IAAI8N,EAAOmP,GACf,MAAM,IAAI+G,EAGPnK,EAAE7Z,IAAIogB,EAASnD,KAClBnP,EAAMmP,IAAQ,EACdmD,EAAQnD,IAAQ,EAChBpD,EAAEN,KAAKmG,EAAE9B,aAAaX,GAAO8G,UACtBjW,EAAMmP,GACb+E,EAAQviB,KAAKwd,GAEjB,IAIIpD,EAAElb,KAAKyhB,KAAaV,EAAEhD,YACxB,MAAM,IAAIsH,EAGZ,OAAOhC,CACT,CAEA,SAASgC,IAAkB,QA/BbC,GAAGH,EACjBA,EAAQE,eAAiBA,EA+BzBA,EAAehlB,UAAY,IAAI0e,4CClC/B,IAAIoG,EAAU1lB,YAEA8lB,GAEd,SAAmBxE,GACjB,IACEoE,EAAQpE,EACT,CAAC,MAAOve,GACP,GAAIA,aAAa2iB,EAAQE,eACvB,OAAO,EAET,MAAM7iB,CACR,CACA,OAAO,CACT,qCCdA,IAAI0Y,EAAIzb,KA+BR,SAAS+lB,EAAMzE,EAAG7D,EAAGuI,EAAWhE,EAASiE,EAAYtB,GAC9ClJ,EAAE7Z,IAAIogB,EAASvE,KAClBuE,EAAQvE,IAAK,EAERuI,GAAarB,EAAItjB,KAAKoc,GAC3BhC,EAAEN,KAAK8K,EAAWxI,IAAI,SAASC,GAC7BqI,EAAMzE,EAAG5D,EAAGsI,EAAWhE,EAASiE,EAAYtB,EAC9C,IACIqB,GAAarB,EAAItjB,KAAKoc,GAE9B,QAvCcyI,GAUd,SAAa5E,EAAG3C,EAAIwH,GACb1K,EAAElU,QAAQoX,KACbA,EAAK,CAACA,IAGR,IAAIsH,GAAc3E,EAAEhE,aAAegE,EAAE5B,WAAa4B,EAAE1B,WAAWwG,KAAK9E,GAEhEqD,EAAM,GACN3C,EAAU,CAAA,EAQd,OAPAvG,EAAEN,KAAKwD,GAAI,SAASlB,GAClB,IAAK6D,EAAExC,QAAQrB,GACb,MAAM,IAAI6B,MAAM,6BAA+B7B,GAGjDsI,EAAMzE,EAAG7D,EAAa,SAAV0I,EAAkBnE,EAASiE,EAAYtB,EACrD,IACOA,CACT,wCC7BA,IAAIzC,EAAMliB,YAEIqmB,GAEd,SAAmB/E,EAAG3C,GACpB,OAAOuD,EAAIZ,EAAG3C,EAAI,OACpB,qCCNA,IAAIuD,EAAMliB,YAEIsmB,GAEd,SAAkBhF,EAAG3C,GACnB,OAAOuD,EAAIZ,EAAG3C,EAAI,MACpB,qCCNA,IAAIlD,EAAIzb,KACJ2b,EAAQ3b,KACRmiB,EAAgBniB,YAENumB,GAEd,SAAcjF,EAAGmD,GACf,IAGIhH,EAHAza,EAAS,IAAI2Y,EACbuE,EAAU,CAAA,EACV2D,EAAK,IAAI1B,EAGb,SAAS2B,EAAgB7D,GACvB,IAAIvC,EAAIuC,EAAKxC,IAAMA,EAAIwC,EAAKvC,EAAIuC,EAAKxC,EACjC+I,EAAM3C,EAAGrB,SAAS9E,GACtB,QAAYxc,IAARslB,EAAmB,CACrB,IAAIC,EAAahC,EAAWxE,GACxBwG,EAAaD,IACftG,EAAQxC,GAAKD,EACboG,EAAGb,SAAStF,EAAG+I,GAEnB,CACF,CAEA,GAAsB,IAAlBnF,EAAEhD,YACJ,OAAOtb,EAGTyY,EAAEN,KAAKmG,EAAE/C,SAAS,SAASd,GACzBoG,EAAG5T,IAAIwN,EAAG0G,OAAOC,mBACjBphB,EAAO4b,QAAQnB,EACjB,IAGAoG,EAAGb,SAAS1B,EAAE/C,QAAQ,GAAI,GAE1B,IAAImI,GAAO,EACX,KAAO7C,EAAGtjB,OAAS,GAAG,CAEpB,GADAkd,EAAIoG,EAAGhB,YACHpH,EAAE7Z,IAAIse,EAASzC,GACjBza,EAAOgd,QAAQvC,EAAGyC,EAAQzC,QACrB,IAAIiJ,EACT,MAAM,IAAIpH,MAAM,iCAAmCgC,GAEnDoF,GAAO,CACT,CAEApF,EAAEJ,UAAUzD,GAAG1N,QAAQ+T,EACzB,CAEA,OAAO9gB,CACT,EvG9CE,IACEkN,mCwGwBJ,IAAIyW,EAAM3mB,YAEVJ,GAAiB,CACf+b,MAAOgL,EAAIhL,MACXgG,KAAM3hB,KACN4mB,gBCnCFhnB,GAAiB,CACfinB,WAAY7mB,KACZukB,SAAUvkB,KACV8mB,YAAa9mB,KACb+mB,WAAY/mB,KACZgnB,cAAehnB,KACfinB,UAAWjnB,KACXgmB,UAAWhmB,KACXknB,SAAUlnB,KACVmnB,KAAMnnB,KACN+kB,OAAQ/kB,KACR0lB,QAAS1lB,ODyBTohB,QAASuF,EAAIvF,SxG9BAphB,EACZ,CAAC,MAAO+C,GACP,CAICmN,KACHA,GAAWsL,OAAOtL,UAGpBtQ,wR0GdIqb,G1GcJrb,GAAiBsQ,sC2GhBjB,IAAInQ,EAAKC,KACL8J,EAAc9J,KACd6I,EAAU7I,KACVoD,EAAWpD,YA0BfJ,GAdA,SAAwBC,EAAOiB,EAAO0D,GACpC,IAAKpB,EAASoB,GACZ,OAAO,EAET,IAAItB,SAAcpC,EAClB,SAAY,UAARoC,EACK4G,EAAYtF,IAAWqE,EAAQ/H,EAAO0D,EAAOrE,QACrC,UAAR+C,GAAoBpC,KAAS0D,IAE7BzE,EAAGyE,EAAO1D,GAAQjB,EAG7B,qCC3BA,IAAIunB,kCCCJ,IAAIC,EAAe,YAiBnBznB,GAPA,SAAyB0F,GAGvB,IAFA,IAAIxE,EAAQwE,EAAOnF,OAEZW,KAAWumB,EAAa/iB,KAAKgB,EAAOgiB,OAAOxmB,MAClD,OAAOA,CACT,EDhBsBd,GAGlBunB,EAAc,cAelB3nB,GANA,SAAkB0F,GAChB,OAAOA,EACHA,EAAO+E,MAAM,EAAG+c,EAAgB9hB,GAAU,GAAGjB,QAAQkjB,EAAa,IAClEjiB,CACN,qCEhBA,IAAIkiB,kCCAJ,IAAIC,EAAWznB,KACXoD,EAAWpD,KACXkU,EAAWlU,KAMX0nB,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAeC,gBA8CnBloB,GArBA,SAAkBC,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIqU,EAASrU,GACX,OA1CM,IA4CR,GAAIuD,EAASvD,GAAQ,CACnB,IAAIC,EAAgC,mBAAjBD,EAAM2N,QAAwB3N,EAAM2N,UAAY3N,EACnEA,EAAQuD,EAAStD,GAAUA,EAAQ,GAAMA,CAC3C,CACA,GAAoB,iBAATD,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQ4nB,EAAS5nB,GACjB,IAAIkoB,EAAWJ,EAAWrjB,KAAKzE,GAC/B,OAAQkoB,GAAYH,EAAUtjB,KAAKzE,GAC/BgoB,EAAahoB,EAAMwK,MAAM,GAAI0d,EAAW,EAAI,GAC3CL,EAAWpjB,KAAKzE,GAvDb,KAuD6BA,CACvC,ED7DeG,GAGXgoB,EAAW,WAsCfpoB,GAZA,SAAkBC,GAChB,OAAKA,GAGLA,EAAQ2nB,EAAS3nB,MACHmoB,GAAYnoB,KAAU,IA9BpB,uBA+BFA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,CAQjC,qCEvCA,IAAIga,EAAgB7Z,KAChBwW,EAAexW,KACfioB,kCCFJ,IAAIC,EAAWloB,YAmCfJ,GAPA,SAAmBC,GACjB,IAAImD,EAASklB,EAASroB,GAClBsoB,EAAYnlB,EAAS,EAEzB,OAAOA,GAAWA,EAAUmlB,EAAYnlB,EAASmlB,EAAYnlB,EAAU,CACzE,ED/BgBhD,GAGZ2Y,EAAYC,KAAKC,WAiDrBjZ,GAZA,SAAmBK,EAAOsK,EAAWqP,GACnC,IAAIzZ,EAAkB,MAATF,EAAgB,EAAIA,EAAME,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIW,EAAqB,MAAb8Y,EAAoB,EAAIqO,EAAUrO,GAI9C,OAHI9Y,EAAQ,IACVA,EAAQ6X,EAAUxY,EAASW,EAAO,IAE7B+Y,EAAc5Z,EAAOuW,EAAajM,EAAW,GAAIzJ,EAC1D,qCEpDA,IAAIyX,EAAcvY,YAqBlBJ,GALA,SAAiBK,GAEf,OADsB,MAATA,EAAgB,EAAIA,EAAME,QACvBoY,EAAYtY,EAAO,GAAK,EAC1C,qCCnBA,IAAIiU,EAAWlU,YA+BfJ,GAnBA,SAAsBK,EAAOoG,EAAUgU,GAIrC,IAHA,IAAIvZ,GAAS,EACTX,EAASF,EAAME,SAEVW,EAAQX,GAAQ,CACvB,IAAIN,EAAQI,EAAMa,GACdsnB,EAAU/hB,EAASxG,GAEvB,GAAe,MAAXuoB,SAAiClnB,IAAbuZ,EACf2N,GAAYA,IAAYlU,EAASkU,GAClC/N,EAAW+N,EAAS3N,IAE1B,IAAIA,EAAW2N,EACXplB,EAASnD,CAEjB,CACA,OAAOmD,CACT,qCC7BA,IAAI0D,EAAkB1G,KAClBD,EAAKC,YAkBTJ,GAPA,SAA0B4E,EAAQtE,EAAKL,SACtBqB,IAAVrB,IAAwBE,EAAGyE,EAAOtE,GAAML,SAC9BqB,IAAVrB,KAAyBK,KAAOsE,KACnCkC,EAAgBlC,EAAQtE,EAAKL,EAEjC,4CCGAD,GAZA,SAAiB4E,EAAQtE,GACvB,IAAY,gBAARA,GAAgD,mBAAhBsE,EAAOtE,KAIhC,aAAPA,EAIJ,OAAOsE,EAAOtE,EAChB,qCClBA,IAAImoB,EAAmBroB,KACnByO,EAAczO,KACdyN,EAAkBzN,KAClB0O,EAAY1O,KACZmP,EAAkBnP,KAClBqH,EAAcrH,KACduH,EAAUvH,KACV6a,EAAoB7a,KACpB8H,EAAW9H,KACX8D,EAAa9D,KACboD,EAAWpD,KACXsoB,kCCXJ,IAAInlB,EAAanD,KACbgL,EAAehL,KACfmH,EAAenH,KAMfkE,EAAY/B,SAASvB,UACrB0B,EAAcP,OAAOnB,UAGrBgD,EAAeM,EAAUzB,SAGzBF,EAAiBD,EAAYC,eAG7BgmB,EAAmB3kB,EAAa5C,KAAKe,eA2CzCnC,GAbA,SAAuBC,GACrB,IAAKsH,EAAatH,IA5CJ,mBA4CcsD,EAAWtD,GACrC,OAAO,EAET,IAAIgO,EAAQ7C,EAAanL,GACzB,GAAc,OAAVgO,EACF,OAAO,EAET,IAAIxE,EAAO9G,EAAevB,KAAK6M,EAAO,gBAAkBA,EAAMvE,YAC9D,MAAsB,mBAARD,GAAsBA,aAAgBA,GAClDzF,EAAa5C,KAAKqI,IAASkf,CAC/B,EDhDoBvoB,GAChB0I,EAAe1I,KACfwoB,EAAUxoB,KACVyoB,kCEdJ,IAAIna,EAAatO,KACbwO,EAASxO,YA8BbJ,GAJA,SAAuBC,GACrB,OAAOyO,EAAWzO,EAAO2O,EAAO3O,GAClC,EFfoBG,UA+EpBJ,GA9DA,SAAuB4E,EAAQqC,EAAQ3G,EAAKwoB,EAAUC,EAAW5hB,EAAY2I,GAC3E,IAAI/I,EAAW6hB,EAAQhkB,EAAQtE,GAC3BwT,EAAW8U,EAAQ3hB,EAAQ3G,GAC3B4P,EAAUJ,EAAM/N,IAAI+R,GAExB,GAAI5D,EACFuY,EAAiB7jB,EAAQtE,EAAK4P,OADhC,CAIA,IAAI7I,EAAWF,EACXA,EAAWJ,EAAU+M,EAAWxT,EAAM,GAAKsE,EAAQqC,EAAQ6I,QAC3DxO,EAEAqZ,OAAwBrZ,IAAb+F,EAEf,GAAIsT,EAAU,CACZ,IAAIxR,EAAQxB,EAAQmM,GAChBzK,GAAUF,GAASjB,EAAS4L,GAC5BkV,GAAW7f,IAAUE,GAAUP,EAAagL,GAEhDzM,EAAWyM,EACP3K,GAASE,GAAU2f,EACjBrhB,EAAQZ,GACVM,EAAWN,EAEJkU,EAAkBlU,GACzBM,EAAWyH,EAAU/H,GAEdsC,GACPsR,GAAW,EACXtT,EAAWwH,EAAYiF,GAAU,IAE1BkV,GACPrO,GAAW,EACXtT,EAAWwG,EAAgBiG,GAAU,IAGrCzM,EAAW,GAGNqhB,EAAc5U,IAAarM,EAAYqM,IAC9CzM,EAAWN,EACPU,EAAYV,GACdM,EAAWwhB,EAAc9hB,GAEjBvD,EAASuD,KAAa7C,EAAW6C,KACzCM,EAAWkI,EAAgBuE,KAI7B6G,GAAW,CAEf,CACIA,IAEF7K,EAAMhO,IAAIgS,EAAUzM,GACpB0hB,EAAU1hB,EAAUyM,EAAUgV,EAAU3hB,EAAY2I,GACpDA,EAAc,OAAEgE,IAElB2U,EAAiB7jB,EAAQtE,EAAK+G,EAnD9B,CAoDF,4CG9EArH,GAJA,SAAgBC,EAAOC,GACrB,OAAOD,EAAQC,CACjB,qCCXA,IAAIiW,EAAU/V,KACV6oB,kCCDJ,IAAIjiB,EAAc5G,KACdyV,EAAWzV,KACX6I,EAAU7I,KACVoD,EAAWpD,KACX0V,EAAQ1V,YA8CZJ,GAlCA,SAAiB4E,EAAQmR,EAAM9V,EAAOkH,GACpC,IAAK3D,EAASoB,GACZ,OAAOA,EAST,IALA,IAAI1D,GAAS,EACTX,GAHJwV,EAAOF,EAASE,EAAMnR,IAGJrE,OACdiN,EAAYjN,EAAS,EACrB2oB,EAAStkB,EAEI,MAAVskB,KAAoBhoB,EAAQX,GAAQ,CACzC,IAAID,EAAMwV,EAAMC,EAAK7U,IACjBmG,EAAWpH,EAEf,GAAY,cAARK,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOsE,EAGT,GAAI1D,GAASsM,EAAW,CACtB,IAAIzG,EAAWmiB,EAAO5oB,QAELgB,KADjB+F,EAAWF,EAAaA,EAAWJ,EAAUzG,EAAK4oB,QAAU5nB,KAE1D+F,EAAW7D,EAASuD,GAChBA,EACCkC,EAAQ8M,EAAK7U,EAAQ,IAAM,GAAK,CAAA,EAEzC,CACA8F,EAAYkiB,EAAQ5oB,EAAK+G,GACzB6hB,EAASA,EAAO5oB,EAClB,CACA,OAAOsE,CACT,ED/CcxE,GACVyV,EAAWzV,YA2BfJ,GAhBA,SAAoB4E,EAAQukB,EAAOxe,GAKjC,IAJA,IAAIzJ,GAAS,EACTX,EAAS4oB,EAAM5oB,OACf6C,EAAS,CAAA,IAEJlC,EAAQX,GAAQ,CACvB,IAAIwV,EAAOoT,EAAMjoB,GACbjB,EAAQkW,EAAQvR,EAAQmR,GAExBpL,EAAU1K,EAAO8V,IACnBkT,EAAQ7lB,EAAQyS,EAASE,EAAMnR,GAAS3E,EAE5C,CACA,OAAOmD,CACT,qCE3BA,IAAIgmB,kCCCJ,IAAIC,EAAarQ,KAAKsQ,KAClBvQ,EAAYC,KAAKC,WAyBrBjZ,GAZA,SAAmBkZ,EAAOqQ,EAAKC,EAAMhZ,GAKnC,IAJA,IAAItP,GAAS,EACTX,EAASwY,EAAUsQ,GAAYE,EAAMrQ,IAAUsQ,GAAQ,IAAK,GAC5DpmB,EAASrC,MAAMR,GAEZA,KACL6C,EAAOoN,EAAYjQ,IAAWW,GAASgY,EACvCA,GAASsQ,EAEX,OAAOpmB,CACT,EDzBgBhD,GACZqpB,EAAiBrpB,KACjBkoB,EAAWloB,YA2BfJ,GAlBA,SAAqBwQ,GACnB,OAAO,SAAS0I,EAAOqQ,EAAKC,GAa1B,OAZIA,GAAuB,iBAARA,GAAoBC,EAAevQ,EAAOqQ,EAAKC,KAChED,EAAMC,OAAOloB,GAGf4X,EAAQoP,EAASpP,QACL5X,IAARioB,GACFA,EAAMrQ,EACNA,EAAQ,GAERqQ,EAAMjB,EAASiB,GAEjBC,OAAgBloB,IAATkoB,EAAsBtQ,EAAQqQ,EAAM,GAAK,EAAKjB,EAASkB,GACvDJ,EAAUlQ,EAAOqQ,EAAKC,EAAMhZ,GAEvC,qCE3BA,IAAIkZ,kCCAJ,IAAIpV,EAAWlU,YAwCfJ,GA9BA,SAA0BC,EAAOC,GAC/B,GAAID,IAAUC,EAAO,CACnB,IAAIypB,OAAyBroB,IAAVrB,EACf2pB,EAAsB,OAAV3pB,EACZ4pB,EAAiB5pB,GAAUA,EAC3B6pB,EAAcxV,EAASrU,GAEvB8pB,OAAyBzoB,IAAVpB,EACf8pB,EAAsB,OAAV9pB,EACZ+pB,EAAiB/pB,GAAUA,EAC3BgqB,EAAc5V,EAASpU,GAE3B,IAAM8pB,IAAcE,IAAgBJ,GAAe7pB,EAAQC,GACtD4pB,GAAeC,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BN,GAAgBM,IACjBJ,EACH,OAAO,EAET,IAAMD,IAAcE,IAAgBI,GAAejqB,EAAQC,GACtDgqB,GAAeP,GAAgBE,IAAmBD,IAAcE,GAChEE,GAAaL,GAAgBE,IAC5BE,GAAgBF,IACjBI,EACH,OAAQ,CAEZ,CACA,OAAO,CACT,EDtCuB7pB,UA2CvBJ,GA3BA,SAAyB4E,EAAQ1E,EAAOiqB,GAOtC,IANA,IAAIjpB,GAAS,EACTkpB,EAAcxlB,EAAOylB,SACrBC,EAAcpqB,EAAMmqB,SACpB9pB,EAAS6pB,EAAY7pB,OACrBgqB,EAAeJ,EAAO5pB,SAEjBW,EAAQX,GAAQ,CACvB,IAAI6C,EAASsmB,EAAiBU,EAAYlpB,GAAQopB,EAAYppB,IAC9D,GAAIkC,EACF,OAAIlC,GAASqpB,EACJnnB,EAGFA,GAAmB,QADd+mB,EAAOjpB,IACiB,EAAI,EAE5C,CAQA,OAAO0D,EAAO1D,MAAQhB,EAAMgB,KAC9B,qCEzCA,IAAI+T,EAAW7U,KACX+V,EAAU/V,KACVwW,EAAexW,KACf0W,EAAU1W,KACVoqB,cCgBJxqB,GAVA,SAAoBK,EAAOoqB,GACzB,IAAIlqB,EAASF,EAAME,OAGnB,IADAF,EAAMqqB,KAAKD,GACJlqB,KACLF,EAAME,GAAUF,EAAME,GAAQN,MAEhC,OAAOI,CACT,GDbIuI,EAAYxI,KACZuqB,EAAkBvqB,KAClB2Q,EAAW3Q,KACXuH,EAAUvH,YAwCdJ,GA7BA,SAAqB6Q,EAAY+Z,EAAWT,GAExCS,EADEA,EAAUrqB,OACA0U,EAAS2V,GAAW,SAASnkB,GACvC,OAAIkB,EAAQlB,GACH,SAASxG,GACd,OAAOkW,EAAQlW,EAA2B,IAApBwG,EAASlG,OAAekG,EAAS,GAAKA,IAGzDA,CACT,IAEY,CAACsK,GAGf,IAAI7P,GAAS,EACb0pB,EAAY3V,EAAS2V,EAAWhiB,EAAUgO,IAE1C,IAAIxT,EAAS0T,EAAQjG,GAAY,SAAS5Q,EAAOK,EAAKuQ,GAIpD,MAAO,CAAEwZ,SAHMpV,EAAS2V,GAAW,SAASnkB,GAC1C,OAAOA,EAASxG,EAClB,IAC+BiB,QAAWA,EAAOjB,MAASA,EAC5D,IAEA,OAAOuqB,EAAWpnB,GAAQ,SAASwB,EAAQ1E,GACzC,OAAOyqB,EAAgB/lB,EAAQ1E,EAAOiqB,EACxC,GACF,EtBzCE,IACE9O,GAAS,CACPwP,0CwBPN,IAAIjb,EAAYxP,YA4BhBJ,GAJA,SAAmBC,GACjB,OAAO2P,EAAU3P,EAAO6qB,EAC1B,ExBnBiB1qB,GACXiZ,SAAUjZ,KACV2qB,yCyBTN,IAAIhQ,EAAW3a,KACXD,EAAKC,KACLqpB,EAAiBrpB,KACjBwO,EAASxO,KAGTsC,EAAcP,OAAOnB,UAGrB2B,EAAiBD,EAAYC,eAuB7BooB,EAAWhQ,GAAS,SAASnW,EAAQga,GACvCha,EAASzC,OAAOyC,GAEhB,IAAI1D,GAAS,EACTX,EAASqe,EAAQre,OACjByqB,EAAQzqB,EAAS,EAAIqe,EAAQ,QAAKtd,EAMtC,IAJI0pB,GAASvB,EAAe7K,EAAQ,GAAIA,EAAQ,GAAIoM,KAClDzqB,EAAS,KAGFW,EAAQX,GAMf,IALA,IAAI0G,EAAS2X,EAAQ1d,GACjBgG,EAAQ0H,EAAO3H,GACfgkB,GAAc,EACdC,EAAchkB,EAAM3G,SAEf0qB,EAAaC,GAAa,CACjC,IAAI5qB,EAAM4G,EAAM+jB,GACZhrB,EAAQ2E,EAAOtE,SAELgB,IAAVrB,GACCE,EAAGF,EAAOyC,EAAYpC,MAAUqC,EAAevB,KAAKwD,EAAQtE,MAC/DsE,EAAOtE,GAAO2G,EAAO3G,GAEzB,CAGF,OAAOsE,CACT,WAEA5E,GAAiB+qB,EzBtDD3qB,GACVmb,KAAMnb,KACNob,OAAQpb,KACR+qB,qC0BZN,IAuCIA,kCCvCJ,IAAIvU,EAAexW,KACf8J,EAAc9J,KACdyD,EAAOzD,YAsBXJ,GAbA,SAAoBorB,GAClB,OAAO,SAASva,EAAYlG,EAAWqP,GACrC,IAAIvJ,EAAWtO,OAAO0O,GACtB,IAAK3G,EAAY2G,GAAa,CAC5B,IAAIpK,EAAWmQ,EAAajM,EAAW,GACvCkG,EAAahN,EAAKgN,GAClBlG,EAAY,SAASrK,GAAO,OAAOmG,EAASgK,EAASnQ,GAAMA,EAAKmQ,GAClE,CACA,IAAIvP,EAAQkqB,EAAcva,EAAYlG,EAAWqP,GACjD,OAAO9Y,GAAS,EAAIuP,EAAShK,EAAWoK,EAAW3P,GAASA,QAASI,EAEzE,EDtBiBlB,EAuCNirB,CAtCKjrB,aAwChBJ,GAAiBmrB,E1B7BL/qB,GACNkrB,QAASlrB,KACT+P,QAAS/P,KACTmrB,sC4BfN,IAAIhb,EAAUnQ,KACV4Q,EAAe5Q,KACfwO,EAASxO,YAoCbJ,GANA,SAAe4E,EAAQ6B,GACrB,OAAiB,MAAV7B,EACHA,EACA2L,EAAQ3L,EAAQoM,EAAavK,GAAWmI,EAC9C,E5BrBaxO,GACP4B,IAAM5B,KACNsb,YAAatb,KACborB,iB6BCNxrB,GALA,SAAcK,GACZ,IAAIE,EAAkB,MAATF,EAAgB,EAAIA,EAAME,OACvC,OAAOA,EAASF,EAAME,EAAS,QAAKe,CACtC,G7BEMiE,IAAKnF,KACLqrB,0C8BpBN,IAAI3kB,EAAkB1G,KAClBsQ,EAAatQ,KACbwW,EAAexW,YAwCnBJ,GAVA,SAAmB4E,EAAQ6B,GACzB,IAAIrD,EAAS,CAAA,EAMb,OALAqD,EAAWmQ,EAAanQ,EAAU,GAElCiK,EAAW9L,GAAQ,SAAS3E,EAAOK,EAAKsE,GACtCkC,EAAgB1D,EAAQ9C,EAAKmG,EAASxG,EAAOK,EAAKsE,GACpD,IACOxB,CACT,E9BpBiBhD,GACX6Y,oC+BrBN,IAAIyS,EAAetrB,KACfurB,cCYJ3rB,GAJA,SAAgBC,EAAOC,GACrB,OAAOD,EAAQC,CACjB,GDTI6Q,EAAW3Q,YA0BfJ,GANA,SAAaK,GACX,OAAQA,GAASA,EAAME,OACnBmrB,EAAarrB,EAAO0Q,EAAU4a,QAC9BrqB,CACN,E/BLWlB,GACLwrB,sCiCtBN,IAAIC,kCCAJ,IAAIrlB,EAAQpG,KACRqoB,EAAmBroB,KACnBmQ,EAAUnQ,KACV0rB,EAAgB1rB,KAChBoD,EAAWpD,KACXwO,EAASxO,KACTwoB,EAAUxoB,YAmCdJ,GAtBA,SAAS6rB,EAAUjnB,EAAQqC,EAAQ6hB,EAAU3hB,EAAY2I,GACnDlL,IAAWqC,GAGfsJ,EAAQtJ,GAAQ,SAAS6M,EAAUxT,GAEjC,GADAwP,IAAUA,EAAQ,IAAItJ,GAClBhD,EAASsQ,GACXgY,EAAclnB,EAAQqC,EAAQ3G,EAAKwoB,EAAU+C,EAAW1kB,EAAY2I,OAEjE,CACH,IAAIzI,EAAWF,EACXA,EAAWyhB,EAAQhkB,EAAQtE,GAAMwT,EAAWxT,EAAM,GAAKsE,EAAQqC,EAAQ6I,QACvExO,OAEaA,IAAb+F,IACFA,EAAWyM,GAEb2U,EAAiB7jB,EAAQtE,EAAK+G,EAChC,CACD,GAAEuH,EACL,KDvCgBxO,GAkCZwrB,kCElCJ,IAAI7Q,EAAW3a,KACXqpB,EAAiBrpB,YAmCrBJ,GA1BA,SAAwB+rB,GACtB,OAAOhR,GAAS,SAASnW,EAAQga,GAC/B,IAAI1d,GAAS,EACTX,EAASqe,EAAQre,OACjB4G,EAAa5G,EAAS,EAAIqe,EAAQre,EAAS,QAAKe,EAChD0pB,EAAQzqB,EAAS,EAAIqe,EAAQ,QAAKtd,EAWtC,IATA6F,EAAc4kB,EAASxrB,OAAS,GAA0B,mBAAd4G,GACvC5G,IAAU4G,QACX7F,EAEA0pB,GAASvB,EAAe7K,EAAQ,GAAIA,EAAQ,GAAIoM,KAClD7jB,EAAa5G,EAAS,OAAIe,EAAY6F,EACtC5G,EAAS,GAEXqE,EAASzC,OAAOyC,KACP1D,EAAQX,GAAQ,CACvB,IAAI0G,EAAS2X,EAAQ1d,GACjB+F,GACF8kB,EAASnnB,EAAQqC,EAAQ/F,EAAOiG,EAEpC,CACA,OAAOvC,CACT,GACF,EFjCqBxE,EAiCT4rB,EAAe,SAASpnB,EAAQqC,EAAQ6hB,GAClD+C,EAAUjnB,EAAQqC,EAAQ6hB,EAC5B,WAEA9oB,GAAiB4rB,EjChBJxrB,GACPyiB,oCoCvBN,IAAI6I,EAAetrB,KACf6rB,EAAS7rB,KACT2Q,EAAW3Q,YA0BfJ,GANA,SAAaK,GACX,OAAQA,GAASA,EAAME,OACnBmrB,EAAarrB,EAAO0Q,EAAUkb,QAC9B3qB,CACN,EpCHWlB,GACL8rB,sCqCxBN,IAAIR,EAAetrB,KACfwW,EAAexW,KACf6rB,EAAS7rB,YA+BbJ,GANA,SAAeK,EAAOoG,GACpB,OAAQpG,GAASA,EAAME,OACnBmrB,EAAarrB,EAAOuW,EAAanQ,EAAU,GAAIwlB,QAC/C3qB,CACN,ErCPalB,GACPqZ,oCsCzBN,IAAInX,EAAOlC,YAsBXJ,GAJU,WACR,OAAOsC,EAAKkX,KAAKC,KACnB,EtCKWrZ,GACL+rB,qCuC1BN,IAAIC,kCCAJ,IAAIC,EAAajsB,KACbiW,EAAQjW,YAiBZJ,GANA,SAAkB4E,EAAQukB,GACxB,OAAOkD,EAAWznB,EAAQukB,GAAO,SAASlpB,EAAO8V,GAC/C,OAAOM,EAAMzR,EAAQmR,EACvB,GACF,EDhBe3V,GAoBX+rB,kCEpBJ,IAAIb,EAAUlrB,KACV2Z,EAAW3Z,KACX0Z,EAAc1Z,YAalBJ,GAJA,SAAkB+D,GAChB,OAAO+V,EAAYC,EAAShW,OAAMzC,EAAWgqB,GAAUvnB,EAAO,GAChE,EFZe3D,EAmBJksB,EAAS,SAAS1nB,EAAQukB,GACnC,OAAiB,MAAVvkB,EAAiB,CAAA,EAAKwnB,EAASxnB,EAAQukB,EAChD,WAEAnpB,GAAiBmsB,EvCEL/rB,GACNmsB,sC0C3BN,IA2CIA,EA3CcnsB,IA2CNosB,UAEZxsB,GAAiBusB,E1ClBJnsB,GACPub,OAAQvb,KACRqsB,uC2C7BN,IAAI9T,EAAcvY,KACdssB,EAActsB,KACd2a,EAAW3a,KACXqpB,EAAiBrpB,KA+BjBqsB,EAAS1R,GAAS,SAASlK,EAAY+Z,GACzC,GAAkB,MAAd/Z,EACF,MAAO,GAET,IAAItQ,EAASqqB,EAAUrqB,OAMvB,OALIA,EAAS,GAAKkpB,EAAe5Y,EAAY+Z,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHrqB,EAAS,GAAKkpB,EAAemB,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElB8B,EAAY7b,EAAY8H,EAAYiS,EAAW,GAAI,GAC5D,WAEA5qB,GAAiBysB,E3ClBHrsB,GACRusB,yC4C9BN,IAAI9pB,EAAWzC,KAGXwsB,EAAY,SAwBhB5sB,GALA,SAAkB6sB,GAChB,IAAIC,IAAOF,EACX,OAAO/pB,EAASgqB,GAAUC,CAC5B,E5CKgB1sB,GACV8K,OAAQ9K,KACR2sB,0C6ChCN,IAAI/lB,EAAc5G,KACd4sB,cCqBJhtB,GAbA,SAAuBkH,EAAOgE,EAAQ+hB,GAMpC,IALA,IAAI/rB,GAAS,EACTX,EAAS2G,EAAM3G,OACf2sB,EAAahiB,EAAO3K,OACpB6C,EAAS,CAAA,IAEJlC,EAAQX,GAAQ,CACvB,IAAIN,EAAQiB,EAAQgsB,EAAahiB,EAAOhK,QAASI,EACjD2rB,EAAW7pB,EAAQ8D,EAAMhG,GAAQjB,EACnC,CACA,OAAOmD,CACT,UDGApD,GAJA,SAAmBkH,EAAOgE,GACxB,OAAO8hB,EAAc9lB,GAAS,GAAIgE,GAAU,GAAIlE,EAClD,E7CWiB5G,GAEd,CAAC,MAAO+C,GACP,CAICkY,KACHA,GAASO,OAAOC,GAGlB7b,IAAAA,GAAiBqb,G+CtCjBrb,GAAiBmtB,GAEjB,SAASA,KACP,IAAIC,EAAW,CAAA,EACfA,EAASC,MAAQD,EAASE,MAAQF,EAClC3sB,KAAK8sB,UAAYH,CACnB,CAiCA,SAASI,GAAO3rB,GACdA,EAAMyrB,MAAMD,MAAQxrB,EAAMwrB,MAC1BxrB,EAAMwrB,MAAMC,MAAQzrB,EAAMyrB,aACnBzrB,EAAMwrB,aACNxrB,EAAMyrB,KACf,CAEA,SAASG,GAAelQ,EAAGM,GACzB,GAAU,UAANN,GAAuB,UAANA,EACnB,OAAOM,CAEX,CA1CAsP,GAAKnsB,UAAU0sB,QAAU,WACvB,IAAIN,EAAW3sB,KAAK8sB,UAChB1rB,EAAQurB,EAASE,MACrB,GAAIzrB,IAAUurB,EAEZ,OADAI,GAAO3rB,GACAA,CAEX,EAEAsrB,GAAKnsB,UAAU2sB,QAAU,SAAS9rB,GAChC,IAAIurB,EAAW3sB,KAAK8sB,UAChB1rB,EAAMyrB,OAASzrB,EAAMwrB,OACvBG,GAAO3rB,GAETA,EAAMwrB,MAAQD,EAASC,MACvBD,EAASC,MAAMC,MAAQzrB,EACvBurB,EAASC,MAAQxrB,EACjBA,EAAMyrB,MAAQF,CAChB,EAEAD,GAAKnsB,UAAU6B,SAAW,WAIxB,IAHA,IAAI+qB,EAAO,GACPR,EAAW3sB,KAAK8sB,UAChBM,EAAOT,EAASE,MACbO,IAAST,GACdQ,EAAKnsB,KAAKqsB,KAAKC,UAAUF,EAAMJ,KAC/BI,EAAOA,EAAKP,MAEd,MAAO,IAAMM,EAAK1V,KAAK,MAAQ,GACjC,EC1CA,IAAI2D,GAAIzb,GACJ2b,GAAQ3b,GAAsB2b,MAC9BoR,GAAO/sB,GASXJ,GAIA,SAAmB0hB,EAAGmC,GACpB,GAAInC,EAAEhD,aAAe,EACnB,MAAO,GAET,IAAIsP,EA4DN,SAAoBtM,EAAGmC,GACrB,IAAIoK,EAAW,IAAIlS,GACfmS,EAAQ,EACRC,EAAS,EAEbtS,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5BoQ,EAASjP,QAAQnB,EAAG,CAAEA,EAAGA,EAAGuQ,GAAM,EAAGC,IAAK,GAC5C,IAIAxS,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAImrB,EAAaL,EAAS5N,KAAKld,EAAE0a,EAAG1a,EAAE2a,IAAM,EACxCsG,EAASP,EAAS1gB,GAClB0jB,EAAayH,EAAalK,EAC9B6J,EAAS7N,QAAQjd,EAAE0a,EAAG1a,EAAE2a,EAAG+I,GAC3BsH,EAASnV,KAAKC,IAAIkV,EAAQF,EAAShP,KAAK9b,EAAE0a,GAAGwQ,KAAOjK,GACpD8J,EAASlV,KAAKC,IAAIiV,EAAQD,EAAShP,KAAK9b,EAAE2a,GAAO,IAAMsG,EACzD,IAEA,IAAImK,EAAU1S,GAAE0Q,MAAM4B,EAASD,EAAQ,GAAG3oB,KAAI,WAAa,OAAO,IAAI4nB,EAAQ,IAC1EqB,EAAUN,EAAQ,EAMtB,OAJArS,GAAE1L,QAAQ8d,EAAStP,SAAS,SAASd,GACnC4Q,GAAaF,EAASC,EAASP,EAAShP,KAAKpB,GAC/C,IAEO,CAAE/B,MAAOmS,EAAUM,QAASA,EAASC,QAASA,EACvD,CAxFcE,CAAWhN,EAAGmC,GAAY8K,IAClC3K,EAQN,SAAqBtC,EAAG6M,EAASC,GAC/B,IAII3sB,EAJAmiB,EAAU,GACVpF,EAAU2P,EAAQA,EAAQhuB,OAAS,GACnCse,EAAQ0P,EAAQ,GAGpB,KAAO7M,EAAEhD,aAAa,CACpB,KAAQ7c,EAAQgd,EAAM6O,WAAgBvO,GAAWuC,EAAG6M,EAASC,EAAS3sB,GACtE,KAAQA,EAAQ+c,EAAQ8O,WAAcvO,GAAWuC,EAAG6M,EAASC,EAAS3sB,GACtE,GAAI6f,EAAEhD,YACJ,IAAK,IAAI2E,EAAIkL,EAAQhuB,OAAS,EAAG8iB,EAAI,IAAKA,EAExC,GADAxhB,EAAQ0sB,EAAQlL,GAAGqK,UACR,CACT1J,EAAUA,EAAQzC,OAAOpC,GAAWuC,EAAG6M,EAASC,EAAS3sB,GAAO,IAChE,KACF,CAGN,CAEA,OAAOmiB,CACT,CA7BgB4K,CAAYZ,EAAMlS,MAAOkS,EAAMO,QAASP,EAAMQ,SAG5D,OAAO3S,GAAEyP,QAAQzP,GAAEtW,IAAIye,GAAS,SAAS7gB,GACvC,OAAOue,EAAEN,SAASje,EAAE0a,EAAG1a,EAAE2a,OACvB,EACN,EAbI6Q,GAAoB9S,GAAExC,SAAS,GAsCnC,SAAS8F,GAAWuC,EAAG6M,EAASC,EAAS3sB,EAAOgtB,GAC9C,IAAI7K,EAAU6K,EAAsB,QAAKvtB,EAwBzC,OAtBAua,GAAE1L,QAAQuR,EAAET,QAAQpf,EAAMgc,IAAI,SAASwC,GACrC,IAAI+D,EAAS1C,EAAErB,KAAKA,GAChByO,EAASpN,EAAEzC,KAAKoB,EAAKxC,GAErBgR,GACF7K,EAAQviB,KAAK,CAAEoc,EAAGwC,EAAKxC,EAAGC,EAAGuC,EAAKvC,IAGpCgR,EAAOT,KAAOjK,EACdqK,GAAaF,EAASC,EAASM,EACjC,IAEAjT,GAAE1L,QAAQuR,EAAEN,SAASvf,EAAMgc,IAAI,SAASwC,GACtC,IAAI+D,EAAS1C,EAAErB,KAAKA,GAChBvC,EAAIuC,EAAKvC,EACTqG,EAASzC,EAAEzC,KAAKnB,GACpBqG,EAAW,IAAKC,EAChBqK,GAAaF,EAASC,EAASrK,EACjC,IAEAzC,EAAEvC,WAAWtd,EAAMgc,GAEZmG,CACT,CAgCA,SAASyK,GAAaF,EAASC,EAAS3sB,GACjCA,EAAMwsB,IAECxsB,EAAU,GAGpB0sB,EAAQ1sB,EAAMwsB,IAAMxsB,EAAU,GAAI2sB,GAASb,QAAQ9rB,GAFnD0sB,EAAQA,EAAQhuB,OAAS,GAAGotB,QAAQ9rB,GAFpC0sB,EAAQ,GAAGZ,QAAQ9rB,EAMvB,CCnHA,IAAIga,GAAIzb,GACJ2uB,GAAY3uB,GAEhBJ,GAAiB,CACfgvB,IAIF,SAAatN,GACX,IAAIuN,EAA+B,WAAxBvN,EAAE5F,QAAQoT,UACjBH,GAAUrN,EAUd,SAAkBA,GAChB,OAAO,SAASve,GACd,OAAOue,EAAErB,KAAKld,GAAGihB,OAErB,CAdiBP,CAASnC,IAiB5B,SAAgBA,GACd,IAAIuN,EAAM,GACNnf,EAAQ,CAAA,EACRsS,EAAU,CAAA,EAEd,SAASE,EAAIzE,GACPhC,GAAE7Z,IAAIogB,EAASvE,KAGnBuE,EAAQvE,IAAK,EACb/N,EAAM+N,IAAK,EACXhC,GAAE1L,QAAQuR,EAAEN,SAASvD,IAAI,SAAS1a,GAC5B0Y,GAAE7Z,IAAI8N,EAAO3M,EAAE2a,GACjBmR,EAAIxtB,KAAK0B,GAETmf,EAAInf,EAAE2a,EAEV,WACOhO,EAAM+N,GACf,CAGA,OADAhC,GAAE1L,QAAQuR,EAAE/C,QAAS2D,GACd2M,CACT,CAvCME,CAAOzN,GACX7F,GAAE1L,QAAQ8e,GAAK,SAAS9rB,GACtB,IAAIob,EAAQmD,EAAErB,KAAKld,GACnBue,EAAEtC,WAAWjc,GACbob,EAAM6Q,YAAcjsB,EAAEkP,KACtBkM,EAAM8Q,UAAW,EACjB3N,EAAEtB,QAAQjd,EAAE2a,EAAG3a,EAAE0a,EAAGU,EAAO1C,GAAE8Q,SAAS,OACxC,GAOF,EApBE2C,KA+CF,SAAc5N,GACZ7F,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIob,EAAQmD,EAAErB,KAAKld,GACnB,GAAIob,EAAM8Q,SAAU,CAClB3N,EAAEtC,WAAWjc,GAEb,IAAIisB,EAAc7Q,EAAM6Q,mBACjB7Q,EAAM8Q,gBACN9Q,EAAM6Q,YACb1N,EAAEtB,QAAQjd,EAAE2a,EAAG3a,EAAE0a,EAAGU,EAAO6Q,EAC7B,CACF,GACF,GC9DA,IAAIvT,GAAIzb,GACJ2b,GAAQ3b,GAAsB2b,MAElC/b,GAAiB,CACfuvB,aAAcA,GACdC,SAiCF,SAAkB9N,GAChB,IAAI+N,GAAa,IAAI1T,IAAQuC,SAASoD,EAAE5F,SAUxC,OATAD,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAAK4R,EAAWzQ,QAAQnB,EAAG6D,EAAEzC,KAAKpB,GAAK,IACrEhC,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIusB,EAAcD,EAAWpP,KAAKld,EAAE0a,EAAG1a,EAAE2a,IAAM,CAAEsG,OAAQ,EAAGuL,OAAQ,GAChEpR,EAAQmD,EAAErB,KAAKld,GACnBssB,EAAWrP,QAAQjd,EAAE0a,EAAG1a,EAAE2a,EAAG,CAC3BsG,OAAQsL,EAAYtL,OAAS7F,EAAM6F,OACnCuL,OAAQ3W,KAAKC,IAAIyW,EAAYC,OAAQpR,EAAMoR,SAE/C,IACOF,CACT,EA5CEG,mBA8CF,SAA4BlO,GAC1B,IAAI+N,EAAa,IAAI1T,GAAM,CAAEQ,WAAYmF,EAAEtD,iBAAkBE,SAASoD,EAAE5F,SASxE,OARAD,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GACvB6D,EAAEpC,SAASzB,GAAGtd,QACjBkvB,EAAWzQ,QAAQnB,EAAG6D,EAAEzC,KAAKpB,GAEjC,IACAhC,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5BssB,EAAWrP,QAAQjd,EAAGue,EAAErB,KAAKld,GAC/B,IACOssB,CACT,EAxDEI,iBA0DF,SAA0BnO,GACxB,IAAIoO,EAAYjU,GAAEtW,IAAImc,EAAE/C,SAAS,SAASd,GACxC,IAAIkS,EAAO,CAAA,EAIX,OAHAlU,GAAE1L,QAAQuR,EAAEN,SAASvD,IAAI,SAAS1a,GAChC4sB,EAAK5sB,EAAE2a,IAAMiS,EAAK5sB,EAAE2a,IAAM,GAAK4D,EAAErB,KAAKld,GAAGihB,MAC3C,IACO2L,CACT,IACA,OAAOlU,GAAEkR,UAAUrL,EAAE/C,QAASmR,EAChC,EAlEEE,mBAoEF,SAA4BtO,GAC1B,IAAIoO,EAAYjU,GAAEtW,IAAImc,EAAE/C,SAAS,SAASd,GACxC,IAAIoC,EAAQ,CAAA,EAIZ,OAHApE,GAAE1L,QAAQuR,EAAET,QAAQpD,IAAI,SAAS1a,GAC/B8c,EAAM9c,EAAE0a,IAAMoC,EAAM9c,EAAE0a,IAAM,GAAK6D,EAAErB,KAAKld,GAAGihB,MAC7C,IACOnE,CACT,IACA,OAAOpE,GAAEkR,UAAUrL,EAAE/C,QAASmR,EAChC,EA5EEG,cAkFF,SAAuBC,EAAMC,GAC3B,IAcIC,EAAIC,EAdJ1N,EAAIuN,EAAKvN,EACT2N,EAAIJ,EAAKI,EAITC,EAAKJ,EAAMxN,EAAIA,EACf6N,EAAKL,EAAMG,EAAIA,EACfxS,EAAIoS,EAAKO,MAAQ,EACjBC,EAAIR,EAAKS,OAAS,EAEtB,IAAKJ,IAAOC,EACV,MAAM,IAAI9Q,MAAM,6DAId1G,KAAK4X,IAAIJ,GAAM1S,EAAI9E,KAAK4X,IAAIL,GAAMG,GAEhCF,EAAK,IACPE,GAAKA,GAEPN,EAAKM,EAAIH,EAAKC,EACdH,EAAKK,IAGDH,EAAK,IACPzS,GAAKA,GAEPsS,EAAKtS,EACLuS,EAAKvS,EAAI0S,EAAKD,GAGhB,MAAO,CAAE5N,EAAGA,EAAIyN,EAAIE,EAAGA,EAAID,EAC7B,EAlHEQ,iBAwHF,SAA0BnP,GACxB,IAAIoP,EAAWjV,GAAEtW,IAAIsW,GAAE0Q,MAAMwE,GAAQrP,GAAK,IAAI,WAAa,MAAO,EAAI,IAQtE,OAPA7F,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GACdmT,EAAO/R,EAAK+R,KACXnV,GAAEH,YAAYsV,KACjBF,EAASE,GAAM/R,EAAKsH,OAAS1I,EAEjC,IACOiT,CACT,EAjIEG,eAuIF,SAAwBvP,GACtB,IAAImB,EAAMhH,GAAEgH,IAAIhH,GAAEtW,IAAImc,EAAE/C,SAAS,SAASd,GAAK,OAAO6D,EAAEzC,KAAKpB,GAAGmT,IAAO,KACvEnV,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GACdhC,GAAE7Z,IAAIid,EAAM,UACdA,EAAK+R,MAAQnO,EAEjB,GACF,EA9IEqO,iBAgJF,SAA0BxP,GAExB,IAAIvW,EAAS0Q,GAAEgH,IAAIhH,GAAEtW,IAAImc,EAAE/C,SAAS,SAASd,GAAK,OAAO6D,EAAEzC,KAAKpB,GAAGmT,IAAO,KAEtEG,EAAS,GACbtV,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAImT,EAAOtP,EAAEzC,KAAKpB,GAAGmT,KAAO7lB,EACvBgmB,EAAOH,KACVG,EAAOH,GAAQ,IAEjBG,EAAOH,GAAMvvB,KAAKoc,EACpB,IAEA,IAAIuT,EAAQ,EACRC,EAAiB3P,EAAE5F,QAAQuV,eAC/BxV,GAAE1L,QAAQghB,GAAQ,SAASpS,EAAIsE,GACzBxH,GAAEH,YAAYqD,IAAOsE,EAAIgO,GAAmB,IAC5CD,EACOA,GACTvV,GAAE1L,QAAQ4O,GAAI,SAASlB,GAAK6D,EAAEzC,KAAKpB,GAAGmT,MAAQI,CAAO,GAEzD,GACF,EArKEE,cAuKF,SAAuB5P,EAAGmL,EAAQmE,EAAMzK,GACtC,IAAItH,EAAO,CACTwR,MAAO,EACPE,OAAQ,GAENjpB,UAAUnH,QAAU,IACtB0e,EAAK+R,KAAOA,EACZ/R,EAAKsH,MAAQA,GAEf,OAAOgJ,GAAa7N,EAAG,SAAUzC,EAAM4N,EACzC,EAhLEkE,QAASA,GACTQ,UA+LF,SAAmB1gB,EAAY2gB,GAC7B,IAAIpuB,EAAS,CAAEquB,IAAK,GAAIC,IAAK,IAQ7B,OAPA7V,GAAE1L,QAAQU,GAAY,SAAS5Q,GACzBuxB,EAAGvxB,GACLmD,EAAOquB,IAAIhwB,KAAKxB,GAEhBmD,EAAOsuB,IAAIjwB,KAAKxB,EAEpB,IACOmD,CACT,EAxMEuuB,KA8MF,SAActf,EAAMmf,GACN3V,GAAEpC,MACd,IACE,OAAO+X,GACT,CAAU,QAEV,CACF,EApNEI,OAsNF,SAAgBvf,EAAMmf,GACpB,OAAOA,GACT,GAlNA,SAASjC,GAAa7N,EAAGpe,EAAMuuB,EAAOxf,GACpC,IAAIwL,EACJ,GACEA,EAAIhC,GAAE8Q,SAASta,SACRqP,EAAExC,QAAQrB,IAInB,OAFAgU,EAAMC,MAAQxuB,EACdoe,EAAE1C,QAAQnB,EAAGgU,GACNhU,CACT,CAgKA,SAASkT,GAAQrP,GACf,OAAO7F,GAAE5C,IAAI4C,GAAEtW,IAAImc,EAAE/C,SAAS,SAASd,GACrC,IAAImT,EAAOtP,EAAEzC,KAAKpB,GAAGmT,KACrB,IAAKnV,GAAEH,YAAYsV,GACjB,OAAOA,CAEV,IACH,CCzMA,IAAInV,GAAIzb,GACJ2xB,GAAO3xB,GAEXJ,GAAiB,CACfgvB,IAoBF,SAAatN,GACXA,EAAE5F,QAAQkW,YAAc,GACxBnW,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASL,IAGhC,SAAuBqB,EAAGve,GACxB,IAYI2uB,EAAOD,EAAOxO,EAZdxF,EAAI1a,EAAE0a,EACNoU,EAAQvQ,EAAEzC,KAAKpB,GAAGmT,KAClBlT,EAAI3a,EAAE2a,EACNoU,EAAQxQ,EAAEzC,KAAKnB,GAAGkT,KAClB3e,EAAOlP,EAAEkP,KACT8f,EAAYzQ,EAAErB,KAAKld,GACnBivB,EAAYD,EAAUC,UAE1B,GAAIF,IAAUD,EAAQ,EAAG,OAKzB,IAHAvQ,EAAEtC,WAAWjc,GAGRkgB,EAAI,IAAK4O,EAAOA,EAAQC,IAAS7O,IAAK4O,EACzCE,EAAUE,OAAS,GACnBR,EAAQ,CACNpB,MAAO,EAAGE,OAAQ,EAClBwB,UAAWA,EAAWlU,QAAS9a,EAC/B6tB,KAAMiB,GAERH,EAAQC,GAAKxC,aAAa7N,EAAG,OAAQmQ,EAAO,MACxCI,IAAUG,IACZP,EAAMpB,MAAQ0B,EAAU1B,MACxBoB,EAAMlB,OAASwB,EAAUxB,OACzBkB,EAAMC,MAAQ,aACdD,EAAMS,SAAWH,EAAUG,UAE7B5Q,EAAEtB,QAAQvC,EAAGiU,EAAO,CAAE1N,OAAQ+N,EAAU/N,QAAU/R,GACxC,IAANgR,GACF3B,EAAE5F,QAAQkW,YAAYvwB,KAAKqwB,GAE7BjU,EAAIiU,EAGNpQ,EAAEtB,QAAQvC,EAAGC,EAAG,CAAEsG,OAAQ+N,EAAU/N,QAAU/R,EAChD,CAvCwCkgB,CAAc7Q,EAAGrB,EAAO,GAChE,EAtBEiP,KA8DF,SAAc5N,GACZ7F,GAAE1L,QAAQuR,EAAE5F,QAAQkW,aAAa,SAASnU,GACxC,IAEIC,EAFAmB,EAAOyC,EAAEzC,KAAKpB,GACd2U,EAAYvT,EAAKkT,UAGrB,IADAzQ,EAAEtB,QAAQnB,EAAKhB,QAASuU,GACjBvT,EAAK6S,OACVhU,EAAI4D,EAAE5B,WAAWjC,GAAG,GACpB6D,EAAEvC,WAAWtB,GACb2U,EAAUH,OAAO5wB,KAAK,CAAEkhB,EAAG1D,EAAK0D,EAAG2N,EAAGrR,EAAKqR,IACxB,eAAfrR,EAAK6S,QACPU,EAAU7P,EAAI1D,EAAK0D,EACnB6P,EAAUlC,EAAIrR,EAAKqR,EACnBkC,EAAU/B,MAAQxR,EAAKwR,MACvB+B,EAAU7B,OAAS1R,EAAK0R,QAE1B9S,EAAIC,EACJmB,EAAOyC,EAAEzC,KAAKpB,EAElB,GACF,GCvFA,IAAIhC,GAAIzb,GAERJ,GAAiB,CACfyyB,YAyBF,SAAqB/Q,GACnB,IAAIU,EAAU,CAAA,EAsBdvG,GAAE1L,QAAQuR,EAAE9C,WApBZ,SAAS0D,EAAIzE,GACX,IAAIU,EAAQmD,EAAEzC,KAAKpB,GACnB,GAAIhC,GAAE7Z,IAAIogB,EAASvE,GACjB,OAAOU,EAAMyS,KAEf5O,EAAQvE,IAAK,EAEb,IAAImT,EAAOnV,GAAEgH,IAAIhH,GAAEtW,IAAImc,EAAEN,SAASvD,IAAI,SAAS1a,GAC7C,OAAOmf,EAAInf,EAAE2a,GAAK4D,EAAErB,KAAKld,GAAGwsB,MAC7B,KAQD,OANIqB,IAASzM,OAAOC,mBAAhBwM,MACAA,IAEFA,EAAO,GAGDzS,EAAMyS,KAAOA,CACvB,GAGF,EAhDE0B,MAsDF,SAAehR,EAAGve,GAChB,OAAOue,EAAEzC,KAAK9b,EAAE2a,GAAGkT,KAAOtP,EAAEzC,KAAK9b,EAAE0a,GAAGmT,KAAOtP,EAAErB,KAAKld,GAAGwsB,MACzD,GC5DA,IAAI9T,GAAIzb,GACJ2b,GAAQ3b,GAAuB2b,MAC/B2W,GAAQtyB,GAAkBsyB,MAE9B1yB,GA2BA,SAAsB0hB,GACpB,IAOIrB,EAAM+Q,EAPNuB,EAAI,IAAI5W,GAAM,CAAEM,UAAU,IAG1BnD,EAAQwI,EAAE/C,QAAQ,GAClBhe,EAAO+gB,EAAEhD,YACbiU,EAAE3T,QAAQ9F,EAAO,CAAA,GAGjB,KAAO0Z,GAAUD,EAAGjR,GAAK/gB,GACvB0f,EAAOwS,GAAiBF,EAAGjR,GAC3B0P,EAAQuB,EAAEzT,QAAQmB,EAAKxC,GAAK6U,GAAMhR,EAAGrB,IAASqS,GAAMhR,EAAGrB,GACvDyS,GAAWH,EAAGjR,EAAG0P,GAGnB,OAAOuB,CACT,EAMA,SAASC,GAAUD,EAAGjR,GAcpB,OADA7F,GAAE1L,QAAQwiB,EAAEhU,SAZZ,SAAS2D,EAAIzE,GACXhC,GAAE1L,QAAQuR,EAAEJ,UAAUzD,IAAI,SAAS1a,GACjC,IAAI4vB,EAAQ5vB,EAAE0a,EACZC,EAAKD,IAAMkV,EAAS5vB,EAAE2a,EAAIiV,EACvBJ,EAAEzT,QAAQpB,IAAO4U,GAAMhR,EAAGve,KAC7BwvB,EAAE3T,QAAQlB,EAAG,CAAA,GACb6U,EAAEvS,QAAQvC,EAAGC,EAAG,CAAE,GAClBwE,EAAIxE,GAER,GACF,IAGO6U,EAAEjU,WACX,CAMA,SAASmU,GAAiBF,EAAGjR,GAC3B,OAAO7F,GAAEqQ,MAAMxK,EAAEhB,SAAS,SAASvd,GACjC,GAAIwvB,EAAEzT,QAAQ/b,EAAE0a,KAAO8U,EAAEzT,QAAQ/b,EAAE2a,GACjC,OAAO4U,GAAMhR,EAAGve,EAEpB,GACF,CAEA,SAAS2vB,GAAWH,EAAGjR,EAAG0P,GACxBvV,GAAE1L,QAAQwiB,EAAEhU,SAAS,SAASd,GAC5B6D,EAAEzC,KAAKpB,GAAGmT,MAAQI,CACpB,GACF,CCtFA,IAAIvV,GAAIzb,GACJ4yB,GAAe5yB,GACfsyB,GAAQtyB,GAAkBsyB,MAC1BO,GAAW7yB,GAAkBqyB,YAC7BnL,GAAWlnB,GAAuB4mB,IAAIM,SACtClB,GAAYhmB,GAAuB4mB,IAAIZ,UACvCoJ,GAAWpvB,GAAmBovB,SAElCxvB,GAAiBkzB,GA2CjB,SAASA,GAAexR,GACtBA,EAAI8N,GAAS9N,GACbuR,GAASvR,GACT,IAIIve,EAJAwvB,EAAIK,GAAatR,GAKrB,IAJAyR,GAAiBR,GACjBS,GAAcT,EAAGjR,GAGTve,EAAIkwB,GAAUV,IAEpBW,GAAcX,EAAGjR,EAAGve,EADhBowB,GAAUZ,EAAGjR,EAAGve,GAGxB,CAKA,SAASiwB,GAAcT,EAAGjR,GACxB,IAAI3C,EAAKqH,GAAUuM,EAAGA,EAAEhU,SACxBI,EAAKA,EAAGtU,MAAM,EAAGsU,EAAGxe,OAAS,GAC7Bsb,GAAE1L,QAAQ4O,GAAI,SAASlB,IAKzB,SAAwB8U,EAAGjR,EAAGnC,GAC5B,IAAIiU,EAAWb,EAAE1T,KAAKM,GAClBE,EAAS+T,EAAS/T,OACtBkT,EAAEtS,KAAKd,EAAOE,GAAQgU,SAAWC,GAAaf,EAAGjR,EAAGnC,EACtD,CARIoU,CAAehB,EAAGjR,EAAG7D,EACvB,GACF,CAYA,SAAS6V,GAAaf,EAAGjR,EAAGnC,GAC1B,IACIE,EADWkT,EAAE1T,KAAKM,GACAE,OAElBmU,GAAc,EAEdC,EAAYnS,EAAErB,KAAKd,EAAOE,GAE1BqU,EAAW,EAyBf,OAvBKD,IACHD,GAAc,EACdC,EAAYnS,EAAErB,KAAKZ,EAAQF,IAG7BuU,EAAWD,EAAUzP,OAErBvI,GAAE1L,QAAQuR,EAAEJ,UAAU/B,IAAQ,SAASpc,GACrC,IAqHsB+d,EAAGrD,EArHrBkW,EAAY5wB,EAAE0a,IAAM0B,EACtBrf,EAAQ6zB,EAAY5wB,EAAE2a,EAAI3a,EAAE0a,EAE9B,GAAI3d,IAAUuf,EAAQ,CACpB,IAAIuU,EAAeD,IAAcH,EAC/BK,EAAcvS,EAAErB,KAAKld,GAAGihB,OAG1B,GADA0P,GAAYE,EAAeC,GAAeA,EA8GtB/S,EA7GF3B,EA6GK1B,EA7GE3d,EAAVyyB,EA8GP3R,QAAQE,EAAGrD,GA9Gc,CAC/B,IAAIqW,EAAgBvB,EAAEtS,KAAKd,EAAOrf,GAAOuzB,SACzCK,GAAYE,GAAgBE,EAAgBA,CAC9C,CACF,CACF,IAEOJ,CACT,CAEA,SAASX,GAAiBgB,EAAM7xB,GAC1BoF,UAAUnH,OAAS,IACrB+B,EAAO6xB,EAAKxV,QAAQ,IAEtByV,GAAgBD,EAAM,CAAA,EAAI,EAAG7xB,EAC/B,CAEA,SAAS8xB,GAAgBD,EAAM/R,EAASiS,EAASxW,EAAG4B,GAClD,IAAI6U,EAAMD,EACN9V,EAAQ4V,EAAKlV,KAAKpB,GAkBtB,OAhBAuE,EAAQvE,IAAK,EACbhC,GAAE1L,QAAQgkB,EAAKnU,UAAUnC,IAAI,SAASC,GAC/BjC,GAAE7Z,IAAIogB,EAAStE,KAClBuW,EAAUD,GAAgBD,EAAM/R,EAASiS,EAASvW,EAAGD,GAEzD,IAEAU,EAAM+V,IAAMA,EACZ/V,EAAMgW,IAAMF,IACR5U,EACFlB,EAAMkB,OAASA,SAGRlB,EAAMkB,OAGR4U,CACT,CAEA,SAAShB,GAAUc,GACjB,OAAOtY,GAAEsP,KAAKgJ,EAAKzT,SAAS,SAASvd,GACnC,OAAOgxB,EAAK9T,KAAKld,GAAGswB,SAAW,CACjC,GACF,CAEA,SAASF,GAAUZ,EAAGjR,EAAGrB,GACvB,IAAIxC,EAAIwC,EAAKxC,EACTC,EAAIuC,EAAKvC,EAKR4D,EAAEV,QAAQnD,EAAGC,KAChBD,EAAIwC,EAAKvC,EACTA,EAAIuC,EAAKxC,GAGX,IAAI2W,EAAS7B,EAAE1T,KAAKpB,GAChB4W,EAAS9B,EAAE1T,KAAKnB,GAChB4W,EAAYF,EACZG,GAAO,EAIPH,EAAOD,IAAME,EAAOF,MACtBG,EAAYD,EACZE,GAAO,GAGT,IAAIC,EAAa/Y,GAAEL,OAAOkG,EAAEhB,SAAS,SAASL,GAC5C,OAAOsU,IAASE,GAAalC,EAAGA,EAAE1T,KAAKoB,EAAKxC,GAAI6W,IACzCC,IAASE,GAAalC,EAAGA,EAAE1T,KAAKoB,EAAKvC,GAAI4W,EAClD,IAEA,OAAO7Y,GAAEqQ,MAAM0I,GAAY,SAASvU,GAAQ,OAAOqS,GAAMhR,EAAGrB,EAAO,GACrE,CAEA,SAASiT,GAAcX,EAAGjR,EAAGve,EAAG2xB,GAC9B,IAAIjX,EAAI1a,EAAE0a,EACNC,EAAI3a,EAAE2a,EACV6U,EAAEvT,WAAWvB,EAAGC,GAChB6U,EAAEvS,QAAQ0U,EAAEjX,EAAGiX,EAAEhX,EAAG,CAAA,GACpBqV,GAAiBR,GACjBS,GAAcT,EAAGjR,GAInB,SAAqBiR,EAAGjR,GACtB,IAAIpf,EAAOuZ,GAAEsP,KAAKwH,EAAEhU,SAAS,SAASd,GAAK,OAAQ6D,EAAEzC,KAAKpB,GAAG4B,MAAQ,IACjEV,EAAKuI,GAASqL,EAAGrwB,GACrByc,EAAKA,EAAGtU,MAAM,GACdoR,GAAE1L,QAAQ4O,GAAI,SAASlB,GACrB,IAAI4B,EAASkT,EAAE1T,KAAKpB,GAAG4B,OACrBY,EAAOqB,EAAErB,KAAKxC,EAAG4B,GACjBsV,GAAU,EAEP1U,IACHA,EAAOqB,EAAErB,KAAKZ,EAAQ5B,GACtBkX,GAAU,GAGZrT,EAAEzC,KAAKpB,GAAGmT,KAAOtP,EAAEzC,KAAKQ,GAAQuR,MAAQ+D,EAAU1U,EAAKsP,QAAUtP,EAAKsP,OACxE,GACF,CAnBEqF,CAAYrC,EAAGjR,EACjB,CA+BA,SAASmT,GAAaV,EAAMK,EAAQS,GAClC,OAAOA,EAAUX,KAAOE,EAAOD,KAAOC,EAAOD,KAAOU,EAAUV,GAChE,CA5NArB,GAAeC,iBAAmBA,GAClCD,GAAeE,cAAgBA,GAC/BF,GAAeQ,aAAeA,GAC9BR,GAAeG,UAAYA,GAC3BH,GAAeK,UAAYA,GAC3BL,GAAeI,cAAgBA,GChB/B,IACIb,GADWryB,GACYqyB,YACvBO,GAAe5yB,GACf8yB,GAAiB9yB,GAErBJ,GAqBA,SAAc0hB,GACZ,OAAOA,EAAE5F,QAAQoZ,QACjB,IAAK,kBAGL,QAASC,GAAqBzT,SAF9B,IAAK,cASP,SAAyBA,GACvB+Q,GAAY/Q,GACZsR,GAAatR,EACf,CAZqB0T,CAAgB1T,GAAI,MACvC,IAAK,eAAgB2T,GAAkB3T,GAGzC,EAGA,IAAI2T,GAAoB5C,GAOxB,SAAS0C,GAAqBzT,GAC5BwR,GAAexR,EACjB,CC/CA,IAAI7F,GAAIzb,GAERJ,GAEA,SAA2B0hB,GACzB,IAAI4T,EAoEN,SAAmB5T,GACjB,IAAIte,EAAS,CAAA,EACTmxB,EAAM,EAEV,SAASjS,EAAIzE,GACX,IAAIyW,EAAMC,EACV1Y,GAAE1L,QAAQuR,EAAEpC,SAASzB,GAAIyE,GACzBlf,EAAOya,GAAK,CAAEyW,IAAKA,EAAKC,IAAKA,IAC/B,CAGA,OAFA1Y,GAAE1L,QAAQuR,EAAEpC,WAAYgD,GAEjBlf,CACT,CAhFsBgjB,CAAU1E,GAE9B7F,GAAE1L,QAAQuR,EAAE5F,QAAQkW,aAAa,SAASnU,GAUxC,IATA,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GACdI,EAAUgB,EAAKhB,QACfsX,EAqCR,SAAkB7T,EAAG4T,EAAezX,EAAGC,GACrC,IAII2B,EACA+V,EALAC,EAAQ,GACRC,EAAQ,GACRpB,EAAMtb,KAAK6J,IAAIyS,EAAczX,GAAGyW,IAAKgB,EAAcxX,GAAGwW,KACtDC,EAAMvb,KAAKC,IAAIqc,EAAczX,GAAG0W,IAAKe,EAAcxX,GAAGyW,KAK1D9U,EAAS5B,EACT,GACE4B,EAASiC,EAAEjC,OAAOA,GAClBgW,EAAMh0B,KAAKge,SACJA,IACC6V,EAAc7V,GAAQ6U,IAAMA,GAAOC,EAAMe,EAAc7V,GAAQ8U,MACzEiB,EAAM/V,EAGNA,EAAS3B,EACT,MAAQ2B,EAASiC,EAAEjC,OAAOA,MAAa+V,GACrCE,EAAMj0B,KAAKge,GAGb,MAAO,CAAE1J,KAAM0f,EAAMlU,OAAOmU,EAAMC,WAAYH,IAAKA,EACrD,CA7DmBI,CAASlU,EAAG4T,EAAerX,EAAQJ,EAAGI,EAAQH,GACzD/H,EAAOwf,EAASxf,KAChByf,EAAMD,EAASC,IACfK,EAAU,EACVC,EAAQ/f,EAAK8f,GACbE,GAAY,EAETlY,IAAMI,EAAQH,GAAG,CAGtB,GAFAmB,EAAOyC,EAAEzC,KAAKpB,GAEVkY,EAAW,CACb,MAAQD,EAAQ/f,EAAK8f,MAAcL,GAC5B9T,EAAEzC,KAAK6W,GAAO/E,QAAU9R,EAAK+R,MAClC6E,IAGEC,IAAUN,IACZO,GAAY,EAEhB,CAEA,IAAKA,EAAW,CACd,KAAOF,EAAU9f,EAAKxV,OAAS,GACxBmhB,EAAEzC,KAAK6W,EAAQ/f,EAAK8f,EAAU,IAAIG,SAAW/W,EAAK+R,MACvD6E,IAEFC,EAAQ/f,EAAK8f,EACf,CAEAnU,EAAElC,UAAU3B,EAAGiY,GACfjY,EAAI6D,EAAE5B,WAAWjC,GAAG,EACtB,CACF,GACF,EC3CA,IAAIhC,GAAIzb,GACJ2xB,GAAO3xB,GAEXJ,GAAiB,CACfgvB,IA2BF,SAAatN,GACX,IAAIpf,EAAOyvB,GAAKxC,aAAa7N,EAAG,OAAQ,CAAA,EAAI,SACxCuU,EAmEN,SAAoBvU,GAClB,IAAIuU,EAAS,CAAA,EACb,SAAS3T,EAAIzE,EAAGjF,GACd,IAAI0G,EAAWoC,EAAEpC,SAASzB,GACtByB,GAAYA,EAAS/e,QACvBsb,GAAE1L,QAAQmP,GAAU,SAASC,GAC3B+C,EAAI/C,EAAO3G,EAAQ,EACrB,IAEFqd,EAAOpY,GAAKjF,CACd,CAEA,OADAiD,GAAE1L,QAAQuR,EAAEpC,YAAY,SAASzB,GAAKyE,EAAIzE,EAAG,EAAI,IAC1CoY,CACT,CAhFeC,CAAWxU,GACpBiP,EAAS9U,GAAE5C,IAAI4C,GAAE3Q,OAAO+qB,IAAW,EACnCE,EAAU,EAAIxF,EAAS,EAE3BjP,EAAE5F,QAAQsa,YAAc9zB,EAGxBuZ,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAAKue,EAAErB,KAAKld,GAAGwsB,QAAUwG,CAAS,IAGhE,IAAI/R,EAwEN,SAAoB1C,GAClB,OAAO7F,GAAEF,OAAO+F,EAAEhB,SAAS,SAASqE,EAAK5hB,GACvC,OAAO4hB,EAAMrD,EAAErB,KAAKld,GAAGihB,MACxB,GAAE,EACL,CA5EeiS,CAAW3U,GAAK,EAG7B7F,GAAE1L,QAAQuR,EAAEpC,YAAY,SAASC,GAC/B+C,GAAIZ,EAAGpf,EAAM6zB,EAAS/R,EAAQuM,EAAQsF,EAAQ1W,EAChD,IAIAmC,EAAE5F,QAAQuV,eAAiB8E,CAC7B,EAhDEG,QAoHF,SAAiB5U,GACf,IAAI6U,EAAa7U,EAAE5F,QACnB4F,EAAEvC,WAAWoX,EAAWH,oBACjBG,EAAWH,YAClBva,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GACjBue,EAAErB,KAAKld,GACTqzB,aACP9U,EAAEtC,WAAWjc,EAEjB,GACF,GA5EA,SAASmf,GAAIZ,EAAGpf,EAAM6zB,EAAS/R,EAAQuM,EAAQsF,EAAQpY,GACrD,IAAIyB,EAAWoC,EAAEpC,SAASzB,GAC1B,GAAKyB,EAAS/e,OAAd,CAOA,IAAIk2B,EAAM1E,GAAKT,cAAc5P,EAAG,OAC5BgV,EAAS3E,GAAKT,cAAc5P,EAAG,OAC/BnD,EAAQmD,EAAEzC,KAAKpB,GAEnB6D,EAAElC,UAAUiX,EAAK5Y,GACjBU,EAAMoY,UAAYF,EAClB/U,EAAElC,UAAUkX,EAAQ7Y,GACpBU,EAAMqY,aAAeF,EAErB7a,GAAE1L,QAAQmP,GAAU,SAASC,GAC3B+C,GAAIZ,EAAGpf,EAAM6zB,EAAS/R,EAAQuM,EAAQsF,EAAQ1W,GAE9C,IAAIsX,EAAYnV,EAAEzC,KAAKM,GACnBuX,EAAWD,EAAUF,UAAYE,EAAUF,UAAYpX,EACvDwX,EAAcF,EAAUD,aAAeC,EAAUD,aAAerX,EAChEyX,EAAaH,EAAUF,UAAYvS,EAAS,EAAIA,EAChDuL,EAASmH,IAAaC,EAAc,EAAIpG,EAASsF,EAAOpY,GAAK,EAEjE6D,EAAEtB,QAAQqW,EAAKK,EAAU,CACvB1S,OAAQ4S,EACRrH,OAAQA,EACR6G,aAAa,IAGf9U,EAAEtB,QAAQ2W,EAAaL,EAAQ,CAC7BtS,OAAQ4S,EACRrH,OAAQA,EACR6G,aAAa,GAEjB,IAEK9U,EAAEjC,OAAO5B,IACZ6D,EAAEtB,QAAQ9d,EAAMm0B,EAAK,CAAErS,OAAQ,EAAGuL,OAAQgB,EAASsF,EAAOpY,IAlC5D,MAJMA,IAAMvb,GACRof,EAAEtB,QAAQ9d,EAAMub,EAAG,CAAEuG,OAAQ,EAAGuL,OAAQwG,GAuC9C,CClGA,IAAIta,GAAIzb,GACJ2xB,GAAO3xB,GAEXJ,GAEA,SAA2B0hB,GAoBzB7F,GAAE1L,QAAQuR,EAAEpC,YAnBZ,SAASgD,EAAIzE,GACX,IAAIyB,EAAWoC,EAAEpC,SAASzB,GACtBoB,EAAOyC,EAAEzC,KAAKpB,GAKlB,GAJIyB,EAAS/e,QACXsb,GAAE1L,QAAQmP,EAAUgD,GAGlBzG,GAAE7Z,IAAIid,EAAM,WAAY,CAC1BA,EAAKgY,WAAa,GAClBhY,EAAKiY,YAAc,GACnB,IAAK,IAAIlG,EAAO/R,EAAK+W,QAASjF,EAAU9R,EAAK8R,QAAU,EACrDC,EAAOD,IACLC,EACFM,GAAc5P,EAAG,aAAc,MAAO7D,EAAGoB,EAAM+R,GAC/CM,GAAc5P,EAAG,cAAe,MAAO7D,EAAGoB,EAAM+R,EAEpD,CACF,GAGF,EAEA,SAASM,GAAc5P,EAAGyV,EAAMtK,EAAQuK,EAAIC,EAAQrG,GAClD,IAAIzS,EAAQ,CAAEkS,MAAO,EAAGE,OAAQ,EAAGK,KAAMA,EAAMsG,WAAYH,GACvDI,EAAOF,EAAOF,GAAMnG,EAAO,GAC3BnD,EAAOkE,GAAKxC,aAAa7N,EAAG,SAAUnD,EAAOsO,GACjDwK,EAAOF,GAAMnG,GAAQnD,EACrBnM,EAAElC,UAAUqO,EAAMuJ,GACdG,GACF7V,EAAEtB,QAAQmX,EAAM1J,EAAM,CAAEzJ,OAAQ,GAEpC,CCnCA,IAAIvI,GAAIzb,GAERJ,GAAiB,CACfw3B,OAIF,SAAgB9V,GACd,IAAI+V,EAAU/V,EAAE5F,QAAQ4b,QAAQC,cAChB,OAAZF,GAAgC,OAAZA,GACtBG,GAAgBlW,EAEpB,EARE4N,KAUF,SAAc5N,GACZ,IAAI+V,EAAU/V,EAAE5F,QAAQ4b,QAAQC,cAChB,OAAZF,GAAgC,OAAZA,GAqB1B,SAAkB/V,GAChB7F,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAAKga,GAAYnW,EAAEzC,KAAKpB,GAAK,IAE3DhC,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GAClB0Y,GAAE1L,QAAQkQ,EAAKgS,OAAQwF,IACnBhc,GAAE7Z,IAAIqe,EAAM,MACdwX,GAAYxX,EAEhB,GACF,CA9BIyX,CAASpW,GAGK,OAAZ+V,GAAgC,OAAZA,KAiC1B,SAAgB/V,GACd7F,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAAKka,GAAUrW,EAAEzC,KAAKpB,GAAK,IAEzDhC,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GAClB0Y,GAAE1L,QAAQkQ,EAAKgS,OAAQ0F,IACnBlc,GAAE7Z,IAAIqe,EAAM,MACd0X,GAAU1X,EAEd,GACF,CA1CI2X,CAAOtW,GACPkW,GAAgBlW,GAEpB,GAEA,SAASkW,GAAgBlW,GACvB7F,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAAKoa,GAAmBvW,EAAEzC,KAAKpB,GAAK,IAClEhC,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAAK80B,GAAmBvW,EAAErB,KAAKld,GAAK,GACpE,CAEA,SAAS80B,GAAmBpG,GAC1B,IAAI/T,EAAI+T,EAAMpB,MACdoB,EAAMpB,MAAQoB,EAAMlB,OACpBkB,EAAMlB,OAAS7S,CACjB,CAcA,SAAS+Z,GAAYhG,GACnBA,EAAMvB,GAAKuB,EAAMvB,CACnB,CAcA,SAASyH,GAAUlG,GACjB,IAAIlP,EAAIkP,EAAMlP,EACdkP,EAAMlP,EAAIkP,EAAMvB,EAChBuB,EAAMvB,EAAI3N,CACZ,CCrEA,IAAI9G,GAAIzb,GAERJ,GAaA,SAAmB0hB,GACjB,IAAIU,EAAU,CAAA,EACV8V,EAAcrc,GAAEL,OAAOkG,EAAE/C,SAAS,SAASd,GAC7C,OAAQ6D,EAAEpC,SAASzB,GAAGtd,MACxB,IACIwwB,EAAUlV,GAAE5C,IAAI4C,GAAEtW,IAAI2yB,GAAa,SAASra,GAAK,OAAO6D,EAAEzC,KAAKpB,GAAGmT,IAAO,KACzEG,EAAStV,GAAEtW,IAAIsW,GAAE0Q,MAAMwE,EAAU,IAAI,WAAa,MAAO,EAAI,IAEjE,SAASzO,EAAIzE,GACX,IAAIhC,GAAE7Z,IAAIogB,EAASvE,GAAnB,CACAuE,EAAQvE,IAAK,EACb,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GAClBsT,EAAOlS,EAAK+R,MAAMvvB,KAAKoc,GACvBhC,GAAE1L,QAAQuR,EAAE5B,WAAWjC,GAAIyE,EAJJ,CAKzB,CAEA,IAAI6V,EAAYtc,GAAE4Q,OAAOyL,GAAa,SAASra,GAAK,OAAO6D,EAAEzC,KAAKpB,GAAGmT,IAAM,IAG3E,OAFAnV,GAAE1L,QAAQgoB,EAAW7V,GAEd6O,CACT,ECnCA,IAAItV,GAAIzb,GAERJ,GAkBA,SAAoB0hB,EAAGoP,GAErB,IADA,IAAIsH,EAAK,EACA/U,EAAI,EAAGA,EAAIyN,EAASvwB,SAAU8iB,EACrC+U,GAAMC,GAAmB3W,EAAGoP,EAASzN,EAAE,GAAIyN,EAASzN,IAEtD,OAAO+U,CACT,EAEA,SAASC,GAAmB3W,EAAG4W,EAAYC,GAczC,IAVA,IAAIC,EAAW3c,GAAEkR,UAAUwL,EACzB1c,GAAEtW,IAAIgzB,GAAY,SAAU1a,EAAGwF,GAAK,OAAOA,CAAI,KAC7CoV,EAAe5c,GAAEyP,QAAQzP,GAAEtW,IAAI+yB,GAAY,SAASza,GACtD,OAAOhC,GAAE4Q,OAAO5Q,GAAEtW,IAAImc,EAAEN,SAASvD,IAAI,SAAS1a,GAC5C,MAAO,CAAEu1B,IAAKF,EAASr1B,EAAE2a,GAAIsG,OAAQ1C,EAAErB,KAAKld,GAAGihB,WAC7C,WACF,GAGAuU,EAAa,EACVA,EAAaJ,EAAWh4B,QAAQo4B,IAAe,EACtD,IAAIC,EAAW,EAAID,EAAa,EAChCA,GAAc,EACd,IAAIxE,EAAOtY,GAAEtW,IAAI,IAAIxE,MAAM63B,IAAW,WAAa,OAAO,CAAG,IAGzDR,EAAK,EAeT,OAdAvc,GAAE1L,QAAQsoB,EAAatoB,SAAQ,SAAStO,GACtC,IAAIX,EAAQW,EAAM62B,IAAMC,EACxBxE,EAAKjzB,IAAUW,EAAMuiB,OAErB,IADA,IAAIyU,EAAY,EACT33B,EAAQ,GACTA,EAAQ,IACV23B,GAAa1E,EAAKjzB,EAAQ,IAG5BizB,EADAjzB,EAASA,EAAQ,GAAM,IACRW,EAAMuiB,OAEvBgU,GAAMv2B,EAAMuiB,OAASyU,CACtB,KAEMT,CACT,CClEA,IAAIvc,GAAIzb,GCER,IAAIyb,GAAIzb,GCFR,IAAIyb,GAAIzb,GACJ2xB,GAAO3xB,GAmCX,SAAS04B,GAAkB/Z,EAAIga,EAAY73B,GAEzC,IADA,IAAIsqB,EACGuN,EAAWx4B,SAAWirB,EAAO3P,GAAE2P,KAAKuN,IAAa1V,GAAKniB,GAC3D63B,EAAW53B,MACX4d,EAAGtd,KAAK+pB,EAAKzM,IACb7d,IAEF,OAAOA,CACT,CC5CA,IAAI2a,GAAIzb,GACJ44B,GHGJ,SAAoBtX,EAAGuX,GACrB,OAAOpd,GAAEtW,IAAI0zB,GAAS,SAASpb,GAC7B,IAAIsD,EAAMO,EAAET,QAAQpD,GACpB,GAAKsD,EAAI5gB,OAEF,CACL,IAAI6C,EAASyY,GAAEF,OAAOwF,GAAK,SAAS4D,EAAK5hB,GACvC,IAAIkd,EAAOqB,EAAErB,KAAKld,GAChB+1B,EAAQxX,EAAEzC,KAAK9b,EAAE0a,GACnB,MAAO,CACLsb,IAAKpU,EAAIoU,IAAO9Y,EAAK+D,OAAS8U,EAAM3S,MACpCnC,OAAQW,EAAIX,OAAS/D,EAAK+D,OAE9B,GAAG,CAAE+U,IAAK,EAAG/U,OAAQ,IAErB,MAAO,CACLvG,EAAGA,EACHmb,WAAY51B,EAAO+1B,IAAM/1B,EAAOghB,OAChCA,OAAQhhB,EAAOghB,OAEnB,CAhBE,MAAO,CAAEvG,EAAGA,EAiBhB,GACF,EGxBIub,GF6BJ,SAA0Bz3B,EAAS03B,GACjC,IAAIC,EAAgB,CAAA,EA4BpB,OA3BAzd,GAAE1L,QAAQxO,GAAS,SAASE,EAAOwhB,GACjC,IAAItF,EAAMub,EAAcz3B,EAAMgc,GAAK,CACjC0b,SAAU,EACVnL,GAAM,GACNC,IAAK,GACLtP,GAAI,CAACld,EAAMgc,GACXwF,EAAGA,GAEAxH,GAAEH,YAAY7Z,EAAMm3B,cACvBjb,EAAIib,WAAan3B,EAAMm3B,WACvBjb,EAAIqG,OAASviB,EAAMuiB,OAEvB,IAEAvI,GAAE1L,QAAQkpB,EAAG3Y,SAAS,SAASvd,GAC7B,IAAIq2B,EAASF,EAAcn2B,EAAE0a,GACzB4b,EAASH,EAAcn2B,EAAE2a,GACxBjC,GAAEH,YAAY8d,IAAY3d,GAAEH,YAAY+d,KAC3CA,EAAOF,WACPC,EAAOnL,IAAI5sB,KAAK63B,EAAcn2B,EAAE2a,IAEpC,IASF,SAA4B4b,GAC1B,IAAI/3B,EAAU,GAEd,SAASg4B,EAAS5V,GAChB,OAAO,SAAS+K,GACVA,EAAO8K,SAGP/d,GAAEH,YAAYoT,EAAOkK,aACrBnd,GAAEH,YAAYqI,EAAOiV,aACrBlK,EAAOkK,YAAcjV,EAAOiV,aA6BtC,SAAsBa,EAAQ5yB,GAC5B,IAAIkyB,EAAM,EACN/U,EAAS,EAETyV,EAAOzV,SACT+U,GAAOU,EAAOb,WAAaa,EAAOzV,OAClCA,GAAUyV,EAAOzV,QAGfnd,EAAOmd,SACT+U,GAAOlyB,EAAO+xB,WAAa/xB,EAAOmd,OAClCA,GAAUnd,EAAOmd,QAGnByV,EAAO9a,GAAK9X,EAAO8X,GAAGwC,OAAOsY,EAAO9a,IACpC8a,EAAOb,WAAaG,EAAM/U,EAC1ByV,EAAOzV,OAASA,EAChByV,EAAOxW,EAAIrK,KAAK6J,IAAI5b,EAAOoc,EAAGwW,EAAOxW,GACrCpc,EAAO2yB,QAAS,CAClB,CA/CQE,CAAa/V,EAAQ+K,GAG3B,CAEA,SAASiL,EAAUhW,GACjB,OAAO,SAASI,GACdA,EAAW,GAAE1iB,KAAKsiB,GACQ,KAApBI,EAAOoV,UACXG,EAAUj4B,KAAK0iB,GAGrB,CAEA,KAAOuV,EAAUn5B,QAAQ,CACvB,IAAIsB,EAAQ63B,EAAUv4B,MACtBQ,EAAQF,KAAKI,GACbga,GAAE1L,QAAQtO,EAAU,GAAE8zB,UAAWgE,EAAS93B,IAC1Cga,GAAE1L,QAAQtO,EAAMwsB,IAAK0L,EAAUl4B,GACjC,CAEA,OAAOga,GAAEtW,IAAIsW,GAAEL,OAAO7Z,GAAS,SAASE,GAAS,OAAQA,EAAM+3B,MAAQ,KACrE,SAAS/3B,GACP,OAAOga,GAAEsQ,KAAKtqB,EAAO,CAAC,KAAM,IAAK,aAAc,UACjD,GAEJ,CAxCSm4B,CAJSne,GAAEL,OAAO8d,GAAe,SAASz3B,GAC/C,OAAQA,EAAM03B,QAChB,IAGF,EE1DI7O,GDEJ,SAAc/oB,EAASs4B,GACrB,IAAIC,EAAQnI,GAAKR,UAAU5vB,GAAS,SAASE,GAC3C,OAAOga,GAAE7Z,IAAIH,EAAO,aACtB,IACIs4B,EAAWD,EAAMzI,IACnBsH,EAAald,GAAE4Q,OAAOyN,EAAMxI,KAAK,SAAS7vB,GAAS,OAAQA,EAAMwhB,CAAG,IACpEtE,EAAK,GACLoa,EAAM,EACN/U,EAAS,EACTgW,EAAU,EAEZD,EAASzP,MA8Bc2P,IA9BSJ,EA+BzB,SAAST,EAAQC,GACtB,OAAID,EAAOR,WAAaS,EAAOT,YACrB,EACCQ,EAAOR,WAAaS,EAAOT,WAC7B,EAGDqB,EAA6BZ,EAAOpW,EAAImW,EAAOnW,EAAxCmW,EAAOnW,EAAIoW,EAAOpW,KApCnC+W,EAAUtB,GAAkB/Z,EAAIga,EAAYqB,GAE5Cve,GAAE1L,QAAQgqB,GAAU,SAAUt4B,GAC5Bu4B,GAAWv4B,EAAMkd,GAAGxe,OACpBwe,EAAGtd,KAAKI,EAAMkd,IACdoa,GAAOt3B,EAAMm3B,WAAan3B,EAAMuiB,OAChCA,GAAUviB,EAAMuiB,OAChBgW,EAAUtB,GAAkB/Z,EAAIga,EAAYqB,EAC9C,IAoBF,IAAyBC,EAlBvB,IAAIj3B,EAAS,CAAE2b,GAAIlD,GAAEyP,QAAQvM,GAAI,IAC7BqF,IACFhhB,EAAO41B,WAAaG,EAAM/U,EAC1BhhB,EAAOghB,OAASA,GAElB,OAAOhhB,CACT,EC7BApD,GAEA,SAASs6B,EAAa5Y,EAAG7D,EAAGwb,EAAIY,GAC9B,IAAIhB,EAAUvX,EAAEpC,SAASzB,GACrBoB,EAAOyC,EAAEzC,KAAKpB,GACd0c,EAAKtb,EAAOA,EAAKgY,gBAAa31B,EAC9Bk5B,EAAKvb,EAAOA,EAAKiY,iBAAa51B,EAC9Bm5B,EAAY,CAAA,EAEZF,IACFtB,EAAUpd,GAAEL,OAAOyd,GAAS,SAASnb,GACnC,OAAOA,IAAMyc,GAAMzc,IAAM0c,CAC3B,KAGF,IAAIE,EAAc1B,GAAWtX,EAAGuX,GAChCpd,GAAE1L,QAAQuqB,GAAa,SAAS74B,GAC9B,GAAI6f,EAAEpC,SAASzd,EAAMgc,GAAGtd,OAAQ,CAC9B,IAAIo6B,EAAiBL,EAAa5Y,EAAG7f,EAAMgc,EAAGwb,EAAIY,GAClDQ,EAAU54B,EAAMgc,GAAK8c,EACjB9e,GAAE7Z,IAAI24B,EAAgB,gBAwCNd,EAvCDh4B,EAuCS3B,EAvCFy6B,EAwCzB9e,GAAEH,YAAYme,EAAOb,aAMxBa,EAAOb,WAAa94B,EAAM84B,WAC1Ba,EAAOzV,OAASlkB,EAAMkkB,SANtByV,EAAOb,YAAca,EAAOb,WAAaa,EAAOzV,OAC3BlkB,EAAM84B,WAAa94B,EAAMkkB,SACzByV,EAAOzV,OAASlkB,EAAMkkB,QAC3CyV,EAAOzV,QAAUlkB,EAAMkkB,QA1CvB,CAqCJ,IAA0ByV,EAAQ35B,CApChC,IAEA,IAAIyB,EAAUy3B,GAAiBsB,EAAarB,IAuB9C,SAAyB13B,EAAS84B,GAChC5e,GAAE1L,QAAQxO,GAAS,SAASE,GAC1BA,EAAMkd,GAAKlD,GAAEyP,QAAQzpB,EAAMkd,GAAGxZ,KAAI,SAASsY,GACzC,OAAI4c,EAAU5c,GACL4c,EAAU5c,GAAGkB,GAEflB,MACL,EACN,GACF,CA/BE+c,CAAgBj5B,EAAS84B,GAEzB,IAAIr3B,EAASsnB,GAAK/oB,EAASs4B,GAE3B,GAAIM,IACFn3B,EAAO2b,GAAKlD,GAAEyP,QAAQ,CAACiP,EAAIn3B,EAAO2b,GAAIyb,IAAK,GACvC9Y,EAAE9B,aAAa2a,GAAIh6B,QAAQ,CAC7B,IAAIs6B,EAASnZ,EAAEzC,KAAKyC,EAAE9B,aAAa2a,GAAI,IACrCO,EAASpZ,EAAEzC,KAAKyC,EAAE9B,aAAa4a,GAAI,IAChC3e,GAAE7Z,IAAIoB,EAAQ,gBACjBA,EAAO41B,WAAa,EACpB51B,EAAOghB,OAAS,GAElBhhB,EAAO41B,YAAc51B,EAAO41B,WAAa51B,EAAOghB,OAC3ByW,EAAOtU,MAAQuU,EAAOvU,QAAUnjB,EAAOghB,OAAS,GACrEhhB,EAAOghB,QAAU,CACnB,CAGF,OAAOhhB,CACT,ECpDA,IAAIyY,GAAIzb,GACJ2b,GAAQ3b,GAAuB2b,MAEnC/b,GAgCA,SAAyB0hB,EAAGsP,EAAM+J,GAChC,IAAIz4B,EAgCN,SAAwBof,GACtB,IAAI7D,EACJ,KAAO6D,EAAExC,QAASrB,EAAIhC,GAAE8Q,SAAS,YACjC,OAAO9O,CACT,CApCamd,CAAetZ,GACxBte,EAAS,IAAI2Y,GAAM,CAAEU,UAAU,IAAQ6B,SAAS,CAAEhc,KAAMA,IACrDkc,qBAAoB,SAASX,GAAK,OAAO6D,EAAEzC,KAAKpB,EAAI,IA2BzD,OAzBAhC,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GAChB4B,EAASiC,EAAEjC,OAAO5B,IAEhBoB,EAAK+R,OAASA,GAAQ/R,EAAK+W,SAAWhF,GAAQA,GAAQ/R,EAAK8R,WAC7D3tB,EAAO4b,QAAQnB,GACfza,EAAOoc,UAAU3B,EAAG4B,GAAUnd,GAG9BuZ,GAAE1L,QAAQuR,EAAEqZ,GAAcld,IAAI,SAAS1a,GACrC,IAAI+d,EAAI/d,EAAE0a,IAAMA,EAAI1a,EAAE2a,EAAI3a,EAAE0a,EAC1BwC,EAAOjd,EAAOid,KAAKa,EAAGrD,GACtBuG,EAAUvI,GAAEH,YAAY2E,GAAsB,EAAdA,EAAK+D,OACvChhB,EAAOgd,QAAQc,EAAGrD,EAAG,CAAEuG,OAAQ1C,EAAErB,KAAKld,GAAGihB,OAASA,GACpD,IAEIvI,GAAE7Z,IAAIid,EAAM,YACd7b,EAAO4b,QAAQnB,EAAG,CAChBoZ,WAAYhY,EAAKgY,WAAWjG,GAC5BkG,YAAajY,EAAKiY,YAAYlG,KAItC,IAEO5tB,CACT,EClEA,IAAIyY,GAAIzb,GCER,IAAIyb,GAAIzb,GACJ66B,GAAY76B,GACZ86B,GAAa96B,GACbk6B,GAAel6B,GACf+6B,GAAkB/6B,GAClBg7B,GDHJ,SAAgC1Z,EAAG2X,EAAIta,GACrC,IACEsc,EADE9D,EAAO,CAAE,EAGb1b,GAAE1L,QAAQ4O,GAAI,SAASlB,GAIrB,IAHA,IACE4B,EACA6b,EAFE/b,EAAQmC,EAAEjC,OAAO5B,GAGd0B,GAAO,CASZ,IARAE,EAASiC,EAAEjC,OAAOF,KAEhB+b,EAAY/D,EAAK9X,GACjB8X,EAAK9X,GAAUF,IAEf+b,EAAYD,EACZA,EAAW9b,GAET+b,GAAaA,IAAc/b,EAE7B,YADA8Z,EAAGjZ,QAAQkb,EAAW/b,GAGxBA,EAAQE,CACV,CACF,GAyBF,EC5CI1D,GAAQ3b,GAAuB2b,MAC/BgW,GAAO3xB,GAEXJ,GAiBA,SAAe0hB,GACb,IAAIqP,EAAUgB,GAAKhB,QAAQrP,GACzB6Z,EAAkBC,GAAiB9Z,EAAG7F,GAAE0Q,MAAM,EAAGwE,EAAU,GAAI,WAC/D0K,EAAgBD,GAAiB9Z,EAAG7F,GAAE0Q,MAAMwE,EAAU,GAAI,GAAI,GAAI,YAEhED,EAAWmK,GAAUvZ,GACzBga,GAAYha,EAAGoP,GAKf,IAHA,IACE6K,EADEC,EAASrX,OAAOC,kBAGXnB,EAAI,EAAGwY,EAAW,EAAGA,EAAW,IAAKxY,IAAKwY,EAAU,CAC3DC,GAAiBzY,EAAI,EAAIkY,EAAkBE,EAAepY,EAAI,GAAK,GAEnEyN,EAAWiB,GAAKlB,iBAAiBnP,GACjC,IAAI0W,EAAK8C,GAAWxZ,EAAGoP,GACnBsH,EAAKwD,IACPC,EAAW,EACXF,EAAO9f,GAAEgP,UAAUiG,GACnB8K,EAASxD,EAEb,CAEAsD,GAAYha,EAAGia,EACjB,EAEA,SAASH,GAAiB9Z,EAAGqa,EAAOhB,GAClC,OAAOlf,GAAEtW,IAAIw2B,GAAO,SAAS/K,GAC3B,OAAOmK,GAAgBzZ,EAAGsP,EAAM+J,EAClC,GACF,CAEA,SAASe,GAAiBE,EAAa/B,GACrC,IAAIZ,EAAK,IAAItd,GACbF,GAAE1L,QAAQ6rB,GAAa,SAASC,GAC9B,IAAI35B,EAAO25B,EAAGngB,QAAQxZ,KAClB45B,EAAS5B,GAAa2B,EAAI35B,EAAM+2B,EAAIY,GACxCpe,GAAE1L,QAAQ+rB,EAAOnd,IAAI,SAASlB,EAAGwF,GAC/B4Y,EAAGhd,KAAKpB,GAAG0I,MAAQlD,CACrB,IACA+X,GAAuBa,EAAI5C,EAAI6C,EAAOnd,GACxC,GACF,CAEA,SAAS2c,GAAYha,EAAGoP,GACtBjV,GAAE1L,QAAQ2gB,GAAU,SAASqL,GAC3BtgB,GAAE1L,QAAQgsB,GAAO,SAASte,EAAGwF,GAC3B3B,EAAEzC,KAAKpB,GAAG0I,MAAQlD,CACpB,GACF,GACF,CC5EA,IAAIxH,GAAIzb,GACJ2b,GAAQ3b,GAAuB2b,MAC/BgW,GAAO3xB,GAOXJ,GA8UA,SAAmB0hB,GACjB,IAMI0a,EANAtL,EAAWiB,GAAKlB,iBAAiBnP,GACjC2a,EAAYxgB,GAAE+P,MAChB0Q,GAAmB5a,EAAGoP,GACtByL,GAAmB7a,EAAGoP,IAEpB0L,EAAM,CAAA,EAEV3gB,GAAE1L,QAAQ,CAAC,IAAK,MAAM,SAASssB,GAC7BL,EAA4B,MAATK,EAAe3L,EAAWjV,GAAE3Q,OAAO4lB,GAAU6E,UAChE9Z,GAAE1L,QAAQ,CAAC,IAAK,MAAM,SAASusB,GACf,MAAVA,IACFN,EAAmBvgB,GAAEtW,IAAI62B,GAAkB,SAASO,GAClD,OAAO9gB,GAAE3Q,OAAOyxB,GAAOhH,SACzB,KAGF,IAAIiH,GAAuB,MAATH,EAAe/a,EAAE9B,aAAe8B,EAAE5B,YAAY0G,KAAK9E,GACjEmb,EAAQC,GAAkBpb,EAAG0a,EAAkBC,EAAWO,GAC1DG,EAAKC,GAAqBtb,EAAG0a,EAC/BS,EAAMv6B,KAAMu6B,EAAMA,MAAiB,MAAVH,GACb,MAAVA,IACFK,EAAKlhB,GAAE4P,UAAUsR,GAAI,SAASpa,GAAK,OAAQA,CAAG,KAEhD6Z,EAAIC,EAAOC,GAASK,CACtB,GACF,IAEA,IAAIE,EAAgBC,GAA2Bxb,EAAG8a,GAElD,OADAW,GAAiBX,EAAKS,GACfG,GAAQZ,EAAK9a,EAAE5F,QAAQ+gB,MAChC,EA/UA,SAASP,GAAmB5a,EAAGoP,GAC7B,IAAIuL,EAAY,CAAA,EAqChB,OADAxgB,GAAEF,OAAOmV,GAlCT,SAAoBuM,EAAWlB,GAC7B,IAGEmB,EAAK,EAGLC,EAAU,EACVC,EAAkBH,EAAU98B,OAC5Bk9B,EAAW5hB,GAAE2P,KAAK2Q,GAsBpB,OApBAtgB,GAAE1L,QAAQgsB,GAAO,SAASte,EAAGwF,GAC3B,IAAIvF,EAuEV,SAAmC4D,EAAG7D,GACpC,GAAI6D,EAAEzC,KAAKpB,GAAGiU,MACZ,OAAOjW,GAAEsP,KAAKzJ,EAAE9B,aAAa/B,IAAI,SAASqD,GACxC,OAAOQ,EAAEzC,KAAKiC,GAAG4Q,KACnB,GAEJ,CA7Ec4L,CAA0Bhc,EAAG7D,GACnC8f,EAAK7f,EAAI4D,EAAEzC,KAAKnB,GAAGyI,MAAQiX,GAEzB1f,GAAKD,IAAM4f,KACb5hB,GAAE1L,QAAQgsB,EAAM1xB,MAAM8yB,EAASla,EAAG,IAAI,SAASua,GAC7C/hB,GAAE1L,QAAQuR,EAAE9B,aAAage,IAAW,SAAS1c,GAC3C,IAAI2c,EAASnc,EAAEzC,KAAKiC,GAClB4c,EAAOD,EAAOtX,QACXuX,EAAOR,GAAMK,EAAKG,IACjBD,EAAO/L,OAASpQ,EAAEzC,KAAK2e,GAAU9L,OACrCiM,GAAY1B,EAAWnb,EAAG0c,EAE9B,GACF,IACAL,EAAUla,EAAI,EACdia,EAAKK,EAET,IAEOxB,CACT,IAGOE,CACT,CAEA,SAASE,GAAmB7a,EAAGoP,GAC7B,IAAIuL,EAAY,CAAA,EAEhB,SAAS2B,EAAKC,EAAOzF,EAAU0F,EAAUC,EAAiBC,GACxD,IAAIvgB,EACJhC,GAAE1L,QAAQ0L,GAAE0Q,MAAMiM,EAAU0F,IAAW,SAAS7a,GAC9CxF,EAAIogB,EAAM5a,GACN3B,EAAEzC,KAAKpB,GAAGiU,OACZjW,GAAE1L,QAAQuR,EAAE9B,aAAa/B,IAAI,SAASqD,GACpC,IAAImd,EAAQ3c,EAAEzC,KAAKiC,GACfmd,EAAMvM,QACLuM,EAAM9X,MAAQ4X,GAAmBE,EAAM9X,MAAQ6X,IAClDL,GAAY1B,EAAWnb,EAAGrD,EAE9B,GAEJ,GACF,CAyBA,OADAhC,GAAEF,OAAOmV,GArBT,SAAoBwN,EAAOL,GACzB,IACEM,EADEC,GAAgB,EAElBhG,EAAW,EAeb,OAbA3c,GAAE1L,QAAQ8tB,GAAO,SAASpgB,EAAG4gB,GAC3B,GAAwB,WAApB/c,EAAEzC,KAAKpB,GAAGiU,MAAoB,CAChC,IAAIlS,EAAe8B,EAAE9B,aAAa/B,GAC9B+B,EAAarf,SACfg+B,EAAe7c,EAAEzC,KAAKW,EAAa,IAAI2G,MACvCyX,EAAKC,EAAOzF,EAAUiG,EAAgBD,EAAcD,GACpD/F,EAAWiG,EACXD,EAAeD,EAEnB,CACAP,EAAKC,EAAOzF,EAAUyF,EAAM19B,OAAQg+B,EAAcD,EAAM/9B,OAC1D,IAEO09B,CACT,IAGO5B,CACT,CAUA,SAAS0B,GAAY1B,EAAWxe,EAAGC,GACjC,GAAID,EAAIC,EAAG,CACT,IAAIC,EAAMF,EACVA,EAAIC,EACJA,EAAIC,CACN,CAEA,IAAI2gB,EAAarC,EAAUxe,GACtB6gB,IACHrC,EAAUxe,GAAK6gB,EAAa,IAE9BA,EAAW5gB,IAAK,CAClB,CAEA,SAAS6gB,GAAYtC,EAAWxe,EAAGC,GACjC,GAAID,EAAIC,EAAG,CACT,IAAIC,EAAMF,EACVA,EAAIC,EACJA,EAAIC,CACN,CACA,OAAOlC,GAAE7Z,IAAIq6B,EAAUxe,GAAIC,EAC7B,CAUA,SAASgf,GAAkBpb,EAAGoP,EAAUuL,EAAWO,GACjD,IAAIt6B,EAAO,CAAE,EACXu6B,EAAQ,CAAE,EACVnE,EAAM,CAAA,EAkCR,OA7BA7c,GAAE1L,QAAQ2gB,GAAU,SAASqL,GAC3BtgB,GAAE1L,QAAQgsB,GAAO,SAASte,EAAG0I,GAC3BjkB,EAAKub,GAAKA,EACVgf,EAAMhf,GAAKA,EACX6a,EAAI7a,GAAK0I,CACX,GACF,IAEA1K,GAAE1L,QAAQ2gB,GAAU,SAASqL,GAC3B,IAAIyC,GAAW,EACf/iB,GAAE1L,QAAQgsB,GAAO,SAASte,GACxB,IAAIghB,EAAKjC,EAAW/e,GACpB,GAAIghB,EAAGt+B,OAAQ,CACbs+B,EAAKhjB,GAAE4Q,OAAOoS,GAAI,SAAS/gB,GAAK,OAAO4a,EAAI5a,EAAI,IAE/C,IADA,IAAIghB,GAAMD,EAAGt+B,OAAS,GAAK,EAClB8iB,EAAIrK,KAAK+lB,MAAMD,GAAKE,EAAKhmB,KAAKsQ,KAAKwV,GAAKzb,GAAK2b,IAAM3b,EAAG,CAC7D,IAAIvF,EAAI+gB,EAAGxb,GACPwZ,EAAMhf,KAAOA,GACb+gB,EAAUlG,EAAI5a,KACb6gB,GAAYtC,EAAWxe,EAAGC,KAC7B+e,EAAM/e,GAAKD,EACXgf,EAAMhf,GAAKvb,EAAKub,GAAKvb,EAAKwb,GAC1B8gB,EAAUlG,EAAI5a,GAElB,CACF,CACF,GACF,IAEO,CAAExb,KAAMA,EAAMu6B,MAAOA,EAC9B,CAEA,SAASG,GAAqBtb,EAAGoP,EAAUxuB,EAAMu6B,EAAOoC,GAMtD,IAAIlC,EAAK,CAAE,EACTmC,EAmDJ,SAAyBxd,EAAGoP,EAAUxuB,EAAM28B,GAC1C,IAAIE,EAAa,IAAIpjB,GACnBwa,EAAa7U,EAAE5F,QACfsjB,EA+GJ,SAAajJ,EAASkJ,EAASJ,GAC7B,OAAO,SAASvd,EAAG7D,EAAGC,GACpB,IAGIsT,EAHAoD,EAAS9S,EAAEzC,KAAKpB,GAChB4W,EAAS/S,EAAEzC,KAAKnB,GAChBqb,EAAM,EAIV,GADAA,GAAO3E,EAAO/D,MAAQ,EAClB5U,GAAE7Z,IAAIwyB,EAAQ,YAChB,OAAQA,EAAOlC,SAASqF,eACxB,IAAK,IAAKvG,GAASoD,EAAO/D,MAAQ,EAAG,MACrC,IAAK,IAAKW,EAAQoD,EAAO/D,MAAQ,EAYnC,GATIW,IACF+H,GAAO8F,EAAa7N,GAASA,GAE/BA,EAAQ,EAER+H,IAAQ3E,EAAO1C,MAAQuN,EAAUlJ,GAAW,EAC5CgD,IAAQ1E,EAAO3C,MAAQuN,EAAUlJ,GAAW,EAE5CgD,GAAO1E,EAAOhE,MAAQ,EAClB5U,GAAE7Z,IAAIyyB,EAAQ,YAChB,OAAQA,EAAOnC,SAASqF,eACxB,IAAK,IAAKvG,EAAQqD,EAAOhE,MAAQ,EAAG,MACpC,IAAK,IAAKW,GAASqD,EAAOhE,MAAQ,EAQpC,OALIW,IACF+H,GAAO8F,EAAa7N,GAASA,GAE/BA,EAAQ,EAED+H,EAEX,CAnJYmG,CAAI/I,EAAWgJ,QAAShJ,EAAWiJ,QAASP,GAgBtD,OAdApjB,GAAE1L,QAAQ2gB,GAAU,SAASqL,GAC3B,IAAIjb,EACJrF,GAAE1L,QAAQgsB,GAAO,SAASte,GACxB,IAAI4hB,EAAQn9B,EAAKub,GAEjB,GADAshB,EAAWngB,QAAQygB,GACfve,EAAG,CACL,IAAIwe,EAAQp9B,EAAK4e,GACfye,EAAUR,EAAW9e,KAAKqf,EAAOD,GACnCN,EAAW/e,QAAQsf,EAAOD,EAAOzmB,KAAKC,IAAImmB,EAAM1d,EAAG7D,EAAGqD,GAAIye,GAAW,GACvE,CACAze,EAAIrD,CACN,GACF,IAEOshB,CACT,CAvEaS,CAAgBle,EAAGoP,EAAUxuB,EAAM28B,GAC5C3H,EAAa2H,EAAa,aAAe,cAE3C,SAASY,EAAQC,EAAWC,GAI1B,IAHA,IAAIjwB,EAAQovB,EAAOvgB,QACfqhB,EAAOlwB,EAAM3O,MACbihB,EAAU,CAAA,EACP4d,GACD5d,EAAQ4d,GACVF,EAAUE,IAEV5d,EAAQ4d,IAAQ,EAChBlwB,EAAMrO,KAAKu+B,GACXlwB,EAAQA,EAAMyR,OAAOwe,EAAcC,KAGrCA,EAAOlwB,EAAM3O,KAEjB,CA6BA,OARA0+B,GAlBA,SAAeG,GACbjD,EAAGiD,GAAQd,EAAOje,QAAQ+e,GAAMrkB,QAAO,SAASoJ,EAAK5hB,GACnD,OAAO6V,KAAKC,IAAI8L,EAAKgY,EAAG55B,EAAE0a,GAAKqhB,EAAO7e,KAAKld,GAC5C,GAAE,EACL,GAce+7B,EAAOtf,aAAa4G,KAAK0Y,IACxCW,GAZA,SAAeG,GACb,IAAInd,EAAMqc,EAAO9d,SAAS4e,GAAMrkB,QAAO,SAASoJ,EAAK5hB,GACnD,OAAO6V,KAAK6J,IAAIkC,EAAKgY,EAAG55B,EAAE2a,GAAKohB,EAAO7e,KAAKld,GAC7C,GAAGohB,OAAOC,mBAENvF,EAAOyC,EAAEzC,KAAK+gB,GACdnd,IAAQ0B,OAAOC,mBAAqBvF,EAAKqY,aAAeA,IAC1DyF,EAAGiD,GAAQhnB,KAAKC,IAAI8jB,EAAGiD,GAAOnd,GAElC,GAGeqc,EAAOpf,WAAW0G,KAAK0Y,IAGtCrjB,GAAE1L,QAAQ0sB,GAAO,SAAShf,GACxBkf,EAAGlf,GAAKkf,EAAGz6B,EAAKub,GAClB,IAEOkf,CACT,CA4BA,SAASG,GAA2Bxb,EAAG8a,GACrC,OAAO3gB,GAAEqQ,MAAMrQ,GAAE3Q,OAAOsxB,IAAM,SAAUO,GACtC,IAAI9jB,EAAMsL,OAAO0b,kBACbpd,EAAM0B,OAAOC,kBASjB,OAPA3I,GAAE0P,MAAMwR,GAAI,SAAUpa,EAAG9E,GACvB,IAAIqiB,EAyHV,SAAexe,EAAG7D,GAChB,OAAO6D,EAAEzC,KAAKpB,GAAG4S,KACnB,CA3HsBA,CAAM/O,EAAG7D,GAAK,EAE9B5E,EAAMD,KAAKC,IAAI0J,EAAIud,EAAWjnB,GAC9B4J,EAAM7J,KAAK6J,IAAIF,EAAIud,EAAWrd,EAChC,IAEO5J,EAAM4J,CACf,GACF,CASA,SAASsa,GAAiBX,EAAK2D,GAC7B,IAAIC,EAAcvkB,GAAE3Q,OAAOi1B,GACzBE,EAAaxkB,GAAEgH,IAAIud,GACnBE,EAAazkB,GAAE5C,IAAImnB,GAErBvkB,GAAE1L,QAAQ,CAAC,IAAK,MAAM,SAASssB,GAC7B5gB,GAAE1L,QAAQ,CAAC,IAAK,MAAM,SAASusB,GAC7B,IAEEtL,EAFEmP,EAAY9D,EAAOC,EACrBK,EAAKP,EAAI+D,GAEX,GAAIxD,IAAOoD,EAAX,CAEA,IAAIK,EAAS3kB,GAAE3Q,OAAO6xB,IACtB3L,EAAkB,MAAVsL,EAAgB2D,EAAaxkB,GAAEgH,IAAI2d,GAAUF,EAAazkB,GAAE5C,IAAIunB,MAGtEhE,EAAI+D,GAAa1kB,GAAE4P,UAAUsR,GAAI,SAASpa,GAAK,OAAOA,EAAIyO,CAAO,IAN/C,CAQtB,GACF,GACF,CAEA,SAASgM,GAAQZ,EAAKK,GACpB,OAAOhhB,GAAE4P,UAAU+Q,EAAIiE,IAAI,SAASC,EAAQ7iB,GAC1C,GAAIgf,EACF,OAAOL,EAAIK,EAAMlF,eAAe9Z,GAEhC,IAAIkf,EAAKlhB,GAAE4Q,OAAO5Q,GAAEtW,IAAIi3B,EAAK3e,IAC7B,OAAQkf,EAAG,GAAKA,EAAG,IAAM,CAE7B,GACF,CCrVA,IAAIlhB,GAAIzb,GACJ2xB,GAAO3xB,GACPugC,GAAYvgC,GCFhB,IAAIyb,GAAIzb,GACJwgC,GAAUxgC,GACVygC,GAAYzgC,GACZ4wB,GAAO5wB,GACP6wB,GAAiB7wB,GAAkB6wB,eACnC6P,GAAoB1gC,GACpB8wB,GAAmB9wB,GAAkB8wB,iBACrC6P,GAAe3gC,GACf4gC,GAAoB5gC,GACpB6gC,GAAmB7gC,GACnBmmB,GAAQnmB,GACR8gC,GDLJ,SAAkBxf,IASlB,SAAmBA,GACjB,IAAIoP,EAAWiB,GAAKlB,iBAAiBnP,GACjCyf,EAAUzf,EAAE5F,QAAQslB,QACpBC,EAAQ,EACZxlB,GAAE1L,QAAQ2gB,GAAU,SAASqL,GAC3B,IAAImF,EAAYzlB,GAAE5C,IAAI4C,GAAEtW,IAAI42B,GAAO,SAASte,GAAK,OAAO6D,EAAEzC,KAAKpB,GAAG8S,MAAS,KAC3E9U,GAAE1L,QAAQgsB,GAAO,SAASte,GACxB6D,EAAEzC,KAAKpB,GAAGyS,EAAI+Q,EAAQC,EAAY,CACpC,IACAD,GAASC,EAAYH,CACvB,GACF,EAjBEI,CAFA7f,EAAIqQ,GAAKnC,mBAAmBlO,IAG5B7F,GAAE1L,QAAQwwB,GAAUjf,IAAI,SAASiB,EAAG9E,GAClC6D,EAAEzC,KAAKpB,GAAG8E,EAAIA,CAChB,GACF,ECDIoP,GAAO3xB,GACP2b,GAAQ3b,GAAsB2b,MAElC/b,GAEA,SAAgB0hB,EAAGvF,GACjB,IAAIwV,EAAOxV,GAAQA,EAAKqlB,YAAczP,GAAKJ,KAAOI,GAAKH,OACvDD,EAAK,UAAU,WACb,IAAI8P,EACF9P,EAAK,sBAAsB,WAAa,OA2F9C,SAA0B+P,GACxB,IAAIhgB,EAAI,IAAI3F,GAAM,CAAEQ,YAAY,EAAME,UAAU,IAC5CX,EAAQ6lB,GAAaD,EAAW5lB,SAqBpC,OAnBA4F,EAAEpD,SAASzC,GAAE+P,MAAM,CAAE,EACnBgW,GACAC,GAAkB/lB,EAAOgmB,IACzBjmB,GAAEsQ,KAAKrQ,EAAOimB,MAEhBlmB,GAAE1L,QAAQuxB,EAAW/iB,SAAS,SAASd,GACrC,IAAIoB,EAAO0iB,GAAaD,EAAWziB,KAAKpB,IACxC6D,EAAE1C,QAAQnB,EAAGhC,GAAEkP,SAAS8W,GAAkB5iB,EAAM+iB,IAAeC,KAC/DvgB,EAAElC,UAAU3B,EAAG6jB,EAAWjiB,OAAO5B,GACnC,IAEAhC,GAAE1L,QAAQuxB,EAAWhhB,SAAS,SAASvd,GACrC,IAAIkd,EAAOshB,GAAaD,EAAWrhB,KAAKld,IACxCue,EAAEtB,QAAQjd,EAAG0Y,GAAE+P,MAAM,CAAE,EACrBsW,GACAL,GAAkBxhB,EAAM8hB,IACxBtmB,GAAEsQ,KAAK9L,EAAM+hB,KACjB,IAEO1gB,CACT,CAnHqD2gB,CAAiB3gB,EAAI,IACtEiQ,EAAK,eAAsB,YAK/B,SAAmBjQ,EAAGiQ,GACpBA,EAAK,8BAA8B,YAsHrC,SAAgCjQ,GAC9B,IAAI5F,EAAQ4F,EAAE5F,QACdA,EAAMslB,SAAW,EACjBvlB,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GAClBkd,EAAKsP,QAAU,EACqB,MAAhCtP,EAAKiS,SAASqF,gBACM,OAAlB7b,EAAM4b,SAAsC,OAAlB5b,EAAM4b,QAClCrX,EAAKoQ,OAASpQ,EAAKiiB,YAEnBjiB,EAAKsQ,QAAUtQ,EAAKiiB,YAG1B,GACF,CApIkDC,CAAuB7gB,EAAI,IAC3EiQ,EAAK,uBAA8B,YAmSrC,SAAyBjQ,GACvB7F,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,GAAIA,EAAE0a,IAAM1a,EAAE2a,EAAG,CACf,IAAImB,EAAOyC,EAAEzC,KAAK9b,EAAE0a,GACfoB,EAAKujB,YACRvjB,EAAKujB,UAAY,IAEnBvjB,EAAKujB,UAAU/gC,KAAK,CAAE0B,EAAGA,EAAGob,MAAOmD,EAAErB,KAAKld,KAC1Cue,EAAEtC,WAAWjc,EACf,CACF,GACF,CA9SkDs/B,CAAgB/gB,EAAI,IACpEiQ,EAAK,eAA8B,WAAaiP,GAAQ5R,IAAItN,EAAI,IAChEiQ,EAAK,wBAA8B,WAAaoP,GAAa/R,IAAItN,EAAI,IACrEiQ,EAAK,YAA8B,WAAaX,GAAKe,GAAKnC,mBAAmBlO,GAAK,IAClFiQ,EAAK,8BAA8B,YAuIrC,SAAgCjQ,GAC9B7F,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GAClB,GAAIkd,EAAKoQ,OAASpQ,EAAKsQ,OAAQ,CAC7B,IAAI9S,EAAI6D,EAAEzC,KAAK9b,EAAE0a,GAEbU,EAAQ,CAAEyS,MADNtP,EAAEzC,KAAK9b,EAAE2a,GACMkT,KAAOnT,EAAEmT,MAAQ,EAAInT,EAAEmT,KAAM7tB,EAAGA,GACvD4uB,GAAKxC,aAAa7N,EAAG,aAAcnD,EAAO,MAC5C,CACF,GACF,CAjJkDmkB,CAAuBhhB,EAAI,IAC3EiQ,EAAK,wBAA8B,WAAaT,GAAiBxP,EAAI,IACrEiQ,EAAK,4BAA8B,WAAaoP,GAAazK,QAAQ5U,EAAI,IACzEiQ,EAAK,sBAA8B,WAAaV,GAAevP,EAAI,IACnEiQ,EAAK,wBAA8B,YA+IrC,SAA0BjQ,GACxB,IAAIqP,EAAU,EACdlV,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GACdoB,EAAK0X,YACP1X,EAAK+W,QAAUtU,EAAEzC,KAAKA,EAAK0X,WAAW3F,KACtC/R,EAAK8R,QAAUrP,EAAEzC,KAAKA,EAAK2X,cAAc5F,KACzCD,EAAUlV,GAAE5C,IAAI8X,EAAS9R,EAAK8R,SAElC,IACArP,EAAE5F,QAAQiV,QAAUA,CACtB,CA1JkD4R,CAAiBjhB,EAAI,IACrEiQ,EAAK,8BAA8B,YA2JrC,SAAgCjQ,GAC9B7F,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GACC,eAAfoB,EAAK6S,QACPpQ,EAAErB,KAAKpB,EAAK9b,GAAGivB,UAAYnT,EAAK+R,KAChCtP,EAAEvC,WAAWtB,GAEjB,GACF,CAnKkD+kB,CAAuBlhB,EAAI,IAC3EiQ,EAAK,qBAA8B,WAAakP,GAAU7R,IAAItN,EAAI,IAClEiQ,EAAK,yBAA8B,WAAamP,GAAkBpf,EAAI,IACtEiQ,EAAK,yBAA8B,WAAaqP,GAAkBtf,EAAI,IACtEiQ,EAAK,aAA8B,WAAapL,GAAM7E,EAAI,IAC1DiQ,EAAK,uBAA8B,YAkSrC,SAAyBjQ,GACvB,IAAIyP,EAASY,GAAKlB,iBAAiBnP,GACnC7F,GAAE1L,QAAQghB,GAAQ,SAASgL,GACzB,IAAI0G,EAAa,EACjBhnB,GAAE1L,QAAQgsB,GAAO,SAASte,EAAGwF,GAC3B,IAAIpE,EAAOyC,EAAEzC,KAAKpB,GAClBoB,EAAKsH,MAAQlD,EAAIwf,EACjBhnB,GAAE1L,QAAQ8O,EAAKujB,WAAW,SAASM,GACjC/Q,GAAKxC,aAAa7N,EAAG,WAAY,CAC/B+O,MAAOqS,EAASvkB,MAAMkS,MACtBE,OAAQmS,EAASvkB,MAAMoS,OACvBK,KAAM/R,EAAK+R,KACXzK,MAAOlD,KAAOwf,EACd1/B,EAAG2/B,EAAS3/B,EACZob,MAAOukB,EAASvkB,OACf,MACL,WACOU,EAAKujB,SACd,GACF,GACF,CAtTkDO,CAAgBrhB,EAAI,IACpEiQ,EAAK,8BAA8B,WAAasP,GAAiBzJ,OAAO9V,EAAI,IAC5EiQ,EAAK,gBAA8B,WAAauP,GAASxf,EAAI,IAC7DiQ,EAAK,yBAA8B,YAqTrC,SAA2BjQ,GACzB7F,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GAClB,GAAmB,aAAfoB,EAAK6S,MAAsB,CAC7B,IAAIkR,EAAWthB,EAAEzC,KAAKA,EAAK9b,EAAE0a,GACzB8E,EAAIqgB,EAASrgB,EAAIqgB,EAASvS,MAAQ,EAClCH,EAAI0S,EAAS1S,EACbC,EAAKtR,EAAK0D,EAAIA,EACd6N,EAAKwS,EAASrS,OAAS,EAC3BjP,EAAEtB,QAAQnB,EAAK9b,EAAG8b,EAAKV,OACvBmD,EAAEvC,WAAWtB,GACboB,EAAKV,MAAM8T,OAAS,CAClB,CAAE1P,EAAGA,EAAI,EAAI4N,EAAK,EAAGD,EAAGA,EAAIE,GAC5B,CAAE7N,EAAGA,EAAI,EAAI4N,EAAK,EAAGD,EAAGA,EAAIE,GAC5B,CAAE7N,EAAGA,EAAQ4N,EAAQD,EAAGA,GACxB,CAAE3N,EAAGA,EAAI,EAAI4N,EAAK,EAAGD,EAAGA,EAAIE,GAC5B,CAAE7N,EAAGA,EAAI,EAAI4N,EAAK,EAAGD,EAAGA,EAAIE,IAE9BvR,EAAKV,MAAMoE,EAAI1D,EAAK0D,EACpB1D,EAAKV,MAAM+R,EAAIrR,EAAKqR,CACtB,CACF,GACF,CA3UkD2S,CAAkBvhB,EAAI,IACtEiQ,EAAK,yBAA8B,YA0PrC,SAA2BjQ,GACzB7F,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,GAAI6D,EAAEpC,SAASzB,GAAGtd,OAAQ,CACxB,IAAI0e,EAAOyC,EAAEzC,KAAKpB,GACd8U,EAAIjR,EAAEzC,KAAKA,EAAK0X,WAChBuM,EAAIxhB,EAAEzC,KAAKA,EAAK2X,cAChBtT,EAAI5B,EAAEzC,KAAKpD,GAAE2P,KAAKvM,EAAKgY,aACvB1T,EAAI7B,EAAEzC,KAAKpD,GAAE2P,KAAKvM,EAAKiY,cAE3BjY,EAAKwR,MAAQzX,KAAK4X,IAAIrN,EAAEZ,EAAIW,EAAEX,GAC9B1D,EAAK0R,OAAS3X,KAAK4X,IAAIsS,EAAE5S,EAAIqC,EAAErC,GAC/BrR,EAAK0D,EAAIW,EAAEX,EAAI1D,EAAKwR,MAAQ,EAC5BxR,EAAKqR,EAAIqC,EAAErC,EAAIrR,EAAK0R,OAAS,CAC/B,CACF,IAEA9U,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GACJ,WAApB6D,EAAEzC,KAAKpB,GAAGiU,OACZpQ,EAAEvC,WAAWtB,EAEjB,GACF,CA/QkDslB,CAAkBzhB,EAAI,IACtEiQ,EAAK,sBAA8B,WAAakP,GAAUvR,KAAK5N,EAAI,IACnEiQ,EAAK,4BAA8B,YAgOrC,SAA8BjQ,GAC5B7F,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GAClB,GAAI0Y,GAAE7Z,IAAIqe,EAAM,KAId,OAHsB,MAAlBA,EAAKiS,UAAsC,MAAlBjS,EAAKiS,WAChCjS,EAAKoQ,OAASpQ,EAAKiiB,aAEbjiB,EAAKiS,UACb,IAAK,IAAKjS,EAAKsC,GAAKtC,EAAKoQ,MAAQ,EAAIpQ,EAAKiiB,YAAa,MACvD,IAAK,IAAKjiB,EAAKsC,GAAKtC,EAAKoQ,MAAQ,EAAIpQ,EAAKiiB,YAG9C,GACF,CA7OkDc,CAAqB1hB,EAAI,IACzEiQ,EAAK,4BAA8B,WAAasP,GAAiB3R,KAAK5N,EAAI,IAC1EiQ,EAAK,sBAA8B,YAwJrC,SAAwBjQ,GACtB,IAAI2hB,EAAO9e,OAAOC,kBACd8e,EAAO,EACPC,EAAOhf,OAAOC,kBACdgf,EAAO,EACPjN,EAAa7U,EAAE5F,QACf2nB,EAAUlN,EAAWmN,SAAW,EAChCC,EAAUpN,EAAWqN,SAAW,EAEpC,SAASC,EAAYhS,GACnB,IAAIlP,EAAIkP,EAAMlP,EACV2N,EAAIuB,EAAMvB,EACVxS,EAAI+T,EAAMpB,MACVC,EAAImB,EAAMlB,OACd0S,EAAOrqB,KAAK6J,IAAIwgB,EAAM1gB,EAAI7E,EAAI,GAC9BwlB,EAAOtqB,KAAKC,IAAIqqB,EAAM3gB,EAAI7E,EAAI,GAC9BylB,EAAOvqB,KAAK6J,IAAI0gB,EAAMjT,EAAII,EAAI,GAC9B8S,EAAOxqB,KAAKC,IAAIuqB,EAAMlT,EAAII,EAAI,EAChC,CAEA7U,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAAKgmB,EAAYniB,EAAEzC,KAAKpB,GAAK,IAC3DhC,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GACd0Y,GAAE7Z,IAAIqe,EAAM,MACdwjB,EAAYxjB,EAEhB,IAEAgjB,GAAQI,EACRF,GAAQI,EAER9nB,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GAClBoB,EAAK0D,GAAK0gB,EACVpkB,EAAKqR,GAAKiT,CACZ,IAEA1nB,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GAClB0Y,GAAE1L,QAAQkQ,EAAKgS,QAAQ,SAASyR,GAC9BA,EAAEnhB,GAAK0gB,EACPS,EAAExT,GAAKiT,CACT,IACI1nB,GAAE7Z,IAAIqe,EAAM,OAAQA,EAAKsC,GAAK0gB,GAC9BxnB,GAAE7Z,IAAIqe,EAAM,OAAQA,EAAKiQ,GAAKiT,EACpC,IAEAhN,EAAW9F,MAAQ6S,EAAOD,EAAOI,EACjClN,EAAW5F,OAAS6S,EAAOD,EAAOI,CACpC,CAzMkDI,CAAeriB,EAAI,IACnEiQ,EAAK,4BAA8B,YA0MrC,SAA8BjQ,GAC5B7F,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAGI6gC,EAAIC,EAHJ5jB,EAAOqB,EAAErB,KAAKld,GACd+gC,EAAQxiB,EAAEzC,KAAK9b,EAAE0a,GACjBsmB,EAAQziB,EAAEzC,KAAK9b,EAAE2a,GAEhBuC,EAAKgS,QAKR2R,EAAK3jB,EAAKgS,OAAO,GACjB4R,EAAK5jB,EAAKgS,OAAOhS,EAAKgS,OAAO9xB,OAAS,KALtC8f,EAAKgS,OAAS,GACd2R,EAAKG,EACLF,EAAKC,GAKP7jB,EAAKgS,OAAO+R,QAAQrS,GAAK9B,cAAciU,EAAOF,IAC9C3jB,EAAKgS,OAAO5wB,KAAKswB,GAAK9B,cAAckU,EAAOF,GAC7C,GACF,CA3NkDI,CAAqB3iB,EAAI,IACzEiQ,EAAK,qBAA8B,YA2OrC,SAAuCjQ,GACrC7F,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GACdkd,EAAKgP,UACPhP,EAAKgS,OAAOsD,SAEhB,GACF,CAlPkD2O,CAA8B5iB,EAAI,IAClFiQ,EAAK,oBAA8B,WAAaiP,GAAQtR,KAAK5N,EAAI,GACnE,CAjC4C6iB,CAAU9C,EAAa9P,EAAO,IACtEA,EAAK,sBAAsB,YAwC/B,SAA0B+P,EAAYD,GACpC5lB,GAAE1L,QAAQuxB,EAAW/iB,SAAS,SAASd,GACrC,IAAI2mB,EAAa9C,EAAWziB,KAAKpB,GAC7B4mB,EAAchD,EAAYxiB,KAAKpB,GAE/B2mB,IACFA,EAAW7hB,EAAI8hB,EAAY9hB,EAC3B6hB,EAAWlU,EAAImU,EAAYnU,EAEvBmR,EAAYniB,SAASzB,GAAGtd,SAC1BikC,EAAW/T,MAAQgU,EAAYhU,MAC/B+T,EAAW7T,OAAS8T,EAAY9T,QAGtC,IAEA9U,GAAE1L,QAAQuxB,EAAWhhB,SAAS,SAASvd,GACrC,IAAIqhC,EAAa9C,EAAWrhB,KAAKld,GAC7BshC,EAAchD,EAAYphB,KAAKld,GAEnCqhC,EAAWnS,OAASoS,EAAYpS,OAC5BxW,GAAE7Z,IAAIyiC,EAAa,OACrBD,EAAW7hB,EAAI8hB,EAAY9hB,EAC3B6hB,EAAWlU,EAAImU,EAAYnU,EAE/B,IAEAoR,EAAW5lB,QAAQ2U,MAAQgR,EAAY3lB,QAAQ2U,MAC/CiR,EAAW5lB,QAAQ6U,OAAS8Q,EAAY3lB,QAAQ6U,MAClD,CArE4C+T,CAAiBhjB,EAAG+f,EAAc,GAC5E,GACF,EAqEA,IAAIK,GAAgB,CAAC,UAAW,UAAW,UAAW,UAAW,WAC7DF,GAAgB,CAAER,QAAS,GAAI5B,QAAS,GAAID,QAAS,GAAI7H,QAAS,MAClEqK,GAAa,CAAC,YAAa,SAAU,UAAW,SAChDC,GAAe,CAAC,QAAS,UACzBC,GAAe,CAAExR,MAAO,EAAGE,OAAQ,GACnCwR,GAAe,CAAC,SAAU,SAAU,QAAS,SAAU,eACvDD,GAAe,CACjBvS,OAAQ,EAAGvL,OAAQ,EAAGqM,MAAO,EAAGE,OAAQ,EACxC2R,YAAa,GAAIhQ,SAAU,KAEzB8P,GAAY,CAAC,YAmRjB,SAASP,GAAkB8C,EAAK9S,GAC9B,OAAOhW,GAAE4P,UAAU5P,GAAEsQ,KAAKwY,EAAK9S,GAAQtN,OACzC,CAEA,SAASod,GAAa9P,GACpB,IAAI+S,EAAW,CAAA,EAIf,OAHA/oB,GAAE1L,QAAQ0hB,GAAO,SAAShU,EAAGN,GAC3BqnB,EAASrnB,EAAEoa,eAAiB9Z,CAC9B,IACO+mB,CACT,CCvYA,IAAI/oB,GAAIzb,GACJ2xB,GAAO3xB,GACP2b,GAAQ3b,GAAsB2b,MCFlC/b,ICsBAA,GAAiB,CACfsQ,SAAUlQ,GAEVykC,OAAQzkC,GACR0kC,MFtBe,CACfC,cAIF,SAAuBrjB,GACrB,IAAIsjB,EAAcjT,GAAKlB,iBAAiBnP,GAEpCgP,EAAI,IAAI3U,GAAM,CAAEU,UAAU,EAAMF,YAAY,IAAQ+B,SAAS,CAAA,GAoBjE,OAlBAzC,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B6S,EAAE1R,QAAQnB,EAAG,CAAEU,MAAOV,IACtB6S,EAAElR,UAAU3B,EAAG,QAAU6D,EAAEzC,KAAKpB,GAAGmT,KACrC,IAEAnV,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5ButB,EAAEtQ,QAAQjd,EAAE0a,EAAG1a,EAAE2a,EAAG,CAAE,EAAE3a,EAAEkP,KAC5B,IAEAwJ,GAAE1L,QAAQ60B,GAAa,SAAS7I,EAAO9Y,GACrC,IAAI4hB,EAAS,QAAU5hB,EACvBqN,EAAE1R,QAAQimB,EAAQ,CAAEjU,KAAM,SAC1BnV,GAAEF,OAAOwgB,GAAO,SAASjb,EAAGrD,GAE1B,OADA6S,EAAEtQ,QAAQc,EAAGrD,EAAG,CAAEqnB,MAAO,UAClBrnB,CACT,GACF,IAEO6S,CACT,GENEqB,KAAM,CACJJ,KAAMvxB,GAAsBuxB,KAC5BC,OAAQxxB,GAAsBwxB,QAEhCpQ,QD/Be,eEyCJ2jB,GAcX,MAAAC,CAAOC,GACL5kC,KAAK4kC,GAAKA,CACX,CAMD,MAAAR,CAAOS,EAAsB,IAC3B,MAAM3mB,MAAEA,EAAK+B,MAAEA,EAAK6kB,SAAEA,GAAa9kC,KAAK4kC,GAAGG,WAG3C,IAAIjG,EAAU,IACV6B,EAAU,IACVmE,EAAW,KACbhG,EAAqB,EAAXgG,EACVnE,EAAqB,EAAXmE,GAIZ9kC,KAAK6kC,OAAMnjC,OAAAsjC,OAAA,CAET/N,QAAS,KAETmF,MAAO,KAEP3H,OAAQ,aAERkM,UAEA7B,UAEAmE,QAAS,IAETE,QAAS,KAEN0B,GAIL,MAAM5jB,EAAI,IAAIpR,YAASyL,MACvB2F,EAAEpD,SAAS7d,KAAK6kC,QAChB5jB,EAAElB,qBAAoB,MAAS,KAG/B7B,EAAMxO,SAAS8O,IACbyC,EAAE1C,QAAQC,EAAK6N,GAAI,CACjB2D,MAAOxR,EAAKwR,OAAS,IACrBE,OAAQ1R,EAAK0R,QAAU,GACvB7D,GAAI7N,EAAK6N,IACT,IAIJpM,EAAMvQ,SAASkQ,IACbqB,EAAEtB,QAAQC,EAAKqlB,aAAcrlB,EAAKslB,aAAc,CAC9C7Y,GAAIzM,EAAKyM,IACT,IAIJ8Y,GAAMf,OAAOnjB,GAGb,MAAMmkB,EAAyB,GACzBC,EAAyB,GAG/BnnB,EAAMxO,SAAS8O,UACb,MAAM0D,EAAEA,EAAC2N,EAAEA,GAAM5O,EAAEzC,KAAKA,EAAK6N,IACvBiZ,EAAS9mB,EAAK+mB,UACpB,IAAKD,EACH,MAAM,IAAIrmB,MAAM,eAAeT,EAAK6N,UAItCiZ,EAAOpjB,EAAIA,EACXojB,EAAOzV,EAAIA,GAGK,QAAZ2V,EAAAF,aAAM,EAANA,EAAQG,YAAI,IAAAD,OAAA,EAAAA,EAAEtjB,KAChBojB,EAAOG,KAAKvjB,EAAIA,EAChBojB,EAAOG,KAAK5V,EAAIA,GAGlBuV,EAASpkC,KAAKskC,EAAO,IAIvBrlB,EAAMvQ,SAASkQ,IACb,MAAM8lB,EAAc9lB,EAAK2lB,UACzB,GAAKG,EAAL,CAIA,GAAKb,EAAOc,gBAKL,QAEED,EAAOE,kBACPF,EAAOG,kBACPH,EAAOI,gBACPJ,EAAOK,sBACPL,EAAOM,eAEd,MAAMC,EAAQjmC,KAAK4kC,GAAGsB,iBAAiBtmB,EAAKyM,IAM5C,GALI4Z,IAEFP,EAAOE,WAAa5lC,KAAKmmC,eAAeF,EAAOb,IAG7CM,EAAOE,WAAY,CAErB,MAAMQ,EAAQV,EAAOE,WAAW,GAC1B7a,EAAO2a,EAAOE,WAAWF,EAAOE,WAAW9lC,OAAS,GAC1D4lC,EAAOG,WAAa,CAAE3jB,EAAGkkB,EAAMlkB,EAAG2N,EAAGuW,EAAMvW,GAC3C6V,EAAOI,SAAW,CAAE5jB,EAAG6I,EAAK7I,EAAG2N,EAAG9E,EAAK8E,GAGnC6V,EAAOD,MAAQC,EAAOD,KAAKjmC,QAC7BkmC,EAAOD,KAAO,CACZvjB,EAAG6I,EAAK7I,EAA6C,EAAzCliB,KAAKqmC,eAAeX,EAAOD,KAAKjmC,OAAa,GACzDqwB,EAAG9E,EAAK8E,EACRrwB,MAAOkmC,EAAOD,KAAKjmC,OAGxB,MAAUkmC,EAAOD,MAAQC,EAAOD,KAAKjmC,QAEpCkmC,EAAOD,KAAOC,EAAOD,KAAKjmC,MAE7B,aApCQkmC,EAAOE,kBACPF,EAAOG,kBACPH,EAAOI,SAoChBT,EAASrkC,KAAK0kC,EA1Cb,CA0CoB,IAGvB1lC,KAAK4kC,GAAG0B,cAAc,CACpBpoB,MAAOknB,EACPnlB,MAAOolB,GAEV,CAOD,cAAAgB,CAAeE,GACb,IAAKA,EACH,OAAO,EAGT,IAAIC,EAAc,EAClB,IAAK,IAAI5jB,EAAI,EAAGA,EAAI2jB,EAAKzmC,OAAQ8iB,IAAK,CACpC,MAAM6jB,EAAIF,EAAKxxB,WAAW6N,GAEtB2jB,EAAKvxB,MAAM,SACbwxB,GAAe,IAIfA,GADQC,GAAK,GAAUA,GAAK,KAAYA,GAAK,OAAUA,GAAK,MAC7C,EAIA,CAElB,CAED,OAAOD,CACR,CAOD,WAAAE,CAAY9U,GACV,MAAM+U,EAAY,IAAI/U,GACtB,IAAIhP,EAAI,EAGR,KAAOA,EAAI+jB,EAAU7mC,OAAS,GAAG,CAC/B,MAAM8mC,EAAMD,EAAU/jB,EAAI,GACpBmF,EAAU4e,EAAU/jB,GACpBikB,EAAOF,EAAU/jB,EAAI,GAIxBgkB,EAAI1kB,IAAM6F,EAAQ7F,GAAK6F,EAAQ7F,IAAM2kB,EAAK3kB,GAC1C0kB,EAAI/W,IAAM9H,EAAQ8H,GAAK9H,EAAQ8H,IAAMgX,EAAKhX,EAG3C8W,EAAUtmC,OAAOuiB,EAAG,GAEpBA,GAEH,CAED,OAAO+jB,CACR,CAQD,cAAAR,CACEF,EACA/nB,GAEA,MAAM0nB,EAAsB,GAGtBkB,EAAkB9mC,KAAK4kC,GAAGmC,iBAAiBd,EAAMhB,cACjD+B,EAAkBhnC,KAAK4kC,GAAGmC,iBAAiBd,EAAMf,cACjD+B,EAAoB/oB,EAAMwM,MAC7BlM,GAAqBA,EAAK6N,KAAO4Z,EAAMhB,eAEpCiC,EAAoBhpB,EAAMwM,MAC7BlM,GAAqBA,EAAK6N,KAAO4Z,EAAMf,eAI1C,KACG4B,GACAE,GACAC,GACAC,GAED,OAIF,MAAMx8B,EAASoZ,OAAOmiB,EAAMv7B,SAAW,GAGvC,GAA4B,OAAxB1K,KAAK6kC,OAAO5N,SAAwC,kBAApBgP,EAAMkB,UAA+B,CAEvE,GAAIF,EAAkB/kB,EAAIglB,EAAkBhlB,EAsB1C,OApBA0jB,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EACjDH,EAAGoX,EAAkBpX,IAGvB+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EAAItlB,EACrDmlB,EAAGoX,EAAkBpX,IAGvB+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EAAItlB,EACrDmlB,EAAGqX,EAAkBrX,IAGvB+V,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EAAI8kB,EAAgBhX,MAAQ,EACjDH,EAAGqX,EAAkBrX,IAGhB7vB,KAAK0mC,YAAYd,GAI1B,GAAIqB,EAAkB/kB,EAAIglB,EAAkBhlB,EAwC1C,OAtCI+kB,EAAkBpX,GAAKqX,EAAkBrX,GAE3C+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,IAEpD0V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,EAAIxlB,IAExDk7B,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,EAAIxlB,IAExDk7B,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EACrB2N,EAAGqX,EAAkBrX,EAAImX,EAAgB9W,OAAS,MAIpD0V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,IAEpD0V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,EAAIxlB,IAExDk7B,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,EAAIxlB,IAExDk7B,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EACrB2N,EAAGqX,EAAkBrX,EAAImX,EAAgB9W,OAAS,KAI/ClwB,KAAK0mC,YAAYd,EAE3B,CAGD,GAA4B,OAAxB5lC,KAAK6kC,OAAO5N,SAAwC,kBAApBgP,EAAMkB,UAA+B,CAEvE,GAAIF,EAAkBpX,EAAIqX,EAAkBrX,EAsB1C,OApBA+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,IAGpD0V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,EAAIxlB,IAGxDk7B,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,EAAIxlB,IAGxDk7B,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EACrB2N,EAAGqX,EAAkBrX,EAAImX,EAAgB9W,OAAS,IAG7ClwB,KAAK0mC,YAAYd,GAI1B,GAAIqB,EAAkBpX,EAAIqX,EAAkBrX,EAuC1C,OAtCIoX,EAAkB/kB,GAAKglB,EAAkBhlB,GAE3C0jB,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EACjDH,EAAGoX,EAAkBpX,IAEvB+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EAAItlB,EACrDmlB,EAAGoX,EAAkBpX,IAEvB+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EAAItlB,EACrDmlB,EAAGqX,EAAkBrX,IAEvB+V,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EAAI8kB,EAAgBhX,MAAQ,EACjDH,EAAGqX,EAAkBrX,MAIvB+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EACjDH,EAAGoX,EAAkBpX,IAEvB+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EAAItlB,EACrDmlB,EAAGoX,EAAkBpX,IAEvB+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EAAItlB,EACrDmlB,EAAGqX,EAAkBrX,IAEvB+V,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EAAI8kB,EAAgBhX,MAAQ,EACjDH,EAAGqX,EAAkBrX,KAIlB7vB,KAAK0mC,YAAYd,EAE3B,CAIF,EA9YMlB,GAAU0C,WAAG","x_google_ignoreList":[0,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,43,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,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273,274,275,276,277,278,279,280,281,282,283,284,285,286,287,288,289]}
1	+ {"version":3,"file":"index.min.js","sources":["../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/eq.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_assocIndexOf.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_ListCache.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheClear.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheDelete.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheGet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheHas.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_freeGlobal.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_root.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Symbol.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseGetTag.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getRawTag.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_objectToString.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isObject.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isFunction.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isMasked.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_coreJsData.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_toSource.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getNative.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsNative.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getValue.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Map.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nativeCreate.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Hash.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashClear.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashDelete.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashGet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashHas.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getMapData.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isKeyable.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_MapCache.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheClear.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheDelete.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheGet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheHas.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Stack.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackClear.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackDelete.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackGet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackHas.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayEach.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_defineProperty.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseAssignValue.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_assignValue.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copyObject.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isObjectLike.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isArguments.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsArguments.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isBuffer.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/stubFalse.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isIndex.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isLength.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseUnary.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nodeUtil.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isTypedArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsTypedArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayLikeKeys.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseTimes.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isPrototype.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_overArg.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseKeys.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nativeKeys.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isArrayLike.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/keys.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseKeysIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nativeKeysIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/keysIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneBuffer.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copyArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayFilter.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/stubArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getSymbols.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayPush.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getPrototype.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getSymbolsIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseGetAllKeys.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getAllKeys.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Set.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getTag.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_DataView.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Promise.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_WeakMap.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Uint8Array.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneArrayBuffer.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneTypedArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_initCloneByTag.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneDataView.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneRegExp.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneSymbol.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseCreate.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_initCloneObject.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isMap.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsMap.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseClone.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseAssign.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseAssignIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copySymbols.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copySymbolsIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getAllKeysIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_initCloneArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/clone.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/constant.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/graphlib.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseFor.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createBaseFor.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseForOwn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseEach.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createBaseEach.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/identity.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_castFunction.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/forEach.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/each.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_SetCache.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_setCacheAdd.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_setCacheHas.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cacheHas.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_equalArrays.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arraySome.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_setToArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_equalByTag.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapToArray.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsEqualDeep.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_equalObjects.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsEqual.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isStrictComparable.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_matchesStrictComparable.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseMatches.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsMatch.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getMatchData.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isSymbol.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isKey.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_memoizeCapped.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/memoize.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayMap.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/toString.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseToString.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_castPath.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stringToPath.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_toKey.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseGet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hasPath.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/hasIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseHasIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseMatchesProperty.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/get.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseProperty.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/property.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_basePropertyDeep.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIteratee.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/filter.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseFilter.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/has.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseHas.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isEmpty.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isUndefined.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseMap.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/map.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/reduce.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayReduce.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseReduce.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stringSize.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_asciiSize.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hasUnicode.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_unicodeSize.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/size.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isString.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/transform.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseFlatten.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isFlattenable.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_overRest.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_apply.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_setToString.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseSetToString.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_shortOut.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseRest.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseFindIndex.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIndexOf.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsNaN.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_strictIndexOf.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/noop.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseUniq.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayIncludes.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayIncludesWith.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isArrayLikeObject.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/union.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/values.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseValues.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/lodash.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/graph.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/index.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/version.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/json.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/components.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/data/priority-queue.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/dijkstra.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/dijkstra-all.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/tarjan.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/find-cycles.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/floyd-warshall.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/topsort.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/is-acyclic.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/dfs.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/postorder.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/preorder.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/prim.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/index.js","../../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/index.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/lodash.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isIterateeCall.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseTrim.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_trimmedEndIndex.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/toFinite.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/toNumber.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/findIndex.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/toInteger.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/flatten.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseExtremum.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_assignMergeValue.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_safeGet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseMergeDeep.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isPlainObject.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/toPlainObject.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseLt.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_basePickBy.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseSet.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createRange.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseRange.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_compareMultiple.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_compareAscending.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseOrderBy.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseSortBy.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/cloneDeep.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/defaults.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/find.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createFind.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/forIn.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/last.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/mapValues.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/max.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseGt.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/merge.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseMerge.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createAssigner.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/min.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/minBy.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/now.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/pick.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_basePick.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_flatRest.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/range.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/sortBy.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/uniqueId.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/zipObject.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseZipObject.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/data/list.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/greedy-fas.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/acyclic.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/util.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/normalize.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/util.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/feasible-tree.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/network-simplex.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/index.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/parent-dummy-chains.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/nesting-graph.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/add-border-segments.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/coordinate-system.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/init-order.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/cross-count.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/barycenter.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/resolve-conflicts.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/sort.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/sort-subgraph.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/build-layer-graph.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/add-subgraph-constraints.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/index.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/position/bk.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/position/index.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/layout.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/debug.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/version.js","../../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/index.js","../src/dagre.ts"],"sourcesContent":["/*\n Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n \n @static\n * @memberOf _\n * @since 4.0.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 _.eq(object, object);\n * // => true\n \n _.eq(object, other);\n * // => false\n \n _.eq('a', 'a');\n * // => true\n \n _.eq('a', Object('a'));\n * // => false\n \n _.eq(NaN, NaN);\n * // => true\n /\nfunction eq(value, other) {\n return value === other \|\| (value !== value && other !== other);\n}\n\nmodule.exports = eq;\n","var eq = require('./eq');\n\n/\n Gets the index at which the `key` is found in `array` of key-value pairs.\n \n @private\n * @param {Array} array The array to inspect.\n * @param {} key The key to search for.\n @returns {number} Returns the index of the matched value, else `-1`.\n /\nfunction assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n}\n\nmodule.exports = assocIndexOf;\n","var listCacheClear = require('./_listCacheClear'),\n listCacheDelete = require('./_listCacheDelete'),\n listCacheGet = require('./_listCacheGet'),\n listCacheHas = require('./_listCacheHas'),\n listCacheSet = require('./_listCacheSet');\n\n/\n Creates an list cache object.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction ListCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nmodule.exports = ListCache;\n","/\n Removes all key-value entries from the list cache.\n \n @private\n * @name clear\n * @memberOf ListCache\n /\nfunction listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n}\n\nmodule.exports = listCacheClear;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/* Used for built-in method references. /\nvar arrayProto = Array.prototype;\n\n/* Built-in value references. /\nvar splice = arrayProto.splice;\n\n/\n Removes `key` and its value from the list cache.\n \n @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n --this.size;\n return true;\n}\n\nmodule.exports = listCacheDelete;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/\n Gets the list cache value for `key`.\n \n @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n}\n\nmodule.exports = listCacheGet;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/*\n Checks if a list cache value for `key` exists.\n \n @private\n * @name has\n * @memberOf ListCache\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 listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n}\n\nmodule.exports = listCacheHas;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/\n Sets the list cache `key` to `value`.\n \n @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the list cache instance.\n /\nfunction listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n ++this.size;\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n}\n\nmodule.exports = listCacheSet;\n","/* Detect free variable `global` from Node.js. /\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nmodule.exports = freeGlobal;\n","var freeGlobal = require('./_freeGlobal');\n\n/* Detect free variable `self`. /\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/* Used as a reference to the global object. /\nvar root = freeGlobal \|\| freeSelf \|\| Function('return this')();\n\nmodule.exports = root;\n","var root = require('./_root');\n\n/* Built-in value references. /\nvar Symbol = root.Symbol;\n\nmodule.exports = Symbol;\n","var Symbol = require('./_Symbol'),\n getRawTag = require('./_getRawTag'),\n objectToString = require('./_objectToString');\n\n/* `Object#toString` result references. /\nvar nullTag = '[object Null]',\n undefinedTag = '[object Undefined]';\n\n/* Built-in value references. /\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/\n The base implementation of `getTag` without fallbacks for buggy environments.\n \n @private\n * @param {} value The value to query.\n @returns {string} Returns the `toStringTag`.\n /\nfunction baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n}\n\nmodule.exports = baseGetTag;\n","var Symbol = require('./_Symbol');\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 Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n /\nvar nativeObjectToString = objectProto.toString;\n\n/* Built-in value references. /\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/\n A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n \n @private\n * @param {} value The value to query.\n @returns {string} Returns the raw `toStringTag`.\n /\nfunction getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag),\n tag = value[symToStringTag];\n\n try {\n value[symToStringTag] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag] = tag;\n } else {\n delete value[symToStringTag];\n }\n }\n return result;\n}\n\nmodule.exports = getRawTag;\n","/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/\n Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n /\nvar nativeObjectToString = objectProto.toString;\n\n/\n Converts `value` to a string using `Object.prototype.toString`.\n \n @private\n * @param {} value The value to convert.\n @returns {string} Returns the converted string.\n /\nfunction objectToString(value) {\n return nativeObjectToString.call(value);\n}\n\nmodule.exports = objectToString;\n","/\n Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\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 an object, else `false`.\n * @example\n \n _.isObject({});\n * // => true\n \n _.isObject([1, 2, 3]);\n * // => true\n \n _.isObject(_.noop);\n * // => true\n \n _.isObject(null);\n * // => false\n /\nfunction isObject(value) {\n var type = typeof value;\n return value != null && (type == 'object' \|\| type == 'function');\n}\n\nmodule.exports = isObject;\n","var baseGetTag = require('./_baseGetTag'),\n isObject = require('./isObject');\n\n/* `Object#toString` result references. /\nvar asyncTag = '[object AsyncFunction]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n proxyTag = '[object Proxy]';\n\n/\n Checks if `value` is classified as a `Function` object.\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 a function, else `false`.\n * @example\n \n _.isFunction(_);\n * // => true\n \n _.isFunction(/abc/);\n * // => false\n /\nfunction isFunction(value) {\n if (!isObject(value)) {\n return false;\n }\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 9 which returns 'object' for typed arrays and other constructors.\n var tag = baseGetTag(value);\n return tag == funcTag \|\| tag == genTag \|\| tag == asyncTag \|\| tag == proxyTag;\n}\n\nmodule.exports = isFunction;\n","var coreJsData = require('./_coreJsData');\n\n/* Used to detect methods masquerading as native. /\nvar maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO \|\| '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/\n Checks if `func` has its source masked.\n \n @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n /\nfunction isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n}\n\nmodule.exports = isMasked;\n","var root = require('./_root');\n\n/* Used to detect overreaching core-js shims. /\nvar coreJsData = root['__core-js_shared__'];\n\nmodule.exports = coreJsData;\n","/* Used for built-in method references. /\nvar funcProto = Function.prototype;\n\n/* Used to resolve the decompiled source of functions. /\nvar funcToString = funcProto.toString;\n\n/\n Converts `func` to its source code.\n \n @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n /\nfunction toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n}\n\nmodule.exports = toSource;\n","var baseIsNative = require('./_baseIsNative'),\n getValue = require('./_getValue');\n\n/\n Gets the native function at `key` of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {} Returns the function if it's native, else `undefined`.\n /\nfunction getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n}\n\nmodule.exports = getNative;\n","var isFunction = require('./isFunction'),\n isMasked = require('./_isMasked'),\n isObject = require('./isObject'),\n toSource = require('./_toSource');\n\n/*\n Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n /\nvar reRegExpChar = /[\\\\^$.+?()[\\]{}\|]/g;\n\n/** Used to detect host constructors (Safari). /\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\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 detect if a method is native. /\nvar reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty\|(function).?(?=\\\\\\()\| for .+?(?=\\\\\\])/g, '$1.?') + '$'\n);\n\n/\n The base implementation of `_.isNative` without bad shim checks.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n /\nfunction baseIsNative(value) {\n if (!isObject(value) \|\| isMasked(value)) {\n return false;\n }\n var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n}\n\nmodule.exports = baseIsNative;\n","/\n Gets the value at `key` of `object`.\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 getValue(object, key) {\n return object == null ? undefined : object[key];\n}\n\nmodule.exports = getValue;\n","var getNative = require('./_getNative'),\n root = require('./_root');\n\n/* Built-in method references that are verified to be native. /\nvar Map = getNative(root, 'Map');\n\nmodule.exports = Map;\n","var getNative = require('./_getNative');\n\n/ Built-in method references that are verified to be native. /\nvar nativeCreate = getNative(Object, 'create');\n\nmodule.exports = nativeCreate;\n","var hashClear = require('./_hashClear'),\n hashDelete = require('./_hashDelete'),\n hashGet = require('./_hashGet'),\n hashHas = require('./_hashHas'),\n hashSet = require('./_hashSet');\n\n/\n Creates a hash object.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction Hash(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nmodule.exports = Hash;\n","var nativeCreate = require('./_nativeCreate');\n\n/\n Removes all key-value entries from the hash.\n \n @private\n * @name clear\n * @memberOf Hash\n /\nfunction hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n}\n\nmodule.exports = hashClear;\n","/\n Removes `key` and its value from the hash.\n \n @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n}\n\nmodule.exports = hashDelete;\n","var nativeCreate = require('./_nativeCreate');\n\n/* Used to stand-in for `undefined` hash values. /\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\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 Gets the hash value for `key`.\n \n @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nmodule.exports = hashGet;\n","var nativeCreate = require('./_nativeCreate');\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 a hash value for `key` exists.\n \n @private\n * @name has\n * @memberOf Hash\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 hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nmodule.exports = hashHas;\n","var nativeCreate = require('./_nativeCreate');\n\n/* Used to stand-in for `undefined` hash values. /\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/\n Sets the hash `key` to `value`.\n \n @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the hash instance.\n /\nfunction hashSet(key, value) {\n var data = this.__data__;\n this.size += this.has(key) ? 0 : 1;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n}\n\nmodule.exports = hashSet;\n","var isKeyable = require('./_isKeyable');\n\n/\n Gets the data for `map`.\n \n @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {} Returns the map data.\n /\nfunction getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n}\n\nmodule.exports = getMapData;\n","/*\n Checks if `value` is suitable for use as unique object key.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n /\nfunction isKeyable(value) {\n var type = typeof value;\n return (type == 'string' \|\| type == 'number' \|\| type == 'symbol' \|\| type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n}\n\nmodule.exports = isKeyable;\n","var mapCacheClear = require('./_mapCacheClear'),\n mapCacheDelete = require('./_mapCacheDelete'),\n mapCacheGet = require('./_mapCacheGet'),\n mapCacheHas = require('./_mapCacheHas'),\n mapCacheSet = require('./_mapCacheSet');\n\n/\n Creates a map cache object to store key-value pairs.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction MapCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nmodule.exports = MapCache;\n","var Hash = require('./_Hash'),\n ListCache = require('./_ListCache'),\n Map = require('./_Map');\n\n/\n Removes all key-value entries from the map.\n \n @private\n * @name clear\n * @memberOf MapCache\n /\nfunction mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map \|\| ListCache),\n 'string': new Hash\n };\n}\n\nmodule.exports = mapCacheClear;\n","var getMapData = require('./_getMapData');\n\n/\n Removes `key` and its value from the map.\n \n @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n}\n\nmodule.exports = mapCacheDelete;\n","var getMapData = require('./_getMapData');\n\n/\n Gets the map value for `key`.\n \n @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction mapCacheGet(key) {\n return getMapData(this, key).get(key);\n}\n\nmodule.exports = mapCacheGet;\n","var getMapData = require('./_getMapData');\n\n/*\n Checks if a map value for `key` exists.\n \n @private\n * @name has\n * @memberOf MapCache\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 mapCacheHas(key) {\n return getMapData(this, key).has(key);\n}\n\nmodule.exports = mapCacheHas;\n","var getMapData = require('./_getMapData');\n\n/\n Sets the map `key` to `value`.\n \n @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the map cache instance.\n /\nfunction mapCacheSet(key, value) {\n var data = getMapData(this, key),\n size = data.size;\n\n data.set(key, value);\n this.size += data.size == size ? 0 : 1;\n return this;\n}\n\nmodule.exports = mapCacheSet;\n","var ListCache = require('./_ListCache'),\n stackClear = require('./_stackClear'),\n stackDelete = require('./_stackDelete'),\n stackGet = require('./_stackGet'),\n stackHas = require('./_stackHas'),\n stackSet = require('./_stackSet');\n\n/\n Creates a stack cache object to store key-value pairs.\n \n @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n /\nfunction Stack(entries) {\n var data = this.__data__ = new ListCache(entries);\n this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nmodule.exports = Stack;\n","var ListCache = require('./_ListCache');\n\n/\n Removes all key-value entries from the stack.\n \n @private\n * @name clear\n * @memberOf Stack\n /\nfunction stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n}\n\nmodule.exports = stackClear;\n","/\n Removes `key` and its value from the stack.\n \n @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n /\nfunction stackDelete(key) {\n var data = this.__data__,\n result = data['delete'](key);\n\n this.size = data.size;\n return result;\n}\n\nmodule.exports = stackDelete;\n","/\n Gets the stack value for `key`.\n \n @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {} Returns the entry value.\n /\nfunction stackGet(key) {\n return this.__data__.get(key);\n}\n\nmodule.exports = stackGet;\n","/*\n Checks if a stack value for `key` exists.\n \n @private\n * @name has\n * @memberOf Stack\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 stackHas(key) {\n return this.__data__.has(key);\n}\n\nmodule.exports = stackHas;\n","var ListCache = require('./_ListCache'),\n Map = require('./_Map'),\n MapCache = require('./_MapCache');\n\n/* Used as the size to enable large array optimizations. /\nvar LARGE_ARRAY_SIZE = 200;\n\n/\n Sets the stack `key` to `value`.\n \n @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {} value The value to set.\n @returns {Object} Returns the stack cache instance.\n /\nfunction stackSet(key, value) {\n var data = this.__data__;\n if (data instanceof ListCache) {\n var pairs = data.__data__;\n if (!Map \|\| (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n pairs.push([key, value]);\n this.size = ++data.size;\n return this;\n }\n data = this.__data__ = new MapCache(pairs);\n }\n data.set(key, value);\n this.size = data.size;\n return this;\n}\n\nmodule.exports = stackSet;\n","/\n A specialized version of `_.forEach` 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 * @returns {Array} Returns `array`.\n /\nfunction arrayEach(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n}\n\nmodule.exports = arrayEach;\n","var getNative = require('./_getNative');\n\nvar defineProperty = (function() {\n try {\n var func = getNative(Object, 'defineProperty');\n func({}, '', {});\n return func;\n } catch (e) {}\n}());\n\nmodule.exports = defineProperty;\n","var defineProperty = require('./_defineProperty');\n\n/\n The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\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 baseAssignValue(object, key, value) {\n if (key == '__proto__' && defineProperty) {\n defineProperty(object, key, {\n 'configurable': true,\n 'enumerable': true,\n 'value': value,\n 'writable': true\n });\n } else {\n object[key] = value;\n }\n}\n\nmodule.exports = baseAssignValue;\n","var baseAssignValue = require('./_baseAssignValue'),\n eq = require('./eq');\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 `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\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 assignValue(object, key, value) {\n var objValue = object[key];\n if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) \|\|\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n}\n\nmodule.exports = assignValue;\n","var assignValue = require('./_assignValue'),\n baseAssignValue = require('./_baseAssignValue');\n\n/*\n Copies properties of `source` to `object`.\n \n @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n /\nfunction copyObject(source, props, object, customizer) {\n var isNew = !object;\n object \|\| (object = {});\n\n var index = -1,\n length = props.length;\n\n while (++index < length) {\n var key = props[index];\n\n var newValue = customizer\n ? customizer(object[key], source[key], key, object, source)\n : undefined;\n\n if (newValue === undefined) {\n newValue = source[key];\n }\n if (isNew) {\n baseAssignValue(object, key, newValue);\n } else {\n assignValue(object, key, newValue);\n }\n }\n return object;\n}\n\nmodule.exports = copyObject;\n","/\n Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"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 object-like, else `false`.\n * @example\n \n _.isObjectLike({});\n * // => true\n \n _.isObjectLike([1, 2, 3]);\n * // => true\n \n _.isObjectLike(_.noop);\n * // => false\n \n _.isObjectLike(null);\n * // => false\n /\nfunction isObjectLike(value) {\n return value != null && typeof value == 'object';\n}\n\nmodule.exports = isObjectLike;\n","var baseIsArguments = require('./_baseIsArguments'),\n isObjectLike = require('./isObjectLike');\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/* Built-in value references. /\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/\n Checks if `value` is likely an `arguments` object.\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 an `arguments` object,\n * else `false`.\n * @example\n \n _.isArguments(function() { return arguments; }());\n * // => true\n \n _.isArguments([1, 2, 3]);\n * // => false\n /\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n !propertyIsEnumerable.call(value, 'callee');\n};\n\nmodule.exports = isArguments;\n","var baseGetTag = require('./_baseGetTag'),\n isObjectLike = require('./isObjectLike');\n\n/* `Object#toString` result references. /\nvar argsTag = '[object Arguments]';\n\n/\n The base implementation of `_.isArguments`.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is an `arguments` object,\n /\nfunction baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nmodule.exports = baseIsArguments;\n","/\n Checks if `value` is classified as an `Array` object.\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 an array, else `false`.\n * @example\n \n _.isArray([1, 2, 3]);\n * // => true\n \n _.isArray(document.body.children);\n * // => false\n \n _.isArray('abc');\n * // => false\n \n _.isArray(_.noop);\n * // => false\n /\nvar isArray = Array.isArray;\n\nmodule.exports = isArray;\n","var root = require('./_root'),\n stubFalse = require('./stubFalse');\n\n/* Detect free variable `exports`. /\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/* Detect free variable `module`. /\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/* Detect the popular CommonJS extension `module.exports`. /\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/* Built-in value references. /\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/\n Checks if `value` is a buffer.\n \n @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n \n _.isBuffer(new Buffer(2));\n * // => true\n \n _.isBuffer(new Uint8Array(2));\n * // => false\n /\nvar isBuffer = nativeIsBuffer \|\| stubFalse;\n\nmodule.exports = isBuffer;\n","/\n This method returns `false`.\n \n @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n \n _.times(2, _.stubFalse);\n * // => [false, false]\n /\nfunction stubFalse() {\n return false;\n}\n\nmodule.exports = stubFalse;\n","/* Used as references for various `Number` constants. /\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/* Used to detect unsigned integer values. /\nvar reIsUint = /^(?:0\|[1-9]\\d)$/;\n\n/*\n Checks if `value` is a valid array-like index.\n \n @private\n * @param {} value The value to check.\n @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n /\nfunction isIndex(value, length) {\n var type = typeof value;\n length = length == null ? MAX_SAFE_INTEGER : length;\n\n return !!length &&\n (type == 'number' \|\|\n (type != 'symbol' && reIsUint.test(value))) &&\n (value > -1 && value % 1 == 0 && value < length);\n}\n\nmodule.exports = isIndex;\n","/* Used as references for various `Number` constants. /\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/\n Checks if `value` is a valid array-like length.\n \n Note: This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\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 valid length, else `false`.\n * @example\n \n _.isLength(3);\n * // => true\n \n _.isLength(Number.MIN_VALUE);\n * // => false\n \n _.isLength(Infinity);\n * // => false\n \n _.isLength('3');\n * // => false\n /\nfunction isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nmodule.exports = isLength;\n","/\n The base implementation of `_.unary` without support for storing metadata.\n \n @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n /\nfunction baseUnary(func) {\n return function(value) {\n return func(value);\n };\n}\n\nmodule.exports = baseUnary;\n","var freeGlobal = require('./_freeGlobal');\n\n/* Detect free variable `exports`. /\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/* Detect free variable `module`. /\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/* Detect the popular CommonJS extension `module.exports`. /\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/* Detect free variable `process` from Node.js. /\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/* Used to access faster Node.js helpers. /\nvar nodeUtil = (function() {\n try {\n // Use `util.types` for Node.js 10+.\n var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n if (types) {\n return types;\n }\n\n // Legacy `process.binding('util')` for Node.js < 10.\n return freeProcess && freeProcess.binding && freeProcess.binding('util');\n } catch (e) {}\n}());\n\nmodule.exports = nodeUtil;\n","var baseIsTypedArray = require('./_baseIsTypedArray'),\n baseUnary = require('./_baseUnary'),\n nodeUtil = require('./_nodeUtil');\n\n/ Node.js helper references. /\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/\n Checks if `value` is classified as a typed array.\n \n @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n \n _.isTypedArray(new Uint8Array);\n * // => true\n \n _.isTypedArray([]);\n * // => false\n /\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nmodule.exports = isTypedArray;\n","var baseGetTag = require('./_baseGetTag'),\n isLength = require('./isLength'),\n isObjectLike = require('./isObjectLike');\n\n/* `Object#toString` result references. /\nvar argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n objectTag = '[object Object]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n/* Used to identify `toStringTag` values of typed arrays. /\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/\n The base implementation of `_.isTypedArray` without Node.js optimizations.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n /\nfunction baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nmodule.exports = baseIsTypedArray;\n","var baseTimes = require('./_baseTimes'),\n isArguments = require('./isArguments'),\n isArray = require('./isArray'),\n isBuffer = require('./isBuffer'),\n isIndex = require('./_isIndex'),\n isTypedArray = require('./isTypedArray');\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 Creates an array of the enumerable property names of the array-like `value`.\n \n @private\n * @param {} value The value to query.\n @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n /\nfunction arrayLikeKeys(value, inherited) {\n var isArr = isArray(value),\n isArg = !isArr && isArguments(value),\n isBuff = !isArr && !isArg && isBuffer(value),\n isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n skipIndexes = isArr \|\| isArg \|\| isBuff \|\| isType,\n result = skipIndexes ? baseTimes(value.length, String) : [],\n length = result.length;\n\n for (var key in value) {\n if ((inherited \|\| hasOwnProperty.call(value, key)) &&\n !(skipIndexes && (\n // Safari 9 has enumerable `arguments.length` in strict mode.\n key == 'length' \|\|\n // Node.js 0.10 has enumerable non-index properties on buffers.\n (isBuff && (key == 'offset' \|\| key == 'parent')) \|\|\n // PhantomJS 2 has enumerable non-index properties on typed arrays.\n (isType && (key == 'buffer' \|\| key == 'byteLength' \|\| key == 'byteOffset')) \|\|\n // Skip index properties.\n isIndex(key, length)\n ))) {\n result.push(key);\n }\n }\n return result;\n}\n\nmodule.exports = arrayLikeKeys;\n","/\n The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n \n @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n /\nfunction baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n}\n\nmodule.exports = baseTimes;\n","/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/\n Checks if `value` is likely a prototype object.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n /\nfunction isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) \|\| objectProto;\n\n return value === proto;\n}\n\nmodule.exports = isPrototype;\n","/\n Creates a unary function that invokes `func` with its argument transformed.\n \n @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n /\nfunction overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n}\n\nmodule.exports = overArg;\n","var isPrototype = require('./_isPrototype'),\n nativeKeys = require('./_nativeKeys');\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 The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n /\nfunction baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n}\n\nmodule.exports = baseKeys;\n","var overArg = require('./_overArg');\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeKeys = overArg(Object.keys, Object);\n\nmodule.exports = nativeKeys;\n","var isFunction = require('./isFunction'),\n isLength = require('./isLength');\n\n/\n Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\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 array-like, else `false`.\n * @example\n \n _.isArrayLike([1, 2, 3]);\n * // => true\n \n _.isArrayLike(document.body.children);\n * // => true\n \n _.isArrayLike('abc');\n * // => true\n \n _.isArrayLike(_.noop);\n * // => false\n /\nfunction isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n}\n\nmodule.exports = isArrayLike;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n baseKeys = require('./_baseKeys'),\n isArrayLike = require('./isArrayLike');\n\n/\n Creates an array of the own enumerable property names of `object`.\n \n Note: Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\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 names.\n * @example\n \n function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n \n Foo.prototype.c = 3;\n \n _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n \n _.keys('hi');\n * // => ['0', '1']\n /\nfunction keys(object) {\n return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nmodule.exports = keys;\n","var isObject = require('./isObject'),\n isPrototype = require('./_isPrototype'),\n nativeKeysIn = require('./_nativeKeysIn');\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 The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n /\nfunction baseKeysIn(object) {\n if (!isObject(object)) {\n return nativeKeysIn(object);\n }\n var isProto = isPrototype(object),\n result = [];\n\n for (var key in object) {\n if (!(key == 'constructor' && (isProto \|\| !hasOwnProperty.call(object, key)))) {\n result.push(key);\n }\n }\n return result;\n}\n\nmodule.exports = baseKeysIn;\n","/\n This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n /\nfunction nativeKeysIn(object) {\n var result = [];\n if (object != null) {\n for (var key in Object(object)) {\n result.push(key);\n }\n }\n return result;\n}\n\nmodule.exports = nativeKeysIn;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n baseKeysIn = require('./_baseKeysIn'),\n isArrayLike = require('./isArrayLike');\n\n/\n Creates an array of the own and inherited enumerable property names of `object`.\n \n Note: Non-object values are coerced to objects.\n \n @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n \n function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n \n Foo.prototype.c = 3;\n \n _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n /\nfunction keysIn(object) {\n return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n}\n\nmodule.exports = keysIn;\n","var root = require('./_root');\n\n/* Detect free variable `exports`. /\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/* Detect free variable `module`. /\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/* Detect the popular CommonJS extension `module.exports`. /\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/* Built-in value references. /\nvar Buffer = moduleExports ? root.Buffer : undefined,\n allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined;\n\n/\n Creates a clone of `buffer`.\n \n @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n /\nfunction cloneBuffer(buffer, isDeep) {\n if (isDeep) {\n return buffer.slice();\n }\n var length = buffer.length,\n result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n buffer.copy(result);\n return result;\n}\n\nmodule.exports = cloneBuffer;\n","/\n Copies the values of `source` to `array`.\n \n @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n /\nfunction copyArray(source, array) {\n var index = -1,\n length = source.length;\n\n array \|\| (array = Array(length));\n while (++index < length) {\n array[index] = source[index];\n }\n return array;\n}\n\nmodule.exports = copyArray;\n","/\n A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n \n @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n /\nfunction arrayFilter(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result[resIndex++] = value;\n }\n }\n return result;\n}\n\nmodule.exports = arrayFilter;\n","/\n This method returns a new empty array.\n \n @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n \n var arrays = _.times(2, _.stubArray);\n \n console.log(arrays);\n * // => [[], []]\n \n console.log(arrays[0] === arrays[1]);\n * // => false\n /\nfunction stubArray() {\n return [];\n}\n\nmodule.exports = stubArray;\n","var arrayFilter = require('./_arrayFilter'),\n stubArray = require('./stubArray');\n\n/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Built-in value references. /\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/\n Creates an array of the own enumerable symbols of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n /\nvar getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n if (object == null) {\n return [];\n }\n object = Object(object);\n return arrayFilter(nativeGetSymbols(object), function(symbol) {\n return propertyIsEnumerable.call(object, symbol);\n });\n};\n\nmodule.exports = getSymbols;\n","/\n Appends the elements of `values` to `array`.\n \n @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n /\nfunction arrayPush(array, values) {\n var index = -1,\n length = values.length,\n offset = array.length;\n\n while (++index < length) {\n array[offset + index] = values[index];\n }\n return array;\n}\n\nmodule.exports = arrayPush;\n","var overArg = require('./_overArg');\n\n/* Built-in value references. /\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\nmodule.exports = getPrototype;\n","var arrayPush = require('./_arrayPush'),\n getPrototype = require('./_getPrototype'),\n getSymbols = require('./_getSymbols'),\n stubArray = require('./stubArray');\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/\n Creates an array of the own and inherited enumerable symbols of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n /\nvar getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n var result = [];\n while (object) {\n arrayPush(result, getSymbols(object));\n object = getPrototype(object);\n }\n return result;\n};\n\nmodule.exports = getSymbolsIn;\n","var arrayPush = require('./_arrayPush'),\n isArray = require('./isArray');\n\n/\n The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n /\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\nmodule.exports = baseGetAllKeys;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n getSymbols = require('./_getSymbols'),\n keys = require('./keys');\n\n/\n Creates an array of own enumerable property names and symbols of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n /\nfunction getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n}\n\nmodule.exports = getAllKeys;\n","var getNative = require('./_getNative'),\n root = require('./_root');\n\n/ Built-in method references that are verified to be native. /\nvar Set = getNative(root, 'Set');\n\nmodule.exports = Set;\n","var DataView = require('./_DataView'),\n Map = require('./_Map'),\n Promise = require('./_Promise'),\n Set = require('./_Set'),\n WeakMap = require('./_WeakMap'),\n baseGetTag = require('./_baseGetTag'),\n toSource = require('./_toSource');\n\n/* `Object#toString` result references. /\nvar mapTag = '[object Map]',\n objectTag = '[object Object]',\n promiseTag = '[object Promise]',\n setTag = '[object Set]',\n weakMapTag = '[object WeakMap]';\n\nvar dataViewTag = '[object DataView]';\n\n/* Used to detect maps, sets, and weakmaps. /\nvar dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\n\n/\n Gets the `toStringTag` of `value`.\n \n @private\n * @param {} value The value to query.\n @returns {string} Returns the `toStringTag`.\n /\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) \|\|\n (Map && getTag(new Map) != mapTag) \|\|\n (Promise && getTag(Promise.resolve()) != promiseTag) \|\|\n (Set && getTag(new Set) != setTag) \|\|\n (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n getTag = function(value) {\n var result = baseGetTag(value),\n Ctor = result == objectTag ? value.constructor : undefined,\n ctorString = Ctor ? toSource(Ctor) : '';\n\n if (ctorString) {\n switch (ctorString) {\n case dataViewCtorString: return dataViewTag;\n case mapCtorString: return mapTag;\n case promiseCtorString: return promiseTag;\n case setCtorString: return setTag;\n case weakMapCtorString: return weakMapTag;\n }\n }\n return result;\n };\n}\n\nmodule.exports = getTag;\n","var getNative = require('./_getNative'),\n root = require('./_root');\n\n/ Built-in method references that are verified to be native. /\nvar DataView = getNative(root, 'DataView');\n\nmodule.exports = DataView;\n","var getNative = require('./_getNative'),\n root = require('./_root');\n\n/ Built-in method references that are verified to be native. /\nvar Promise = getNative(root, 'Promise');\n\nmodule.exports = Promise;\n","var getNative = require('./_getNative'),\n root = require('./_root');\n\n/ Built-in method references that are verified to be native. /\nvar WeakMap = getNative(root, 'WeakMap');\n\nmodule.exports = WeakMap;\n","var root = require('./_root');\n\n/* Built-in value references. /\nvar Uint8Array = root.Uint8Array;\n\nmodule.exports = Uint8Array;\n","var Uint8Array = require('./_Uint8Array');\n\n/\n Creates a clone of `arrayBuffer`.\n \n @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n /\nfunction cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n}\n\nmodule.exports = cloneArrayBuffer;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer');\n\n/\n Creates a clone of `typedArray`.\n \n @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n /\nfunction cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\nmodule.exports = cloneTypedArray;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer'),\n cloneDataView = require('./_cloneDataView'),\n cloneRegExp = require('./_cloneRegExp'),\n cloneSymbol = require('./_cloneSymbol'),\n cloneTypedArray = require('./_cloneTypedArray');\n\n/* `Object#toString` result references. /\nvar boolTag = '[object Boolean]',\n dateTag = '[object Date]',\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 float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n/\n Initializes an object clone based on its `toStringTag`.\n \n Note: This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n \n @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n /\nfunction initCloneByTag(object, tag, isDeep) {\n var Ctor = object.constructor;\n switch (tag) {\n case arrayBufferTag:\n return cloneArrayBuffer(object);\n\n case boolTag:\n case dateTag:\n return new Ctor(+object);\n\n case dataViewTag:\n return cloneDataView(object, isDeep);\n\n case float32Tag: case float64Tag:\n case int8Tag: case int16Tag: case int32Tag:\n case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n return cloneTypedArray(object, isDeep);\n\n case mapTag:\n return new Ctor;\n\n case numberTag:\n case stringTag:\n return new Ctor(object);\n\n case regexpTag:\n return cloneRegExp(object);\n\n case setTag:\n return new Ctor;\n\n case symbolTag:\n return cloneSymbol(object);\n }\n}\n\nmodule.exports = initCloneByTag;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer');\n\n/\n Creates a clone of `dataView`.\n \n @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n /\nfunction cloneDataView(dataView, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n}\n\nmodule.exports = cloneDataView;\n","/* Used to match `RegExp` flags from their coerced string values. /\nvar reFlags = /\\w$/;\n\n/*\n Creates a clone of `regexp`.\n \n @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n /\nfunction cloneRegExp(regexp) {\n var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n result.lastIndex = regexp.lastIndex;\n return result;\n}\n\nmodule.exports = cloneRegExp;\n","var Symbol = require('./_Symbol');\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 Creates a clone of the `symbol` object.\n \n @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n /\nfunction cloneSymbol(symbol) {\n return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n}\n\nmodule.exports = cloneSymbol;\n","var isObject = require('./isObject');\n\n/* Built-in value references. /\nvar objectCreate = Object.create;\n\n/\n The base implementation of `_.create` without support for assigning\n * properties to the created object.\n \n @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n /\nvar baseCreate = (function() {\n function object() {}\n return function(proto) {\n if (!isObject(proto)) {\n return {};\n }\n if (objectCreate) {\n return objectCreate(proto);\n }\n object.prototype = proto;\n var result = new object;\n object.prototype = undefined;\n return result;\n };\n}());\n\nmodule.exports = baseCreate;\n","var baseCreate = require('./_baseCreate'),\n getPrototype = require('./_getPrototype'),\n isPrototype = require('./_isPrototype');\n\n/\n Initializes an object clone.\n \n @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n /\nfunction initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n}\n\nmodule.exports = initCloneObject;\n","var baseIsMap = require('./_baseIsMap'),\n baseUnary = require('./_baseUnary'),\n nodeUtil = require('./_nodeUtil');\n\n/ Node.js helper references. /\nvar nodeIsMap = nodeUtil && nodeUtil.isMap;\n\n/\n Checks if `value` is classified as a `Map` object.\n \n @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n \n _.isMap(new Map);\n * // => true\n \n _.isMap(new WeakMap);\n * // => false\n /\nvar isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\nmodule.exports = isMap;\n","var getTag = require('./_getTag'),\n isObjectLike = require('./isObjectLike');\n\n/* `Object#toString` result references. /\nvar mapTag = '[object Map]';\n\n/\n The base implementation of `_.isMap` without Node.js optimizations.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a map, else `false`.\n /\nfunction baseIsMap(value) {\n return isObjectLike(value) && getTag(value) == mapTag;\n}\n\nmodule.exports = baseIsMap;\n","var baseIsSet = require('./_baseIsSet'),\n baseUnary = require('./_baseUnary'),\n nodeUtil = require('./_nodeUtil');\n\n/ Node.js helper references. /\nvar nodeIsSet = nodeUtil && nodeUtil.isSet;\n\n/\n Checks if `value` is classified as a `Set` object.\n \n @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n \n _.isSet(new Set);\n * // => true\n \n _.isSet(new WeakSet);\n * // => false\n /\nvar isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\nmodule.exports = isSet;\n","var getTag = require('./_getTag'),\n isObjectLike = require('./isObjectLike');\n\n/* `Object#toString` result references. /\nvar setTag = '[object Set]';\n\n/\n The base implementation of `_.isSet` without Node.js optimizations.\n \n @private\n * @param {} value The value to check.\n @returns {boolean} Returns `true` if `value` is a set, else `false`.\n /\nfunction baseIsSet(value) {\n return isObjectLike(value) && getTag(value) == setTag;\n}\n\nmodule.exports = baseIsSet;\n","var Stack = require('./_Stack'),\n arrayEach = require('./_arrayEach'),\n assignValue = require('./_assignValue'),\n baseAssign = require('./_baseAssign'),\n baseAssignIn = require('./_baseAssignIn'),\n cloneBuffer = require('./_cloneBuffer'),\n copyArray = require('./_copyArray'),\n copySymbols = require('./_copySymbols'),\n copySymbolsIn = require('./_copySymbolsIn'),\n getAllKeys = require('./_getAllKeys'),\n getAllKeysIn = require('./_getAllKeysIn'),\n getTag = require('./_getTag'),\n initCloneArray = require('./_initCloneArray'),\n initCloneByTag = require('./_initCloneByTag'),\n initCloneObject = require('./_initCloneObject'),\n isArray = require('./isArray'),\n isBuffer = require('./isBuffer'),\n isMap = require('./isMap'),\n isObject = require('./isObject'),\n isSet = require('./isSet'),\n keys = require('./keys'),\n keysIn = require('./keysIn');\n\n/* Used to compose bitmasks for cloning. /\nvar CLONE_DEEP_FLAG = 1,\n CLONE_FLAT_FLAG = 2,\n CLONE_SYMBOLS_FLAG = 4;\n\n/* `Object#toString` result references. /\nvar argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n objectTag = '[object Object]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]',\n weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n/* Used to identify `toStringTag` values supported by `_.clone`. /\nvar cloneableTags = {};\ncloneableTags[argsTag] = cloneableTags[arrayTag] =\ncloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\ncloneableTags[boolTag] = cloneableTags[dateTag] =\ncloneableTags[float32Tag] = cloneableTags[float64Tag] =\ncloneableTags[int8Tag] = cloneableTags[int16Tag] =\ncloneableTags[int32Tag] = cloneableTags[mapTag] =\ncloneableTags[numberTag] = cloneableTags[objectTag] =\ncloneableTags[regexpTag] = cloneableTags[setTag] =\ncloneableTags[stringTag] = cloneableTags[symbolTag] =\ncloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\ncloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\ncloneableTags[errorTag] = cloneableTags[funcTag] =\ncloneableTags[weakMapTag] = false;\n\n/\n The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n \n @private\n * @param {} value The value to clone.\n @param {boolean} bitmask The bitmask flags.\n * 1 - Deep clone\n * 2 - Flatten inherited properties\n * 4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {} Returns the cloned value.\n /\nfunction baseClone(value, bitmask, customizer, key, object, stack) {\n var result,\n isDeep = bitmask & CLONE_DEEP_FLAG,\n isFlat = bitmask & CLONE_FLAT_FLAG,\n isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n if (customizer) {\n result = object ? customizer(value, key, object, stack) : customizer(value);\n }\n if (result !== undefined) {\n return result;\n }\n if (!isObject(value)) {\n return value;\n }\n var isArr = isArray(value);\n if (isArr) {\n result = initCloneArray(value);\n if (!isDeep) {\n return copyArray(value, result);\n }\n } else {\n var tag = getTag(value),\n isFunc = tag == funcTag \|\| tag == genTag;\n\n if (isBuffer(value)) {\n return cloneBuffer(value, isDeep);\n }\n if (tag == objectTag \|\| tag == argsTag \|\| (isFunc && !object)) {\n result = (isFlat \|\| isFunc) ? {} : initCloneObject(value);\n if (!isDeep) {\n return isFlat\n ? copySymbolsIn(value, baseAssignIn(result, value))\n : copySymbols(value, baseAssign(result, value));\n }\n } else {\n if (!cloneableTags[tag]) {\n return object ? value : {};\n }\n result = initCloneByTag(value, tag, isDeep);\n }\n }\n // Check for circular references and return its corresponding clone.\n stack \|\| (stack = new Stack);\n var stacked = stack.get(value);\n if (stacked) {\n return stacked;\n }\n stack.set(value, result);\n\n if (isSet(value)) {\n value.forEach(function(subValue) {\n result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n });\n } else if (isMap(value)) {\n value.forEach(function(subValue, key) {\n result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n }\n\n var keysFunc = isFull\n ? (isFlat ? getAllKeysIn : getAllKeys)\n : (isFlat ? keysIn : keys);\n\n var props = isArr ? undefined : keysFunc(value);\n arrayEach(props \|\| value, function(subValue, key) {\n if (props) {\n key = subValue;\n subValue = value[key];\n }\n // Recursively populate clone (susceptible to call stack limits).\n assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n return result;\n}\n\nmodule.exports = baseClone;\n","var copyObject = require('./_copyObject'),\n keys = require('./keys');\n\n/*\n The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n \n @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n /\nfunction baseAssign(object, source) {\n return object && copyObject(source, keys(source), object);\n}\n\nmodule.exports = baseAssign;\n","var copyObject = require('./_copyObject'),\n keysIn = require('./keysIn');\n\n/\n The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n \n @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n /\nfunction baseAssignIn(object, source) {\n return object && copyObject(source, keysIn(source), object);\n}\n\nmodule.exports = baseAssignIn;\n","var copyObject = require('./_copyObject'),\n getSymbols = require('./_getSymbols');\n\n/\n Copies own symbols of `source` to `object`.\n \n @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n /\nfunction copySymbols(source, object) {\n return copyObject(source, getSymbols(source), object);\n}\n\nmodule.exports = copySymbols;\n","var copyObject = require('./_copyObject'),\n getSymbolsIn = require('./_getSymbolsIn');\n\n/\n Copies own and inherited symbols of `source` to `object`.\n \n @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n /\nfunction copySymbolsIn(source, object) {\n return copyObject(source, getSymbolsIn(source), object);\n}\n\nmodule.exports = copySymbolsIn;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n getSymbolsIn = require('./_getSymbolsIn'),\n keysIn = require('./keysIn');\n\n/\n Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n \n @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n /\nfunction getAllKeysIn(object) {\n return baseGetAllKeys(object, keysIn, getSymbolsIn);\n}\n\nmodule.exports = getAllKeysIn;\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 Initializes an array clone.\n \n @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n /\nfunction initCloneArray(array) {\n var length = array.length,\n result = new array.constructor(length);\n\n // Add properties assigned by `RegExp#exec`.\n if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n result.index = array.index;\n result.input = array.input;\n }\n return result;\n}\n\nmodule.exports = initCloneArray;\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","/ 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 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","/\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 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","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 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","/\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","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 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","/* 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","/\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 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 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","/\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","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 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 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 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","/\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 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 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","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 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 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","/\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 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 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 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 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","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 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","/\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 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","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 `_.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 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 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 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 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","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 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","/* 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 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","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","/\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 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 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 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 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 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 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","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 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","/\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 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 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 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","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","/\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 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","/\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 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 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","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 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","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","/ 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","// Includes only the \"core\" of graphlib\nmodule.exports = {\n Graph: require(\"./graph\"),\n version: require(\"./version\")\n};\n","module.exports = '2.1.8';\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","/\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","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","/ 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","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 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","/* 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 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 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 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 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 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 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","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","/*\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 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 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","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","/\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 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 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 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","/ 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 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 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 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","/\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 baseClone = require('./_baseClone');\n\n/* Used to compose bitmasks for cloning. /\nvar CLONE_DEEP_FLAG = 1,\n CLONE_SYMBOLS_FLAG = 4;\n\n/\n This method is like `_.clone` except that it recursively clones `value`.\n \n @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {} value The value to recursively clone.\n @returns {} Returns the deep cloned value.\n @see _.clone\n * @example\n \n var objects = [{ 'a': 1 }, { 'b': 2 }];\n \n var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n /\nfunction cloneDeep(value) {\n return baseClone(value, CLONE_DEEP_FLAG \| CLONE_SYMBOLS_FLAG);\n}\n\nmodule.exports = cloneDeep;\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 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 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","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 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","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","/\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 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","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 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 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","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 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","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","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","/\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","/\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","/\n @fileoverview Dagre布局插件 - 提供自动化图形布局功能\n \n 本插件基于dagre.js实现LogicFlow的自动化布局功能，支持多种布局方向\n * 可自动计算节点位置和连线路径，实现整洁的图形展示\n /\nimport LogicFlow, { BaseNodeModel, BaseEdgeModel } from '@logicflow/core'\nimport dagre, { GraphLabel, graphlib } from 'dagre'\n\nimport NodeConfig = LogicFlow.NodeConfig\nimport EdgeConfig = LogicFlow.EdgeConfig\nimport Point = LogicFlow.Point\n\n/\n Dagre布局配置选项接口\n * @interface DagreOption\n * @extends GraphLabel - 继承dagre原生配置\n /\nexport interface DagreOption extends GraphLabel {\n /\n 是否是默认锚点\n * true: 会根据布局方向自动计算边的路径点\n /\n isDefaultAnchor?: boolean\n}\n\n/\n Dagre插件接口定义\n /\nexport interface DagrePlugin {\n /\n 执行布局计算\n * @param option - 布局配置选项\n /\n layout(option: DagreOption): void\n}\n\n/\n Dagre布局类 - LogicFlow自动布局插件\n * 基于dagre.js提供图的自动布局能力\n /\nexport class Dagre {\n /* 插件名称，用于在LogicFlow中注册 /\n static pluginName = 'dagre'\n\n /* LogicFlow实例引用 /\n lf: LogicFlow\n\n /* 当前布局配置 /\n option: DagreOption // 使用已定义的DagreOption接口替代重复定义\n\n /\n 插件初始化方法，由LogicFlow自动调用\n * @param lf - LogicFlow实例\n /\n render(lf: LogicFlow) {\n this.lf = lf\n }\n\n /\n 执行布局算法，重新排列图中的节点和边\n * @param option - 布局配置选项\n /\n layout(option: DagreOption = {}) {\n const { nodes, edges, gridSize } = this.lf.graphModel\n\n // 根据网格大小调整节点间距\n let nodesep = 100\n let ranksep = 150\n if (gridSize > 20) {\n nodesep = gridSize 2\n ranksep = gridSize * 2\n }\n\n // 合并默认配置和用户配置\n this.option = {\n // 默认从左到右布局\n rankdir: 'LR',\n // 默认右下角对齐\n align: 'UL',\n // 紧凑树形排名算法\n ranker: 'tight-tree',\n // 层级间距\n ranksep,\n // 同层节点间距\n nodesep,\n // 图的水平边距\n marginx: 120,\n // 图的垂直边距\n marginy: 120,\n // 用户自定义选项覆盖默认值\n ...option,\n }\n\n // 创建dagre图实例\n const g = new graphlib.Graph()\n g.setGraph(this.option)\n g.setDefaultEdgeLabel(() => ({}))\n\n // 将LogicFlow节点添加到dagre图中\n nodes.forEach((node: BaseNodeModel) => {\n g.setNode(node.id, {\n width: node.width \|\| 150,\n height: node.height \|\| 50,\n id: node.id,\n })\n })\n\n // 将LogicFlow边添加到dagre图中\n edges.forEach((edge: BaseEdgeModel) => {\n g.setEdge(edge.sourceNodeId, edge.targetNodeId, {\n id: edge.id,\n })\n })\n\n // 执行dagre布局算法\n dagre.layout(g)\n\n // 存储新的节点和边数据\n const newNodes: NodeConfig[] = []\n const newEdges: EdgeConfig[] = []\n\n // 更新节点位置\n nodes.forEach((node: BaseNodeModel) => {\n const { x, y } = g.node(node.id)\n const lfNode = node.getData()\n if (!lfNode) {\n throw new Error(`布局错误：找不到ID为 ${node.id} 的节点`)\n }\n\n // 更新节点坐标\n lfNode.x = x\n lfNode.y = y\n\n // 更新节点文本位置\n if (lfNode?.text?.x) {\n lfNode.text.x = x\n lfNode.text.y = y\n }\n\n newNodes.push(lfNode)\n })\n\n // 处理边的路径和锚点\n edges.forEach((edge: BaseEdgeModel) => {\n const lfEdge: any = edge.getData()\n if (!lfEdge) {\n return\n }\n\n if (!option.isDefaultAnchor) {\n // 自定义锚点，不调整边的关联锚点，只清除路径相关数据，让LogicFlow自动计算\n delete lfEdge.pointsList\n delete lfEdge.startPoint\n delete lfEdge.endPoint\n if (lfEdge.text && lfEdge.text.value) {\n lfEdge.text = lfEdge.text.value\n }\n } else {\n // 默认锚点，重新计算路径以及边的起点和终点（节点默认锚点为上下左右）\n delete lfEdge.pointsList\n delete lfEdge.startPoint\n delete lfEdge.endPoint\n delete lfEdge.sourceAnchorId\n delete lfEdge.targetAnchorId\n\n const model = this.lf.getEdgeModelById(edge.id)\n if (model) {\n // 计算自定义折线路径\n lfEdge.pointsList = this.calcPointsList(model, newNodes)\n }\n\n if (lfEdge.pointsList) {\n // 设置边的起点和终点\n const first = lfEdge.pointsList[0]\n const last = lfEdge.pointsList[lfEdge.pointsList.length - 1]\n lfEdge.startPoint = { x: first.x, y: first.y }\n lfEdge.endPoint = { x: last.x, y: last.y }\n }\n if (lfEdge.text && lfEdge.text.value) {\n // 保留文本内容\n lfEdge.text = lfEdge.text.value\n }\n }\n\n newEdges.push(lfEdge)\n })\n // 将计算好的布局数据应用到画布\n this.lf.renderRawData({\n nodes: newNodes,\n edges: newEdges,\n })\n }\n\n /*\n 计算字符串显示宽度（用于文本定位）\n * @param word - 要计算的文本\n * @returns 估算的文本像素宽度\n /\n getBytesLength(word: string): number {\n if (!word) {\n return 0\n }\n\n let totalLength = 0\n for (let i = 0; i < word.length; i++) {\n const c = word.charCodeAt(i)\n // 大写字母宽度加权\n if (word.match(/[A-Z]/)) {\n totalLength += 1.5\n }\n // ASCII字符和半角字符\n else if ((c >= 0x0001 && c <= 0x007e) \|\| (c >= 0xff60 && c <= 0xff9f)) {\n totalLength += 1\n }\n // 其他字符（如中文）\n else {\n totalLength += 2\n }\n }\n\n return totalLength\n }\n\n /\n 优化折线路径点，移除冗余点\n * @param points - 原始路径点数组\n * @returns 优化后的路径点数组\n /\n pointFilter(points: Point[]): Point[] {\n const allPoints = [...points] // 创建副本避免修改原始数据\n let i = 1\n\n // 删除直线上的中间点（保持路径简洁）\n while (i < allPoints.length - 1) {\n const pre = allPoints[i - 1]\n const current = allPoints[i]\n const next = allPoints[i + 1]\n\n // 如果三点共线，移除中间点\n if (\n (pre.x === current.x && current.x === next.x) \|\| // 垂直线上的点\n (pre.y === current.y && current.y === next.y)\n ) {\n // 水平线上的点\n allPoints.splice(i, 1)\n } else {\n i++\n }\n }\n\n return allPoints\n }\n\n /\n 计算边的折线路径点\n * @param model - 边模型\n * @param nodes - 节点数据数组\n * @returns 计算后的路径点数组，如果无法计算则返回undefined\n */\n calcPointsList(\n model: BaseEdgeModel,\n nodes: NodeConfig[],\n ): Point[] \| undefined {\n const pointsList: Point[] = []\n\n // 获取源节点和目标节点的模型与布局数据\n const sourceNodeModel = this.lf.getNodeModelById(model.sourceNodeId)\n const targetNodeModel = this.lf.getNodeModelById(model.targetNodeId)\n const newSourceNodeData = nodes.find(\n (node: NodeConfig) => node.id === model.sourceNodeId,\n )\n const newTargetNodeData = nodes.find(\n (node: NodeConfig) => node.id === model.targetNodeId,\n )\n\n // 数据验证\n if (\n !sourceNodeModel \|\|\n !targetNodeModel \|\|\n !newSourceNodeData \|\|\n !newTargetNodeData\n ) {\n return undefined\n }\n\n // 折线偏移量（用于创建合适的转折点）\n const offset = Number(model.offset) \|\| 50\n\n // 处理从左到右(LR)布局的边路径\n if (this.option.rankdir === 'LR' && model.modelType === 'polyline-edge') {\n // 正向连线：源节点在目标节点左侧\n if (newSourceNodeData.x < newTargetNodeData.x) {\n // 从源节点右侧中心出发\n pointsList.push({\n x: newSourceNodeData.x + sourceNodeModel.width / 2,\n y: newSourceNodeData.y,\n })\n // 向右延伸一段距离\n pointsList.push({\n x: newSourceNodeData.x + sourceNodeModel.width / 2 + offset,\n y: newSourceNodeData.y,\n })\n // 垂直移动到目标节点的高度\n pointsList.push({\n x: newSourceNodeData.x + sourceNodeModel.width / 2 + offset,\n y: newTargetNodeData.y,\n })\n // 连接到目标节点左侧中心\n pointsList.push({\n x: newTargetNodeData.x - targetNodeModel.width / 2,\n y: newTargetNodeData.y,\n })\n\n return this.pointFilter(pointsList)\n }\n\n // 反向连线：源节点在目标节点右侧\n if (newSourceNodeData.x > newTargetNodeData.x) {\n // 根据节点相对Y轴位置选择不同路径\n if (newSourceNodeData.y >= newTargetNodeData.y) {\n // 源节点在目标节点的右下方，从源节点上方出发\n pointsList.push({\n x: newSourceNodeData.x,\n y: newSourceNodeData.y + sourceNodeModel.height / 2,\n })\n pointsList.push({\n x: newSourceNodeData.x,\n y: newSourceNodeData.y + sourceNodeModel.height / 2 + offset,\n })\n pointsList.push({\n x: newTargetNodeData.x,\n y: newSourceNodeData.y + sourceNodeModel.height / 2 + offset,\n })\n pointsList.push({\n x: newTargetNodeData.x,\n y: newTargetNodeData.y + targetNodeModel.height / 2,\n })\n } else {\n // 源节点在目标节点的右上方，从源节点下方出发\n pointsList.push({\n x: newSourceNodeData.x,\n y: newSourceNodeData.y - sourceNodeModel.height / 2,\n })\n pointsList.push({\n x: newSourceNodeData.x,\n y: newSourceNodeData.y - sourceNodeModel.height / 2 - offset,\n })\n pointsList.push({\n x: newTargetNodeData.x,\n y: newSourceNodeData.y - sourceNodeModel.height / 2 - offset,\n })\n pointsList.push({\n x: newTargetNodeData.x,\n y: newTargetNodeData.y - targetNodeModel.height / 2,\n })\n }\n\n return this.pointFilter(pointsList)\n }\n }\n\n // 处理从上到下(TB)布局的边路径\n if (this.option.rankdir === 'TB' && model.modelType === 'polyline-edge') {\n // 正向连线：源节点在目标节点上方\n if (newSourceNodeData.y < newTargetNodeData.y) {\n // 从源节点底部中心出发\n pointsList.push({\n x: newSourceNodeData.x,\n y: newSourceNodeData.y + sourceNodeModel.height / 2,\n })\n // 向下延伸一段距离\n pointsList.push({\n x: newSourceNodeData.x,\n y: newSourceNodeData.y + sourceNodeModel.height / 2 + offset,\n })\n // 水平移动到目标节点的位置\n pointsList.push({\n x: newTargetNodeData.x,\n y: newSourceNodeData.y + sourceNodeModel.height / 2 + offset,\n })\n // 连接到目标节点顶部中心\n pointsList.push({\n x: newTargetNodeData.x,\n y: newTargetNodeData.y - targetNodeModel.height / 2,\n })\n\n return this.pointFilter(pointsList)\n }\n\n // 反向连线：源节点在目标节点下方\n if (newSourceNodeData.y > newTargetNodeData.y) {\n if (newSourceNodeData.x >= newTargetNodeData.x) {\n // 源节点在目标节点右下方，从源节点右侧出发\n pointsList.push({\n x: newSourceNodeData.x + sourceNodeModel.width / 2,\n y: newSourceNodeData.y,\n })\n pointsList.push({\n x: newSourceNodeData.x + sourceNodeModel.width / 2 + offset,\n y: newSourceNodeData.y,\n })\n pointsList.push({\n x: newSourceNodeData.x + sourceNodeModel.width / 2 + offset,\n y: newTargetNodeData.y,\n })\n pointsList.push({\n x: newTargetNodeData.x + targetNodeModel.width / 2,\n y: newTargetNodeData.y,\n })\n } else {\n // 源节点在目标节点左下方，从源节点左侧出发\n pointsList.push({\n x: newSourceNodeData.x - sourceNodeModel.width / 2,\n y: newSourceNodeData.y,\n })\n pointsList.push({\n x: newSourceNodeData.x - sourceNodeModel.width / 2 - offset,\n y: newSourceNodeData.y,\n })\n pointsList.push({\n x: newSourceNodeData.x - sourceNodeModel.width / 2 - offset,\n y: newTargetNodeData.y,\n })\n pointsList.push({\n x: newTargetNodeData.x - targetNodeModel.width / 2,\n y: newTargetNodeData.y,\n })\n }\n\n return this.pointFilter(pointsList)\n }\n }\n\n // 无法确定路径时返回undefined，让LogicFlow自行处理\n return undefined\n }\n}\n"],"names":["module","value","other","eq","require","array","key","length","listCacheClear","this","__data__","size","listCacheDelete","assocIndexOf","splice","Array","prototype","data","index","pop","call","listCacheGet","undefined","listCacheHas","listCacheSet","push","ListCache","entries","clear","entry","set","get","has","freeGlobal","global","Object","freeSelf","self","root","Function","Symbol","getRawTag","objectProto","hasOwnProperty","nativeObjectToString","toString","symToStringTag","toStringTag","isOwn","tag","unmasked","e","result","objectToString","type","baseGetTag","isObject","uid","coreJsData","maskSrcKey","exec","keys","IE_PROTO","func","funcToString","baseIsNative","isFunction","isMasked","toSource","reIsHostCtor","funcProto","reIsNative","RegExp","replace","test","getValue","object","Map","getNative","nativeCreate","hashClear","hashDelete","hashGet","hashHas","hashSet","Hash","isKeyable","map","mapCacheClear","hash","string","mapCacheDelete","getMapData","mapCacheGet","mapCacheHas","mapCacheSet","MapCache","stackClear","stackDelete","stackGet","stackHas","stackSet","pairs","LARGE_ARRAY_SIZE","Stack","iteratee","defineProperty","configurable","enumerable","writable","baseAssignValue","objValue","assignValue","source","props","customizer","isNew","newValue","baseIsArguments","isObjectLike","propertyIsEnumerable","isArguments","arguments","isArray","stubFalse","freeExports","exports","nodeType","freeModule","Buffer","isBuffer","reIsUint","freeProcess","process","nodeUtil","types","binding","baseIsTypedArray","isLength","typedArrayTags","baseUnary","nodeIsTypedArray","isTypedArray","baseTimes","n","isIndex","inherited","isArr","isArg","isBuff","isType","skipIndexes","String","Ctor","constructor","transform","arg","isPrototype","nativeKeys","overArg","arrayLikeKeys","baseKeys","isArrayLike","nativeKeysIn","isProto","baseKeysIn","allocUnsafe","buffer","isDeep","slice","copy","predicate","resIndex","arrayFilter","stubArray","nativeGetSymbols","getOwnPropertySymbols","symbol","values","offset","getPrototype","getPrototypeOf","arrayPush","getSymbols","keysFunc","symbolsFunc","baseGetAllKeys","Set","DataView","Promise","WeakMap","mapTag","promiseTag","setTag","weakMapTag","dataViewTag","dataViewCtorString","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","getTag","ArrayBuffer","resolve","ctorString","Uint8Array","arrayBuffer","byteLength","cloneArrayBuffer","typedArray","byteOffset","cloneDataView","dataView","cloneRegExp","reFlags","regexp","lastIndex","cloneSymbol","symbolProto","symbolValueOf","valueOf","cloneTypedArray","objectCreate","create","baseCreate","proto","baseIsMap","nodeIsMap","isMap","baseIsSet","nodeIsSet","isSet","arrayEach","baseAssign","copyObject","baseAssignIn","keysIn","cloneBuffer","copyArray","copySymbols","copySymbolsIn","getSymbolsIn","getAllKeys","getAllKeysIn","initCloneArray","input","initCloneByTag","initCloneObject","argsTag","funcTag","objectTag","cloneableTags","baseClone","bitmask","stack","isFlat","isFull","isFunc","stacked","forEach","subValue","add","graphlib","baseFor","fromRight","iterable","baseForOwn","baseEach","eachFunc","collection","createBaseEach","identity","castFunction","setCacheAdd","setCacheHas","SetCache","cache","arraySome","cacheHas","equalFunc","isPartial","arrLength","othLength","arrStacked","othStacked","seen","arrValue","othValue","compared","othIndex","equalArrays","mapToArray","setToArray","name","message","convert","equalByTag","equalObjects","objProps","objLength","objStacked","skipCtor","objCtor","othCtor","arrayTag","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","baseIsEqualDeep","baseIsEqual","srcValue","baseIsMatch","matchData","noCustomizer","COMPARE_PARTIAL_FLAG","getMatchData","isStrictComparable","matchesStrictComparable","isSymbol","reIsDeepProp","reIsPlainProp","memoize","resolver","TypeError","memoized","args","apply","Cache","baseToString","arrayMap","symbolToString","isKey","stringToPath","memoizeCapped","rePropName","reEscapeChar","charCodeAt","match","number","quote","subString","castPath","toKey","path","hasFunc","baseHasIn","hasPath","baseGet","defaultValue","hasIn","baseProperty","basePropertyDeep","baseMatches","baseMatchesProperty","property","baseFilter","baseIteratee","baseHas","baseMap","arrayReduce","accumulator","initAccum","baseReduce","asciiSize","hasUnicode","reHasUnicode","unicodeSize","rsAstralRange","rsAstral","rsCombo","rsFitz","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsModifier","rsOptVar","rsSeq","join","rsSymbol","reUnicode","isString","stringSize","isArrLike","isFlattenable","spreadableSymbol","isConcatSpreadable","baseFlatten","depth","isStrict","thisArg","nativeMax","Math","max","start","otherArgs","baseSetToString","constant","shortOut","nativeNow","Date","now","count","lastCalled","stamp","remaining","setToString","overRest","fromIndex","baseFindIndex","baseIsNaN","strictIndexOf","noop","createSet","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","includes","isCommon","outer","computed","seenIndex","baseRest","baseUniq","isArrayLikeObject","union","arrays","baseValues","lodash","clone","each","filter","isEmpty","isUndefined","reduce","window","_","graph","Graph","DEFAULT_EDGE_NAME","GRAPH_NODE","EDGE_KEY_DELIM","opts","_isDirected","directed","_isMultigraph","multigraph","_isCompound","compound","_label","_defaultNodeLabelFn","_defaultEdgeLabelFn","_nodes","_parent","_children","_in","_preds","_out","_sucs","_edgeObjs","_edgeLabels","incrementOrInitEntry","k","decrementOrRemoveEntry","edgeArgsToId","isDirected","v_","w_","v","w","tmp","edgeObjToId","edgeObj","_nodeCount","_edgeCount","isMultigraph","isCompound","setGraph","label","setDefaultNodeLabel","newDefault","nodeCount","nodes","sources","sinks","setNodes","vs","setNode","node","hasNode","removeNode","removeEdge","_removeFromParentsChildList","children","child","setParent","parent","Error","ancestor","predecessors","predsV","successors","sucsV","neighbors","preds","isLeaf","filterNodes","setEdge","edge","parents","findParent","setDefaultEdgeLabel","edgeCount","edges","setPath","valueSpecified","arg0","edgeArgsToObj","freeze","hasEdge","inEdges","u","inV","outEdges","outV","nodeEdges","concat","version","writeNodes","g","nodeValue","writeEdges","edgeValue","write","json","options","read","components_1","cmpt","visited","cmpts","dfs","PriorityQueue","_arr","_keyIndices","priorityQueue","x","priority","min","keyIndices","arr","_decrease","removeMin","_swap","_heapify","decrease","i","l","r","largest","j","origArrI","origArrJ","dijkstra_1","weightFn","edgeFn","vEntry","results","pq","updateNeighbors","wEntry","weight","distance","predecessor","Number","POSITIVE_INFINITY","runDijkstra","DEFAULT_WEIGHT_FUNC","dijkstra","dijkstraAll_1","weightFunc","edgeFunc","acc","tarjan_1","onStack","lowlink","tarjan","findCycles_1","floydWarshall_1","d","rowK","rowI","ik","kj","ij","altDistance","runFloydWarshall","topsort","visit","CycleException","topsort_1","isAcyclic_1","doDfs","postorder","navigation","dfs_1","order","bind","postorder_1","preorder_1","prim_1","pri","edgeWeight","init","lib","alg","components","dijkstraAll","findCycles","floydWarshall","isAcyclic","preorder","prim","trimmedEndIndex","reWhitespace","charAt","reTrimStart","toNumber","baseTrim","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","parseInt","isBinary","INFINITY","toInteger","toFinite","remainder","current","assignMergeValue","isPlainObject","objectCtorString","safeGet","toPlainObject","srcIndex","mergeFunc","isTyped","baseSet","nested","paths","baseRange","nativeCeil","ceil","end","step","isIterateeCall","compareAscending","valIsDefined","valIsNull","valIsReflexive","valIsSymbol","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","orders","objCriteria","criteria","othCriteria","ordersLength","baseSortBy","comparer","sort","compareMultiple","iteratees","cloneDeep","CLONE_DEEP_FLAG","defaults","guard","propsIndex","propsLength","find","findIndexFunc","createFind","flatten","forIn","last","mapValues","baseExtremum","baseGt","merge","baseMerge","baseMergeDeep","assigner","createAssigner","baseLt","minBy","pick","basePick","basePickBy","flatRest","range","createRange","sortBy","baseOrderBy","uniqueId","idCounter","prefix","id","zipObject","baseZipObject","assignFunc","valsLength","List","sentinel","_next","_prev","_sentinel","unlink","filterOutLinks","dequeue","enqueue","strs","curr","JSON","stringify","state","fasGraph","maxIn","maxOut","in","out","prevWeight","buckets","zeroIdx","assignBucket","buildState","DEFAULT_WEIGHT_FN","doGreedyFAS","collectPredecessors","uEntry","greedyFAS","run","fas","acyclicer","dfsFAS","forwardName","reversed","undo","addDummyNode","simplify","simplified","simpleLabel","minlen","asNonCompoundGraph","successorWeights","weightMap","sucs","predecessorWeights","intersectRect","rect","point","sx","sy","y","dx","dy","width","h","height","abs","buildLayerMatrix","layering","maxRank","rank","normalizeRanks","removeEmptyRanks","layers","delta","nodeRankFactor","addBorderNode","partition","fn","lhs","rhs","time","notime","attrs","dummy","util","dummyChains","vRank","wRank","edgeLabel","labelRank","points","labelpos","normalizeEdge","origLabel","longestPath","slack","t","tightTree","findMinSlackEdge","shiftRanks","edgeV","feasibleTree","initRank","networkSimplex","initLowLimValues","initCutValues","leaveEdge","exchangeEdges","enterEdge","childLab","cutvalue","calcCutValue","assignCutValue","childIsTail","graphEdge","cutValue","isOutEdge","pointsToHead","otherWeight","otherCutValue","tree","dfsAssignLowLim","nextLim","low","lim","vLabel","wLabel","tailLabel","flip","candidates","isDescendant","f","flipped","updateRanks","rootLabel","ranker","networkSimplexRanker","tightTreeRanker","longestPathRanker","postorderNums","pathData","lca","vPath","wPath","reverse","findPath","pathIdx","pathV","ascending","minRank","depths","treeDepths","nodeSep","nestingRoot","sumWeights","cleanup","graphLabel","nestingEdge","top","bottom","borderTop","borderBottom","childNode","childTop","childBottom","thisWeight","borderLeft","borderRight","prop","sg","sgNode","borderType","prev","adjust","rankDir","rankdir","toLowerCase","swapWidthHeight","reverseYOne","reverseY","swapXYOne","swapXY","swapWidthHeightOne","simpleNodes","orderedVs","cc","twoLayerCrossCount","northLayer","southLayer","southPos","southEntries","pos","firstIndex","treeSize","weightSum","consumeUnsortable","unsortable","barycenter","movable","nodeU","sum","resolveConflicts","cg","mappedEntries","indegree","entryV","entryW","sourceSet","handleIn","merged","target","mergeEntries","handleOut","doResolveConflicts","biasRight","parts","sortable","vsIndex","bias","sortSubgraph","bl","br","subgraphs","barycenters","subgraphResult","expandSubgraphs","blPred","brPred","relationship","createRootNode","initOrder","crossCount","buildLayerGraph","addSubgraphConstraints","rootPrev","prevChild","downLayerGraphs","buildLayerGraphs","upLayerGraphs","assignOrder","best","bestCC","lastBest","sweepLayerGraphs","ranks","layerGraphs","lg","sorted","layer","adjustedLayering","conflicts","findType1Conflicts","findType2Conflicts","xss","vert","horiz","inner","neighborFn","align","verticalAlignment","xs","horizontalCompaction","smallestWidth","findSmallestWidthAlignment","alignCoordinates","balance","prevLayer","k0","scanPos","prevLayerLength","lastNode","findOtherInnerSegmentNode","k1","scanNode","uLabel","uPos","addConflict","scan","south","southEnd","prevNorthBorder","nextNorthBorder","uNode","north","nextNorthPos","prevNorthPos","southLookahead","conflictsV","hasConflict","prevIdx","ws","mp","floor","il","reverseSep","blockG","blockGraph","sepFn","edgeSep","sep","nodesep","edgesep","vRoot","uRoot","prevMax","buildBlockGraph","iterate","setXsFunc","nextNodesFunc","elem","NEGATIVE_INFINITY","halfWidth","alignTo","alignToVals","alignToMin","alignToMax","alignment","xsVals","ul","ignore","positionX","acyclic","normalize","parentDummyChains","nestingGraph","addBorderSegments","coordinateSystem","position","rankSep","ranksep","prevY","maxHeight","positionY","debugTiming","layoutGraph","inputGraph","canonicalize","graphDefaults","selectNumberAttrs","graphNumAttrs","graphAttrs","nodeNumAttrs","nodeDefaults","edgeDefaults","edgeNumAttrs","edgeAttrs","buildLayoutGraph","labeloffset","makeSpaceForEdgeLabels","selfEdges","removeSelfEdges","injectEdgeLabelProxies","assignRankMinMax","removeEdgeLabelProxies","orderShift","selfEdge","insertSelfEdges","selfNode","positionSelfEdges","b","removeBorderNodes","fixupEdgeLabelCoords","minX","maxX","minY","maxY","marginX","marginx","marginY","marginy","getExtremes","p","translateGraph","p1","p2","nodeV","nodeW","unshift","assignNodeIntersects","reversePointsForReversedEdges","runLayout","inputLabel","layoutLabel","updateInputGraph","obj","newAttrs","layout","debug","debugOrdering","layerMatrix","layerV","style","Dagre","render","lf","option","gridSize","graphModel","assign","sourceNodeId","targetNodeId","dagre","newNodes","newEdges","lfNode","getData","_a","text","lfEdge","isDefaultAnchor","pointsList","startPoint","endPoint","sourceAnchorId","targetAnchorId","model","getEdgeModelById","calcPointsList","first","renderRawData","getBytesLength","word","totalLength","c","pointFilter","allPoints","pre","next","sourceNodeModel","getNodeModelById","targetNodeModel","newSourceNodeData","newTargetNodeData","modelType","pluginName"],"mappings":"0rBAoCAA,EAJA,SAAYC,EAAOC,GACjB,OAAOD,IAAUC,GAAUD,GAAUA,GAASC,GAAUA,CAC1D,kCClCA,IAAIC,EAAKC,YAoBTJ,EAVA,SAAsBK,EAAOC,GAE3B,IADA,IAAIC,EAASF,EAAME,OACZA,KACL,GAAIJ,EAAGE,EAAME,GAAQ,GAAID,GACvB,OAAOC,EAGX,OAAQ,CACV,kCClBA,IAAIC,WCYJR,EALA,WACES,KAAKC,SAAW,GAChBD,KAAKE,KAAO,CACd,GDTIC,+BEDJ,IAAIC,EAAeT,KAMfU,EAHaC,MAAMC,UAGCF,cA4BxBd,EAjBA,SAAyBM,GACvB,IAAIW,EAAOR,KAAKC,SACZQ,EAAQL,EAAaI,EAAMX,GAE/B,QAAIY,EAAQ,IAIRA,GADYD,EAAKV,OAAS,EAE5BU,EAAKE,MAELL,EAAOM,KAAKH,EAAMC,EAAO,KAEzBT,KAAKE,KACA,GACT,EF/BsBP,GAClBiB,+BGFJ,IAAIR,EAAeT,YAkBnBJ,EAPA,SAAsBM,GACpB,IAAIW,EAAOR,KAAKC,SACZQ,EAAQL,EAAaI,EAAMX,GAE/B,OAAOY,EAAQ,OAAII,EAAYL,EAAKC,GAAO,EAC7C,EHdmBd,GACfmB,+BIHJ,IAAIV,EAAeT,YAenBJ,EAJA,SAAsBM,GACpB,OAAOO,EAAaJ,KAAKC,SAAUJ,IAAQ,CAC7C,EJVmBF,GACfoB,+BKJJ,IAAIX,EAAeT,YAyBnBJ,EAbA,SAAsBM,EAAKL,GACzB,IAAIgB,EAAOR,KAAKC,SACZQ,EAAQL,EAAaI,EAAMX,GAQ/B,OANIY,EAAQ,KACRT,KAAKE,KACPM,EAAKQ,KAAK,CAACnB,EAAKL,KAEhBgB,EAAKC,GAAO,GAAKjB,EAEZQ,IACT,ELnBmBL,GASnB,SAASsB,EAAUC,GACjB,IAAIT,GAAS,EACTX,EAAoB,MAAXoB,EAAkB,EAAIA,EAAQpB,OAG3C,IADAE,KAAKmB,UACIV,EAAQX,GAAQ,CACvB,IAAIsB,EAAQF,EAAQT,GACpBT,KAAKqB,IAAID,EAAM,GAAIA,EAAM,GAC3B,CACF,QAGAH,EAAUV,UAAUY,MAAQpB,EAC5BkB,EAAUV,UAAkB,OAAIJ,EAChCc,EAAUV,UAAUe,IAAMV,EAC1BK,EAAUV,UAAUgB,IAAMT,EAC1BG,EAAUV,UAAUc,IAAMN,EAE1BxB,EAAiB0B,kCM9BjB,IAAIO,EAA8B,iBAAVC,IAAsBA,IAAUA,GAAOC,SAAWA,QAAUD,UAEpFlC,EAAiBiC,kCCHjB,IAAIA,EAAa7B,KAGbgC,EAA0B,iBAARC,MAAoBA,MAAQA,KAAKF,SAAWA,QAAUE,KAGxEC,EAAOL,GAAcG,GAAYG,SAAS,cAATA,UAErCvC,EAAiBsC,kCCRjB,IAGIE,EAHOpC,KAGOoC,cAElBxC,EAAiBwC,kCCLjB,IAAIA,EAASpC,KACTqC,+BCDJ,IAAID,EAASpC,KAGTsC,EAAcP,OAAOnB,UAGrB2B,EAAiBD,EAAYC,eAO7BC,EAAuBF,EAAYG,SAGnCC,EAAiBN,EAASA,EAAOO,iBAAczB,SA6BnDtB,EApBA,SAAmBC,GACjB,IAAI+C,EAAQL,EAAevB,KAAKnB,EAAO6C,GACnCG,EAAMhD,EAAM6C,GAEhB,IACE7C,EAAM6C,QAAkBxB,EACxB,IAAI4B,GAAW,CACjB,CAAE,MAAOC,GAAI,CAEb,IAAIC,EAASR,EAAqBxB,KAAKnB,GAQvC,OAPIiD,IACEF,EACF/C,EAAM6C,GAAkBG,SAEjBhD,EAAM6C,IAGVM,CACT,ED1CgBhD,GACZiD,+BEDJ,IAOIT,EAPcT,OAAOnB,UAOc6B,gBAavC7C,EAJA,SAAwBC,GACtB,OAAO2C,EAAqBxB,KAAKnB,EACnC,EFjBqBG,GAOjB0C,EAAiBN,EAASA,EAAOO,iBAAczB,SAkBnDtB,EATA,SAAoBC,GAClB,OAAa,MAATA,OACeqB,IAAVrB,EAdQ,qBADL,gBAiBJ6C,GAAkBA,KAAkBX,OAAOlC,GAC/CwC,EAAUxC,GACVoD,EAAepD,EACrB,yCGKAD,EALA,SAAkBC,GAChB,IAAIqD,SAAcrD,EAClB,OAAgB,MAATA,IAA0B,UAARqD,GAA4B,YAARA,EAC/C,kCC5BA,IAAIC,EAAanD,KACboD,EAAWpD,YAmCfJ,EAVA,SAAoBC,GAClB,IAAKuD,EAASvD,GACZ,OAAO,EAIT,IAAIgD,EAAMM,EAAWtD,GACrB,MA5BY,qBA4BLgD,GA3BI,8BA2BcA,GA7BZ,0BA6B6BA,GA1B7B,kBA0BgDA,CAC/D,kCClCA,IAIMQ,EAJFC,+BCAJ,IAGIA,EAHOtD,KAGW,6BAEtBJ,EAAiB0D,EDLAtD,GAGbuD,GACEF,EAAM,SAASG,KAAKF,GAAcA,EAAWG,MAAQH,EAAWG,KAAKC,UAAY,KACvE,iBAAmBL,EAAO,UAc1CzD,EAJA,SAAkB+D,GAChB,QAASJ,GAAeA,KAAcI,CACxC,kCEhBA,IAGIC,EAHYzB,SAASvB,UAGI6B,gBAqB7B7C,EAZA,SAAkB+D,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOC,EAAa5C,KAAK2C,EAC3B,CAAE,MAAOZ,GAAI,CACb,IACE,OAAQY,EAAO,EACjB,CAAE,MAAOZ,GAAI,CACf,CACA,MAAO,EACT,kCCvBA,IAAIc,+BCAJ,IAAIC,EAAa9D,KACb+D,EAAW/D,KACXoD,EAAWpD,KACXgE,EAAWhE,KASXiE,EAAe,8BAGfC,EAAY/B,SAASvB,UACrB0B,EAAcP,OAAOnB,UAGrBgD,EAAeM,EAAUzB,SAGzBF,EAAiBD,EAAYC,eAG7B4B,EAAaC,OAAO,IACtBR,EAAa5C,KAAKuB,GAAgB8B,QAjBjB,sBAiBuC,QACvDA,QAAQ,yDAA0D,SAAW,YAmBhFzE,EARA,SAAsBC,GACpB,SAAKuD,EAASvD,IAAUkE,EAASlE,MAGnBiE,EAAWjE,GAASsE,EAAaF,GAChCK,KAAKN,EAASnE,GAC/B,ED5CmBG,GACfuE,WEWJ3E,EAJA,SAAkB4E,EAAQtE,GACxB,OAAiB,MAAVsE,OAAiBtD,EAAYsD,EAAOtE,EAC7C,UFMAN,EALA,SAAmB4E,EAAQtE,GACzB,IAAIL,EAAQ0E,EAASC,EAAQtE,GAC7B,OAAO2D,EAAahE,GAASA,OAAQqB,CACvC,oCGdA,IAIIuD,EAJYzE,IAIN0E,CAHC1E,KAGe,cAE1BJ,EAAiB6E,qCCNjB,IAGIE,EAHY3E,IAGG0E,CAAU3C,OAAQ,iBAErCnC,GAAiB+E,qCCLjB,IAAIC,kCCAJ,IAAID,EAAe3E,YAcnBJ,GALA,WACES,KAAKC,SAAWqE,EAAeA,EAAa,MAAQ,CAAA,EACpDtE,KAAKE,KAAO,CACd,EDZgBP,GACZ6E,cEeJjF,GANA,SAAoBM,GAClB,IAAI8C,EAAS3C,KAAKuB,IAAI1B,WAAeG,KAAKC,SAASJ,GAEnD,OADAG,KAAKE,MAAQyC,EAAS,EAAI,EACnBA,CACT,GFZI8B,kCGFJ,IAAIH,EAAe3E,KASfuC,EAHcR,OAAOnB,UAGQ2B,sBAoBjC3C,GATA,SAAiBM,GACf,IAAIW,EAAOR,KAAKC,SAChB,GAAIqE,EAAc,CAChB,IAAI3B,EAASnC,EAAKX,GAClB,MArBiB,8BAqBV8C,OAA4B9B,EAAY8B,CACjD,CACA,OAAOT,EAAevB,KAAKH,EAAMX,GAAOW,EAAKX,QAAOgB,CACtD,EHzBclB,GACV+E,kCIHJ,IAAIJ,EAAe3E,KAMfuC,EAHcR,OAAOnB,UAGQ2B,sBAgBjC3C,GALA,SAAiBM,GACf,IAAIW,EAAOR,KAAKC,SAChB,OAAOqE,OAA8BzD,IAAdL,EAAKX,GAAsBqC,EAAevB,KAAKH,EAAMX,EAC9E,EJjBcF,GACVgF,kCKJJ,IAAIL,EAAe3E,YAsBnBJ,GAPA,SAAiBM,EAAKL,GACpB,IAAIgB,EAAOR,KAAKC,SAGhB,OAFAD,KAAKE,MAAQF,KAAKuB,IAAI1B,GAAO,EAAI,EACjCW,EAAKX,GAAQyE,QAA0BzD,IAAVrB,EAfV,4BAekDA,EAC9DQ,IACT,ELhBcL,GASd,SAASiF,EAAK1D,GACZ,IAAIT,GAAS,EACTX,EAAoB,MAAXoB,EAAkB,EAAIA,EAAQpB,OAG3C,IADAE,KAAKmB,UACIV,EAAQX,GAAQ,CACvB,IAAIsB,EAAQF,EAAQT,GACpBT,KAAKqB,IAAID,EAAM,GAAIA,EAAM,GAC3B,CACF,QAGAwD,EAAKrE,UAAUY,MAAQoD,EACvBK,EAAKrE,UAAkB,OAAIiE,EAC3BI,EAAKrE,UAAUe,IAAMmD,EACrBG,EAAKrE,UAAUgB,IAAMmD,EACrBE,EAAKrE,UAAUc,IAAMsD,EAErBpF,GAAiBqF,qCM/BjB,IAAIC,cCcJtF,GAPA,SAAmBC,GACjB,IAAIqD,SAAcrD,EAClB,MAAgB,UAARqD,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVrD,EACU,OAAVA,CACP,UDKAD,GAPA,SAAoBuF,EAAKjF,GACvB,IAAIW,EAAOsE,EAAI7E,SACf,OAAO4E,EAAUhF,GACbW,EAAmB,iBAAPX,EAAkB,SAAW,QACzCW,EAAKsE,GACX,qCEfA,IAAIC,kCCAJ,IAAIH,EAAOjF,KACPsB,EAAYtB,KACZyE,EAAMzE,YAkBVJ,GATA,WACES,KAAKE,KAAO,EACZF,KAAKC,SAAW,CACd+E,KAAQ,IAAIJ,EACZE,IAAO,IAAKV,GAAOnD,GACnBgE,OAAU,IAAIL,EAElB,EDlBoBjF,GAChBuF,kCEDJ,IAAIC,EAAaxF,YAiBjBJ,GANA,SAAwBM,GACtB,IAAI8C,EAASwC,EAAWnF,KAAMH,GAAa,OAAEA,GAE7C,OADAG,KAAKE,MAAQyC,EAAS,EAAI,EACnBA,CACT,EFdqBhD,GACjByF,kCGFJ,IAAID,EAAaxF,YAejBJ,GAJA,SAAqBM,GACnB,OAAOsF,EAAWnF,KAAMH,GAAKyB,IAAIzB,EACnC,EHXkBF,GACd0F,kCIHJ,IAAIF,EAAaxF,YAejBJ,GAJA,SAAqBM,GACnB,OAAOsF,EAAWnF,KAAMH,GAAK0B,IAAI1B,EACnC,EJVkBF,GACd2F,kCKJJ,IAAIH,EAAaxF,YAqBjBJ,GATA,SAAqBM,EAAKL,GACxB,IAAIgB,EAAO2E,EAAWnF,KAAMH,GACxBK,EAAOM,EAAKN,KAIhB,OAFAM,EAAKa,IAAIxB,EAAKL,GACdQ,KAAKE,MAAQM,EAAKN,MAAQA,EAAO,EAAI,EAC9BF,IACT,ELfkBL,GASlB,SAAS4F,EAASrE,GAChB,IAAIT,GAAS,EACTX,EAAoB,MAAXoB,EAAkB,EAAIA,EAAQpB,OAG3C,IADAE,KAAKmB,UACIV,EAAQX,GAAQ,CACvB,IAAIsB,EAAQF,EAAQT,GACpBT,KAAKqB,IAAID,EAAM,GAAIA,EAAM,GAC3B,CACF,QAGAmE,EAAShF,UAAUY,MAAQ4D,EAC3BQ,EAAShF,UAAkB,OAAI2E,EAC/BK,EAAShF,UAAUe,IAAM8D,EACzBG,EAAShF,UAAUgB,IAAM8D,EACzBE,EAAShF,UAAUc,IAAMiE,EAEzB/F,GAAiBgG,qCM/BjB,IAAItE,EAAYtB,KACZ6F,+BCDJ,IAAIvE,EAAYtB,YAchBJ,EALA,WACES,KAAKC,SAAW,IAAIgB,EACpBjB,KAAKE,KAAO,CACd,EDXiBP,GACb8F,WEeJlG,EARA,SAAqBM,GACnB,IAAIW,EAAOR,KAAKC,SACZ0C,EAASnC,EAAa,OAAEX,GAG5B,OADAG,KAAKE,KAAOM,EAAKN,KACVyC,CACT,GFZI+C,WGUJnG,EAJA,SAAkBM,GAChB,OAAOG,KAAKC,SAASqB,IAAIzB,EAC3B,GHPI8F,WISJpG,EAJA,SAAkBM,GAChB,OAAOG,KAAKC,SAASsB,IAAI1B,EAC3B,GJNI+F,kCKLJ,IAAI3E,EAAYtB,KACZyE,EAAMzE,KACN4F,EAAW5F,YA+BfJ,GAhBA,SAAkBM,EAAKL,GACrB,IAAIgB,EAAOR,KAAKC,SAChB,GAAIO,aAAgBS,EAAW,CAC7B,IAAI4E,EAAQrF,EAAKP,SACjB,IAAKmE,GAAQyB,EAAM/F,OAASgG,IAG1B,OAFAD,EAAM7E,KAAK,CAACnB,EAAKL,IACjBQ,KAAKE,OAASM,EAAKN,KACZF,KAETQ,EAAOR,KAAKC,SAAW,IAAIsF,EAASM,EACtC,CAGA,OAFArF,EAAKa,IAAIxB,EAAKL,GACdQ,KAAKE,KAAOM,EAAKN,KACVF,IACT,EL1BeL,GASf,SAASoG,EAAM7E,GACb,IAAIV,EAAOR,KAAKC,SAAW,IAAIgB,EAAUC,GACzClB,KAAKE,KAAOM,EAAKN,IACnB,QAGA6F,EAAMxF,UAAUY,MAAQqE,EACxBO,EAAMxF,UAAkB,OAAIkF,EAC5BM,EAAMxF,UAAUe,IAAMoE,EACtBK,EAAMxF,UAAUgB,IAAMoE,EACtBI,EAAMxF,UAAUc,IAAMuE,EAEtBrG,GAAiBwG,4CMLjBxG,GAZA,SAAmBK,EAAOoG,GAIxB,IAHA,IAAIvF,GAAS,EACTX,EAAkB,MAATF,EAAgB,EAAIA,EAAME,SAE9BW,EAAQX,IAC8B,IAAzCkG,EAASpG,EAAMa,GAAQA,EAAOb,KAIpC,OAAOA,CACT,qCCnBA,IAAIyE,EAAY1E,KAEZsG,EAAkB,WACpB,IACE,IAAI3C,EAAOe,EAAU3C,OAAQ,kBAE7B,OADA4B,EAAK,CAAE,EAAE,GAAI,CAAA,GACNA,CACT,CAAE,MAAOZ,GAAI,CACf,CANsB,UAQtBnD,GAAiB0G,qCCVjB,IAAIA,EAAiBtG,YAwBrBJ,GAbA,SAAyB4E,EAAQtE,EAAKL,GACzB,aAAPK,GAAsBoG,EACxBA,EAAe9B,EAAQtE,EAAK,CAC1BqG,cAAgB,EAChBC,YAAc,EACd3G,MAASA,EACT4G,UAAY,IAGdjC,EAAOtE,GAAOL,CAElB,qCCtBA,IAAI6G,EAAkB1G,KAClBD,EAAKC,KAMLuC,EAHcR,OAAOnB,UAGQ2B,sBAoBjC3C,GARA,SAAqB4E,EAAQtE,EAAKL,GAChC,IAAI8G,EAAWnC,EAAOtE,GAChBqC,EAAevB,KAAKwD,EAAQtE,IAAQH,EAAG4G,EAAU9G,UACxCqB,IAAVrB,GAAyBK,KAAOsE,IACnCkC,EAAgBlC,EAAQtE,EAAKL,EAEjC,qCCzBA,IAAI+G,EAAc5G,KACd0G,EAAkB1G,YAsCtBJ,GA1BA,SAAoBiH,EAAQC,EAAOtC,EAAQuC,GACzC,IAAIC,GAASxC,EACbA,IAAWA,EAAS,CAAA,GAKpB,IAHA,IAAI1D,GAAS,EACTX,EAAS2G,EAAM3G,SAEVW,EAAQX,GAAQ,CACvB,IAAID,EAAM4G,EAAMhG,GAEZmG,EAAWF,EACXA,EAAWvC,EAAOtE,GAAM2G,EAAO3G,GAAMA,EAAKsE,EAAQqC,QAClD3F,OAEaA,IAAb+F,IACFA,EAAWJ,EAAO3G,IAEhB8G,EACFN,EAAgBlC,EAAQtE,EAAK+G,GAE7BL,EAAYpC,EAAQtE,EAAK+G,EAE7B,CACA,OAAOzC,CACT,4CCTA5E,GAJA,SAAsBC,GACpB,OAAgB,MAATA,GAAiC,iBAATA,CACjC,qCC1BA,IAAIqH,kCCAJ,IAAI/D,EAAanD,KACbmH,EAAenH,YAgBnBJ,GAJA,SAAyBC,GACvB,OAAOsH,EAAatH,IAVR,sBAUkBsD,EAAWtD,EAC3C,EDfsBG,GAClBmH,EAAenH,KAGfsC,EAAcP,OAAOnB,UAGrB2B,EAAiBD,EAAYC,eAG7B6E,EAAuB9E,EAAY8E,qBAoBnCC,EAAcH,EAAgB,WAAa,OAAOI,SAAW,CAA/B,IAAsCJ,EAAkB,SAASrH,GACjG,OAAOsH,EAAatH,IAAU0C,EAAevB,KAAKnB,EAAO,YACtDuH,EAAqBpG,KAAKnB,EAAO,SACtC,SAEAD,GAAiByH,qCEZjB,IAAIE,EAAU5G,MAAM4G,eAEpB3H,GAAiB2H,6ICzBjB,IAAIrF,EAAOlC,KACPwH,cCgBJ5H,GAJA,WACE,OAAO,CACT,GDXI6H,EAA4CC,IAAYA,EAAQC,UAAYD,EAG5EE,EAAaH,GAA4C7H,IAAWA,EAAO+H,UAAY/H,EAMvFiI,EAHgBD,GAAcA,EAAWF,UAAYD,EAG5BvF,EAAK2F,YAAS3G,EAsBvC4G,GAnBiBD,EAASA,EAAOC,cAAW5G,IAmBfsG,EAEjC5H,EAAAA,QAAiBkI,iDEpCjB,IAGIC,EAAW,0BAoBfnI,GAVA,SAAiBC,EAAOM,GACtB,IAAI+C,SAAcrD,EAGlB,SAFAM,EAAmB,MAAVA,EAfY,iBAewBA,KAGlC,UAAR+C,GACU,UAARA,GAAoB6E,EAASzD,KAAKzE,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQM,CACjD,4CCYAP,GALA,SAAkBC,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GA9Bb,gBA+BvB,4CCnBAD,GANA,SAAmB+D,GACjB,OAAO,SAAS9D,GACd,OAAO8D,EAAK9D,GAEhB,6LCXA,IAAIgC,EAAa7B,KAGbyH,EAA4CC,IAAYA,EAAQC,UAAYD,EAG5EE,EAAaH,GAA4C7H,IAAWA,EAAO+H,UAAY/H,EAMvFoI,EAHgBJ,GAAcA,EAAWF,UAAYD,GAGtB5F,EAAWoG,QAG1CC,EAAY,WACd,IAEE,IAAIC,EAAQP,GAAcA,EAAW5H,SAAW4H,EAAW5H,QAAQ,QAAQmI,MAE3E,OAAIA,GAKGH,GAAeA,EAAYI,SAAWJ,EAAYI,QAAQ,OACnE,CAAE,MAAOrF,GAAI,CACf,CAZgB,GAchBnD,EAAAA,QAAiBsI,iDC7BjB,IAAIG,kCCAJ,IAAIlF,EAAanD,KACbsI,EAAWtI,KACXmH,EAAenH,KA8BfuI,EAAiB,CAAA,SACrBA,EAZiB,yBAYYA,EAXZ,yBAYjBA,EAXc,sBAWYA,EAVX,uBAWfA,EAVe,uBAUYA,EATZ,uBAUfA,EATsB,8BASYA,EARlB,wBAShBA,EARgB,yBAQY,EAC5BA,EAjCc,sBAiCYA,EAhCX,kBAiCfA,EApBqB,wBAoBYA,EAhCnB,oBAiCdA,EApBkB,qBAoBYA,EAhChB,iBAiCdA,EAhCe,kBAgCYA,EA/Bb,qBAgCdA,EA/Ba,gBA+BYA,EA9BT,mBA+BhBA,EA9BgB,mBA8BYA,EA7BZ,mBA8BhBA,EA7Ba,gBA6BYA,EA5BT,mBA6BhBA,EA5BiB,qBA4BY,EAc7B3I,GALA,SAA0BC,GACxB,OAAOsH,EAAatH,IAClByI,EAASzI,EAAMM,WAAaoI,EAAepF,EAAWtD,GAC1D,EDzDuBG,GACnBwI,EAAYxI,KACZkI,EAAWlI,KAGXyI,EAAmBP,GAAYA,EAASQ,aAmBxCA,EAAeD,EAAmBD,EAAUC,GAAoBJ,SAEpEzI,GAAiB8I,qCE1BjB,IAAIC,cCmBJ/I,GAVA,SAAmBgJ,EAAGvC,GAIpB,IAHA,IAAIvF,GAAS,EACTkC,EAASrC,MAAMiI,KAEV9H,EAAQ8H,GACf5F,EAAOlC,GAASuF,EAASvF,GAE3B,OAAOkC,CACT,GDhBIqE,EAAcrH,KACduH,EAAUvH,KACV8H,EAAW9H,KACX6I,EAAU7I,KACV0I,EAAe1I,KAMfuC,EAHcR,OAAOnB,UAGQ2B,sBAqCjC3C,GA3BA,SAAuBC,EAAOiJ,GAC5B,IAAIC,EAAQxB,EAAQ1H,GAChBmJ,GAASD,GAAS1B,EAAYxH,GAC9BoJ,GAAUF,IAAUC,GAASlB,EAASjI,GACtCqJ,GAAUH,IAAUC,IAAUC,GAAUP,EAAa7I,GACrDsJ,EAAcJ,GAASC,GAASC,GAAUC,EAC1ClG,EAASmG,EAAcR,EAAU9I,EAAMM,OAAQiJ,QAAU,GACzDjJ,EAAS6C,EAAO7C,OAEpB,IAAK,IAAID,KAAOL,GACTiJ,IAAavG,EAAevB,KAAKnB,EAAOK,IACvCiJ,IAEQ,UAAPjJ,GAEC+I,IAAkB,UAAP/I,GAA0B,UAAPA,IAE9BgJ,IAAkB,UAAPhJ,GAA0B,cAAPA,GAA8B,cAAPA,IAEtD2I,EAAQ3I,EAAKC,KAElB6C,EAAO3B,KAAKnB,GAGhB,OAAO8C,CACT,qCE7CA,IAAIV,EAAcP,OAAOnB,iBAgBzBhB,GAPA,SAAqBC,GACnB,IAAIwJ,EAAOxJ,GAASA,EAAMyJ,YAG1B,OAAOzJ,KAFqB,mBAARwJ,GAAsBA,EAAKzI,WAAc0B,EAG/D,4CCDA1C,GANA,SAAiB+D,EAAM4F,GACrB,OAAO,SAASC,GACd,OAAO7F,EAAK4F,EAAUC,IAE1B,qCCZA,IAAIC,EAAczJ,KACd0J,kCCDJ,IAGIA,EAHU1J,IAGG2J,CAAQ5H,OAAO0B,KAAM1B,eAEtCnC,GAAiB8J,EDJA1J,GAMbuC,EAHcR,OAAOnB,UAGQ2B,sBAsBjC3C,GAbA,SAAkB4E,GAChB,IAAKiF,EAAYjF,GACf,OAAOkF,EAAWlF,GAEpB,IAAIxB,EAAS,GACb,IAAK,IAAI9C,KAAO6B,OAAOyC,GACjBjC,EAAevB,KAAKwD,EAAQtE,IAAe,eAAPA,GACtC8C,EAAO3B,KAAKnB,GAGhB,OAAO8C,CACT,qCE3BA,IAAIc,EAAa9D,KACbsI,EAAWtI,YA+BfJ,GAJA,SAAqBC,GACnB,OAAgB,MAATA,GAAiByI,EAASzI,EAAMM,UAAY2D,EAAWjE,EAChE,qCC9BA,IAAI+J,EAAgB5J,KAChB6J,EAAW7J,KACX8J,EAAc9J,YAkClBJ,GAJA,SAAc4E,GACZ,OAAOsF,EAAYtF,GAAUoF,EAAcpF,GAAUqF,EAASrF,EAChE,qCClCA,IAAIpB,EAAWpD,KACXyJ,EAAczJ,KACd+J,cCiBJnK,GAVA,SAAsB4E,GACpB,IAAIxB,EAAS,GACb,GAAc,MAAVwB,EACF,IAAK,IAAItE,KAAO6B,OAAOyC,GACrBxB,EAAO3B,KAAKnB,GAGhB,OAAO8C,CACT,GDTIT,EAHcR,OAAOnB,UAGQ2B,sBAwBjC3C,GAfA,SAAoB4E,GAClB,IAAKpB,EAASoB,GACZ,OAAOuF,EAAavF,GAEtB,IAAIwF,EAAUP,EAAYjF,GACtBxB,EAAS,GAEb,IAAK,IAAI9C,KAAOsE,GACD,eAAPtE,IAAyB8J,GAAYzH,EAAevB,KAAKwD,EAAQtE,KACrE8C,EAAO3B,KAAKnB,GAGhB,OAAO8C,CACT,qCE9BA,IAAI4G,EAAgB5J,KAChBiK,EAAajK,KACb8J,EAAc9J,YA6BlBJ,GAJA,SAAgB4E,GACd,OAAOsF,EAAYtF,GAAUoF,EAAcpF,GAAQ,GAAQyF,EAAWzF,EACxE,2TC7BA,IAAItC,EAAOlC,KAGPyH,EAA4CC,IAAYA,EAAQC,UAAYD,EAG5EE,EAAaH,GAA4C7H,IAAWA,EAAO+H,UAAY/H,EAMvFiI,EAHgBD,GAAcA,EAAWF,UAAYD,EAG5BvF,EAAK2F,YAAS3G,EACvCgJ,EAAcrC,EAASA,EAAOqC,iBAAchJ,EAqBhDtB,EAAAA,QAXA,SAAqBuK,EAAQC,GAC3B,GAAIA,EACF,OAAOD,EAAOE,QAEhB,IAAIlK,EAASgK,EAAOhK,OAChB6C,EAASkH,EAAcA,EAAY/J,GAAU,IAAIgK,EAAOb,YAAYnJ,GAGxE,OADAgK,EAAOG,KAAKtH,GACLA,CACT,wDCbApD,GAXA,SAAmBiH,EAAQ5G,GACzB,IAAIa,GAAS,EACTX,EAAS0G,EAAO1G,OAGpB,IADAF,IAAUA,EAAQU,MAAMR,MACfW,EAAQX,GACfF,EAAMa,GAAS+F,EAAO/F,GAExB,OAAOb,CACT,4CCOAL,GAfA,SAAqBK,EAAOsK,GAM1B,IALA,IAAIzJ,GAAS,EACTX,EAAkB,MAATF,EAAgB,EAAIA,EAAME,OACnCqK,EAAW,EACXxH,EAAS,KAEJlC,EAAQX,GAAQ,CACvB,IAAIN,EAAQI,EAAMa,GACdyJ,EAAU1K,EAAOiB,EAAOb,KAC1B+C,EAAOwH,KAAc3K,EAEzB,CACA,OAAOmD,CACT,4CCAApD,GAJA,WACE,MAAO,EACT,qCCpBA,IAAI6K,EAAczK,KACd0K,EAAY1K,KAMZoH,EAHcrF,OAAOnB,UAGcwG,qBAGnCuD,EAAmB5I,OAAO6I,6BAmB9BhL,GAVkB+K,EAA+B,SAASnG,GACxD,OAAc,MAAVA,EACK,IAETA,EAASzC,OAAOyC,GACTiG,EAAYE,EAAiBnG,IAAS,SAASqG,GACpD,OAAOzD,EAAqBpG,KAAKwD,EAAQqG,EAC3C,IACF,EARqCH,4CCArC9K,GAXA,SAAmBK,EAAO6K,GAKxB,IAJA,IAAIhK,GAAS,EACTX,EAAS2K,EAAO3K,OAChB4K,EAAS9K,EAAME,SAEVW,EAAQX,GACfF,EAAM8K,EAASjK,GAASgK,EAAOhK,GAEjC,OAAOb,CACT,qCCjBA,IAGI+K,EAHUhL,IAGK2J,CAAQ5H,OAAOkJ,eAAgBlJ,eAElDnC,GAAiBoL,qCCLjB,IAAIE,EAAYlL,KACZgL,EAAehL,KACfmL,EAAanL,KACb0K,EAAY1K,KAGZ2K,EAAmB5I,OAAO6I,6BAkB9BhL,GAToB+K,EAA+B,SAASnG,GAE1D,IADA,IAAIxB,EAAS,GACNwB,GACL0G,EAAUlI,EAAQmI,EAAW3G,IAC7BA,EAASwG,EAAaxG,GAExB,OAAOxB,CACT,EAPuC0H,qCCfvC,IAAIQ,EAAYlL,KACZuH,EAAUvH,YAkBdJ,GALA,SAAwB4E,EAAQ4G,EAAUC,GACxC,IAAIrI,EAASoI,EAAS5G,GACtB,OAAO+C,EAAQ/C,GAAUxB,EAASkI,EAAUlI,EAAQqI,EAAY7G,GAClE,qCCjBA,IAAI8G,EAAiBtL,KACjBmL,EAAanL,KACbyD,EAAOzD,YAaXJ,GAJA,SAAoB4E,GAClB,OAAO8G,EAAe9G,EAAQf,EAAM0H,EACtC,qCCbA,IAIII,EAJYvL,IAIN0E,CAHC1E,KAGe,cAE1BJ,GAAiB2L,qCCNjB,IAAIC,kCCAJ,IAIIA,EAJYxL,IAID0E,CAHJ1E,KAGoB,mBAE/BJ,GAAiB4L,EDNFxL,GACXyE,EAAMzE,KACNyL,kCEFJ,IAIIA,EAJYzL,IAIF0E,CAHH1E,KAGmB,kBAE9BJ,GAAiB6L,EFJHzL,GACVuL,EAAMvL,KACN0L,kCGJJ,IAIIA,EAJY1L,IAIF0E,CAHH1E,KAGmB,kBAE9BJ,GAAiB8L,EHFH1L,GACVmD,EAAanD,KACbgE,EAAWhE,KAGX2L,EAAS,eAETC,EAAa,mBACbC,EAAS,eACTC,EAAa,mBAEbC,EAAc,oBAGdC,EAAqBhI,EAASwH,GAC9BS,EAAgBjI,EAASS,GACzByH,EAAoBlI,EAASyH,GAC7BU,EAAgBnI,EAASuH,GACzBa,EAAoBpI,EAAS0H,GAS7BW,EAASlJ,SAGRqI,GAAYa,EAAO,IAAIb,EAAS,IAAIc,YAAY,MAAQP,GACxDtH,GAAO4H,EAAO,IAAI5H,IAAQkH,GAC1BF,GAAWY,EAAOZ,EAAQc,YAAcX,GACxCL,GAAOc,EAAO,IAAId,IAAQM,GAC1BH,GAAWW,EAAO,IAAIX,IAAYI,KACrCO,EAAS,SAASxM,GAChB,IAAImD,EAASG,EAAWtD,GACpBwJ,EA/BQ,mBA+BDrG,EAAsBnD,EAAMyJ,iBAAcpI,EACjDsL,EAAanD,EAAOrF,EAASqF,GAAQ,GAEzC,GAAImD,EACF,OAAQA,GACN,KAAKR,EAAoB,OAAOD,EAChC,KAAKE,EAAe,OAAON,EAC3B,KAAKO,EAAmB,OAAON,EAC/B,KAAKO,EAAe,OAAON,EAC3B,KAAKO,EAAmB,OAAON,EAGnC,OAAO9I,IAIXpD,GAAiByM,qCIzDjB,IAGII,EAHOzM,KAGWyM,kBAEtB7M,GAAiB6M,qCCLjB,IAAIA,EAAazM,YAejBJ,GANA,SAA0B8M,GACxB,IAAI1J,EAAS,IAAI0J,EAAYpD,YAAYoD,EAAYC,YAErD,OADA,IAAIF,EAAWzJ,GAAQtB,IAAI,IAAI+K,EAAWC,IACnC1J,CACT,qCCbA,IAAI4J,EAAmB5M,YAevBJ,GALA,SAAyBiN,EAAYzC,GACnC,IAAID,EAASC,EAASwC,EAAiBC,EAAW1C,QAAU0C,EAAW1C,OACvE,OAAO,IAAI0C,EAAWvD,YAAYa,EAAQ0C,EAAWC,WAAYD,EAAW1M,OAC9E,qCCbA,IAAIyM,EAAmB5M,KACnB+M,kCCDJ,IAAIH,EAAmB5M,YAevBJ,GALA,SAAuBoN,EAAU5C,GAC/B,IAAID,EAASC,EAASwC,EAAiBI,EAAS7C,QAAU6C,EAAS7C,OACnE,OAAO,IAAI6C,EAAS1D,YAAYa,EAAQ6C,EAASF,WAAYE,EAASL,WACxE,EDZoB3M,GAChBiN,kCEDJ,IAAIC,EAAU,cAedtN,GANA,SAAqBuN,GACnB,IAAInK,EAAS,IAAImK,EAAO7D,YAAY6D,EAAOtG,OAAQqG,EAAQ1J,KAAK2J,IAEhE,OADAnK,EAAOoK,UAAYD,EAAOC,UACnBpK,CACT,EFZkBhD,GACdqN,kCGHJ,IAAIjL,EAASpC,KAGTsN,EAAclL,EAASA,EAAOxB,eAAYM,EAC1CqM,EAAgBD,EAAcA,EAAYE,aAAUtM,SAaxDtB,GAJA,SAAqBiL,GACnB,OAAO0C,EAAgBxL,OAAOwL,EAAcvM,KAAK6J,IAAW,EAC9D,EHZkB7K,GACdyN,EAAkBzN,YAwEtBJ,GApCA,SAAwB4E,EAAQ3B,EAAKuH,GACnC,IAAIf,EAAO7E,EAAO8E,YAClB,OAAQzG,GACN,IA3BiB,uBA4Bf,OAAO+J,EAAiBpI,GAE1B,IAvCU,mBAwCV,IAvCU,gBAwCR,OAAO,IAAI6E,GAAM7E,GAEnB,IAjCc,oBAkCZ,OAAOuI,EAAcvI,EAAQ4F,GAE/B,IAnCa,wBAmCI,IAlCJ,wBAmCb,IAlCU,qBAkCI,IAjCH,sBAiCkB,IAhClB,sBAiCX,IAhCW,sBAgCI,IA/BG,6BA+BmB,IA9BzB,uBA8ByC,IA7BzC,uBA8BV,OAAOqD,EAAgBjJ,EAAQ4F,GAEjC,IAjDS,eA2DT,IAxDS,eAyDP,OAAO,IAAIf,EARb,IAnDY,kBAoDZ,IAjDY,kBAkDV,OAAO,IAAIA,EAAK7E,GAElB,IAtDY,kBAuDV,OAAOyI,EAAYzI,GAKrB,IAzDY,kBA0DV,OAAO6I,EAAY7I,GAEzB,qCI1EA,IAAIpB,EAAWpD,KAGX0N,EAAe3L,OAAO4L,OAUtBC,EAAc,WAChB,SAASpJ,IAAU,CACnB,OAAO,SAASqJ,GACd,IAAKzK,EAASyK,GACZ,MAAO,GAET,GAAIH,EACF,OAAOA,EAAaG,GAEtBrJ,EAAO5D,UAAYiN,EACnB,IAAI7K,EAAS,IAAIwB,EAEjB,OADAA,EAAO5D,eAAYM,EACZ8B,EAEX,CAdkB,UAgBlBpD,GAAiBgO,qCC7BjB,IAAIA,EAAa5N,KACbgL,EAAehL,KACfyJ,EAAczJ,YAelBJ,GANA,SAAyB4E,GACvB,MAAqC,mBAAtBA,EAAO8E,aAA8BG,EAAYjF,GAE5D,CAAA,EADAoJ,EAAW5C,EAAaxG,GAE9B,qCCfA,IAAIsJ,kCCAJ,IAAIzB,EAASrM,KACTmH,EAAenH,YAgBnBJ,GAJA,SAAmBC,GACjB,OAAOsH,EAAatH,IAVT,gBAUmBwM,EAAOxM,EACvC,EDfgBG,GACZwI,EAAYxI,KACZkI,EAAWlI,KAGX+N,EAAY7F,GAAYA,EAAS8F,MAmBjCA,EAAQD,EAAYvF,EAAUuF,GAAaD,SAE/ClO,GAAiBoO,qCE1BjB,IAAIC,kCCAJ,IAAI5B,EAASrM,KACTmH,EAAenH,YAgBnBJ,GAJA,SAAmBC,GACjB,OAAOsH,EAAatH,IAVT,gBAUmBwM,EAAOxM,EACvC,EDfgBG,GACZwI,EAAYxI,KACZkI,EAAWlI,KAGXkO,EAAYhG,GAAYA,EAASiG,MAmBjCA,EAAQD,EAAY1F,EAAU0F,GAAaD,SAE/CrO,GAAiBuO,qCE1BjB,IAAI/H,EAAQpG,KACRoO,EAAYpO,KACZ4G,EAAc5G,KACdqO,kCCHJ,IAAIC,EAAatO,KACbyD,EAAOzD,YAeXJ,GAJA,SAAoB4E,EAAQqC,GAC1B,OAAOrC,GAAU8J,EAAWzH,EAAQpD,EAAKoD,GAASrC,EACpD,EDXiBxE,GACbuO,kCEJJ,IAAID,EAAatO,KACbwO,EAASxO,YAebJ,GAJA,SAAsB4E,EAAQqC,GAC5B,OAAOrC,GAAU8J,EAAWzH,EAAQ2H,EAAO3H,GAASrC,EACtD,EFVmBxE,GACfyO,EAAczO,KACd0O,EAAY1O,KACZ2O,kCGPJ,IAAIL,EAAatO,KACbmL,EAAanL,YAcjBJ,GAJA,SAAqBiH,EAAQrC,GAC3B,OAAO8J,EAAWzH,EAAQsE,EAAWtE,GAASrC,EAChD,EHNkBxE,GACd4O,kCIRJ,IAAIN,EAAatO,KACb6O,EAAe7O,YAcnBJ,GAJA,SAAuBiH,EAAQrC,GAC7B,OAAO8J,EAAWzH,EAAQgI,EAAahI,GAASrC,EAClD,EJLoBxE,GAChB8O,EAAa9O,KACb+O,kCKVJ,IAAIzD,EAAiBtL,KACjB6O,EAAe7O,KACfwO,EAASxO,YAcbJ,GAJA,SAAsB4E,GACpB,OAAO8G,EAAe9G,EAAQgK,EAAQK,EACxC,ELJmB7O,GACfqM,EAASrM,KACTgP,kCMXJ,IAGIzM,EAHcR,OAAOnB,UAGQ2B,sBAqBjC3C,GAZA,SAAwBK,GACtB,IAAIE,EAASF,EAAME,OACf6C,EAAS,IAAI/C,EAAMqJ,YAAYnJ,GAOnC,OAJIA,GAA6B,iBAAZF,EAAM,IAAkBsC,EAAevB,KAAKf,EAAO,WACtE+C,EAAOlC,MAAQb,EAAMa,MACrBkC,EAAOiM,MAAQhP,EAAMgP,OAEhBjM,CACT,ENXqBhD,GACjBkP,EAAiBlP,KACjBmP,EAAkBnP,KAClBuH,EAAUvH,KACV8H,EAAW9H,KACXgO,EAAQhO,KACRoD,EAAWpD,KACXmO,EAAQnO,KACRyD,EAAOzD,KACPwO,EAASxO,KAQToP,EAAU,qBAKVC,EAAU,oBAIVC,EAAY,kBAoBZC,EAAgB,CAAA,SACpBA,EAAcH,GAAWG,EA7BV,kBA8BfA,EAfqB,wBAeWA,EAdd,qBAelBA,EA9Bc,oBA8BWA,EA7BX,iBA8BdA,EAfiB,yBAeWA,EAdX,yBAejBA,EAdc,sBAcWA,EAbV,uBAcfA,EAbe,uBAaWA,EA5Bb,gBA6BbA,EA5BgB,mBA4BWA,EAAcD,GACzCC,EA3BgB,mBA2BWA,EA1Bd,gBA2BbA,EA1BgB,mBA0BWA,EAzBX,mBA0BhBA,EAhBe,uBAgBWA,EAfJ,8BAgBtBA,EAfgB,wBAeWA,EAdX,yBAcsC,EACtDA,EArCe,kBAqCWA,EAAcF,GACxCE,EA5BiB,qBA4BW,EA8F5B3P,GA5EA,SAAS4P,EAAU3P,EAAO4P,EAAS1I,EAAY7G,EAAKsE,EAAQkL,GAC1D,IAAI1M,EACAoH,EAnEgB,EAmEPqF,EACTE,EAnEgB,EAmEPF,EACTG,EAnEmB,EAmEVH,EAKb,GAHI1I,IACF/D,EAASwB,EAASuC,EAAWlH,EAAOK,EAAKsE,EAAQkL,GAAS3I,EAAWlH,SAExDqB,IAAX8B,EACF,OAAOA,EAET,IAAKI,EAASvD,GACZ,OAAOA,EAET,IAAIkJ,EAAQxB,EAAQ1H,GACpB,GAAIkJ,GAEF,GADA/F,EAASgM,EAAenP,IACnBuK,EACH,OAAOsE,EAAU7O,EAAOmD,OAErB,CACL,IAAIH,EAAMwJ,EAAOxM,GACbgQ,EAAShN,GAAOwM,GA7EX,8BA6EsBxM,EAE/B,GAAIiF,EAASjI,GACX,OAAO4O,EAAY5O,EAAOuK,GAE5B,GAAIvH,GAAOyM,GAAazM,GAAOuM,GAAYS,IAAWrL,GAEpD,GADAxB,EAAU2M,GAAUE,EAAU,CAAE,EAAGV,EAAgBtP,IAC9CuK,EACH,OAAOuF,EACHf,EAAc/O,EAAO0O,EAAavL,EAAQnD,IAC1C8O,EAAY9O,EAAOwO,EAAWrL,EAAQnD,QAEvC,CACL,IAAK0P,EAAc1M,GACjB,OAAO2B,EAAS3E,EAAQ,GAE1BmD,EAASkM,EAAerP,EAAOgD,EAAKuH,EACtC,CACF,CAEAsF,IAAUA,EAAQ,IAAItJ,GACtB,IAAI0J,EAAUJ,EAAM/N,IAAI9B,GACxB,GAAIiQ,EACF,OAAOA,EAETJ,EAAMhO,IAAI7B,EAAOmD,GAEbmL,EAAMtO,GACRA,EAAMkQ,SAAQ,SAASC,GACrBhN,EAAOiN,IAAIT,EAAUQ,EAAUP,EAAS1I,EAAYiJ,EAAUnQ,EAAO6P,GACvE,IACS1B,EAAMnO,IACfA,EAAMkQ,SAAQ,SAASC,EAAU9P,GAC/B8C,EAAOtB,IAAIxB,EAAKsP,EAAUQ,EAAUP,EAAS1I,EAAY7G,EAAKL,EAAO6P,GACvE,IAGF,IAII5I,EAAQiC,OAAQ7H,GAJL0O,EACVD,EAASZ,EAAeD,EACxBa,EAASnB,EAAS/K,GAEkB5D,GASzC,OARAuO,EAAUtH,GAASjH,GAAO,SAASmQ,EAAU9P,GACvC4G,IAEFkJ,EAAWnQ,EADXK,EAAM8P,IAIRpJ,EAAY5D,EAAQ9C,EAAKsP,EAAUQ,EAAUP,EAAS1I,EAAY7G,EAAKL,EAAO6P,GAChF,IACO1M,CACT,wCOnKA,IAAIwM,EAAYxP,YAmChBJ,GAJA,SAAeC,GACb,OAAO2P,EAAU3P,EA7BM,EA8BzB,4CCRAD,GANA,SAAkBC,GAChB,OAAO,WACL,OAAOA,EAEX,ynBCrBIqQ,+FCFJ,IAaIC,eCWJvQ,GAjBA,SAAuBwQ,GACrB,OAAO,SAAS5L,EAAQ6B,EAAU+E,GAMhC,IALA,IAAItK,GAAS,EACTuP,EAAWtO,OAAOyC,GAClBsC,EAAQsE,EAAS5G,GACjBrE,EAAS2G,EAAM3G,OAEZA,KAAU,CACf,IAAID,EAAM4G,EAAMsJ,EAAYjQ,IAAWW,GACvC,IAA+C,IAA3CuF,EAASgK,EAASnQ,GAAMA,EAAKmQ,GAC/B,KAEJ,CACA,OAAO7L,EAEX,aDPA5E,GAAiBuQ,qCEfjB,IAAIA,EAAUnQ,KACVyD,EAAOzD,YAcXJ,GAJA,SAAoB4E,EAAQ6B,GAC1B,OAAO7B,GAAU2L,EAAQ3L,EAAQ6B,EAAU5C,EAC7C,qCCbA,IAAI6M,EAAatQ,KAWbuQ,kCCXJ,IAAIzG,EAAc9J,YA+BlBJ,GArBA,SAAwB4Q,EAAUJ,GAChC,OAAO,SAASK,EAAYpK,GAC1B,GAAkB,MAAdoK,EACF,OAAOA,EAET,IAAK3G,EAAY2G,GACf,OAAOD,EAASC,EAAYpK,GAM9B,IAJA,IAAIlG,EAASsQ,EAAWtQ,OACpBW,EAAQsP,EAAYjQ,GAAU,EAC9BkQ,EAAWtO,OAAO0O,IAEdL,EAAYtP,MAAYA,EAAQX,KACa,IAA/CkG,EAASgK,EAASvP,GAAQA,EAAOuP,KAIvC,OAAOI,EAEX,ED5BqBzQ,EAUN0Q,CAAeJ,UAE9B1Q,GAAiB2Q,4CEOjB3Q,GAJA,SAAkBC,GAChB,OAAOA,CACT,qCClBA,IAAI8Q,EAAW3Q,YAafJ,GAJA,SAAsBC,GACpB,MAAuB,mBAATA,EAAsBA,EAAQ8Q,CAC9C,qCCXA,IAAIvC,EAAYpO,KACZuQ,EAAWvQ,KACX4Q,EAAe5Q,KACfuH,EAAUvH,YAqCdJ,GALA,SAAiB6Q,EAAYpK,GAE3B,OADWkB,EAAQkJ,GAAcrC,EAAYmC,GACjCE,EAAYG,EAAavK,GACvC,6CCtCAzG,EAAAA,QAAiBI,iDCAjB,IAAI4F,EAAW5F,KACX6Q,cCiBJjR,GALA,SAAqBC,GAEnB,OADAQ,KAAKC,SAASoB,IAAI7B,EAbC,6BAcZQ,IACT,GDdIyQ,cEWJlR,GAJA,SAAqBC,GACnB,OAAOQ,KAAKC,SAASsB,IAAI/B,EAC3B,GFCA,SAASkR,EAASjG,GAChB,IAAIhK,GAAS,EACTX,EAAmB,MAAV2K,EAAiB,EAAIA,EAAO3K,OAGzC,IADAE,KAAKC,SAAW,IAAIsF,IACX9E,EAAQX,GACfE,KAAK4P,IAAInF,EAAOhK,GAEpB,QAGAiQ,EAASnQ,UAAUqP,IAAMc,EAASnQ,UAAUS,KAAOwP,EACnDE,EAASnQ,UAAUgB,IAAMkP,EAEzBlR,GAAiBmR,4CGdjBnR,GAJA,SAAkBoR,EAAO9Q,GACvB,OAAO8Q,EAAMpP,IAAI1B,EACnB,qCCVA,IAAI6Q,EAAW/Q,KACXiR,cCqBJrR,GAZA,SAAmBK,EAAOsK,GAIxB,IAHA,IAAIzJ,GAAS,EACTX,EAAkB,MAATF,EAAgB,EAAIA,EAAME,SAE9BW,EAAQX,GACf,GAAIoK,EAAUtK,EAAMa,GAAQA,EAAOb,GACjC,OAAO,EAGX,OAAO,CACT,GDlBIiR,EAAWlR,YAiFfJ,GA9DA,SAAqBK,EAAOH,EAAO2P,EAAS1I,EAAYoK,EAAWzB,GACjE,IAAI0B,EAjBqB,EAiBT3B,EACZ4B,EAAYpR,EAAME,OAClBmR,EAAYxR,EAAMK,OAEtB,GAAIkR,GAAaC,KAAeF,GAAaE,EAAYD,GACvD,OAAO,EAGT,IAAIE,EAAa7B,EAAM/N,IAAI1B,GACvBuR,EAAa9B,EAAM/N,IAAI7B,GAC3B,GAAIyR,GAAcC,EAChB,OAAOD,GAAczR,GAAS0R,GAAcvR,EAE9C,IAAIa,GAAS,EACTkC,GAAS,EACTyO,EA/BuB,EA+BfhC,EAAoC,IAAIsB,OAAW7P,EAM/D,IAJAwO,EAAMhO,IAAIzB,EAAOH,GACjB4P,EAAMhO,IAAI5B,EAAOG,KAGRa,EAAQuQ,GAAW,CAC1B,IAAIK,EAAWzR,EAAMa,GACjB6Q,EAAW7R,EAAMgB,GAErB,GAAIiG,EACF,IAAI6K,EAAWR,EACXrK,EAAW4K,EAAUD,EAAU5Q,EAAOhB,EAAOG,EAAOyP,GACpD3I,EAAW2K,EAAUC,EAAU7Q,EAAOb,EAAOH,EAAO4P,GAE1D,QAAiBxO,IAAb0Q,EAAwB,CAC1B,GAAIA,EACF,SAEF5O,GAAS,EACT,KACF,CAEA,GAAIyO,GACF,IAAKR,EAAUnR,GAAO,SAAS6R,EAAUE,GACnC,IAAKX,EAASO,EAAMI,KACfH,IAAaC,GAAYR,EAAUO,EAAUC,EAAUlC,EAAS1I,EAAY2I,IAC/E,OAAO+B,EAAKpQ,KAAKwQ,EAErB,IAAI,CACN7O,GAAS,EACT,KACF,OACK,GACD0O,IAAaC,IACXR,EAAUO,EAAUC,EAAUlC,EAAS1I,EAAY2I,GACpD,CACL1M,GAAS,EACT,KACF,CACF,CAGA,OAFA0M,EAAc,OAAEzP,GAChByP,EAAc,OAAE5P,GACTkD,CACT,4CEhEApD,GAVA,SAAoB8B,GAClB,IAAIZ,GAAS,EACTkC,EAASrC,MAAMe,EAAInB,MAKvB,OAHAmB,EAAIqO,SAAQ,SAASlQ,GACnBmD,IAASlC,GAASjB,CACpB,IACOmD,CACT,qCCfA,IAAIZ,EAASpC,KACTyM,EAAazM,KACbD,EAAKC,KACL8R,EAAc9R,KACd+R,cCaJnS,GAVA,SAAoBuF,GAClB,IAAIrE,GAAS,EACTkC,EAASrC,MAAMwE,EAAI5E,MAKvB,OAHA4E,EAAI4K,SAAQ,SAASlQ,EAAOK,GAC1B8C,IAASlC,GAAS,CAACZ,EAAKL,EAC1B,IACOmD,CACT,GDVIgP,EAAahS,KAqBbsN,EAAclL,EAASA,EAAOxB,eAAYM,EAC1CqM,EAAgBD,EAAcA,EAAYE,aAAUtM,SAoFxDtB,GAjEA,SAAoB4E,EAAQ1E,EAAO+C,EAAK4M,EAAS1I,EAAYoK,EAAWzB,GACtE,OAAQ7M,GACN,IAzBc,oBA0BZ,GAAK2B,EAAOmI,YAAc7M,EAAM6M,YAC3BnI,EAAOsI,YAAchN,EAAMgN,WAC9B,OAAO,EAETtI,EAASA,EAAO2F,OAChBrK,EAAQA,EAAMqK,OAEhB,IAlCiB,uBAmCf,QAAK3F,EAAOmI,YAAc7M,EAAM6M,aAC3BwE,EAAU,IAAI1E,EAAWjI,GAAS,IAAIiI,EAAW3M,KAKxD,IAnDU,mBAoDV,IAnDU,gBAoDV,IAjDY,kBAoDV,OAAOC,GAAIyE,GAAS1E,GAEtB,IAxDW,iBAyDT,OAAO0E,EAAOyN,MAAQnS,EAAMmS,MAAQzN,EAAO0N,SAAWpS,EAAMoS,QAE9D,IAxDY,kBAyDZ,IAvDY,kBA2DV,OAAO1N,GAAW1E,EAAQ,GAE5B,IAjES,eAkEP,IAAIqS,EAAUJ,EAEhB,IAjES,eAkEP,IAAIX,EA5EiB,EA4EL3B,EAGhB,GAFA0C,IAAYA,EAAUH,GAElBxN,EAAOjE,MAAQT,EAAMS,OAAS6Q,EAChC,OAAO,EAGT,IAAItB,EAAUJ,EAAM/N,IAAI6C,GACxB,GAAIsL,EACF,OAAOA,GAAWhQ,EAEpB2P,GAtFuB,EAyFvBC,EAAMhO,IAAI8C,EAAQ1E,GAClB,IAAIkD,EAAS8O,EAAYK,EAAQ3N,GAAS2N,EAAQrS,GAAQ2P,EAAS1I,EAAYoK,EAAWzB,GAE1F,OADAA,EAAc,OAAElL,GACTxB,EAET,IAnFY,kBAoFV,GAAIuK,EACF,OAAOA,EAAcvM,KAAKwD,IAAW+I,EAAcvM,KAAKlB,GAG9D,OAAO,CACT,qCE7GA,IAAIsG,EAAQpG,KACR8R,EAAc9R,KACdoS,EAAapS,KACbqS,kCCHJ,IAAIvD,EAAa9O,KASbuC,EAHcR,OAAOnB,UAGQ2B,sBAgFjC3C,GAjEA,SAAsB4E,EAAQ1E,EAAO2P,EAAS1I,EAAYoK,EAAWzB,GACnE,IAAI0B,EAtBqB,EAsBT3B,EACZ6C,EAAWxD,EAAWtK,GACtB+N,EAAYD,EAASnS,OAIzB,GAAIoS,GAHWzD,EAAWhP,GACDK,SAEMiR,EAC7B,OAAO,EAGT,IADA,IAAItQ,EAAQyR,EACLzR,KAAS,CACd,IAAIZ,EAAMoS,EAASxR,GACnB,KAAMsQ,EAAYlR,KAAOJ,EAAQyC,EAAevB,KAAKlB,EAAOI,IAC1D,OAAO,CAEX,CAEA,IAAIsS,EAAa9C,EAAM/N,IAAI6C,GACvBgN,EAAa9B,EAAM/N,IAAI7B,GAC3B,GAAI0S,GAAchB,EAChB,OAAOgB,GAAc1S,GAAS0R,GAAchN,EAE9C,IAAIxB,GAAS,EACb0M,EAAMhO,IAAI8C,EAAQ1E,GAClB4P,EAAMhO,IAAI5B,EAAO0E,GAGjB,IADA,IAAIiO,EAAWrB,IACNtQ,EAAQyR,GAAW,CAE1B,IAAI5L,EAAWnC,EADftE,EAAMoS,EAASxR,IAEX6Q,EAAW7R,EAAMI,GAErB,GAAI6G,EACF,IAAI6K,EAAWR,EACXrK,EAAW4K,EAAUhL,EAAUzG,EAAKJ,EAAO0E,EAAQkL,GACnD3I,EAAWJ,EAAUgL,EAAUzR,EAAKsE,EAAQ1E,EAAO4P,GAGzD,UAAmBxO,IAAb0Q,EACGjL,IAAagL,GAAYR,EAAUxK,EAAUgL,EAAUlC,EAAS1I,EAAY2I,GAC7EkC,GACD,CACL5O,GAAS,EACT,KACF,CACAyP,IAAaA,EAAkB,eAAPvS,EAC1B,CACA,GAAI8C,IAAWyP,EAAU,CACvB,IAAIC,EAAUlO,EAAO8E,YACjBqJ,EAAU7S,EAAMwJ,YAGhBoJ,GAAWC,KACV,gBAAiBnO,MAAU,gBAAiB1E,IACzB,mBAAX4S,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvD3P,GAAS,EAEb,CAGA,OAFA0M,EAAc,OAAElL,GAChBkL,EAAc,OAAE5P,GACTkD,CACT,EDpFmBhD,GACfqM,EAASrM,KACTuH,EAAUvH,KACV8H,EAAW9H,KACX0I,EAAe1I,KAMfoP,EAAU,qBACVwD,EAAW,iBACXtD,EAAY,kBAMZ/M,EAHcR,OAAOnB,UAGQ2B,sBA6DjC3C,GA7CA,SAAyB4E,EAAQ1E,EAAO2P,EAAS1I,EAAYoK,EAAWzB,GACtE,IAAImD,EAAWtL,EAAQ/C,GACnBsO,EAAWvL,EAAQzH,GACnBiT,EAASF,EAAWD,EAAWvG,EAAO7H,GACtCwO,EAASF,EAAWF,EAAWvG,EAAOvM,GAKtCmT,GAHJF,EAASA,GAAU3D,EAAUE,EAAYyD,IAGhBzD,EACrB4D,GAHJF,EAASA,GAAU5D,EAAUE,EAAY0D,IAGhB1D,EACrB6D,EAAYJ,GAAUC,EAE1B,GAAIG,GAAarL,EAAStD,GAAS,CACjC,IAAKsD,EAAShI,GACZ,OAAO,EAET+S,GAAW,EACXI,GAAW,CACb,CACA,GAAIE,IAAcF,EAEhB,OADAvD,IAAUA,EAAQ,IAAItJ,GACdyM,GAAYnK,EAAalE,GAC7BsN,EAAYtN,EAAQ1E,EAAO2P,EAAS1I,EAAYoK,EAAWzB,GAC3D0C,EAAW5N,EAAQ1E,EAAOiT,EAAQtD,EAAS1I,EAAYoK,EAAWzB,GAExE,KArDyB,EAqDnBD,GAAiC,CACrC,IAAI2D,EAAeH,GAAY1Q,EAAevB,KAAKwD,EAAQ,eACvD6O,EAAeH,GAAY3Q,EAAevB,KAAKlB,EAAO,eAE1D,GAAIsT,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAe5O,EAAO3E,QAAU2E,EAC/C+O,EAAeF,EAAevT,EAAMD,QAAUC,EAGlD,OADA4P,IAAUA,EAAQ,IAAItJ,GACf+K,EAAUmC,EAAcC,EAAc9D,EAAS1I,EAAY2I,EACpE,CACF,CACA,QAAKyD,IAGLzD,IAAUA,EAAQ,IAAItJ,GACfiM,EAAa7N,EAAQ1E,EAAO2P,EAAS1I,EAAYoK,EAAWzB,GACrE,qCEhFA,IAAI8D,EAAkBxT,KAClBmH,EAAenH,YA0BnBJ,GAVA,SAAS6T,EAAY5T,EAAOC,EAAO2P,EAAS1I,EAAY2I,GACtD,OAAI7P,IAAUC,IAGD,MAATD,GAA0B,MAATC,IAAmBqH,EAAatH,KAAWsH,EAAarH,GACpED,GAAUA,GAASC,GAAUA,EAE/B0T,EAAgB3T,EAAOC,EAAO2P,EAAS1I,EAAY0M,EAAa/D,GACzE,wCCzBA,IAAItM,EAAWpD,YAcfJ,GAJA,SAA4BC,GAC1B,OAAOA,GAAUA,IAAUuD,EAASvD,EACtC,4CCOAD,GAVA,SAAiCM,EAAKwT,GACpC,OAAO,SAASlP,GACd,OAAc,MAAVA,IAGGA,EAAOtE,KAASwT,SACPxS,IAAbwS,GAA2BxT,KAAO6B,OAAOyC,KAEhD,qCCjBA,IAAImP,kCCAJ,IAAIvN,EAAQpG,KACRyT,EAAczT,YA4DlBJ,GA5CA,SAAqB4E,EAAQqC,EAAQ+M,EAAW7M,GAC9C,IAAIjG,EAAQ8S,EAAUzT,OAClBA,EAASW,EACT+S,GAAgB9M,EAEpB,GAAc,MAAVvC,EACF,OAAQrE,EAGV,IADAqE,EAASzC,OAAOyC,GACT1D,KAAS,CACd,IAAID,EAAO+S,EAAU9S,GACrB,GAAK+S,GAAgBhT,EAAK,GAClBA,EAAK,KAAO2D,EAAO3D,EAAK,MACtBA,EAAK,KAAM2D,GAEnB,OAAO,CAEX,CACA,OAAS1D,EAAQX,GAAQ,CAEvB,IAAID,GADJW,EAAO+S,EAAU9S,IACF,GACX6F,EAAWnC,EAAOtE,GAClBwT,EAAW7S,EAAK,GAEpB,GAAIgT,GAAgBhT,EAAK,IACvB,QAAiBK,IAAbyF,KAA4BzG,KAAOsE,GACrC,OAAO,MAEJ,CACL,IAAIkL,EAAQ,IAAItJ,EAChB,GAAIW,EACF,IAAI/D,EAAS+D,EAAWJ,EAAU+M,EAAUxT,EAAKsE,EAAQqC,EAAQ6I,GAEnE,UAAiBxO,IAAX8B,EACEyQ,EAAYC,EAAU/M,EAAUmN,EAA+C/M,EAAY2I,GAC3F1M,GAEN,OAAO,CAEX,CACF,CACA,OAAO,CACT,ED3DkBhD,GACd+T,kCEDJ,IAAIC,EAAqBhU,KACrByD,EAAOzD,YAsBXJ,GAbA,SAAsB4E,GAIpB,IAHA,IAAIxB,EAASS,EAAKe,GACdrE,EAAS6C,EAAO7C,OAEbA,KAAU,CACf,IAAID,EAAM8C,EAAO7C,GACbN,EAAQ2E,EAAOtE,GAEnB8C,EAAO7C,GAAU,CAACD,EAAKL,EAAOmU,EAAmBnU,GACnD,CACA,OAAOmD,CACT,EFpBmBhD,GACfiU,EAA0BjU,YAmB9BJ,GAVA,SAAqBiH,GACnB,IAAI+M,EAAYG,EAAalN,GAC7B,OAAwB,GAApB+M,EAAUzT,QAAeyT,EAAU,GAAG,GACjCK,EAAwBL,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAASpP,GACd,OAAOA,IAAWqC,GAAU8M,EAAYnP,EAAQqC,EAAQ+M,GAE5D,qCGnBA,IAAIzQ,EAAanD,KACbmH,EAAenH,YA2BnBJ,GALA,SAAkBC,GAChB,MAAuB,iBAATA,GACXsH,EAAatH,IArBF,mBAqBYsD,EAAWtD,EACvC,qCC1BA,IAAI0H,EAAUvH,KACVkU,EAAWlU,KAGXmU,EAAe,mDACfC,EAAgB,eAuBpBxU,GAbA,SAAeC,EAAO2E,GACpB,GAAI+C,EAAQ1H,GACV,OAAO,EAET,IAAIqD,SAAcrD,EAClB,QAAY,UAARqD,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATrD,IAAiBqU,EAASrU,MAGvBuU,EAAc9P,KAAKzE,KAAWsU,EAAa7P,KAAKzE,IAC1C,MAAV2E,GAAkB3E,KAASkC,OAAOyC,GACvC,qCC1BA,IAAI6P,kCCAJ,IAAIzO,EAAW5F,KAiDf,SAASqU,EAAQ1Q,EAAM2Q,GACrB,GAAmB,mBAAR3Q,GAAmC,MAAZ2Q,GAAuC,mBAAZA,EAC3D,MAAM,IAAIC,UAhDQ,uBAkDpB,IAAIC,EAAW,WACb,IAAIC,EAAOnN,UACPpH,EAAMoU,EAAWA,EAASI,MAAMrU,KAAMoU,GAAQA,EAAK,GACnDzD,EAAQwD,EAASxD,MAErB,GAAIA,EAAMpP,IAAI1B,GACZ,OAAO8Q,EAAMrP,IAAIzB,GAEnB,IAAI8C,EAASW,EAAK+Q,MAAMrU,KAAMoU,GAE9B,OADAD,EAASxD,MAAQA,EAAMtP,IAAIxB,EAAK8C,IAAWgO,EACpChO,GAGT,OADAwR,EAASxD,MAAQ,IAAKqD,EAAQM,OAAS/O,GAChC4O,CACT,QAGAH,EAAQM,MAAQ/O,EAEhBhG,GAAiByU,EDxEHrU,UAyBdJ,GAZA,SAAuB+D,GACrB,IAAIX,EAASqR,EAAQ1Q,GAAM,SAASzD,GAIlC,OAfmB,MAYf8Q,EAAMzQ,MACRyQ,EAAMxP,QAEDtB,CACT,IAEI8Q,EAAQhO,EAAOgO,MACnB,OAAOhO,CACT,4CEHApD,GAXA,SAAkBK,EAAOoG,GAKvB,IAJA,IAAIvF,GAAS,EACTX,EAAkB,MAATF,EAAgB,EAAIA,EAAME,OACnC6C,EAASrC,MAAMR,KAEVW,EAAQX,GACf6C,EAAOlC,GAASuF,EAASpG,EAAMa,GAAQA,EAAOb,GAEhD,OAAO+C,CACT,qCClBA,IAAI4R,kCCAJ,IAAIxS,EAASpC,KACT6U,EAAW7U,KACXuH,EAAUvH,KACVkU,EAAWlU,KAMXsN,EAAclL,EAASA,EAAOxB,eAAYM,EAC1C4T,EAAiBxH,EAAcA,EAAY7K,cAAWvB,SA0B1DtB,GAhBA,SAASgV,EAAa/U,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI0H,EAAQ1H,GAEV,OAAOgV,EAAShV,EAAO+U,GAAgB,GAEzC,GAAIV,EAASrU,GACX,OAAOiV,EAAiBA,EAAe9T,KAAKnB,GAAS,GAEvD,IAAImD,EAAUnD,EAAQ,GACtB,MAAkB,KAAVmD,GAAkB,EAAInD,IAAU,IAAa,KAAOmD,CAC9D,KDlCmBhD,UA2BnBJ,GAJA,SAAkBC,GAChB,OAAgB,MAATA,EAAgB,GAAK+U,EAAa/U,EAC3C,qCEzBA,IAAI0H,EAAUvH,KACV+U,EAAQ/U,KACRgV,kCCFJ,IAAIC,EAAgBjV,KAGhBkV,EAAa,mGAGbC,EAAe,WASfH,EAAeC,GAAc,SAAS3P,GACxC,IAAItC,EAAS,GAOb,OAN6B,KAAzBsC,EAAO8P,WAAW,IACpBpS,EAAO3B,KAAK,IAEdiE,EAAOjB,QAAQ6Q,GAAY,SAASG,EAAOC,EAAQC,EAAOC,GACxDxS,EAAO3B,KAAKkU,EAAQC,EAAUnR,QAAQ8Q,EAAc,MAASG,GAAUD,EACzE,IACOrS,CACT,WAEApD,GAAiBoV,EDxBEhV,GACfyC,EAAWzC,YAiBfJ,GAPA,SAAkBC,EAAO2E,GACvB,OAAI+C,EAAQ1H,GACHA,EAEFkV,EAAMlV,EAAO2E,GAAU,CAAC3E,GAASmV,EAAavS,EAAS5C,GAChE,qCElBA,IAAIqU,EAAWlU,YAoBfJ,GARA,SAAeC,GACb,GAAoB,iBAATA,GAAqBqU,EAASrU,GACvC,OAAOA,EAET,IAAImD,EAAUnD,EAAQ,GACtB,MAAkB,KAAVmD,GAAkB,EAAInD,IAAU,IAAa,KAAOmD,CAC9D,qCClBA,IAAIyS,EAAWzV,KACX0V,EAAQ1V,YAsBZJ,GAZA,SAAiB4E,EAAQmR,GAMvB,IAHA,IAAI7U,EAAQ,EACRX,GAHJwV,EAAOF,EAASE,EAAMnR,IAGJrE,OAED,MAAVqE,GAAkB1D,EAAQX,GAC/BqE,EAASA,EAAOkR,EAAMC,EAAK7U,OAE7B,OAAQA,GAASA,GAASX,EAAUqE,OAAStD,CAC/C,qCCrBA,IAAIuU,EAAWzV,KACXqH,EAAcrH,KACduH,EAAUvH,KACV6I,EAAU7I,KACVsI,EAAWtI,KACX0V,EAAQ1V,YAiCZJ,GAtBA,SAAiB4E,EAAQmR,EAAMC,GAO7B,IAJA,IAAI9U,GAAS,EACTX,GAHJwV,EAAOF,EAASE,EAAMnR,IAGJrE,OACd6C,GAAS,IAEJlC,EAAQX,GAAQ,CACvB,IAAID,EAAMwV,EAAMC,EAAK7U,IACrB,KAAMkC,EAAmB,MAAVwB,GAAkBoR,EAAQpR,EAAQtE,IAC/C,MAEFsE,EAASA,EAAOtE,EAClB,CACA,OAAI8C,KAAYlC,GAASX,EAChB6C,KAET7C,EAAmB,MAAVqE,EAAiB,EAAIA,EAAOrE,SAClBmI,EAASnI,IAAW0I,EAAQ3I,EAAKC,KACjDoH,EAAQ/C,IAAW6C,EAAY7C,GACpC,qCCpCA,IAAIqR,cCYJjW,GAJA,SAAmB4E,EAAQtE,GACzB,OAAiB,MAAVsE,GAAkBtE,KAAO6B,OAAOyC,EACzC,GDTIsR,EAAU9V,YAgCdJ,GAJA,SAAe4E,EAAQmR,GACrB,OAAiB,MAAVnR,GAAkBsR,EAAQtR,EAAQmR,EAAME,EACjD,qCE/BA,IAAIpC,EAAczT,KACd2B,kCCDJ,IAAIoU,EAAU/V,YAgCdJ,GALA,SAAa4E,EAAQmR,EAAMK,GACzB,IAAIhT,EAAmB,MAAVwB,OAAiBtD,EAAY6U,EAAQvR,EAAQmR,GAC1D,YAAkBzU,IAAX8B,EAAuBgT,EAAehT,CAC/C,ED7BUhD,GACNiW,EAAQjW,KACR+U,EAAQ/U,KACRgU,EAAqBhU,KACrBiU,EAA0BjU,KAC1B0V,EAAQ1V,YA0BZJ,GAZA,SAA6B+V,EAAMjC,GACjC,OAAIqB,EAAMY,IAAS3B,EAAmBN,GAC7BO,EAAwByB,EAAMC,GAAOjC,GAEvC,SAASlP,GACd,IAAImC,EAAWhF,EAAI6C,EAAQmR,GAC3B,YAAqBzU,IAAbyF,GAA0BA,IAAa+M,EAC3CuC,EAAMzR,EAAQmR,GACdlC,EAAYC,EAAU/M,EAAUmN,GAExC,4CEjBAlU,GANA,SAAsBM,GACpB,OAAO,SAASsE,GACd,OAAiB,MAAVA,OAAiBtD,EAAYsD,EAAOtE,GAE/C,qCCXA,IAAIgW,EAAelW,KACfmW,kCCDJ,IAAIJ,EAAU/V,YAedJ,GANA,SAA0B+V,GACxB,OAAO,SAASnR,GACd,OAAOuR,EAAQvR,EAAQmR,GAE3B,EDZuB3V,GACnB+U,EAAQ/U,KACR0V,EAAQ1V,YA4BZJ,GAJA,SAAkB+V,GAChB,OAAOZ,EAAMY,GAAQO,EAAaR,EAAMC,IAASQ,EAAiBR,EACpE,qCE7BA,IAAIS,EAAcpW,KACdqW,EAAsBrW,KACtB2Q,EAAW3Q,KACXuH,EAAUvH,KACVsW,EAAWtW,YA0BfJ,GAjBA,SAAsBC,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACK8Q,EAEW,iBAAT9Q,EACF0H,EAAQ1H,GACXwW,EAAoBxW,EAAM,GAAIA,EAAM,IACpCuW,EAAYvW,GAEXyW,EAASzW,EAClB,qCC5BA,IAAI4K,EAAczK,KACduW,kCCDJ,IAAIhG,EAAWvQ,YAoBfJ,GAVA,SAAoB6Q,EAAYlG,GAC9B,IAAIvH,EAAS,GAMb,OALAuN,EAASE,GAAY,SAAS5Q,EAAOiB,EAAO2P,GACtClG,EAAU1K,EAAOiB,EAAO2P,IAC1BzN,EAAO3B,KAAKxB,EAEhB,IACOmD,CACT,EDjBiBhD,GACbwW,EAAexW,KACfuH,EAAUvH,YAgDdJ,GALA,SAAgB6Q,EAAYlG,GAE1B,OADWhD,EAAQkJ,GAAchG,EAAc8L,GACnC9F,EAAY+F,EAAajM,EAAW,GAClD,qCEjDA,IAAIkM,kCCCJ,IAGIlU,EAHcR,OAAOnB,UAGQ2B,sBAcjC3C,GAJA,SAAiB4E,EAAQtE,GACvB,OAAiB,MAAVsE,GAAkBjC,EAAevB,KAAKwD,EAAQtE,EACvD,EDhBcF,GACV8V,EAAU9V,YAiCdJ,GAJA,SAAa4E,EAAQmR,GACnB,OAAiB,MAAVnR,GAAkBsR,EAAQtR,EAAQmR,EAAMc,EACjD,qCEhCA,IAAI5M,EAAW7J,KACXqM,EAASrM,KACTqH,EAAcrH,KACduH,EAAUvH,KACV8J,EAAc9J,KACd8H,EAAW9H,KACXyJ,EAAczJ,KACd0I,EAAe1I,KAUfuC,EAHcR,OAAOnB,UAGQ2B,sBA2DjC3C,GAxBA,SAAiBC,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIiK,EAAYjK,KACX0H,EAAQ1H,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAMa,QAC1DoH,EAASjI,IAAU6I,EAAa7I,IAAUwH,EAAYxH,IAC1D,OAAQA,EAAMM,OAEhB,IAAI0C,EAAMwJ,EAAOxM,GACjB,GApDW,gBAoDPgD,GAnDO,gBAmDUA,EACnB,OAAQhD,EAAMU,KAEhB,GAAIkJ,EAAY5J,GACd,OAAQgK,EAAShK,GAAOM,OAE1B,IAAK,IAAID,KAAOL,EACd,GAAI0C,EAAevB,KAAKnB,EAAOK,GAC7B,OAAO,EAGX,OAAO,CACT,4CCrDAN,GAJA,SAAqBC,GACnB,YAAiBqB,IAAVrB,CACT,qCCnBA,IAAI0Q,EAAWvQ,KACX8J,EAAc9J,YAoBlBJ,GAVA,SAAiB6Q,EAAYpK,GAC3B,IAAIvF,GAAS,EACTkC,EAAS8G,EAAY2G,GAAc9P,MAAM8P,EAAWtQ,QAAU,GAKlE,OAHAoQ,EAASE,GAAY,SAAS5Q,EAAOK,EAAKuQ,GACxCzN,IAASlC,GAASuF,EAASxG,EAAOK,EAAKuQ,EACzC,IACOzN,CACT,qCCnBA,IAAI6R,EAAW7U,KACXwW,EAAexW,KACf0W,EAAU1W,KACVuH,EAAUvH,YAiDdJ,GALA,SAAa6Q,EAAYpK,GAEvB,OADWkB,EAAQkJ,GAAcoE,EAAW6B,GAChCjG,EAAY+F,EAAanQ,EAAU,GACjD,qCClDA,IAAIsQ,cCyBJ/W,GAbA,SAAqBK,EAAOoG,EAAUuQ,EAAaC,GACjD,IAAI/V,GAAS,EACTX,EAAkB,MAATF,EAAgB,EAAIA,EAAME,OAKvC,IAHI0W,GAAa1W,IACfyW,EAAc3W,IAAQa,MAEfA,EAAQX,GACfyW,EAAcvQ,EAASuQ,EAAa3W,EAAMa,GAAQA,EAAOb,GAE3D,OAAO2W,CACT,GDtBIrG,EAAWvQ,KACXwW,EAAexW,KACf8W,cEmBJlX,GATA,SAAoB6Q,EAAYpK,EAAUuQ,EAAaC,EAAWrG,GAMhE,OALAA,EAASC,GAAY,SAAS5Q,EAAOiB,EAAO2P,GAC1CmG,EAAcC,GACTA,GAAY,EAAOhX,GACpBwG,EAASuQ,EAAa/W,EAAOiB,EAAO2P,EAC1C,IACOmG,CACT,GFhBIrP,EAAUvH,YA8CdJ,GAPA,SAAgB6Q,EAAYpK,EAAUuQ,GACpC,IAAIjT,EAAO4D,EAAQkJ,GAAckG,EAAcG,EAC3CD,EAAYvP,UAAUnH,OAAS,EAEnC,OAAOwD,EAAK8M,EAAY+F,EAAanQ,EAAU,GAAIuQ,EAAaC,EAAWtG,EAC7E,wCGhDA,IAAIwG,kCCAJ,IASIA,EATe/W,IASHkW,CAAa,iBAE7BtW,GAAiBmX,EDXD/W,GACZgX,kCEAJ,IAWIC,EAAe7S,OAAO,8FAa1BxE,GAJA,SAAoB0F,GAClB,OAAO2R,EAAa3S,KAAKgB,EAC3B,EFtBiBtF,GACbkX,kCGDJ,IAAIC,EAAgB,kBAQhBC,EAAW,IAAMD,EAAgB,IACjCE,EAAU,kDACVC,EAAS,2BAETC,EAAc,KAAOJ,EAAgB,IACrCK,EAAa,kCACbC,EAAa,qCAIbC,EAPa,MAAQL,EAAU,IAAMC,EAO1BK,KACXC,EAAW,oBAEXC,EAAQD,EAAWF,EADP,gBAAwB,CAACH,EAAaC,EAAYC,GAAYK,KAAK,KAAO,IAAMF,EAAWF,EAAW,KAElHK,EAAW,MAAQ,CAACR,EAAcF,EAAU,IAAKA,EAASG,EAAYC,EAAYL,GAAUU,KAAK,KAAO,IAGxGE,EAAY5T,OAAOkT,EAAS,MAAQA,EAAS,KAAOS,EAAWF,EAAO,YAiB1EjY,GARA,SAAqB0F,GAEnB,IADA,IAAItC,EAASgV,EAAU5K,UAAY,EAC5B4K,EAAU1T,KAAKgB,MAClBtC,EAEJ,OAAOA,CACT,EHvCkBhD,UAelBJ,GANA,SAAoB0F,GAClB,OAAO0R,EAAW1R,GACd4R,EAAY5R,GACZyR,EAAUzR,EAChB,qCIfA,IAAIuE,EAAW7J,KACXqM,EAASrM,KACT8J,EAAc9J,KACdiY,kCCHJ,IAAI9U,EAAanD,KACbuH,EAAUvH,KACVmH,EAAenH,YA2BnBJ,GALA,SAAkBC,GAChB,MAAuB,iBAATA,IACV0H,EAAQ1H,IAAUsH,EAAatH,IArBrB,mBAqB+BsD,EAAWtD,EAC1D,EDxBeG,GACXkY,EAAalY,YAyCjBJ,GAdA,SAAc6Q,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAI3G,EAAY2G,GACd,OAAOwH,EAASxH,GAAcyH,EAAWzH,GAAcA,EAAWtQ,OAEpE,IAAI0C,EAAMwJ,EAAOoE,GACjB,MAhCW,gBAgCP5N,GA/BO,gBA+BUA,EACZ4N,EAAWlQ,KAEbsJ,EAAS4G,GAAYtQ,MAC9B,qCE3CA,IAAIiO,EAAYpO,KACZ4N,EAAa5N,KACbsQ,EAAatQ,KACbwW,EAAexW,KACfgL,EAAehL,KACfuH,EAAUvH,KACV8H,EAAW9H,KACX8D,EAAa9D,KACboD,EAAWpD,KACX0I,EAAe1I,YAuDnBJ,GAvBA,SAAmB4E,EAAQ6B,EAAUuQ,GACnC,IAAI7N,EAAQxB,EAAQ/C,GAChB2T,EAAYpP,GAASjB,EAAStD,IAAWkE,EAAalE,GAG1D,GADA6B,EAAWmQ,EAAanQ,EAAU,GACf,MAAfuQ,EAAqB,CACvB,IAAIvN,EAAO7E,GAAUA,EAAO8E,YAE1BsN,EADEuB,EACYpP,EAAQ,IAAIM,EAAO,GAE1BjG,EAASoB,IACFV,EAAWuF,GAAQuE,EAAW5C,EAAaxG,IAG3C,CAAA,CAElB,CAIA,OAHC2T,EAAY/J,EAAYkC,GAAY9L,GAAQ,SAAS3E,EAAOiB,EAAO0D,GAClE,OAAO6B,EAASuQ,EAAa/W,EAAOiB,EAAO0D,EAC7C,IACOoS,CACT,qCC9DA,IAAI1L,EAAYlL,KACZoY,kCCDJ,IAAIhW,EAASpC,KACTqH,EAAcrH,KACduH,EAAUvH,KAGVqY,EAAmBjW,EAASA,EAAOkW,wBAAqBpX,SAc5DtB,GALA,SAAuBC,GACrB,OAAO0H,EAAQ1H,IAAUwH,EAAYxH,OAChCwY,GAAoBxY,GAASA,EAAMwY,GAC1C,EDhBoBrY,UAoCpBJ,GAvBA,SAAS2Y,EAAYtY,EAAOuY,EAAOjO,EAAWkO,EAAUzV,GACtD,IAAIlC,GAAS,EACTX,EAASF,EAAME,OAKnB,IAHAoK,IAAcA,EAAY6N,GAC1BpV,IAAWA,EAAS,MAEXlC,EAAQX,GAAQ,CACvB,IAAIN,EAAQI,EAAMa,GACd0X,EAAQ,GAAKjO,EAAU1K,GACrB2Y,EAAQ,EAEVD,EAAY1Y,EAAO2Y,EAAQ,EAAGjO,EAAWkO,EAAUzV,GAEnDkI,EAAUlI,EAAQnD,GAEV4Y,IACVzV,EAAOA,EAAO7C,QAAUN,EAE5B,CACA,OAAOmD,CACT,wCEnCA,IAAI0R,cCoBJ9U,GAVA,SAAe+D,EAAM+U,EAASjE,GAC5B,OAAQA,EAAKtU,QACX,KAAK,EAAG,OAAOwD,EAAK3C,KAAK0X,GACzB,KAAK,EAAG,OAAO/U,EAAK3C,KAAK0X,EAASjE,EAAK,IACvC,KAAK,EAAG,OAAO9Q,EAAK3C,KAAK0X,EAASjE,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAO9Q,EAAK3C,KAAK0X,EAASjE,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAO9Q,EAAK+Q,MAAMgE,EAASjE,EAC7B,GDfIkE,EAAYC,KAAKC,WAgCrBjZ,GArBA,SAAkB+D,EAAMmV,EAAOvP,GAE7B,OADAuP,EAAQH,OAAoBzX,IAAV4X,EAAuBnV,EAAKxD,OAAS,EAAK2Y,EAAO,GAC5D,WAML,IALA,IAAIrE,EAAOnN,UACPxG,GAAS,EACTX,EAASwY,EAAUlE,EAAKtU,OAAS2Y,EAAO,GACxC7Y,EAAQU,MAAMR,KAETW,EAAQX,GACfF,EAAMa,GAAS2T,EAAKqE,EAAQhY,GAE9BA,GAAS,EAET,IADA,IAAIiY,EAAYpY,MAAMmY,EAAQ,KACrBhY,EAAQgY,GACfC,EAAUjY,GAAS2T,EAAK3T,GAG1B,OADAiY,EAAUD,GAASvP,EAAUtJ,GACtByU,EAAM/Q,EAAMtD,KAAM0Y,GAE7B,wCEjCA,IAAIC,kCCAJ,IAAIC,EAAWjZ,KACXsG,EAAiBtG,KACjB2Q,EAAW3Q,YAmBfJ,GATuB0G,EAA4B,SAAS3C,EAAM2B,GAChE,OAAOgB,EAAe3C,EAAM,WAAY,CACtC4C,cAAgB,EAChBC,YAAc,EACd3G,MAASoZ,EAAS3T,GAClBmB,UAAY,GAEhB,EAPwCkK,EDZlB3Q,GAClBkZ,kCEAJ,IAIIC,EAAYC,KAAKC,WA+BrBzZ,GApBA,SAAkB+D,GAChB,IAAI2V,EAAQ,EACRC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQL,IACRM,EApBO,IAoBiBD,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMH,GAzBI,IA0BR,OAAOhS,UAAU,QAGnBgS,EAAQ,EAEV,OAAO3V,EAAK+Q,WAAMxT,EAAWoG,WAEjC,KFjCetH,GAUX0Z,EAAcR,EAASF,UAE3BpZ,GAAiB8Z,qCGbjB,IAAI/I,EAAW3Q,KACX2Z,EAAW3Z,KACX0Z,EAAc1Z,YAclBJ,GAJA,SAAkB+D,EAAMmV,GACtB,OAAOY,EAAYC,EAAShW,EAAMmV,EAAOnI,GAAWhN,EAAO,GAC7D,4CCSA/D,GAZA,SAAuBK,EAAOsK,EAAWqP,EAAWxJ,GAIlD,IAHA,IAAIjQ,EAASF,EAAME,OACfW,EAAQ8Y,GAAaxJ,EAAY,GAAK,GAElCA,EAAYtP,MAAYA,EAAQX,GACtC,GAAIoK,EAAUtK,EAAMa,GAAQA,EAAOb,GACjC,OAAOa,EAGX,OAAQ,CACV,qCCrBA,IAAI+Y,EAAgB7Z,KAChB8Z,cCUJla,GAJA,SAAmBC,GACjB,OAAOA,GAAUA,CACnB,GDPIka,cEoBJna,GAZA,SAAuBK,EAAOJ,EAAO+Z,GAInC,IAHA,IAAI9Y,EAAQ8Y,EAAY,EACpBzZ,EAASF,EAAME,SAEVW,EAAQX,GACf,GAAIF,EAAMa,KAAWjB,EACnB,OAAOiB,EAGX,OAAQ,CACV,UFDAlB,GANA,SAAqBK,EAAOJ,EAAO+Z,GACjC,OAAO/Z,GAAUA,EACbka,EAAc9Z,EAAOJ,EAAO+Z,GAC5BC,EAAc5Z,EAAO6Z,EAAWF,EACtC,qCGjBA,IAAIrO,EAAMvL,KACNga,cCeJpa,GAJA,WACE,GDXEoS,EAAahS,KAYbia,EAAc1O,GAAQ,EAAIyG,EAAW,IAAIzG,EAAI,CAAE,EAAC,KAAK,IAT1C,IASoE,SAAST,GAC1F,OAAO,IAAIS,EAAIT,EACjB,EAF4EkP,SAI5Epa,GAAiBqa,qCElBjB,IAAIlJ,EAAW/Q,KACXka,kCCDJ,IAAIC,EAAcna,YAgBlBJ,GALA,SAAuBK,EAAOJ,GAE5B,QADsB,MAATI,IAAoBA,EAAME,SACpBga,EAAYla,EAAOJ,EAAO,IAAM,CACrD,EDboBG,GAChBoa,cEmBJxa,GAZA,SAA2BK,EAAOJ,EAAOwa,GAIvC,IAHA,IAAIvZ,GAAS,EACTX,EAAkB,MAATF,EAAgB,EAAIA,EAAME,SAE9BW,EAAQX,GACf,GAAIka,EAAWxa,EAAOI,EAAMa,IAC1B,OAAO,EAGX,OAAO,CACT,GFhBIoQ,EAAWlR,KACXia,EAAYja,KACZgS,EAAahS,YAkEjBJ,GApDA,SAAkBK,EAAOoG,EAAUgU,GACjC,IAAIvZ,GAAS,EACTwZ,EAAWJ,EACX/Z,EAASF,EAAME,OACfoa,GAAW,EACXvX,EAAS,GACTyO,EAAOzO,EAEX,GAAIqX,EACFE,GAAW,EACXD,EAAWF,OAER,GAAIja,GAvBY,IAuBgB,CACnC,IAAIuB,EAAM2E,EAAW,KAAO4T,EAAUha,GACtC,GAAIyB,EACF,OAAOsQ,EAAWtQ,GAEpB6Y,GAAW,EACXD,EAAWpJ,EACXO,EAAO,IAAIV,CACb,MAEEU,EAAOpL,EAAW,GAAKrD,EAEzBwX,EACA,OAAS1Z,EAAQX,GAAQ,CACvB,IAAIN,EAAQI,EAAMa,GACd2Z,EAAWpU,EAAWA,EAASxG,GAASA,EAG5C,GADAA,EAASwa,GAAwB,IAAVxa,EAAeA,EAAQ,EAC1C0a,GAAYE,GAAaA,EAAU,CAErC,IADA,IAAIC,EAAYjJ,EAAKtR,OACdua,KACL,GAAIjJ,EAAKiJ,KAAeD,EACtB,SAASD,EAGTnU,GACFoL,EAAKpQ,KAAKoZ,GAEZzX,EAAO3B,KAAKxB,EACb,MACSya,EAAS7I,EAAMgJ,EAAUJ,KAC7B5I,IAASzO,GACXyO,EAAKpQ,KAAKoZ,GAEZzX,EAAO3B,KAAKxB,GAEhB,CACA,OAAOmD,CACT,qCGrEA,IAAI8G,EAAc9J,KACdmH,EAAenH,YA+BnBJ,GAJA,SAA2BC,GACzB,OAAOsH,EAAatH,IAAUiK,EAAYjK,EAC5C,qCC9BA,IAAI0Y,EAAcvY,KACd2a,EAAW3a,KACX4a,EAAW5a,KACX6a,EAAoB7a,KAkBpB8a,EAAQH,GAAS,SAASI,GAC5B,OAAOH,EAASrC,EAAYwC,EAAQ,EAAGF,GAAmB,GAC5D,WAEAjb,GAAiBkb,qCCzBjB,IAAIE,kCCAJ,IAAInG,EAAW7U,YAkBfJ,GANA,SAAoB4E,EAAQsC,GAC1B,OAAO+N,EAAS/N,GAAO,SAAS5G,GAC9B,OAAOsE,EAAOtE,EAChB,GACF,EDhBiBF,GACbyD,EAAOzD,YAgCXJ,GAJA,SAAgB4E,GACd,OAAiB,MAAVA,EAAiB,GAAKwW,EAAWxW,EAAQf,EAAKe,GACvD,gCE7BA,IAAIyW,OAGF,IACEA,EAAS,CACPC,MAAOlb,KACPiZ,SAAUjZ,KACVmb,KAAMnb,KACNob,OAAQpb,KACR4B,IAAM5B,KACNuH,QAASvH,KACTqb,QAASrb,KACT8D,WAAY9D,KACZsb,YAAatb,KACbyD,KAAMzD,KACNmF,IAAKnF,KACLub,OAAQvb,KACRO,KAAMP,KACNuJ,UAAWvJ,KACX8a,MAAO9a,KACP8K,OAAQ9K,KAEX,CAAC,MAAO+C,GACP,QAICkY,IACHA,EAASO,OAAOC,GAGlB7b,GAAiBqb,qCC/BjB,IAAIQ,EAAIzb,KAEM0b,GAAGC,EAEjB,IAAIC,EAAoB,KACpBC,EAAa,KACbC,EAAiB,IAYrB,SAASH,EAAMI,GACb1b,KAAK2b,aAAcP,EAAE7Z,IAAIma,EAAM,aAAcA,EAAKE,SAClD5b,KAAK6b,gBAAgBT,EAAE7Z,IAAIma,EAAM,eAAgBA,EAAKI,WACtD9b,KAAK+b,cAAcX,EAAE7Z,IAAIma,EAAM,aAAcA,EAAKM,SAGlDhc,KAAKic,YAASpb,EAGdb,KAAKkc,oBAAsBd,EAAExC,cAAS/X,GAGtCb,KAAKmc,oBAAsBf,EAAExC,cAAS/X,GAGtCb,KAAKoc,OAAS,GAEVpc,KAAK+b,cAEP/b,KAAKqc,QAAU,GAGfrc,KAAKsc,UAAY,GACjBtc,KAAKsc,UAAUd,GAAc,IAI/Bxb,KAAKuc,IAAM,GAGXvc,KAAKwc,OAAS,GAGdxc,KAAKyc,KAAO,GAGZzc,KAAK0c,MAAQ,GAGb1c,KAAK2c,UAAY,GAGjB3c,KAAK4c,YAAc,EACrB,CA2aA,SAASC,EAAqB/X,EAAKgY,GAC7BhY,EAAIgY,GACNhY,EAAIgY,KAEJhY,EAAIgY,GAAK,CAEb,CAEA,SAASC,EAAuBjY,EAAKgY,KAC5BhY,EAAIgY,WAAahY,EAAIgY,EAC9B,CAEA,SAASE,EAAaC,EAAYC,EAAIC,EAAIvL,GACxC,IAAIwL,EAAI,GAAKF,EACTG,EAAI,GAAKF,EACb,IAAKF,GAAcG,EAAIC,EAAG,CACxB,IAAIC,EAAMF,EACVA,EAAIC,EACJA,EAAIC,CACN,CACA,OAAOF,EAAI3B,EAAiB4B,EAAI5B,GACpBL,EAAEH,YAAYrJ,GAAQ2J,EAAoB3J,EACxD,CAiBA,SAAS2L,EAAYN,EAAYO,GAC/B,OAAOR,EAAaC,EAAYO,EAAQJ,EAAGI,EAAQH,EAAGG,EAAQ5L,KAChE,QAjdA0J,EAAM/a,UAAUkd,WAAa,EAG7BnC,EAAM/a,UAAUmd,WAAa,EAK7BpC,EAAM/a,UAAU0c,WAAa,WAC3B,OAAOjd,KAAK2b,WACd,EAEAL,EAAM/a,UAAUod,aAAe,WAC7B,OAAO3d,KAAK6b,aACd,EAEAP,EAAM/a,UAAUqd,WAAa,WAC3B,OAAO5d,KAAK+b,WACd,EAEAT,EAAM/a,UAAUsd,SAAW,SAASC,GAElC,OADA9d,KAAKic,OAAS6B,EACP9d,IACT,EAEAsb,EAAM/a,UAAU8a,MAAQ,WACtB,OAAOrb,KAAKic,MACd,EAKAX,EAAM/a,UAAUwd,oBAAsB,SAASC,GAK7C,OAJK5C,EAAE3X,WAAWua,KAChBA,EAAa5C,EAAExC,SAASoF,IAE1Bhe,KAAKkc,oBAAsB8B,EACpBhe,IACT,EAEAsb,EAAM/a,UAAU0d,UAAY,WAC1B,OAAOje,KAAKyd,UACd,EAEAnC,EAAM/a,UAAU2d,MAAQ,WACtB,OAAO9C,EAAEhY,KAAKpD,KAAKoc,OACrB,EAEAd,EAAM/a,UAAU4d,QAAU,WACxB,IAAIvc,EAAO5B,KACX,OAAOob,EAAEL,OAAO/a,KAAKke,SAAS,SAASd,GACrC,OAAOhC,EAAEJ,QAAQpZ,EAAK2a,IAAIa,GAC5B,GACF,EAEA9B,EAAM/a,UAAU6d,MAAQ,WACtB,IAAIxc,EAAO5B,KACX,OAAOob,EAAEL,OAAO/a,KAAKke,SAAS,SAASd,GACrC,OAAOhC,EAAEJ,QAAQpZ,EAAK6a,KAAKW,GAC7B,GACF,EAEA9B,EAAM/a,UAAU8d,SAAW,SAASC,EAAI9e,GACtC,IAAI4U,EAAOnN,UACPrF,EAAO5B,KAQX,OAPAob,EAAEN,KAAKwD,GAAI,SAASlB,GACdhJ,EAAKtU,OAAS,EAChB8B,EAAK2c,QAAQnB,EAAG5d,GAEhBoC,EAAK2c,QAAQnB,EAEjB,IACOpd,IACT,EAEAsb,EAAM/a,UAAUge,QAAU,SAASnB,EAAG5d,GACpC,OAAI4b,EAAE7Z,IAAIvB,KAAKoc,OAAQgB,IACjBnW,UAAUnH,OAAS,IACrBE,KAAKoc,OAAOgB,GAAK5d,GAEZQ,OAGTA,KAAKoc,OAAOgB,GAAKnW,UAAUnH,OAAS,EAAIN,EAAQQ,KAAKkc,oBAAoBkB,GACrEpd,KAAK+b,cACP/b,KAAKqc,QAAQe,GAAK5B,EAClBxb,KAAKsc,UAAUc,GAAK,GACpBpd,KAAKsc,UAAUd,GAAY4B,IAAK,GAElCpd,KAAKuc,IAAIa,GAAK,GACdpd,KAAKwc,OAAOY,GAAK,GACjBpd,KAAKyc,KAAKW,GAAK,GACfpd,KAAK0c,MAAMU,GAAK,KACdpd,KAAKyd,WACAzd,KACT,EAEAsb,EAAM/a,UAAUie,KAAO,SAASpB,GAC9B,OAAOpd,KAAKoc,OAAOgB,EACrB,EAEA9B,EAAM/a,UAAUke,QAAU,SAASrB,GACjC,OAAOhC,EAAE7Z,IAAIvB,KAAKoc,OAAQgB,EAC5B,EAEA9B,EAAM/a,UAAUme,WAAc,SAAStB,GACrC,IAAIxb,EAAO5B,KACX,GAAIob,EAAE7Z,IAAIvB,KAAKoc,OAAQgB,GAAI,CACzB,IAAIuB,EAAa,SAASjc,GAAKd,EAAK+c,WAAW/c,EAAK+a,UAAUja,YACvD1C,KAAKoc,OAAOgB,GACfpd,KAAK+b,cACP/b,KAAK4e,4BAA4BxB,UAC1Bpd,KAAKqc,QAAQe,GACpBhC,EAAEN,KAAK9a,KAAK6e,SAASzB,IAAI,SAAS0B,GAChCld,EAAKmd,UAAUD,EACjB,WACO9e,KAAKsc,UAAUc,IAExBhC,EAAEN,KAAKM,EAAEhY,KAAKpD,KAAKuc,IAAIa,IAAKuB,UACrB3e,KAAKuc,IAAIa,UACTpd,KAAKwc,OAAOY,GACnBhC,EAAEN,KAAKM,EAAEhY,KAAKpD,KAAKyc,KAAKW,IAAKuB,UACtB3e,KAAKyc,KAAKW,UACVpd,KAAK0c,MAAMU,KAChBpd,KAAKyd,UACT,CACA,OAAOzd,IACT,EAEAsb,EAAM/a,UAAUwe,UAAY,SAAS3B,EAAG4B,GACtC,IAAKhf,KAAK+b,YACR,MAAM,IAAIkD,MAAM,6CAGlB,GAAI7D,EAAEH,YAAY+D,GAChBA,EAASxD,MACJ,CAGL,IAAK,IAAI0D,EADTF,GAAU,IAEP5D,EAAEH,YAAYiE,GACfA,EAAWlf,KAAKgf,OAAOE,GACvB,GAAIA,IAAa9B,EACf,MAAM,IAAI6B,MAAM,WAAaD,EAAQ,iBAAmB5B,EACxC,yBAIpBpd,KAAKue,QAAQS,EACf,CAMA,OAJAhf,KAAKue,QAAQnB,GACbpd,KAAK4e,4BAA4BxB,GACjCpd,KAAKqc,QAAQe,GAAK4B,EAClBhf,KAAKsc,UAAU0C,GAAQ5B,IAAK,EACrBpd,IACT,EAEAsb,EAAM/a,UAAUqe,4BAA8B,SAASxB,UAC9Cpd,KAAKsc,UAAUtc,KAAKqc,QAAQe,IAAIA,EACzC,EAEA9B,EAAM/a,UAAUye,OAAS,SAAS5B,GAChC,GAAIpd,KAAK+b,YAAa,CACpB,IAAIiD,EAAShf,KAAKqc,QAAQe,GAC1B,GAAI4B,IAAWxD,EACb,OAAOwD,CAEX,CACF,EAEA1D,EAAM/a,UAAUse,SAAW,SAASzB,GAKlC,GAJIhC,EAAEH,YAAYmC,KAChBA,EAAI5B,GAGFxb,KAAK+b,YAAa,CACpB,IAAI8C,EAAW7e,KAAKsc,UAAUc,GAC9B,GAAIyB,EACF,OAAOzD,EAAEhY,KAAKyb,EAElB,KAAO,IAAIzB,IAAM5B,EACf,OAAOxb,KAAKke,QACP,GAAIle,KAAKye,QAAQrB,GACtB,MAAO,EACT,CACF,EAEA9B,EAAM/a,UAAU4e,aAAe,SAAS/B,GACtC,IAAIgC,EAASpf,KAAKwc,OAAOY,GACzB,GAAIgC,EACF,OAAOhE,EAAEhY,KAAKgc,EAElB,EAEA9D,EAAM/a,UAAU8e,WAAa,SAASjC,GACpC,IAAIkC,EAAQtf,KAAK0c,MAAMU,GACvB,GAAIkC,EACF,OAAOlE,EAAEhY,KAAKkc,EAElB,EAEAhE,EAAM/a,UAAUgf,UAAY,SAASnC,GACnC,IAAIoC,EAAQxf,KAAKmf,aAAa/B,GAC9B,GAAIoC,EACF,OAAOpE,EAAEX,MAAM+E,EAAOxf,KAAKqf,WAAWjC,GAE1C,EAEA9B,EAAM/a,UAAUkf,OAAS,SAAUrC,GAOjC,OAA4B,KALxBpd,KAAKid,aACKjd,KAAKqf,WAAWjC,GAEhBpd,KAAKuf,UAAUnC,IAEZtd,MACnB,EAEAwb,EAAM/a,UAAUmf,YAAc,SAAS3E,GACrC,IAAI9Q,EAAO,IAAIjK,KAAKiJ,YAAY,CAC9B2S,SAAU5b,KAAK2b,YACfG,WAAY9b,KAAK6b,cACjBG,SAAUhc,KAAK+b,cAGjB9R,EAAK4T,SAAS7d,KAAKqb,SAEnB,IAAIzZ,EAAO5B,KACXob,EAAEN,KAAK9a,KAAKoc,QAAQ,SAAS5c,EAAO4d,GAC9BrC,EAAOqC,IACTnT,EAAKsU,QAAQnB,EAAG5d,EAEpB,IAEA4b,EAAEN,KAAK9a,KAAK2c,WAAW,SAASja,GAC1BuH,EAAKwU,QAAQ/b,EAAE0a,IAAMnT,EAAKwU,QAAQ/b,EAAE2a,IACtCpT,EAAK0V,QAAQjd,EAAGd,EAAKge,KAAKld,GAE9B,IAEA,IAAImd,EAAU,CAAA,EACd,SAASC,EAAW1C,GAClB,IAAI4B,EAASpd,EAAKod,OAAO5B,GACzB,YAAevc,IAAXme,GAAwB/U,EAAKwU,QAAQO,IACvCa,EAAQzC,GAAK4B,EACNA,GACEA,KAAUa,EACZA,EAAQb,GAERc,EAAWd,EAEtB,CAQA,OANIhf,KAAK+b,aACPX,EAAEN,KAAK7Q,EAAKiU,SAAS,SAASd,GAC5BnT,EAAK8U,UAAU3B,EAAG0C,EAAW1C,GAC/B,IAGKnT,CACT,EAIAqR,EAAM/a,UAAUwf,oBAAsB,SAAS/B,GAK7C,OAJK5C,EAAE3X,WAAWua,KAChBA,EAAa5C,EAAExC,SAASoF,IAE1Bhe,KAAKmc,oBAAsB6B,EACpBhe,IACT,EAEAsb,EAAM/a,UAAUyf,UAAY,WAC1B,OAAOhgB,KAAK0d,UACd,EAEApC,EAAM/a,UAAU0f,MAAQ,WACtB,OAAO7E,EAAE3Q,OAAOzK,KAAK2c,UACvB,EAEArB,EAAM/a,UAAU2f,QAAU,SAAS5B,EAAI9e,GACrC,IAAIoC,EAAO5B,KACPoU,EAAOnN,UASX,OARAmU,EAAEF,OAAOoD,GAAI,SAASlB,EAAGC,GAMvB,OALIjJ,EAAKtU,OAAS,EAChB8B,EAAK+d,QAAQvC,EAAGC,EAAG7d,GAEnBoC,EAAK+d,QAAQvC,EAAGC,GAEXA,CACT,IACOrd,IACT,EAMAsb,EAAM/a,UAAUof,QAAU,WACxB,IAAIvC,EAAGC,EAAGzL,EAAMpS,EACZ2gB,GAAiB,EACjBC,EAAOnZ,UAAU,GAED,iBAATmZ,GAA8B,OAATA,GAAiB,MAAOA,GACtDhD,EAAIgD,EAAKhD,EACTC,EAAI+C,EAAK/C,EACTzL,EAAOwO,EAAKxO,KACa,IAArB3K,UAAUnH,SACZN,EAAQyH,UAAU,GAClBkZ,GAAiB,KAGnB/C,EAAIgD,EACJ/C,EAAIpW,UAAU,GACd2K,EAAO3K,UAAU,GACbA,UAAUnH,OAAS,IACrBN,EAAQyH,UAAU,GAClBkZ,GAAiB,IAIrB/C,EAAI,GAAKA,EACTC,EAAI,GAAKA,EACJjC,EAAEH,YAAYrJ,KACjBA,EAAO,GAAKA,GAGd,IAAIlP,EAAIsa,EAAahd,KAAK2b,YAAayB,EAAGC,EAAGzL,GAC7C,GAAIwJ,EAAE7Z,IAAIvB,KAAK4c,YAAala,GAI1B,OAHIyd,IACFngB,KAAK4c,YAAYla,GAAKlD,GAEjBQ,KAGT,IAAKob,EAAEH,YAAYrJ,KAAU5R,KAAK6b,cAChC,MAAM,IAAIoD,MAAM,qDAKlBjf,KAAKue,QAAQnB,GACbpd,KAAKue,QAAQlB,GAEbrd,KAAK4c,YAAYla,GAAKyd,EAAiB3gB,EAAQQ,KAAKmc,oBAAoBiB,EAAGC,EAAGzL,GAE9E,IAAI4L,EAqGN,SAAuBP,EAAYC,EAAIC,EAAIvL,GACzC,IAAIwL,EAAI,GAAKF,EACTG,EAAI,GAAKF,EACb,IAAKF,GAAcG,EAAIC,EAAG,CACxB,IAAIC,EAAMF,EACVA,EAAIC,EACJA,EAAIC,CACN,CACA,IAAIE,EAAW,CAAEJ,EAAGA,EAAGC,EAAGA,GACtBzL,IACF4L,EAAQ5L,KAAOA,GAEjB,OAAO4L,CACT,CAlHgB6C,CAAcrgB,KAAK2b,YAAayB,EAAGC,EAAGzL,GAYpD,OAVAwL,EAAII,EAAQJ,EACZC,EAAIG,EAAQH,EAEZ3b,OAAO4e,OAAO9C,GACdxd,KAAK2c,UAAUja,GAAK8a,EACpBX,EAAqB7c,KAAKwc,OAAOa,GAAID,GACrCP,EAAqB7c,KAAK0c,MAAMU,GAAIC,GACpCrd,KAAKuc,IAAIc,GAAG3a,GAAK8a,EACjBxd,KAAKyc,KAAKW,GAAG1a,GAAK8a,EAClBxd,KAAK0d,aACE1d,IACT,EAEAsb,EAAM/a,UAAUqf,KAAO,SAASxC,EAAGC,EAAGzL,GACpC,IAAIlP,EAA0B,IAArBuE,UAAUnH,OACfyd,EAAYvd,KAAK2b,YAAa1U,UAAU,IACxC+V,EAAahd,KAAK2b,YAAayB,EAAGC,EAAGzL,GACzC,OAAO5R,KAAK4c,YAAYla,EAC1B,EAEA4Y,EAAM/a,UAAUggB,QAAU,SAASnD,EAAGC,EAAGzL,GACvC,IAAIlP,EAA0B,IAArBuE,UAAUnH,OACfyd,EAAYvd,KAAK2b,YAAa1U,UAAU,IACxC+V,EAAahd,KAAK2b,YAAayB,EAAGC,EAAGzL,GACzC,OAAOwJ,EAAE7Z,IAAIvB,KAAK4c,YAAala,EACjC,EAEA4Y,EAAM/a,UAAUoe,WAAa,SAASvB,EAAGC,EAAGzL,GAC1C,IAAIlP,EAA0B,IAArBuE,UAAUnH,OACfyd,EAAYvd,KAAK2b,YAAa1U,UAAU,IACxC+V,EAAahd,KAAK2b,YAAayB,EAAGC,EAAGzL,GACrCgO,EAAO5f,KAAK2c,UAAUja,GAY1B,OAXIkd,IACFxC,EAAIwC,EAAKxC,EACTC,EAAIuC,EAAKvC,SACFrd,KAAK4c,YAAYla,UACjB1C,KAAK2c,UAAUja,GACtBqa,EAAuB/c,KAAKwc,OAAOa,GAAID,GACvCL,EAAuB/c,KAAK0c,MAAMU,GAAIC,UAC/Brd,KAAKuc,IAAIc,GAAG3a,UACZ1C,KAAKyc,KAAKW,GAAG1a,GACpB1C,KAAK0d,cAEA1d,IACT,EAEAsb,EAAM/a,UAAUigB,QAAU,SAASpD,EAAGqD,GACpC,IAAIC,EAAM1gB,KAAKuc,IAAIa,GACnB,GAAIsD,EAAK,CACP,IAAIT,EAAQ7E,EAAE3Q,OAAOiW,GACrB,OAAKD,EAGErF,EAAEL,OAAOkF,GAAO,SAASL,GAAQ,OAAOA,EAAKxC,IAAMqD,CAAG,IAFpDR,CAGX,CACF,EAEA3E,EAAM/a,UAAUogB,SAAW,SAASvD,EAAGC,GACrC,IAAIuD,EAAO5gB,KAAKyc,KAAKW,GACrB,GAAIwD,EAAM,CACR,IAAIX,EAAQ7E,EAAE3Q,OAAOmW,GACrB,OAAKvD,EAGEjC,EAAEL,OAAOkF,GAAO,SAASL,GAAQ,OAAOA,EAAKvC,IAAMA,CAAG,IAFpD4C,CAGX,CACF,EAEA3E,EAAM/a,UAAUsgB,UAAY,SAASzD,EAAGC,GACtC,IAAImD,EAAUxgB,KAAKwgB,QAAQpD,EAAGC,GAC9B,GAAImD,EACF,OAAOA,EAAQM,OAAO9gB,KAAK2gB,SAASvD,EAAGC,GAE3C,sCCveA9d,GAAiB,CACf+b,MAAO3b,KACPohB,oBCHFxhB,GAAiB,8CCAjB,IAAI6b,EAAIzb,KACJ2b,EAAQ3b,KAuBZ,SAASqhB,EAAWC,GAClB,OAAO7F,EAAEtW,IAAImc,EAAE/C,SAAS,SAASd,GAC/B,IAAI8D,EAAYD,EAAEzC,KAAKpB,GACnB4B,EAASiC,EAAEjC,OAAO5B,GAClBoB,EAAO,CAAEpB,EAAGA,GAOhB,OANKhC,EAAEH,YAAYiG,KACjB1C,EAAKhf,MAAQ0hB,GAEV9F,EAAEH,YAAY+D,KACjBR,EAAKQ,OAASA,GAETR,CACT,GACF,CAEA,SAAS2C,EAAWF,GAClB,OAAO7F,EAAEtW,IAAImc,EAAEhB,SAAS,SAASvd,GAC/B,IAAI0e,EAAYH,EAAErB,KAAKld,GACnBkd,EAAO,CAAExC,EAAG1a,EAAE0a,EAAGC,EAAG3a,EAAE2a,GAO1B,OANKjC,EAAEH,YAAYvY,EAAEkP,QACnBgO,EAAKhO,KAAOlP,EAAEkP,MAEXwJ,EAAEH,YAAYmG,KACjBxB,EAAKpgB,MAAQ4hB,GAERxB,CACT,GACF,QAhDArgB,GAAiB,CACf8hB,MAIF,SAAeJ,GACb,IAAIK,EAAO,CACTC,QAAS,CACP3F,SAAUqF,EAAEhE,aACZnB,WAAYmF,EAAEtD,eACd3B,SAAUiF,EAAErD,cAEdM,MAAO8C,EAAWC,GAClBhB,MAAOkB,EAAWF,IAEf7F,EAAEH,YAAYgG,EAAE5F,WACnBiG,EAAK9hB,MAAQ4b,EAAEP,MAAMoG,EAAE5F,UAEzB,OAAOiG,CACT,EAjBEE,KAgDF,SAAcF,GACZ,IAAIL,EAAI,IAAI3F,EAAMgG,EAAKC,SAAS1D,SAASyD,EAAK9hB,OAU9C,OATA4b,EAAEN,KAAKwG,EAAKpD,OAAO,SAAS9c,GAC1B6f,EAAE1C,QAAQnd,EAAMgc,EAAGhc,EAAM5B,OACrB4B,EAAM4d,QACRiC,EAAElC,UAAU3d,EAAMgc,EAAGhc,EAAM4d,OAE/B,IACA5D,EAAEN,KAAKwG,EAAKrB,OAAO,SAAS7e,GAC1B6f,EAAEtB,QAAQ,CAAEvC,EAAGhc,EAAMgc,EAAGC,EAAGjc,EAAMic,EAAGzL,KAAMxQ,EAAMwQ,MAAQxQ,EAAM5B,MAChE,IACOyhB,CACT,sCCjEA,IAAI7F,EAAIzb,YAEM8hB,GAEd,SAAoBR,GAClB,IAEIS,EAFAC,EAAU,CAAA,EACVC,EAAQ,GAGZ,SAASC,EAAIzE,GACPhC,EAAE7Z,IAAIogB,EAASvE,KACnBuE,EAAQvE,IAAK,EACbsE,EAAK1gB,KAAKoc,GACVhC,EAAEN,KAAKmG,EAAE5B,WAAWjC,GAAIyE,GACxBzG,EAAEN,KAAKmG,EAAE9B,aAAa/B,GAAIyE,GAC5B,CAUA,OARAzG,EAAEN,KAAKmG,EAAE/C,SAAS,SAASd,GACzBsE,EAAO,GACPG,EAAIzE,GACAsE,EAAK5hB,QACP8hB,EAAM5gB,KAAK0gB,EAEf,IAEOE,CACT,wCC1BA,IAAIxG,EAAIzb,KAWR,SAASmiB,IACP9hB,KAAK+hB,KAAO,GACZ/hB,KAAKgiB,YAAc,EACrB,QAZcC,GAAGH,EAiBjBA,EAAcvhB,UAAUL,KAAO,WAC7B,OAAOF,KAAK+hB,KAAKjiB,MACnB,EAKAgiB,EAAcvhB,UAAU6C,KAAO,WAC7B,OAAOpD,KAAK+hB,KAAKjd,KAAI,SAASod,GAAK,OAAOA,EAAEriB,GAAK,GACnD,EAKAiiB,EAAcvhB,UAAUgB,IAAM,SAAS1B,GACrC,OAAOub,EAAE7Z,IAAIvB,KAAKgiB,YAAaniB,EACjC,EAQAiiB,EAAcvhB,UAAU4hB,SAAW,SAAStiB,GAC1C,IAAIY,EAAQT,KAAKgiB,YAAYniB,GAC7B,QAAcgB,IAAVJ,EACF,OAAOT,KAAK+hB,KAAKthB,GAAO0hB,QAE5B,EAMAL,EAAcvhB,UAAU6hB,IAAM,WAC5B,GAAoB,IAAhBpiB,KAAKE,OACP,MAAM,IAAI+e,MAAM,mBAElB,OAAOjf,KAAK+hB,KAAK,GAAGliB,GACtB,EAUAiiB,EAAcvhB,UAAUqP,IAAM,SAAS/P,EAAKsiB,GAC1C,IAAIE,EAAariB,KAAKgiB,YAEtB,GADAniB,EAAMkJ,OAAOlJ,IACRub,EAAE7Z,IAAI8gB,EAAYxiB,GAAM,CAC3B,IAAIyiB,EAAMtiB,KAAK+hB,KACXthB,EAAQ6hB,EAAIxiB,OAIhB,OAHAuiB,EAAWxiB,GAAOY,EAClB6hB,EAAIthB,KAAK,CAACnB,IAAKA,EAAKsiB,SAAUA,IAC9BniB,KAAKuiB,UAAU9hB,IACR,CACT,CACA,OAAO,CACT,EAKAqhB,EAAcvhB,UAAUiiB,UAAY,WAClCxiB,KAAKyiB,MAAM,EAAGziB,KAAK+hB,KAAKjiB,OAAS,GACjC,IAAIsiB,EAAMpiB,KAAK+hB,KAAKrhB,MAGpB,cAFOV,KAAKgiB,YAAYI,EAAIviB,KAC5BG,KAAK0iB,SAAS,GACPN,EAAIviB,GACb,EASAiiB,EAAcvhB,UAAUoiB,SAAW,SAAS9iB,EAAKsiB,GAC/C,IAAI1hB,EAAQT,KAAKgiB,YAAYniB,GAC7B,GAAIsiB,EAAWniB,KAAK+hB,KAAKthB,GAAO0hB,SAC9B,MAAM,IAAIlD,MAAM,uDACFpf,EAAM,SAAWG,KAAK+hB,KAAKthB,GAAO0hB,SAAW,SAAWA,GAExEniB,KAAK+hB,KAAKthB,GAAO0hB,SAAWA,EAC5BniB,KAAKuiB,UAAU9hB,EACjB,EAEAqhB,EAAcvhB,UAAUmiB,SAAW,SAASE,GAC1C,IAAIN,EAAMtiB,KAAK+hB,KACXc,EAAI,EAAID,EACRE,EAAID,EAAI,EACRE,EAAUH,EACVC,EAAIP,EAAIxiB,SACVijB,EAAUT,EAAIO,GAAGV,SAAWG,EAAIS,GAASZ,SAAWU,EAAIE,EACpDD,EAAIR,EAAIxiB,SACVijB,EAAUT,EAAIQ,GAAGX,SAAWG,EAAIS,GAASZ,SAAWW,EAAIC,GAEtDA,IAAYH,IACd5iB,KAAKyiB,MAAMG,EAAGG,GACd/iB,KAAK0iB,SAASK,IAGpB,EAEAjB,EAAcvhB,UAAUgiB,UAAY,SAAS9hB,GAI3C,IAHA,IAEIue,EAFAsD,EAAMtiB,KAAK+hB,KACXI,EAAWG,EAAI7hB,GAAO0hB,SAET,IAAV1hB,KAED6hB,EADJtD,EAASve,GAAS,GACF0hB,SAAWA,IAG3BniB,KAAKyiB,MAAMhiB,EAAOue,GAClBve,EAAQue,CAEZ,EAEA8C,EAAcvhB,UAAUkiB,MAAQ,SAASG,EAAGI,GAC1C,IAAIV,EAAMtiB,KAAK+hB,KACXM,EAAariB,KAAKgiB,YAClBiB,EAAWX,EAAIM,GACfM,EAAWZ,EAAIU,GACnBV,EAAIM,GAAKM,EACTZ,EAAIU,GAAKC,EACTZ,EAAWa,EAASrjB,KAAO+iB,EAC3BP,EAAWY,EAASpjB,KAAOmjB,yCCtJ7B,IAAI5H,EAAIzb,KACJmiB,EAAgBniB,KAENwjB,GAId,SAAkBlC,EAAGza,EAAQ4c,EAAUC,GACrC,OAKF,SAAqBpC,EAAGza,EAAQ4c,EAAUC,GACxC,IAEIjG,EAAGkG,EAFHC,EAAU,CAAA,EACVC,EAAK,IAAI1B,EAGT2B,EAAkB,SAAS7D,GAC7B,IAAIvC,EAAIuC,EAAKxC,IAAMA,EAAIwC,EAAKxC,EAAIwC,EAAKvC,EACjCqG,EAASH,EAAQlG,GACjBsG,EAASP,EAASxD,GAClBgE,EAAWN,EAAOM,SAAWD,EAEjC,GAAIA,EAAS,EACX,MAAM,IAAI1E,MAAM,4DACeW,EAAO,YAAc+D,GAGlDC,EAAWF,EAAOE,WACpBF,EAAOE,SAAWA,EAClBF,EAAOG,YAAczG,EACrBoG,EAAGb,SAAStF,EAAGuG,KAInB3C,EAAE/C,QAAQxO,SAAQ,SAAS0N,GACzB,IAAIwG,EAAWxG,IAAM5W,EAAS,EAAIsd,OAAOC,kBACzCR,EAAQnG,GAAK,CAAEwG,SAAUA,GACzBJ,EAAG5T,IAAIwN,EAAGwG,EACZ,IAEA,KAAOJ,EAAGtjB,OAAS,IACjBkd,EAAIoG,EAAGhB,aACPc,EAASC,EAAQnG,IACNwG,WAAaE,OAAOC,oBAI/BV,EAAOjG,GAAG1N,QAAQ+T,GAGpB,OAAOF,CACT,CA7CSS,CAAY/C,EAAGlY,OAAOvC,GAC3B4c,GAAYa,EACZZ,GAAU,SAASjG,GAAK,OAAO6D,EAAEN,SAASvD,EAAI,EAClD,EANA,IAAI6G,EAAsB7I,EAAExC,SAAS,gDCLrC,IAAIsL,EAAWvkB,KACXyb,EAAIzb,YAEMwkB,GAEd,SAAqBlD,EAAGmD,EAAYC,GAClC,OAAOjJ,EAAElS,UAAU+X,EAAE/C,SAAS,SAASoG,EAAKlH,GAC1CkH,EAAIlH,GAAK8G,EAASjD,EAAG7D,EAAGgH,EAAYC,EACrC,GAAE,CAAE,EACP,qCCTA,IAAIjJ,EAAIzb,YAEM4kB,GAEd,SAAgBtD,GACd,IAAIxgB,EAAQ,EACR4O,EAAQ,GACRsS,EAAU,CAAA,EACV4B,EAAU,GAEd,SAAS1B,EAAIzE,GACX,IAAIhc,EAAQugB,EAAQvE,GAAK,CACvBoH,SAAS,EACTC,QAAShkB,EACTA,MAAOA,KAaT,GAXA4O,EAAMrO,KAAKoc,GAEX6D,EAAE5B,WAAWjC,GAAG1N,SAAQ,SAAS2N,GAC1BjC,EAAE7Z,IAAIogB,EAAStE,GAGTsE,EAAQtE,GAAGmH,UACpBpjB,EAAMqjB,QAAUlM,KAAK6J,IAAIhhB,EAAMqjB,QAAS9C,EAAQtE,GAAG5c,SAHnDohB,EAAIxE,GACJjc,EAAMqjB,QAAUlM,KAAK6J,IAAIhhB,EAAMqjB,QAAS9C,EAAQtE,GAAGoH,SAIvD,IAEIrjB,EAAMqjB,UAAYrjB,EAAMX,MAAO,CACjC,IACI4c,EADAqE,EAAO,GAEX,GACErE,EAAIhO,EAAM3O,MACVihB,EAAQtE,GAAGmH,SAAU,EACrB9C,EAAK1gB,KAAKqc,SACHD,IAAMC,GACfkG,EAAQviB,KAAK0gB,EACf,CACF,CAQA,OANAT,EAAE/C,QAAQxO,SAAQ,SAAS0N,GACpBhC,EAAE7Z,IAAIogB,EAASvE,IAClByE,EAAIzE,EAER,IAEOmG,CACT,wCC9CA,IAAInI,EAAIzb,KACJ+kB,EAAS/kB,YAECglB,GAEd,SAAoB1D,GAClB,OAAO7F,EAAEL,OAAO2J,EAAOzD,IAAI,SAASS,GAClC,OAAOA,EAAK5hB,OAAS,GAAsB,IAAhB4hB,EAAK5hB,QAAgBmhB,EAAEV,QAAQmB,EAAK,GAAIA,EAAK,GAC1E,GACF,qCCTA,IAAItG,EAAIzb,KAEMilB,GAId,SAAuB3D,EAAGmC,EAAUC,GAClC,OAKF,SAA0BpC,EAAGmC,EAAUC,GACrC,IAAIE,EAAU,CAAA,EACVrF,EAAQ+C,EAAE/C,QAkCd,OAhCAA,EAAMxO,SAAQ,SAAS0N,GACrBmG,EAAQnG,GAAK,GACbmG,EAAQnG,GAAGA,GAAK,CAAEwG,SAAU,GAC5B1F,EAAMxO,SAAQ,SAAS2N,GACjBD,IAAMC,IACRkG,EAAQnG,GAAGC,GAAK,CAAEuG,SAAUE,OAAOC,mBAEvC,IACAV,EAAOjG,GAAG1N,SAAQ,SAASkQ,GACzB,IAAIvC,EAAIuC,EAAKxC,IAAMA,EAAIwC,EAAKvC,EAAIuC,EAAKxC,EACjCyH,EAAIzB,EAASxD,GACjB2D,EAAQnG,GAAGC,GAAK,CAAEuG,SAAUiB,EAAGhB,YAAazG,EAC9C,GACF,IAEAc,EAAMxO,SAAQ,SAASoN,GACrB,IAAIgI,EAAOvB,EAAQzG,GACnBoB,EAAMxO,SAAQ,SAASkT,GACrB,IAAImC,EAAOxB,EAAQX,GACnB1E,EAAMxO,SAAQ,SAASsT,GACrB,IAAIgC,EAAKD,EAAKjI,GACVmI,EAAKH,EAAK9B,GACVkC,EAAKH,EAAK/B,GACVmC,EAAcH,EAAGpB,SAAWqB,EAAGrB,SAC/BuB,EAAcD,EAAGtB,WACnBsB,EAAGtB,SAAWuB,EACdD,EAAGrB,YAAcoB,EAAGpB,YAExB,GACF,GACF,IAEON,CACT,CA1CS6B,CAAiBnE,EACtBmC,GAAYa,EACZZ,GAAU,SAASjG,GAAK,OAAO6D,EAAEN,SAASvD,EAAI,EAClD,EANA,IAAI6G,EAAsB7I,EAAExC,SAAS,gDCJrC,IAAIwC,EAAIzb,KAKR,SAAS0lB,EAAQpE,GACf,IAAIU,EAAU,CAAA,EACVtS,EAAQ,CAAA,EACRkU,EAAU,GAkBd,GAFAnI,EAAEN,KAAKmG,EAAE7C,SAdT,SAASkH,EAAM9G,GACb,GAAIpD,EAAE7Z,IAAI8N,EAAOmP,GACf,MAAM,IAAI+G,EAGPnK,EAAE7Z,IAAIogB,EAASnD,KAClBnP,EAAMmP,IAAQ,EACdmD,EAAQnD,IAAQ,EAChBpD,EAAEN,KAAKmG,EAAE9B,aAAaX,GAAO8G,UACtBjW,EAAMmP,GACb+E,EAAQviB,KAAKwd,GAEjB,IAIIpD,EAAElb,KAAKyhB,KAAaV,EAAEhD,YACxB,MAAM,IAAIsH,EAGZ,OAAOhC,CACT,CAEA,SAASgC,IAAkB,QA/BbC,GAAGH,EACjBA,EAAQE,eAAiBA,EA+BzBA,EAAehlB,UAAY,IAAI0e,4CClC/B,IAAIoG,EAAU1lB,YAEA8lB,GAEd,SAAmBxE,GACjB,IACEoE,EAAQpE,EACT,CAAC,MAAOve,GACP,GAAIA,aAAa2iB,EAAQE,eACvB,OAAO,EAET,MAAM7iB,CACR,CACA,OAAO,CACT,qCCdA,IAAI0Y,EAAIzb,KA+BR,SAAS+lB,EAAMzE,EAAG7D,EAAGuI,EAAWhE,EAASiE,EAAYtB,GAC9ClJ,EAAE7Z,IAAIogB,EAASvE,KAClBuE,EAAQvE,IAAK,EAERuI,GAAarB,EAAItjB,KAAKoc,GAC3BhC,EAAEN,KAAK8K,EAAWxI,IAAI,SAASC,GAC7BqI,EAAMzE,EAAG5D,EAAGsI,EAAWhE,EAASiE,EAAYtB,EAC9C,IACIqB,GAAarB,EAAItjB,KAAKoc,GAE9B,QAvCcyI,GAUd,SAAa5E,EAAG3C,EAAIwH,GACb1K,EAAElU,QAAQoX,KACbA,EAAK,CAACA,IAGR,IAAIsH,GAAc3E,EAAEhE,aAAegE,EAAE5B,WAAa4B,EAAE1B,WAAWwG,KAAK9E,GAEhEqD,EAAM,GACN3C,EAAU,CAAA,EAQd,OAPAvG,EAAEN,KAAKwD,GAAI,SAASlB,GAClB,IAAK6D,EAAExC,QAAQrB,GACb,MAAM,IAAI6B,MAAM,6BAA+B7B,GAGjDsI,EAAMzE,EAAG7D,EAAa,SAAV0I,EAAkBnE,EAASiE,EAAYtB,EACrD,IACOA,CACT,wCC7BA,IAAIzC,EAAMliB,YAEIqmB,GAEd,SAAmB/E,EAAG3C,GACpB,OAAOuD,EAAIZ,EAAG3C,EAAI,OACpB,qCCNA,IAAIuD,EAAMliB,YAEIsmB,GAEd,SAAkBhF,EAAG3C,GACnB,OAAOuD,EAAIZ,EAAG3C,EAAI,MACpB,qCCNA,IAAIlD,EAAIzb,KACJ2b,EAAQ3b,KACRmiB,EAAgBniB,YAENumB,GAEd,SAAcjF,EAAGmD,GACf,IAGIhH,EAHAza,EAAS,IAAI2Y,EACbuE,EAAU,CAAA,EACV2D,EAAK,IAAI1B,EAGb,SAAS2B,EAAgB7D,GACvB,IAAIvC,EAAIuC,EAAKxC,IAAMA,EAAIwC,EAAKvC,EAAIuC,EAAKxC,EACjC+I,EAAM3C,EAAGrB,SAAS9E,GACtB,QAAYxc,IAARslB,EAAmB,CACrB,IAAIC,EAAahC,EAAWxE,GACxBwG,EAAaD,IACftG,EAAQxC,GAAKD,EACboG,EAAGb,SAAStF,EAAG+I,GAEnB,CACF,CAEA,GAAsB,IAAlBnF,EAAEhD,YACJ,OAAOtb,EAGTyY,EAAEN,KAAKmG,EAAE/C,SAAS,SAASd,GACzBoG,EAAG5T,IAAIwN,EAAG0G,OAAOC,mBACjBphB,EAAO4b,QAAQnB,EACjB,IAGAoG,EAAGb,SAAS1B,EAAE/C,QAAQ,GAAI,GAE1B,IAAImI,GAAO,EACX,KAAO7C,EAAGtjB,OAAS,GAAG,CAEpB,GADAkd,EAAIoG,EAAGhB,YACHpH,EAAE7Z,IAAIse,EAASzC,GACjBza,EAAOgd,QAAQvC,EAAGyC,EAAQzC,QACrB,IAAIiJ,EACT,MAAM,IAAIpH,MAAM,iCAAmCgC,GAEnDoF,GAAO,CACT,CAEApF,EAAEJ,UAAUzD,GAAG1N,QAAQ+T,EACzB,CAEA,OAAO9gB,CACT,EvG9CE,IACEkN,mCwGwBJ,IAAIyW,EAAM3mB,YAEVJ,GAAiB,CACf+b,MAAOgL,EAAIhL,MACXgG,KAAM3hB,KACN4mB,gBCnCFhnB,GAAiB,CACfinB,WAAY7mB,KACZukB,SAAUvkB,KACV8mB,YAAa9mB,KACb+mB,WAAY/mB,KACZgnB,cAAehnB,KACfinB,UAAWjnB,KACXgmB,UAAWhmB,KACXknB,SAAUlnB,KACVmnB,KAAMnnB,KACN+kB,OAAQ/kB,KACR0lB,QAAS1lB,ODyBTohB,QAASuF,EAAIvF,SxG9BAphB,EACZ,CAAC,MAAO+C,GACP,CAICmN,KACHA,GAAWsL,OAAOtL,UAGpBtQ,wR0GdIqb,G1GcJrb,GAAiBsQ,sC2GhBjB,IAAInQ,EAAKC,KACL8J,EAAc9J,KACd6I,EAAU7I,KACVoD,EAAWpD,YA0BfJ,GAdA,SAAwBC,EAAOiB,EAAO0D,GACpC,IAAKpB,EAASoB,GACZ,OAAO,EAET,IAAItB,SAAcpC,EAClB,SAAY,UAARoC,EACK4G,EAAYtF,IAAWqE,EAAQ/H,EAAO0D,EAAOrE,QACrC,UAAR+C,GAAoBpC,KAAS0D,IAE7BzE,EAAGyE,EAAO1D,GAAQjB,EAG7B,qCC3BA,IAAIunB,kCCCJ,IAAIC,EAAe,YAiBnBznB,GAPA,SAAyB0F,GAGvB,IAFA,IAAIxE,EAAQwE,EAAOnF,OAEZW,KAAWumB,EAAa/iB,KAAKgB,EAAOgiB,OAAOxmB,MAClD,OAAOA,CACT,EDhBsBd,GAGlBunB,EAAc,cAelB3nB,GANA,SAAkB0F,GAChB,OAAOA,EACHA,EAAO+E,MAAM,EAAG+c,EAAgB9hB,GAAU,GAAGjB,QAAQkjB,EAAa,IAClEjiB,CACN,qCEhBA,IAAIkiB,kCCAJ,IAAIC,EAAWznB,KACXoD,EAAWpD,KACXkU,EAAWlU,KAMX0nB,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAeC,gBA8CnBloB,GArBA,SAAkBC,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIqU,EAASrU,GACX,OA1CM,IA4CR,GAAIuD,EAASvD,GAAQ,CACnB,IAAIC,EAAgC,mBAAjBD,EAAM2N,QAAwB3N,EAAM2N,UAAY3N,EACnEA,EAAQuD,EAAStD,GAAUA,EAAQ,GAAMA,CAC3C,CACA,GAAoB,iBAATD,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQ4nB,EAAS5nB,GACjB,IAAIkoB,EAAWJ,EAAWrjB,KAAKzE,GAC/B,OAAQkoB,GAAYH,EAAUtjB,KAAKzE,GAC/BgoB,EAAahoB,EAAMwK,MAAM,GAAI0d,EAAW,EAAI,GAC3CL,EAAWpjB,KAAKzE,GAvDb,KAuD6BA,CACvC,ED7DeG,GAGXgoB,EAAW,WAsCfpoB,GAZA,SAAkBC,GAChB,OAAKA,GAGLA,EAAQ2nB,EAAS3nB,MACHmoB,GAAYnoB,KAAU,IA9BpB,uBA+BFA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,CAQjC,qCEvCA,IAAIga,EAAgB7Z,KAChBwW,EAAexW,KACfioB,kCCFJ,IAAIC,EAAWloB,YAmCfJ,GAPA,SAAmBC,GACjB,IAAImD,EAASklB,EAASroB,GAClBsoB,EAAYnlB,EAAS,EAEzB,OAAOA,GAAWA,EAAUmlB,EAAYnlB,EAASmlB,EAAYnlB,EAAU,CACzE,ED/BgBhD,GAGZ2Y,EAAYC,KAAKC,WAiDrBjZ,GAZA,SAAmBK,EAAOsK,EAAWqP,GACnC,IAAIzZ,EAAkB,MAATF,EAAgB,EAAIA,EAAME,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIW,EAAqB,MAAb8Y,EAAoB,EAAIqO,EAAUrO,GAI9C,OAHI9Y,EAAQ,IACVA,EAAQ6X,EAAUxY,EAASW,EAAO,IAE7B+Y,EAAc5Z,EAAOuW,EAAajM,EAAW,GAAIzJ,EAC1D,qCEpDA,IAAIyX,EAAcvY,YAqBlBJ,GALA,SAAiBK,GAEf,OADsB,MAATA,EAAgB,EAAIA,EAAME,QACvBoY,EAAYtY,EAAO,GAAK,EAC1C,qCCnBA,IAAIiU,EAAWlU,YA+BfJ,GAnBA,SAAsBK,EAAOoG,EAAUgU,GAIrC,IAHA,IAAIvZ,GAAS,EACTX,EAASF,EAAME,SAEVW,EAAQX,GAAQ,CACvB,IAAIN,EAAQI,EAAMa,GACdsnB,EAAU/hB,EAASxG,GAEvB,GAAe,MAAXuoB,SAAiClnB,IAAbuZ,EACf2N,GAAYA,IAAYlU,EAASkU,GAClC/N,EAAW+N,EAAS3N,IAE1B,IAAIA,EAAW2N,EACXplB,EAASnD,CAEjB,CACA,OAAOmD,CACT,qCC7BA,IAAI0D,EAAkB1G,KAClBD,EAAKC,YAkBTJ,GAPA,SAA0B4E,EAAQtE,EAAKL,SACtBqB,IAAVrB,IAAwBE,EAAGyE,EAAOtE,GAAML,SAC9BqB,IAAVrB,KAAyBK,KAAOsE,KACnCkC,EAAgBlC,EAAQtE,EAAKL,EAEjC,4CCGAD,GAZA,SAAiB4E,EAAQtE,GACvB,IAAY,gBAARA,GAAgD,mBAAhBsE,EAAOtE,KAIhC,aAAPA,EAIJ,OAAOsE,EAAOtE,EAChB,qCClBA,IAAImoB,EAAmBroB,KACnByO,EAAczO,KACdyN,EAAkBzN,KAClB0O,EAAY1O,KACZmP,EAAkBnP,KAClBqH,EAAcrH,KACduH,EAAUvH,KACV6a,EAAoB7a,KACpB8H,EAAW9H,KACX8D,EAAa9D,KACboD,EAAWpD,KACXsoB,kCCXJ,IAAInlB,EAAanD,KACbgL,EAAehL,KACfmH,EAAenH,KAMfkE,EAAY/B,SAASvB,UACrB0B,EAAcP,OAAOnB,UAGrBgD,EAAeM,EAAUzB,SAGzBF,EAAiBD,EAAYC,eAG7BgmB,EAAmB3kB,EAAa5C,KAAKe,eA2CzCnC,GAbA,SAAuBC,GACrB,IAAKsH,EAAatH,IA5CJ,mBA4CcsD,EAAWtD,GACrC,OAAO,EAET,IAAIgO,EAAQ7C,EAAanL,GACzB,GAAc,OAAVgO,EACF,OAAO,EAET,IAAIxE,EAAO9G,EAAevB,KAAK6M,EAAO,gBAAkBA,EAAMvE,YAC9D,MAAsB,mBAARD,GAAsBA,aAAgBA,GAClDzF,EAAa5C,KAAKqI,IAASkf,CAC/B,EDhDoBvoB,GAChB0I,EAAe1I,KACfwoB,EAAUxoB,KACVyoB,kCEdJ,IAAIna,EAAatO,KACbwO,EAASxO,YA8BbJ,GAJA,SAAuBC,GACrB,OAAOyO,EAAWzO,EAAO2O,EAAO3O,GAClC,EFfoBG,UA+EpBJ,GA9DA,SAAuB4E,EAAQqC,EAAQ3G,EAAKwoB,EAAUC,EAAW5hB,EAAY2I,GAC3E,IAAI/I,EAAW6hB,EAAQhkB,EAAQtE,GAC3BwT,EAAW8U,EAAQ3hB,EAAQ3G,GAC3B4P,EAAUJ,EAAM/N,IAAI+R,GAExB,GAAI5D,EACFuY,EAAiB7jB,EAAQtE,EAAK4P,OADhC,CAIA,IAAI7I,EAAWF,EACXA,EAAWJ,EAAU+M,EAAWxT,EAAM,GAAKsE,EAAQqC,EAAQ6I,QAC3DxO,EAEAqZ,OAAwBrZ,IAAb+F,EAEf,GAAIsT,EAAU,CACZ,IAAIxR,EAAQxB,EAAQmM,GAChBzK,GAAUF,GAASjB,EAAS4L,GAC5BkV,GAAW7f,IAAUE,GAAUP,EAAagL,GAEhDzM,EAAWyM,EACP3K,GAASE,GAAU2f,EACjBrhB,EAAQZ,GACVM,EAAWN,EAEJkU,EAAkBlU,GACzBM,EAAWyH,EAAU/H,GAEdsC,GACPsR,GAAW,EACXtT,EAAWwH,EAAYiF,GAAU,IAE1BkV,GACPrO,GAAW,EACXtT,EAAWwG,EAAgBiG,GAAU,IAGrCzM,EAAW,GAGNqhB,EAAc5U,IAAarM,EAAYqM,IAC9CzM,EAAWN,EACPU,EAAYV,GACdM,EAAWwhB,EAAc9hB,GAEjBvD,EAASuD,KAAa7C,EAAW6C,KACzCM,EAAWkI,EAAgBuE,KAI7B6G,GAAW,CAEf,CACIA,IAEF7K,EAAMhO,IAAIgS,EAAUzM,GACpB0hB,EAAU1hB,EAAUyM,EAAUgV,EAAU3hB,EAAY2I,GACpDA,EAAc,OAAEgE,IAElB2U,EAAiB7jB,EAAQtE,EAAK+G,EAnD9B,CAoDF,4CG9EArH,GAJA,SAAgBC,EAAOC,GACrB,OAAOD,EAAQC,CACjB,qCCXA,IAAIiW,EAAU/V,KACV6oB,kCCDJ,IAAIjiB,EAAc5G,KACdyV,EAAWzV,KACX6I,EAAU7I,KACVoD,EAAWpD,KACX0V,EAAQ1V,YA8CZJ,GAlCA,SAAiB4E,EAAQmR,EAAM9V,EAAOkH,GACpC,IAAK3D,EAASoB,GACZ,OAAOA,EAST,IALA,IAAI1D,GAAS,EACTX,GAHJwV,EAAOF,EAASE,EAAMnR,IAGJrE,OACdiN,EAAYjN,EAAS,EACrB2oB,EAAStkB,EAEI,MAAVskB,KAAoBhoB,EAAQX,GAAQ,CACzC,IAAID,EAAMwV,EAAMC,EAAK7U,IACjBmG,EAAWpH,EAEf,GAAY,cAARK,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOsE,EAGT,GAAI1D,GAASsM,EAAW,CACtB,IAAIzG,EAAWmiB,EAAO5oB,QAELgB,KADjB+F,EAAWF,EAAaA,EAAWJ,EAAUzG,EAAK4oB,QAAU5nB,KAE1D+F,EAAW7D,EAASuD,GAChBA,EACCkC,EAAQ8M,EAAK7U,EAAQ,IAAM,GAAK,CAAA,EAEzC,CACA8F,EAAYkiB,EAAQ5oB,EAAK+G,GACzB6hB,EAASA,EAAO5oB,EAClB,CACA,OAAOsE,CACT,ED/CcxE,GACVyV,EAAWzV,YA2BfJ,GAhBA,SAAoB4E,EAAQukB,EAAOxe,GAKjC,IAJA,IAAIzJ,GAAS,EACTX,EAAS4oB,EAAM5oB,OACf6C,EAAS,CAAA,IAEJlC,EAAQX,GAAQ,CACvB,IAAIwV,EAAOoT,EAAMjoB,GACbjB,EAAQkW,EAAQvR,EAAQmR,GAExBpL,EAAU1K,EAAO8V,IACnBkT,EAAQ7lB,EAAQyS,EAASE,EAAMnR,GAAS3E,EAE5C,CACA,OAAOmD,CACT,qCE3BA,IAAIgmB,kCCCJ,IAAIC,EAAarQ,KAAKsQ,KAClBvQ,EAAYC,KAAKC,WAyBrBjZ,GAZA,SAAmBkZ,EAAOqQ,EAAKC,EAAMhZ,GAKnC,IAJA,IAAItP,GAAS,EACTX,EAASwY,EAAUsQ,GAAYE,EAAMrQ,IAAUsQ,GAAQ,IAAK,GAC5DpmB,EAASrC,MAAMR,GAEZA,KACL6C,EAAOoN,EAAYjQ,IAAWW,GAASgY,EACvCA,GAASsQ,EAEX,OAAOpmB,CACT,EDzBgBhD,GACZqpB,EAAiBrpB,KACjBkoB,EAAWloB,YA2BfJ,GAlBA,SAAqBwQ,GACnB,OAAO,SAAS0I,EAAOqQ,EAAKC,GAa1B,OAZIA,GAAuB,iBAARA,GAAoBC,EAAevQ,EAAOqQ,EAAKC,KAChED,EAAMC,OAAOloB,GAGf4X,EAAQoP,EAASpP,QACL5X,IAARioB,GACFA,EAAMrQ,EACNA,EAAQ,GAERqQ,EAAMjB,EAASiB,GAEjBC,OAAgBloB,IAATkoB,EAAsBtQ,EAAQqQ,EAAM,GAAK,EAAKjB,EAASkB,GACvDJ,EAAUlQ,EAAOqQ,EAAKC,EAAMhZ,GAEvC,qCE3BA,IAAIkZ,kCCAJ,IAAIpV,EAAWlU,YAwCfJ,GA9BA,SAA0BC,EAAOC,GAC/B,GAAID,IAAUC,EAAO,CACnB,IAAIypB,OAAyBroB,IAAVrB,EACf2pB,EAAsB,OAAV3pB,EACZ4pB,EAAiB5pB,GAAUA,EAC3B6pB,EAAcxV,EAASrU,GAEvB8pB,OAAyBzoB,IAAVpB,EACf8pB,EAAsB,OAAV9pB,EACZ+pB,EAAiB/pB,GAAUA,EAC3BgqB,EAAc5V,EAASpU,GAE3B,IAAM8pB,IAAcE,IAAgBJ,GAAe7pB,EAAQC,GACtD4pB,GAAeC,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BN,GAAgBM,IACjBJ,EACH,OAAO,EAET,IAAMD,IAAcE,IAAgBI,GAAejqB,EAAQC,GACtDgqB,GAAeP,GAAgBE,IAAmBD,IAAcE,GAChEE,GAAaL,GAAgBE,IAC5BE,GAAgBF,IACjBI,EACH,OAAQ,CAEZ,CACA,OAAO,CACT,EDtCuB7pB,UA2CvBJ,GA3BA,SAAyB4E,EAAQ1E,EAAOiqB,GAOtC,IANA,IAAIjpB,GAAS,EACTkpB,EAAcxlB,EAAOylB,SACrBC,EAAcpqB,EAAMmqB,SACpB9pB,EAAS6pB,EAAY7pB,OACrBgqB,EAAeJ,EAAO5pB,SAEjBW,EAAQX,GAAQ,CACvB,IAAI6C,EAASsmB,EAAiBU,EAAYlpB,GAAQopB,EAAYppB,IAC9D,GAAIkC,EACF,OAAIlC,GAASqpB,EACJnnB,EAGFA,GAAmB,QADd+mB,EAAOjpB,IACiB,EAAI,EAE5C,CAQA,OAAO0D,EAAO1D,MAAQhB,EAAMgB,KAC9B,qCEzCA,IAAI+T,EAAW7U,KACX+V,EAAU/V,KACVwW,EAAexW,KACf0W,EAAU1W,KACVoqB,cCgBJxqB,GAVA,SAAoBK,EAAOoqB,GACzB,IAAIlqB,EAASF,EAAME,OAGnB,IADAF,EAAMqqB,KAAKD,GACJlqB,KACLF,EAAME,GAAUF,EAAME,GAAQN,MAEhC,OAAOI,CACT,GDbIuI,EAAYxI,KACZuqB,EAAkBvqB,KAClB2Q,EAAW3Q,KACXuH,EAAUvH,YAwCdJ,GA7BA,SAAqB6Q,EAAY+Z,EAAWT,GAExCS,EADEA,EAAUrqB,OACA0U,EAAS2V,GAAW,SAASnkB,GACvC,OAAIkB,EAAQlB,GACH,SAASxG,GACd,OAAOkW,EAAQlW,EAA2B,IAApBwG,EAASlG,OAAekG,EAAS,GAAKA,IAGzDA,CACT,IAEY,CAACsK,GAGf,IAAI7P,GAAS,EACb0pB,EAAY3V,EAAS2V,EAAWhiB,EAAUgO,IAE1C,IAAIxT,EAAS0T,EAAQjG,GAAY,SAAS5Q,EAAOK,EAAKuQ,GAIpD,MAAO,CAAEwZ,SAHMpV,EAAS2V,GAAW,SAASnkB,GAC1C,OAAOA,EAASxG,EAClB,IAC+BiB,QAAWA,EAAOjB,MAASA,EAC5D,IAEA,OAAOuqB,EAAWpnB,GAAQ,SAASwB,EAAQ1E,GACzC,OAAOyqB,EAAgB/lB,EAAQ1E,EAAOiqB,EACxC,GACF,EtBzCE,IACE9O,GAAS,CACPwP,0CwBPN,IAAIjb,EAAYxP,YA4BhBJ,GAJA,SAAmBC,GACjB,OAAO2P,EAAU3P,EAAO6qB,EAC1B,ExBnBiB1qB,GACXiZ,SAAUjZ,KACV2qB,yCyBTN,IAAIhQ,EAAW3a,KACXD,EAAKC,KACLqpB,EAAiBrpB,KACjBwO,EAASxO,KAGTsC,EAAcP,OAAOnB,UAGrB2B,EAAiBD,EAAYC,eAuB7BooB,EAAWhQ,GAAS,SAASnW,EAAQga,GACvCha,EAASzC,OAAOyC,GAEhB,IAAI1D,GAAS,EACTX,EAASqe,EAAQre,OACjByqB,EAAQzqB,EAAS,EAAIqe,EAAQ,QAAKtd,EAMtC,IAJI0pB,GAASvB,EAAe7K,EAAQ,GAAIA,EAAQ,GAAIoM,KAClDzqB,EAAS,KAGFW,EAAQX,GAMf,IALA,IAAI0G,EAAS2X,EAAQ1d,GACjBgG,EAAQ0H,EAAO3H,GACfgkB,GAAc,EACdC,EAAchkB,EAAM3G,SAEf0qB,EAAaC,GAAa,CACjC,IAAI5qB,EAAM4G,EAAM+jB,GACZhrB,EAAQ2E,EAAOtE,SAELgB,IAAVrB,GACCE,EAAGF,EAAOyC,EAAYpC,MAAUqC,EAAevB,KAAKwD,EAAQtE,MAC/DsE,EAAOtE,GAAO2G,EAAO3G,GAEzB,CAGF,OAAOsE,CACT,WAEA5E,GAAiB+qB,EzBtDD3qB,GACVmb,KAAMnb,KACNob,OAAQpb,KACR+qB,qC0BZN,IAuCIA,kCCvCJ,IAAIvU,EAAexW,KACf8J,EAAc9J,KACdyD,EAAOzD,YAsBXJ,GAbA,SAAoBorB,GAClB,OAAO,SAASva,EAAYlG,EAAWqP,GACrC,IAAIvJ,EAAWtO,OAAO0O,GACtB,IAAK3G,EAAY2G,GAAa,CAC5B,IAAIpK,EAAWmQ,EAAajM,EAAW,GACvCkG,EAAahN,EAAKgN,GAClBlG,EAAY,SAASrK,GAAO,OAAOmG,EAASgK,EAASnQ,GAAMA,EAAKmQ,GAClE,CACA,IAAIvP,EAAQkqB,EAAcva,EAAYlG,EAAWqP,GACjD,OAAO9Y,GAAS,EAAIuP,EAAShK,EAAWoK,EAAW3P,GAASA,QAASI,EAEzE,EDtBiBlB,EAuCNirB,CAtCKjrB,aAwChBJ,GAAiBmrB,E1B7BL/qB,GACNkrB,QAASlrB,KACT+P,QAAS/P,KACTmrB,sC4BfN,IAAIhb,EAAUnQ,KACV4Q,EAAe5Q,KACfwO,EAASxO,YAoCbJ,GANA,SAAe4E,EAAQ6B,GACrB,OAAiB,MAAV7B,EACHA,EACA2L,EAAQ3L,EAAQoM,EAAavK,GAAWmI,EAC9C,E5BrBaxO,GACP4B,IAAM5B,KACNsb,YAAatb,KACborB,iB6BCNxrB,GALA,SAAcK,GACZ,IAAIE,EAAkB,MAATF,EAAgB,EAAIA,EAAME,OACvC,OAAOA,EAASF,EAAME,EAAS,QAAKe,CACtC,G7BEMiE,IAAKnF,KACLqrB,0C8BpBN,IAAI3kB,EAAkB1G,KAClBsQ,EAAatQ,KACbwW,EAAexW,YAwCnBJ,GAVA,SAAmB4E,EAAQ6B,GACzB,IAAIrD,EAAS,CAAA,EAMb,OALAqD,EAAWmQ,EAAanQ,EAAU,GAElCiK,EAAW9L,GAAQ,SAAS3E,EAAOK,EAAKsE,GACtCkC,EAAgB1D,EAAQ9C,EAAKmG,EAASxG,EAAOK,EAAKsE,GACpD,IACOxB,CACT,E9BpBiBhD,GACX6Y,oC+BrBN,IAAIyS,EAAetrB,KACfurB,cCYJ3rB,GAJA,SAAgBC,EAAOC,GACrB,OAAOD,EAAQC,CACjB,GDTI6Q,EAAW3Q,YA0BfJ,GANA,SAAaK,GACX,OAAQA,GAASA,EAAME,OACnBmrB,EAAarrB,EAAO0Q,EAAU4a,QAC9BrqB,CACN,E/BLWlB,GACLwrB,sCiCtBN,IAAIC,kCCAJ,IAAIrlB,EAAQpG,KACRqoB,EAAmBroB,KACnBmQ,EAAUnQ,KACV0rB,EAAgB1rB,KAChBoD,EAAWpD,KACXwO,EAASxO,KACTwoB,EAAUxoB,YAmCdJ,GAtBA,SAAS6rB,EAAUjnB,EAAQqC,EAAQ6hB,EAAU3hB,EAAY2I,GACnDlL,IAAWqC,GAGfsJ,EAAQtJ,GAAQ,SAAS6M,EAAUxT,GAEjC,GADAwP,IAAUA,EAAQ,IAAItJ,GAClBhD,EAASsQ,GACXgY,EAAclnB,EAAQqC,EAAQ3G,EAAKwoB,EAAU+C,EAAW1kB,EAAY2I,OAEjE,CACH,IAAIzI,EAAWF,EACXA,EAAWyhB,EAAQhkB,EAAQtE,GAAMwT,EAAWxT,EAAM,GAAKsE,EAAQqC,EAAQ6I,QACvExO,OAEaA,IAAb+F,IACFA,EAAWyM,GAEb2U,EAAiB7jB,EAAQtE,EAAK+G,EAChC,CACD,GAAEuH,EACL,KDvCgBxO,GAkCZwrB,kCElCJ,IAAI7Q,EAAW3a,KACXqpB,EAAiBrpB,YAmCrBJ,GA1BA,SAAwB+rB,GACtB,OAAOhR,GAAS,SAASnW,EAAQga,GAC/B,IAAI1d,GAAS,EACTX,EAASqe,EAAQre,OACjB4G,EAAa5G,EAAS,EAAIqe,EAAQre,EAAS,QAAKe,EAChD0pB,EAAQzqB,EAAS,EAAIqe,EAAQ,QAAKtd,EAWtC,IATA6F,EAAc4kB,EAASxrB,OAAS,GAA0B,mBAAd4G,GACvC5G,IAAU4G,QACX7F,EAEA0pB,GAASvB,EAAe7K,EAAQ,GAAIA,EAAQ,GAAIoM,KAClD7jB,EAAa5G,EAAS,OAAIe,EAAY6F,EACtC5G,EAAS,GAEXqE,EAASzC,OAAOyC,KACP1D,EAAQX,GAAQ,CACvB,IAAI0G,EAAS2X,EAAQ1d,GACjB+F,GACF8kB,EAASnnB,EAAQqC,EAAQ/F,EAAOiG,EAEpC,CACA,OAAOvC,CACT,GACF,EFjCqBxE,EAiCT4rB,EAAe,SAASpnB,EAAQqC,EAAQ6hB,GAClD+C,EAAUjnB,EAAQqC,EAAQ6hB,EAC5B,WAEA9oB,GAAiB4rB,EjChBJxrB,GACPyiB,oCoCvBN,IAAI6I,EAAetrB,KACf6rB,EAAS7rB,KACT2Q,EAAW3Q,YA0BfJ,GANA,SAAaK,GACX,OAAQA,GAASA,EAAME,OACnBmrB,EAAarrB,EAAO0Q,EAAUkb,QAC9B3qB,CACN,EpCHWlB,GACL8rB,sCqCxBN,IAAIR,EAAetrB,KACfwW,EAAexW,KACf6rB,EAAS7rB,YA+BbJ,GANA,SAAeK,EAAOoG,GACpB,OAAQpG,GAASA,EAAME,OACnBmrB,EAAarrB,EAAOuW,EAAanQ,EAAU,GAAIwlB,QAC/C3qB,CACN,ErCPalB,GACPqZ,oCsCzBN,IAAInX,EAAOlC,YAsBXJ,GAJU,WACR,OAAOsC,EAAKkX,KAAKC,KACnB,EtCKWrZ,GACL+rB,qCuC1BN,IAAIC,kCCAJ,IAAIC,EAAajsB,KACbiW,EAAQjW,YAiBZJ,GANA,SAAkB4E,EAAQukB,GACxB,OAAOkD,EAAWznB,EAAQukB,GAAO,SAASlpB,EAAO8V,GAC/C,OAAOM,EAAMzR,EAAQmR,EACvB,GACF,EDhBe3V,GAoBX+rB,kCEpBJ,IAAIb,EAAUlrB,KACV2Z,EAAW3Z,KACX0Z,EAAc1Z,YAalBJ,GAJA,SAAkB+D,GAChB,OAAO+V,EAAYC,EAAShW,OAAMzC,EAAWgqB,GAAUvnB,EAAO,GAChE,EFZe3D,EAmBJksB,EAAS,SAAS1nB,EAAQukB,GACnC,OAAiB,MAAVvkB,EAAiB,CAAA,EAAKwnB,EAASxnB,EAAQukB,EAChD,WAEAnpB,GAAiBmsB,EvCEL/rB,GACNmsB,sC0C3BN,IA2CIA,EA3CcnsB,IA2CNosB,UAEZxsB,GAAiBusB,E1ClBJnsB,GACPub,OAAQvb,KACRqsB,uC2C7BN,IAAI9T,EAAcvY,KACdssB,EAActsB,KACd2a,EAAW3a,KACXqpB,EAAiBrpB,KA+BjBqsB,EAAS1R,GAAS,SAASlK,EAAY+Z,GACzC,GAAkB,MAAd/Z,EACF,MAAO,GAET,IAAItQ,EAASqqB,EAAUrqB,OAMvB,OALIA,EAAS,GAAKkpB,EAAe5Y,EAAY+Z,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHrqB,EAAS,GAAKkpB,EAAemB,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElB8B,EAAY7b,EAAY8H,EAAYiS,EAAW,GAAI,GAC5D,WAEA5qB,GAAiBysB,E3ClBHrsB,GACRusB,yC4C9BN,IAAI9pB,EAAWzC,KAGXwsB,EAAY,SAwBhB5sB,GALA,SAAkB6sB,GAChB,IAAIC,IAAOF,EACX,OAAO/pB,EAASgqB,GAAUC,CAC5B,E5CKgB1sB,GACV8K,OAAQ9K,KACR2sB,0C6ChCN,IAAI/lB,EAAc5G,KACd4sB,cCqBJhtB,GAbA,SAAuBkH,EAAOgE,EAAQ+hB,GAMpC,IALA,IAAI/rB,GAAS,EACTX,EAAS2G,EAAM3G,OACf2sB,EAAahiB,EAAO3K,OACpB6C,EAAS,CAAA,IAEJlC,EAAQX,GAAQ,CACvB,IAAIN,EAAQiB,EAAQgsB,EAAahiB,EAAOhK,QAASI,EACjD2rB,EAAW7pB,EAAQ8D,EAAMhG,GAAQjB,EACnC,CACA,OAAOmD,CACT,UDGApD,GAJA,SAAmBkH,EAAOgE,GACxB,OAAO8hB,EAAc9lB,GAAS,GAAIgE,GAAU,GAAIlE,EAClD,E7CWiB5G,GAEd,CAAC,MAAO+C,GACP,CAICkY,KACHA,GAASO,OAAOC,GAGlB7b,IAAAA,GAAiBqb,G+CtCjBrb,GAAiBmtB,GAEjB,SAASA,KACP,IAAIC,EAAW,CAAA,EACfA,EAASC,MAAQD,EAASE,MAAQF,EAClC3sB,KAAK8sB,UAAYH,CACnB,CAiCA,SAASI,GAAO3rB,GACdA,EAAMyrB,MAAMD,MAAQxrB,EAAMwrB,MAC1BxrB,EAAMwrB,MAAMC,MAAQzrB,EAAMyrB,aACnBzrB,EAAMwrB,aACNxrB,EAAMyrB,KACf,CAEA,SAASG,GAAelQ,EAAGM,GACzB,GAAU,UAANN,GAAuB,UAANA,EACnB,OAAOM,CAEX,CA1CAsP,GAAKnsB,UAAU0sB,QAAU,WACvB,IAAIN,EAAW3sB,KAAK8sB,UAChB1rB,EAAQurB,EAASE,MACrB,GAAIzrB,IAAUurB,EAEZ,OADAI,GAAO3rB,GACAA,CAEX,EAEAsrB,GAAKnsB,UAAU2sB,QAAU,SAAS9rB,GAChC,IAAIurB,EAAW3sB,KAAK8sB,UAChB1rB,EAAMyrB,OAASzrB,EAAMwrB,OACvBG,GAAO3rB,GAETA,EAAMwrB,MAAQD,EAASC,MACvBD,EAASC,MAAMC,MAAQzrB,EACvBurB,EAASC,MAAQxrB,EACjBA,EAAMyrB,MAAQF,CAChB,EAEAD,GAAKnsB,UAAU6B,SAAW,WAIxB,IAHA,IAAI+qB,EAAO,GACPR,EAAW3sB,KAAK8sB,UAChBM,EAAOT,EAASE,MACbO,IAAST,GACdQ,EAAKnsB,KAAKqsB,KAAKC,UAAUF,EAAMJ,KAC/BI,EAAOA,EAAKP,MAEd,MAAO,IAAMM,EAAK1V,KAAK,MAAQ,GACjC,EC1CA,IAAI2D,GAAIzb,GACJ2b,GAAQ3b,GAAsB2b,MAC9BoR,GAAO/sB,GASXJ,GAIA,SAAmB0hB,EAAGmC,GACpB,GAAInC,EAAEhD,aAAe,EACnB,MAAO,GAET,IAAIsP,EA4DN,SAAoBtM,EAAGmC,GACrB,IAAIoK,EAAW,IAAIlS,GACfmS,EAAQ,EACRC,EAAS,EAEbtS,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5BoQ,EAASjP,QAAQnB,EAAG,CAAEA,EAAGA,EAAGuQ,GAAM,EAAGC,IAAK,GAC5C,IAIAxS,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAImrB,EAAaL,EAAS5N,KAAKld,EAAE0a,EAAG1a,EAAE2a,IAAM,EACxCsG,EAASP,EAAS1gB,GAClB0jB,EAAayH,EAAalK,EAC9B6J,EAAS7N,QAAQjd,EAAE0a,EAAG1a,EAAE2a,EAAG+I,GAC3BsH,EAASnV,KAAKC,IAAIkV,EAAQF,EAAShP,KAAK9b,EAAE0a,GAAGwQ,KAAOjK,GACpD8J,EAASlV,KAAKC,IAAIiV,EAAQD,EAAShP,KAAK9b,EAAE2a,GAAO,IAAMsG,EACzD,IAEA,IAAImK,EAAU1S,GAAE0Q,MAAM4B,EAASD,EAAQ,GAAG3oB,KAAI,WAAa,OAAO,IAAI4nB,EAAQ,IAC1EqB,EAAUN,EAAQ,EAMtB,OAJArS,GAAE1L,QAAQ8d,EAAStP,SAAS,SAASd,GACnC4Q,GAAaF,EAASC,EAASP,EAAShP,KAAKpB,GAC/C,IAEO,CAAE/B,MAAOmS,EAAUM,QAASA,EAASC,QAASA,EACvD,CAxFcE,CAAWhN,EAAGmC,GAAY8K,IAClC3K,EAQN,SAAqBtC,EAAG6M,EAASC,GAC/B,IAII3sB,EAJAmiB,EAAU,GACVpF,EAAU2P,EAAQA,EAAQhuB,OAAS,GACnCse,EAAQ0P,EAAQ,GAGpB,KAAO7M,EAAEhD,aAAa,CACpB,KAAQ7c,EAAQgd,EAAM6O,WAAgBvO,GAAWuC,EAAG6M,EAASC,EAAS3sB,GACtE,KAAQA,EAAQ+c,EAAQ8O,WAAcvO,GAAWuC,EAAG6M,EAASC,EAAS3sB,GACtE,GAAI6f,EAAEhD,YACJ,IAAK,IAAI2E,EAAIkL,EAAQhuB,OAAS,EAAG8iB,EAAI,IAAKA,EAExC,GADAxhB,EAAQ0sB,EAAQlL,GAAGqK,UACR,CACT1J,EAAUA,EAAQzC,OAAOpC,GAAWuC,EAAG6M,EAASC,EAAS3sB,GAAO,IAChE,KACF,CAGN,CAEA,OAAOmiB,CACT,CA7BgB4K,CAAYZ,EAAMlS,MAAOkS,EAAMO,QAASP,EAAMQ,SAG5D,OAAO3S,GAAEyP,QAAQzP,GAAEtW,IAAIye,GAAS,SAAS7gB,GACvC,OAAOue,EAAEN,SAASje,EAAE0a,EAAG1a,EAAE2a,OACvB,EACN,EAbI6Q,GAAoB9S,GAAExC,SAAS,GAsCnC,SAAS8F,GAAWuC,EAAG6M,EAASC,EAAS3sB,EAAOgtB,GAC9C,IAAI7K,EAAU6K,EAAsB,QAAKvtB,EAwBzC,OAtBAua,GAAE1L,QAAQuR,EAAET,QAAQpf,EAAMgc,IAAI,SAASwC,GACrC,IAAI+D,EAAS1C,EAAErB,KAAKA,GAChByO,EAASpN,EAAEzC,KAAKoB,EAAKxC,GAErBgR,GACF7K,EAAQviB,KAAK,CAAEoc,EAAGwC,EAAKxC,EAAGC,EAAGuC,EAAKvC,IAGpCgR,EAAOT,KAAOjK,EACdqK,GAAaF,EAASC,EAASM,EACjC,IAEAjT,GAAE1L,QAAQuR,EAAEN,SAASvf,EAAMgc,IAAI,SAASwC,GACtC,IAAI+D,EAAS1C,EAAErB,KAAKA,GAChBvC,EAAIuC,EAAKvC,EACTqG,EAASzC,EAAEzC,KAAKnB,GACpBqG,EAAW,IAAKC,EAChBqK,GAAaF,EAASC,EAASrK,EACjC,IAEAzC,EAAEvC,WAAWtd,EAAMgc,GAEZmG,CACT,CAgCA,SAASyK,GAAaF,EAASC,EAAS3sB,GACjCA,EAAMwsB,IAECxsB,EAAU,GAGpB0sB,EAAQ1sB,EAAMwsB,IAAMxsB,EAAU,GAAI2sB,GAASb,QAAQ9rB,GAFnD0sB,EAAQA,EAAQhuB,OAAS,GAAGotB,QAAQ9rB,GAFpC0sB,EAAQ,GAAGZ,QAAQ9rB,EAMvB,CCnHA,IAAIga,GAAIzb,GACJ2uB,GAAY3uB,GAEhBJ,GAAiB,CACfgvB,IAIF,SAAatN,GACX,IAAIuN,EAA+B,WAAxBvN,EAAE5F,QAAQoT,UACjBH,GAAUrN,EAUd,SAAkBA,GAChB,OAAO,SAASve,GACd,OAAOue,EAAErB,KAAKld,GAAGihB,OAErB,CAdiBP,CAASnC,IAiB5B,SAAgBA,GACd,IAAIuN,EAAM,GACNnf,EAAQ,CAAA,EACRsS,EAAU,CAAA,EAEd,SAASE,EAAIzE,GACPhC,GAAE7Z,IAAIogB,EAASvE,KAGnBuE,EAAQvE,IAAK,EACb/N,EAAM+N,IAAK,EACXhC,GAAE1L,QAAQuR,EAAEN,SAASvD,IAAI,SAAS1a,GAC5B0Y,GAAE7Z,IAAI8N,EAAO3M,EAAE2a,GACjBmR,EAAIxtB,KAAK0B,GAETmf,EAAInf,EAAE2a,EAEV,WACOhO,EAAM+N,GACf,CAGA,OADAhC,GAAE1L,QAAQuR,EAAE/C,QAAS2D,GACd2M,CACT,CAvCME,CAAOzN,GACX7F,GAAE1L,QAAQ8e,GAAK,SAAS9rB,GACtB,IAAIob,EAAQmD,EAAErB,KAAKld,GACnBue,EAAEtC,WAAWjc,GACbob,EAAM6Q,YAAcjsB,EAAEkP,KACtBkM,EAAM8Q,UAAW,EACjB3N,EAAEtB,QAAQjd,EAAE2a,EAAG3a,EAAE0a,EAAGU,EAAO1C,GAAE8Q,SAAS,OACxC,GAOF,EApBE2C,KA+CF,SAAc5N,GACZ7F,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIob,EAAQmD,EAAErB,KAAKld,GACnB,GAAIob,EAAM8Q,SAAU,CAClB3N,EAAEtC,WAAWjc,GAEb,IAAIisB,EAAc7Q,EAAM6Q,mBACjB7Q,EAAM8Q,gBACN9Q,EAAM6Q,YACb1N,EAAEtB,QAAQjd,EAAE2a,EAAG3a,EAAE0a,EAAGU,EAAO6Q,EAC7B,CACF,GACF,GC9DA,IAAIvT,GAAIzb,GACJ2b,GAAQ3b,GAAsB2b,MAElC/b,GAAiB,CACfuvB,aAAcA,GACdC,SAiCF,SAAkB9N,GAChB,IAAI+N,GAAa,IAAI1T,IAAQuC,SAASoD,EAAE5F,SAUxC,OATAD,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAAK4R,EAAWzQ,QAAQnB,EAAG6D,EAAEzC,KAAKpB,GAAK,IACrEhC,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIusB,EAAcD,EAAWpP,KAAKld,EAAE0a,EAAG1a,EAAE2a,IAAM,CAAEsG,OAAQ,EAAGuL,OAAQ,GAChEpR,EAAQmD,EAAErB,KAAKld,GACnBssB,EAAWrP,QAAQjd,EAAE0a,EAAG1a,EAAE2a,EAAG,CAC3BsG,OAAQsL,EAAYtL,OAAS7F,EAAM6F,OACnCuL,OAAQ3W,KAAKC,IAAIyW,EAAYC,OAAQpR,EAAMoR,SAE/C,IACOF,CACT,EA5CEG,mBA8CF,SAA4BlO,GAC1B,IAAI+N,EAAa,IAAI1T,GAAM,CAAEQ,WAAYmF,EAAEtD,iBAAkBE,SAASoD,EAAE5F,SASxE,OARAD,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GACvB6D,EAAEpC,SAASzB,GAAGtd,QACjBkvB,EAAWzQ,QAAQnB,EAAG6D,EAAEzC,KAAKpB,GAEjC,IACAhC,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5BssB,EAAWrP,QAAQjd,EAAGue,EAAErB,KAAKld,GAC/B,IACOssB,CACT,EAxDEI,iBA0DF,SAA0BnO,GACxB,IAAIoO,EAAYjU,GAAEtW,IAAImc,EAAE/C,SAAS,SAASd,GACxC,IAAIkS,EAAO,CAAA,EAIX,OAHAlU,GAAE1L,QAAQuR,EAAEN,SAASvD,IAAI,SAAS1a,GAChC4sB,EAAK5sB,EAAE2a,IAAMiS,EAAK5sB,EAAE2a,IAAM,GAAK4D,EAAErB,KAAKld,GAAGihB,MAC3C,IACO2L,CACT,IACA,OAAOlU,GAAEkR,UAAUrL,EAAE/C,QAASmR,EAChC,EAlEEE,mBAoEF,SAA4BtO,GAC1B,IAAIoO,EAAYjU,GAAEtW,IAAImc,EAAE/C,SAAS,SAASd,GACxC,IAAIoC,EAAQ,CAAA,EAIZ,OAHApE,GAAE1L,QAAQuR,EAAET,QAAQpD,IAAI,SAAS1a,GAC/B8c,EAAM9c,EAAE0a,IAAMoC,EAAM9c,EAAE0a,IAAM,GAAK6D,EAAErB,KAAKld,GAAGihB,MAC7C,IACOnE,CACT,IACA,OAAOpE,GAAEkR,UAAUrL,EAAE/C,QAASmR,EAChC,EA5EEG,cAkFF,SAAuBC,EAAMC,GAC3B,IAcIC,EAAIC,EAdJ1N,EAAIuN,EAAKvN,EACT2N,EAAIJ,EAAKI,EAITC,EAAKJ,EAAMxN,EAAIA,EACf6N,EAAKL,EAAMG,EAAIA,EACfxS,EAAIoS,EAAKO,MAAQ,EACjBC,EAAIR,EAAKS,OAAS,EAEtB,IAAKJ,IAAOC,EACV,MAAM,IAAI9Q,MAAM,6DAId1G,KAAK4X,IAAIJ,GAAM1S,EAAI9E,KAAK4X,IAAIL,GAAMG,GAEhCF,EAAK,IACPE,GAAKA,GAEPN,EAAKM,EAAIH,EAAKC,EACdH,EAAKK,IAGDH,EAAK,IACPzS,GAAKA,GAEPsS,EAAKtS,EACLuS,EAAKvS,EAAI0S,EAAKD,GAGhB,MAAO,CAAE5N,EAAGA,EAAIyN,EAAIE,EAAGA,EAAID,EAC7B,EAlHEQ,iBAwHF,SAA0BnP,GACxB,IAAIoP,EAAWjV,GAAEtW,IAAIsW,GAAE0Q,MAAMwE,GAAQrP,GAAK,IAAI,WAAa,MAAO,EAAI,IAQtE,OAPA7F,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GACdmT,EAAO/R,EAAK+R,KACXnV,GAAEH,YAAYsV,KACjBF,EAASE,GAAM/R,EAAKsH,OAAS1I,EAEjC,IACOiT,CACT,EAjIEG,eAuIF,SAAwBvP,GACtB,IAAImB,EAAMhH,GAAEgH,IAAIhH,GAAEtW,IAAImc,EAAE/C,SAAS,SAASd,GAAK,OAAO6D,EAAEzC,KAAKpB,GAAGmT,IAAO,KACvEnV,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GACdhC,GAAE7Z,IAAIid,EAAM,UACdA,EAAK+R,MAAQnO,EAEjB,GACF,EA9IEqO,iBAgJF,SAA0BxP,GAExB,IAAIvW,EAAS0Q,GAAEgH,IAAIhH,GAAEtW,IAAImc,EAAE/C,SAAS,SAASd,GAAK,OAAO6D,EAAEzC,KAAKpB,GAAGmT,IAAO,KAEtEG,EAAS,GACbtV,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAImT,EAAOtP,EAAEzC,KAAKpB,GAAGmT,KAAO7lB,EACvBgmB,EAAOH,KACVG,EAAOH,GAAQ,IAEjBG,EAAOH,GAAMvvB,KAAKoc,EACpB,IAEA,IAAIuT,EAAQ,EACRC,EAAiB3P,EAAE5F,QAAQuV,eAC/BxV,GAAE1L,QAAQghB,GAAQ,SAASpS,EAAIsE,GACzBxH,GAAEH,YAAYqD,IAAOsE,EAAIgO,GAAmB,IAC5CD,EACOA,GACTvV,GAAE1L,QAAQ4O,GAAI,SAASlB,GAAK6D,EAAEzC,KAAKpB,GAAGmT,MAAQI,CAAO,GAEzD,GACF,EArKEE,cAuKF,SAAuB5P,EAAGmL,EAAQmE,EAAMzK,GACtC,IAAItH,EAAO,CACTwR,MAAO,EACPE,OAAQ,GAENjpB,UAAUnH,QAAU,IACtB0e,EAAK+R,KAAOA,EACZ/R,EAAKsH,MAAQA,GAEf,OAAOgJ,GAAa7N,EAAG,SAAUzC,EAAM4N,EACzC,EAhLEkE,QAASA,GACTQ,UA+LF,SAAmB1gB,EAAY2gB,GAC7B,IAAIpuB,EAAS,CAAEquB,IAAK,GAAIC,IAAK,IAQ7B,OAPA7V,GAAE1L,QAAQU,GAAY,SAAS5Q,GACzBuxB,EAAGvxB,GACLmD,EAAOquB,IAAIhwB,KAAKxB,GAEhBmD,EAAOsuB,IAAIjwB,KAAKxB,EAEpB,IACOmD,CACT,EAxMEuuB,KA8MF,SAActf,EAAMmf,GACN3V,GAAEpC,MACd,IACE,OAAO+X,GACT,CAAU,QAEV,CACF,EApNEI,OAsNF,SAAgBvf,EAAMmf,GACpB,OAAOA,GACT,GAlNA,SAASjC,GAAa7N,EAAGpe,EAAMuuB,EAAOxf,GACpC,IAAIwL,EACJ,GACEA,EAAIhC,GAAE8Q,SAASta,SACRqP,EAAExC,QAAQrB,IAInB,OAFAgU,EAAMC,MAAQxuB,EACdoe,EAAE1C,QAAQnB,EAAGgU,GACNhU,CACT,CAgKA,SAASkT,GAAQrP,GACf,OAAO7F,GAAE5C,IAAI4C,GAAEtW,IAAImc,EAAE/C,SAAS,SAASd,GACrC,IAAImT,EAAOtP,EAAEzC,KAAKpB,GAAGmT,KACrB,IAAKnV,GAAEH,YAAYsV,GACjB,OAAOA,CAEV,IACH,CCzMA,IAAInV,GAAIzb,GACJ2xB,GAAO3xB,GAEXJ,GAAiB,CACfgvB,IAoBF,SAAatN,GACXA,EAAE5F,QAAQkW,YAAc,GACxBnW,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASL,IAGhC,SAAuBqB,EAAGve,GACxB,IAYI2uB,EAAOD,EAAOxO,EAZdxF,EAAI1a,EAAE0a,EACNoU,EAAQvQ,EAAEzC,KAAKpB,GAAGmT,KAClBlT,EAAI3a,EAAE2a,EACNoU,EAAQxQ,EAAEzC,KAAKnB,GAAGkT,KAClB3e,EAAOlP,EAAEkP,KACT8f,EAAYzQ,EAAErB,KAAKld,GACnBivB,EAAYD,EAAUC,UAE1B,GAAIF,IAAUD,EAAQ,EAAG,OAKzB,IAHAvQ,EAAEtC,WAAWjc,GAGRkgB,EAAI,IAAK4O,EAAOA,EAAQC,IAAS7O,IAAK4O,EACzCE,EAAUE,OAAS,GACnBR,EAAQ,CACNpB,MAAO,EAAGE,OAAQ,EAClBwB,UAAWA,EAAWlU,QAAS9a,EAC/B6tB,KAAMiB,GAERH,EAAQC,GAAKxC,aAAa7N,EAAG,OAAQmQ,EAAO,MACxCI,IAAUG,IACZP,EAAMpB,MAAQ0B,EAAU1B,MACxBoB,EAAMlB,OAASwB,EAAUxB,OACzBkB,EAAMC,MAAQ,aACdD,EAAMS,SAAWH,EAAUG,UAE7B5Q,EAAEtB,QAAQvC,EAAGiU,EAAO,CAAE1N,OAAQ+N,EAAU/N,QAAU/R,GACxC,IAANgR,GACF3B,EAAE5F,QAAQkW,YAAYvwB,KAAKqwB,GAE7BjU,EAAIiU,EAGNpQ,EAAEtB,QAAQvC,EAAGC,EAAG,CAAEsG,OAAQ+N,EAAU/N,QAAU/R,EAChD,CAvCwCkgB,CAAc7Q,EAAGrB,EAAO,GAChE,EAtBEiP,KA8DF,SAAc5N,GACZ7F,GAAE1L,QAAQuR,EAAE5F,QAAQkW,aAAa,SAASnU,GACxC,IAEIC,EAFAmB,EAAOyC,EAAEzC,KAAKpB,GACd2U,EAAYvT,EAAKkT,UAGrB,IADAzQ,EAAEtB,QAAQnB,EAAKhB,QAASuU,GACjBvT,EAAK6S,OACVhU,EAAI4D,EAAE5B,WAAWjC,GAAG,GACpB6D,EAAEvC,WAAWtB,GACb2U,EAAUH,OAAO5wB,KAAK,CAAEkhB,EAAG1D,EAAK0D,EAAG2N,EAAGrR,EAAKqR,IACxB,eAAfrR,EAAK6S,QACPU,EAAU7P,EAAI1D,EAAK0D,EACnB6P,EAAUlC,EAAIrR,EAAKqR,EACnBkC,EAAU/B,MAAQxR,EAAKwR,MACvB+B,EAAU7B,OAAS1R,EAAK0R,QAE1B9S,EAAIC,EACJmB,EAAOyC,EAAEzC,KAAKpB,EAElB,GACF,GCvFA,IAAIhC,GAAIzb,GAERJ,GAAiB,CACfyyB,YAyBF,SAAqB/Q,GACnB,IAAIU,EAAU,CAAA,EAsBdvG,GAAE1L,QAAQuR,EAAE9C,WApBZ,SAAS0D,EAAIzE,GACX,IAAIU,EAAQmD,EAAEzC,KAAKpB,GACnB,GAAIhC,GAAE7Z,IAAIogB,EAASvE,GACjB,OAAOU,EAAMyS,KAEf5O,EAAQvE,IAAK,EAEb,IAAImT,EAAOnV,GAAEgH,IAAIhH,GAAEtW,IAAImc,EAAEN,SAASvD,IAAI,SAAS1a,GAC7C,OAAOmf,EAAInf,EAAE2a,GAAK4D,EAAErB,KAAKld,GAAGwsB,MAC7B,KAQD,OANIqB,IAASzM,OAAOC,mBAAhBwM,MACAA,IAEFA,EAAO,GAGDzS,EAAMyS,KAAOA,CACvB,GAGF,EAhDE0B,MAsDF,SAAehR,EAAGve,GAChB,OAAOue,EAAEzC,KAAK9b,EAAE2a,GAAGkT,KAAOtP,EAAEzC,KAAK9b,EAAE0a,GAAGmT,KAAOtP,EAAErB,KAAKld,GAAGwsB,MACzD,GC5DA,IAAI9T,GAAIzb,GACJ2b,GAAQ3b,GAAuB2b,MAC/B2W,GAAQtyB,GAAkBsyB,MAE9B1yB,GA2BA,SAAsB0hB,GACpB,IAOIrB,EAAM+Q,EAPNuB,EAAI,IAAI5W,GAAM,CAAEM,UAAU,IAG1BnD,EAAQwI,EAAE/C,QAAQ,GAClBhe,EAAO+gB,EAAEhD,YACbiU,EAAE3T,QAAQ9F,EAAO,CAAA,GAGjB,KAAO0Z,GAAUD,EAAGjR,GAAK/gB,GACvB0f,EAAOwS,GAAiBF,EAAGjR,GAC3B0P,EAAQuB,EAAEzT,QAAQmB,EAAKxC,GAAK6U,GAAMhR,EAAGrB,IAASqS,GAAMhR,EAAGrB,GACvDyS,GAAWH,EAAGjR,EAAG0P,GAGnB,OAAOuB,CACT,EAMA,SAASC,GAAUD,EAAGjR,GAcpB,OADA7F,GAAE1L,QAAQwiB,EAAEhU,SAZZ,SAAS2D,EAAIzE,GACXhC,GAAE1L,QAAQuR,EAAEJ,UAAUzD,IAAI,SAAS1a,GACjC,IAAI4vB,EAAQ5vB,EAAE0a,EACZC,EAAKD,IAAMkV,EAAS5vB,EAAE2a,EAAIiV,EACvBJ,EAAEzT,QAAQpB,IAAO4U,GAAMhR,EAAGve,KAC7BwvB,EAAE3T,QAAQlB,EAAG,CAAA,GACb6U,EAAEvS,QAAQvC,EAAGC,EAAG,CAAE,GAClBwE,EAAIxE,GAER,GACF,IAGO6U,EAAEjU,WACX,CAMA,SAASmU,GAAiBF,EAAGjR,GAC3B,OAAO7F,GAAEqQ,MAAMxK,EAAEhB,SAAS,SAASvd,GACjC,GAAIwvB,EAAEzT,QAAQ/b,EAAE0a,KAAO8U,EAAEzT,QAAQ/b,EAAE2a,GACjC,OAAO4U,GAAMhR,EAAGve,EAEpB,GACF,CAEA,SAAS2vB,GAAWH,EAAGjR,EAAG0P,GACxBvV,GAAE1L,QAAQwiB,EAAEhU,SAAS,SAASd,GAC5B6D,EAAEzC,KAAKpB,GAAGmT,MAAQI,CACpB,GACF,CCtFA,IAAIvV,GAAIzb,GACJ4yB,GAAe5yB,GACfsyB,GAAQtyB,GAAkBsyB,MAC1BO,GAAW7yB,GAAkBqyB,YAC7BnL,GAAWlnB,GAAuB4mB,IAAIM,SACtClB,GAAYhmB,GAAuB4mB,IAAIZ,UACvCoJ,GAAWpvB,GAAmBovB,SAElCxvB,GAAiBkzB,GA2CjB,SAASA,GAAexR,GACtBA,EAAI8N,GAAS9N,GACbuR,GAASvR,GACT,IAIIve,EAJAwvB,EAAIK,GAAatR,GAKrB,IAJAyR,GAAiBR,GACjBS,GAAcT,EAAGjR,GAGTve,EAAIkwB,GAAUV,IAEpBW,GAAcX,EAAGjR,EAAGve,EADhBowB,GAAUZ,EAAGjR,EAAGve,GAGxB,CAKA,SAASiwB,GAAcT,EAAGjR,GACxB,IAAI3C,EAAKqH,GAAUuM,EAAGA,EAAEhU,SACxBI,EAAKA,EAAGtU,MAAM,EAAGsU,EAAGxe,OAAS,GAC7Bsb,GAAE1L,QAAQ4O,GAAI,SAASlB,IAKzB,SAAwB8U,EAAGjR,EAAGnC,GAC5B,IAAIiU,EAAWb,EAAE1T,KAAKM,GAClBE,EAAS+T,EAAS/T,OACtBkT,EAAEtS,KAAKd,EAAOE,GAAQgU,SAAWC,GAAaf,EAAGjR,EAAGnC,EACtD,CARIoU,CAAehB,EAAGjR,EAAG7D,EACvB,GACF,CAYA,SAAS6V,GAAaf,EAAGjR,EAAGnC,GAC1B,IACIE,EADWkT,EAAE1T,KAAKM,GACAE,OAElBmU,GAAc,EAEdC,EAAYnS,EAAErB,KAAKd,EAAOE,GAE1BqU,EAAW,EAyBf,OAvBKD,IACHD,GAAc,EACdC,EAAYnS,EAAErB,KAAKZ,EAAQF,IAG7BuU,EAAWD,EAAUzP,OAErBvI,GAAE1L,QAAQuR,EAAEJ,UAAU/B,IAAQ,SAASpc,GACrC,IAqHsB+d,EAAGrD,EArHrBkW,EAAY5wB,EAAE0a,IAAM0B,EACtBrf,EAAQ6zB,EAAY5wB,EAAE2a,EAAI3a,EAAE0a,EAE9B,GAAI3d,IAAUuf,EAAQ,CACpB,IAAIuU,EAAeD,IAAcH,EAC/BK,EAAcvS,EAAErB,KAAKld,GAAGihB,OAG1B,GADA0P,GAAYE,EAAeC,GAAeA,EA8GtB/S,EA7GF3B,EA6GK1B,EA7GE3d,EAAVyyB,EA8GP3R,QAAQE,EAAGrD,GA9Gc,CAC/B,IAAIqW,EAAgBvB,EAAEtS,KAAKd,EAAOrf,GAAOuzB,SACzCK,GAAYE,GAAgBE,EAAgBA,CAC9C,CACF,CACF,IAEOJ,CACT,CAEA,SAASX,GAAiBgB,EAAM7xB,GAC1BoF,UAAUnH,OAAS,IACrB+B,EAAO6xB,EAAKxV,QAAQ,IAEtByV,GAAgBD,EAAM,CAAA,EAAI,EAAG7xB,EAC/B,CAEA,SAAS8xB,GAAgBD,EAAM/R,EAASiS,EAASxW,EAAG4B,GAClD,IAAI6U,EAAMD,EACN9V,EAAQ4V,EAAKlV,KAAKpB,GAkBtB,OAhBAuE,EAAQvE,IAAK,EACbhC,GAAE1L,QAAQgkB,EAAKnU,UAAUnC,IAAI,SAASC,GAC/BjC,GAAE7Z,IAAIogB,EAAStE,KAClBuW,EAAUD,GAAgBD,EAAM/R,EAASiS,EAASvW,EAAGD,GAEzD,IAEAU,EAAM+V,IAAMA,EACZ/V,EAAMgW,IAAMF,IACR5U,EACFlB,EAAMkB,OAASA,SAGRlB,EAAMkB,OAGR4U,CACT,CAEA,SAAShB,GAAUc,GACjB,OAAOtY,GAAEsP,KAAKgJ,EAAKzT,SAAS,SAASvd,GACnC,OAAOgxB,EAAK9T,KAAKld,GAAGswB,SAAW,CACjC,GACF,CAEA,SAASF,GAAUZ,EAAGjR,EAAGrB,GACvB,IAAIxC,EAAIwC,EAAKxC,EACTC,EAAIuC,EAAKvC,EAKR4D,EAAEV,QAAQnD,EAAGC,KAChBD,EAAIwC,EAAKvC,EACTA,EAAIuC,EAAKxC,GAGX,IAAI2W,EAAS7B,EAAE1T,KAAKpB,GAChB4W,EAAS9B,EAAE1T,KAAKnB,GAChB4W,EAAYF,EACZG,GAAO,EAIPH,EAAOD,IAAME,EAAOF,MACtBG,EAAYD,EACZE,GAAO,GAGT,IAAIC,EAAa/Y,GAAEL,OAAOkG,EAAEhB,SAAS,SAASL,GAC5C,OAAOsU,IAASE,GAAalC,EAAGA,EAAE1T,KAAKoB,EAAKxC,GAAI6W,IACzCC,IAASE,GAAalC,EAAGA,EAAE1T,KAAKoB,EAAKvC,GAAI4W,EAClD,IAEA,OAAO7Y,GAAEqQ,MAAM0I,GAAY,SAASvU,GAAQ,OAAOqS,GAAMhR,EAAGrB,EAAO,GACrE,CAEA,SAASiT,GAAcX,EAAGjR,EAAGve,EAAG2xB,GAC9B,IAAIjX,EAAI1a,EAAE0a,EACNC,EAAI3a,EAAE2a,EACV6U,EAAEvT,WAAWvB,EAAGC,GAChB6U,EAAEvS,QAAQ0U,EAAEjX,EAAGiX,EAAEhX,EAAG,CAAA,GACpBqV,GAAiBR,GACjBS,GAAcT,EAAGjR,GAInB,SAAqBiR,EAAGjR,GACtB,IAAIpf,EAAOuZ,GAAEsP,KAAKwH,EAAEhU,SAAS,SAASd,GAAK,OAAQ6D,EAAEzC,KAAKpB,GAAG4B,MAAQ,IACjEV,EAAKuI,GAASqL,EAAGrwB,GACrByc,EAAKA,EAAGtU,MAAM,GACdoR,GAAE1L,QAAQ4O,GAAI,SAASlB,GACrB,IAAI4B,EAASkT,EAAE1T,KAAKpB,GAAG4B,OACrBY,EAAOqB,EAAErB,KAAKxC,EAAG4B,GACjBsV,GAAU,EAEP1U,IACHA,EAAOqB,EAAErB,KAAKZ,EAAQ5B,GACtBkX,GAAU,GAGZrT,EAAEzC,KAAKpB,GAAGmT,KAAOtP,EAAEzC,KAAKQ,GAAQuR,MAAQ+D,EAAU1U,EAAKsP,QAAUtP,EAAKsP,OACxE,GACF,CAnBEqF,CAAYrC,EAAGjR,EACjB,CA+BA,SAASmT,GAAaV,EAAMK,EAAQS,GAClC,OAAOA,EAAUX,KAAOE,EAAOD,KAAOC,EAAOD,KAAOU,EAAUV,GAChE,CA5NArB,GAAeC,iBAAmBA,GAClCD,GAAeE,cAAgBA,GAC/BF,GAAeQ,aAAeA,GAC9BR,GAAeG,UAAYA,GAC3BH,GAAeK,UAAYA,GAC3BL,GAAeI,cAAgBA,GChB/B,IACIb,GADWryB,GACYqyB,YACvBO,GAAe5yB,GACf8yB,GAAiB9yB,GAErBJ,GAqBA,SAAc0hB,GACZ,OAAOA,EAAE5F,QAAQoZ,QACjB,IAAK,kBAGL,QAASC,GAAqBzT,SAF9B,IAAK,cASP,SAAyBA,GACvB+Q,GAAY/Q,GACZsR,GAAatR,EACf,CAZqB0T,CAAgB1T,GAAI,MACvC,IAAK,eAAgB2T,GAAkB3T,GAGzC,EAGA,IAAI2T,GAAoB5C,GAOxB,SAAS0C,GAAqBzT,GAC5BwR,GAAexR,EACjB,CC/CA,IAAI7F,GAAIzb,GAERJ,GAEA,SAA2B0hB,GACzB,IAAI4T,EAoEN,SAAmB5T,GACjB,IAAIte,EAAS,CAAA,EACTmxB,EAAM,EAEV,SAASjS,EAAIzE,GACX,IAAIyW,EAAMC,EACV1Y,GAAE1L,QAAQuR,EAAEpC,SAASzB,GAAIyE,GACzBlf,EAAOya,GAAK,CAAEyW,IAAKA,EAAKC,IAAKA,IAC/B,CAGA,OAFA1Y,GAAE1L,QAAQuR,EAAEpC,WAAYgD,GAEjBlf,CACT,CAhFsBgjB,CAAU1E,GAE9B7F,GAAE1L,QAAQuR,EAAE5F,QAAQkW,aAAa,SAASnU,GAUxC,IATA,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GACdI,EAAUgB,EAAKhB,QACfsX,EAqCR,SAAkB7T,EAAG4T,EAAezX,EAAGC,GACrC,IAII2B,EACA+V,EALAC,EAAQ,GACRC,EAAQ,GACRpB,EAAMtb,KAAK6J,IAAIyS,EAAczX,GAAGyW,IAAKgB,EAAcxX,GAAGwW,KACtDC,EAAMvb,KAAKC,IAAIqc,EAAczX,GAAG0W,IAAKe,EAAcxX,GAAGyW,KAK1D9U,EAAS5B,EACT,GACE4B,EAASiC,EAAEjC,OAAOA,GAClBgW,EAAMh0B,KAAKge,SACJA,IACC6V,EAAc7V,GAAQ6U,IAAMA,GAAOC,EAAMe,EAAc7V,GAAQ8U,MACzEiB,EAAM/V,EAGNA,EAAS3B,EACT,MAAQ2B,EAASiC,EAAEjC,OAAOA,MAAa+V,GACrCE,EAAMj0B,KAAKge,GAGb,MAAO,CAAE1J,KAAM0f,EAAMlU,OAAOmU,EAAMC,WAAYH,IAAKA,EACrD,CA7DmBI,CAASlU,EAAG4T,EAAerX,EAAQJ,EAAGI,EAAQH,GACzD/H,EAAOwf,EAASxf,KAChByf,EAAMD,EAASC,IACfK,EAAU,EACVC,EAAQ/f,EAAK8f,GACbE,GAAY,EAETlY,IAAMI,EAAQH,GAAG,CAGtB,GAFAmB,EAAOyC,EAAEzC,KAAKpB,GAEVkY,EAAW,CACb,MAAQD,EAAQ/f,EAAK8f,MAAcL,GAC5B9T,EAAEzC,KAAK6W,GAAO/E,QAAU9R,EAAK+R,MAClC6E,IAGEC,IAAUN,IACZO,GAAY,EAEhB,CAEA,IAAKA,EAAW,CACd,KAAOF,EAAU9f,EAAKxV,OAAS,GACxBmhB,EAAEzC,KAAK6W,EAAQ/f,EAAK8f,EAAU,IAAIG,SAAW/W,EAAK+R,MACvD6E,IAEFC,EAAQ/f,EAAK8f,EACf,CAEAnU,EAAElC,UAAU3B,EAAGiY,GACfjY,EAAI6D,EAAE5B,WAAWjC,GAAG,EACtB,CACF,GACF,EC3CA,IAAIhC,GAAIzb,GACJ2xB,GAAO3xB,GAEXJ,GAAiB,CACfgvB,IA2BF,SAAatN,GACX,IAAIpf,EAAOyvB,GAAKxC,aAAa7N,EAAG,OAAQ,CAAA,EAAI,SACxCuU,EAmEN,SAAoBvU,GAClB,IAAIuU,EAAS,CAAA,EACb,SAAS3T,EAAIzE,EAAGjF,GACd,IAAI0G,EAAWoC,EAAEpC,SAASzB,GACtByB,GAAYA,EAAS/e,QACvBsb,GAAE1L,QAAQmP,GAAU,SAASC,GAC3B+C,EAAI/C,EAAO3G,EAAQ,EACrB,IAEFqd,EAAOpY,GAAKjF,CACd,CAEA,OADAiD,GAAE1L,QAAQuR,EAAEpC,YAAY,SAASzB,GAAKyE,EAAIzE,EAAG,EAAI,IAC1CoY,CACT,CAhFeC,CAAWxU,GACpBiP,EAAS9U,GAAE5C,IAAI4C,GAAE3Q,OAAO+qB,IAAW,EACnCE,EAAU,EAAIxF,EAAS,EAE3BjP,EAAE5F,QAAQsa,YAAc9zB,EAGxBuZ,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAAKue,EAAErB,KAAKld,GAAGwsB,QAAUwG,CAAS,IAGhE,IAAI/R,EAwEN,SAAoB1C,GAClB,OAAO7F,GAAEF,OAAO+F,EAAEhB,SAAS,SAASqE,EAAK5hB,GACvC,OAAO4hB,EAAMrD,EAAErB,KAAKld,GAAGihB,MACxB,GAAE,EACL,CA5EeiS,CAAW3U,GAAK,EAG7B7F,GAAE1L,QAAQuR,EAAEpC,YAAY,SAASC,GAC/B+C,GAAIZ,EAAGpf,EAAM6zB,EAAS/R,EAAQuM,EAAQsF,EAAQ1W,EAChD,IAIAmC,EAAE5F,QAAQuV,eAAiB8E,CAC7B,EAhDEG,QAoHF,SAAiB5U,GACf,IAAI6U,EAAa7U,EAAE5F,QACnB4F,EAAEvC,WAAWoX,EAAWH,oBACjBG,EAAWH,YAClBva,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GACjBue,EAAErB,KAAKld,GACTqzB,aACP9U,EAAEtC,WAAWjc,EAEjB,GACF,GA5EA,SAASmf,GAAIZ,EAAGpf,EAAM6zB,EAAS/R,EAAQuM,EAAQsF,EAAQpY,GACrD,IAAIyB,EAAWoC,EAAEpC,SAASzB,GAC1B,GAAKyB,EAAS/e,OAAd,CAOA,IAAIk2B,EAAM1E,GAAKT,cAAc5P,EAAG,OAC5BgV,EAAS3E,GAAKT,cAAc5P,EAAG,OAC/BnD,EAAQmD,EAAEzC,KAAKpB,GAEnB6D,EAAElC,UAAUiX,EAAK5Y,GACjBU,EAAMoY,UAAYF,EAClB/U,EAAElC,UAAUkX,EAAQ7Y,GACpBU,EAAMqY,aAAeF,EAErB7a,GAAE1L,QAAQmP,GAAU,SAASC,GAC3B+C,GAAIZ,EAAGpf,EAAM6zB,EAAS/R,EAAQuM,EAAQsF,EAAQ1W,GAE9C,IAAIsX,EAAYnV,EAAEzC,KAAKM,GACnBuX,EAAWD,EAAUF,UAAYE,EAAUF,UAAYpX,EACvDwX,EAAcF,EAAUD,aAAeC,EAAUD,aAAerX,EAChEyX,EAAaH,EAAUF,UAAYvS,EAAS,EAAIA,EAChDuL,EAASmH,IAAaC,EAAc,EAAIpG,EAASsF,EAAOpY,GAAK,EAEjE6D,EAAEtB,QAAQqW,EAAKK,EAAU,CACvB1S,OAAQ4S,EACRrH,OAAQA,EACR6G,aAAa,IAGf9U,EAAEtB,QAAQ2W,EAAaL,EAAQ,CAC7BtS,OAAQ4S,EACRrH,OAAQA,EACR6G,aAAa,GAEjB,IAEK9U,EAAEjC,OAAO5B,IACZ6D,EAAEtB,QAAQ9d,EAAMm0B,EAAK,CAAErS,OAAQ,EAAGuL,OAAQgB,EAASsF,EAAOpY,IAlC5D,MAJMA,IAAMvb,GACRof,EAAEtB,QAAQ9d,EAAMub,EAAG,CAAEuG,OAAQ,EAAGuL,OAAQwG,GAuC9C,CClGA,IAAIta,GAAIzb,GACJ2xB,GAAO3xB,GAEXJ,GAEA,SAA2B0hB,GAoBzB7F,GAAE1L,QAAQuR,EAAEpC,YAnBZ,SAASgD,EAAIzE,GACX,IAAIyB,EAAWoC,EAAEpC,SAASzB,GACtBoB,EAAOyC,EAAEzC,KAAKpB,GAKlB,GAJIyB,EAAS/e,QACXsb,GAAE1L,QAAQmP,EAAUgD,GAGlBzG,GAAE7Z,IAAIid,EAAM,WAAY,CAC1BA,EAAKgY,WAAa,GAClBhY,EAAKiY,YAAc,GACnB,IAAK,IAAIlG,EAAO/R,EAAK+W,QAASjF,EAAU9R,EAAK8R,QAAU,EACrDC,EAAOD,IACLC,EACFM,GAAc5P,EAAG,aAAc,MAAO7D,EAAGoB,EAAM+R,GAC/CM,GAAc5P,EAAG,cAAe,MAAO7D,EAAGoB,EAAM+R,EAEpD,CACF,GAGF,EAEA,SAASM,GAAc5P,EAAGyV,EAAMtK,EAAQuK,EAAIC,EAAQrG,GAClD,IAAIzS,EAAQ,CAAEkS,MAAO,EAAGE,OAAQ,EAAGK,KAAMA,EAAMsG,WAAYH,GACvDI,EAAOF,EAAOF,GAAMnG,EAAO,GAC3BnD,EAAOkE,GAAKxC,aAAa7N,EAAG,SAAUnD,EAAOsO,GACjDwK,EAAOF,GAAMnG,GAAQnD,EACrBnM,EAAElC,UAAUqO,EAAMuJ,GACdG,GACF7V,EAAEtB,QAAQmX,EAAM1J,EAAM,CAAEzJ,OAAQ,GAEpC,CCnCA,IAAIvI,GAAIzb,GAERJ,GAAiB,CACfw3B,OAIF,SAAgB9V,GACd,IAAI+V,EAAU/V,EAAE5F,QAAQ4b,QAAQC,cAChB,OAAZF,GAAgC,OAAZA,GACtBG,GAAgBlW,EAEpB,EARE4N,KAUF,SAAc5N,GACZ,IAAI+V,EAAU/V,EAAE5F,QAAQ4b,QAAQC,cAChB,OAAZF,GAAgC,OAAZA,GAqB1B,SAAkB/V,GAChB7F,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAAKga,GAAYnW,EAAEzC,KAAKpB,GAAK,IAE3DhC,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GAClB0Y,GAAE1L,QAAQkQ,EAAKgS,OAAQwF,IACnBhc,GAAE7Z,IAAIqe,EAAM,MACdwX,GAAYxX,EAEhB,GACF,CA9BIyX,CAASpW,GAGK,OAAZ+V,GAAgC,OAAZA,KAiC1B,SAAgB/V,GACd7F,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAAKka,GAAUrW,EAAEzC,KAAKpB,GAAK,IAEzDhC,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GAClB0Y,GAAE1L,QAAQkQ,EAAKgS,OAAQ0F,IACnBlc,GAAE7Z,IAAIqe,EAAM,MACd0X,GAAU1X,EAEd,GACF,CA1CI2X,CAAOtW,GACPkW,GAAgBlW,GAEpB,GAEA,SAASkW,GAAgBlW,GACvB7F,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAAKoa,GAAmBvW,EAAEzC,KAAKpB,GAAK,IAClEhC,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAAK80B,GAAmBvW,EAAErB,KAAKld,GAAK,GACpE,CAEA,SAAS80B,GAAmBpG,GAC1B,IAAI/T,EAAI+T,EAAMpB,MACdoB,EAAMpB,MAAQoB,EAAMlB,OACpBkB,EAAMlB,OAAS7S,CACjB,CAcA,SAAS+Z,GAAYhG,GACnBA,EAAMvB,GAAKuB,EAAMvB,CACnB,CAcA,SAASyH,GAAUlG,GACjB,IAAIlP,EAAIkP,EAAMlP,EACdkP,EAAMlP,EAAIkP,EAAMvB,EAChBuB,EAAMvB,EAAI3N,CACZ,CCrEA,IAAI9G,GAAIzb,GAERJ,GAaA,SAAmB0hB,GACjB,IAAIU,EAAU,CAAA,EACV8V,EAAcrc,GAAEL,OAAOkG,EAAE/C,SAAS,SAASd,GAC7C,OAAQ6D,EAAEpC,SAASzB,GAAGtd,MACxB,IACIwwB,EAAUlV,GAAE5C,IAAI4C,GAAEtW,IAAI2yB,GAAa,SAASra,GAAK,OAAO6D,EAAEzC,KAAKpB,GAAGmT,IAAO,KACzEG,EAAStV,GAAEtW,IAAIsW,GAAE0Q,MAAMwE,EAAU,IAAI,WAAa,MAAO,EAAI,IAEjE,SAASzO,EAAIzE,GACX,IAAIhC,GAAE7Z,IAAIogB,EAASvE,GAAnB,CACAuE,EAAQvE,IAAK,EACb,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GAClBsT,EAAOlS,EAAK+R,MAAMvvB,KAAKoc,GACvBhC,GAAE1L,QAAQuR,EAAE5B,WAAWjC,GAAIyE,EAJJ,CAKzB,CAEA,IAAI6V,EAAYtc,GAAE4Q,OAAOyL,GAAa,SAASra,GAAK,OAAO6D,EAAEzC,KAAKpB,GAAGmT,IAAM,IAG3E,OAFAnV,GAAE1L,QAAQgoB,EAAW7V,GAEd6O,CACT,ECnCA,IAAItV,GAAIzb,GAERJ,GAkBA,SAAoB0hB,EAAGoP,GAErB,IADA,IAAIsH,EAAK,EACA/U,EAAI,EAAGA,EAAIyN,EAASvwB,SAAU8iB,EACrC+U,GAAMC,GAAmB3W,EAAGoP,EAASzN,EAAE,GAAIyN,EAASzN,IAEtD,OAAO+U,CACT,EAEA,SAASC,GAAmB3W,EAAG4W,EAAYC,GAczC,IAVA,IAAIC,EAAW3c,GAAEkR,UAAUwL,EACzB1c,GAAEtW,IAAIgzB,GAAY,SAAU1a,EAAGwF,GAAK,OAAOA,CAAI,KAC7CoV,EAAe5c,GAAEyP,QAAQzP,GAAEtW,IAAI+yB,GAAY,SAASza,GACtD,OAAOhC,GAAE4Q,OAAO5Q,GAAEtW,IAAImc,EAAEN,SAASvD,IAAI,SAAS1a,GAC5C,MAAO,CAAEu1B,IAAKF,EAASr1B,EAAE2a,GAAIsG,OAAQ1C,EAAErB,KAAKld,GAAGihB,WAC7C,WACF,GAGAuU,EAAa,EACVA,EAAaJ,EAAWh4B,QAAQo4B,IAAe,EACtD,IAAIC,EAAW,EAAID,EAAa,EAChCA,GAAc,EACd,IAAIxE,EAAOtY,GAAEtW,IAAI,IAAIxE,MAAM63B,IAAW,WAAa,OAAO,CAAG,IAGzDR,EAAK,EAeT,OAdAvc,GAAE1L,QAAQsoB,EAAatoB,SAAQ,SAAStO,GACtC,IAAIX,EAAQW,EAAM62B,IAAMC,EACxBxE,EAAKjzB,IAAUW,EAAMuiB,OAErB,IADA,IAAIyU,EAAY,EACT33B,EAAQ,GACTA,EAAQ,IACV23B,GAAa1E,EAAKjzB,EAAQ,IAG5BizB,EADAjzB,EAASA,EAAQ,GAAM,IACRW,EAAMuiB,OAEvBgU,GAAMv2B,EAAMuiB,OAASyU,CACtB,KAEMT,CACT,CClEA,IAAIvc,GAAIzb,GCER,IAAIyb,GAAIzb,GCFR,IAAIyb,GAAIzb,GACJ2xB,GAAO3xB,GAmCX,SAAS04B,GAAkB/Z,EAAIga,EAAY73B,GAEzC,IADA,IAAIsqB,EACGuN,EAAWx4B,SAAWirB,EAAO3P,GAAE2P,KAAKuN,IAAa1V,GAAKniB,GAC3D63B,EAAW53B,MACX4d,EAAGtd,KAAK+pB,EAAKzM,IACb7d,IAEF,OAAOA,CACT,CC5CA,IAAI2a,GAAIzb,GACJ44B,GHGJ,SAAoBtX,EAAGuX,GACrB,OAAOpd,GAAEtW,IAAI0zB,GAAS,SAASpb,GAC7B,IAAIsD,EAAMO,EAAET,QAAQpD,GACpB,GAAKsD,EAAI5gB,OAEF,CACL,IAAI6C,EAASyY,GAAEF,OAAOwF,GAAK,SAAS4D,EAAK5hB,GACvC,IAAIkd,EAAOqB,EAAErB,KAAKld,GAChB+1B,EAAQxX,EAAEzC,KAAK9b,EAAE0a,GACnB,MAAO,CACLsb,IAAKpU,EAAIoU,IAAO9Y,EAAK+D,OAAS8U,EAAM3S,MACpCnC,OAAQW,EAAIX,OAAS/D,EAAK+D,OAE9B,GAAG,CAAE+U,IAAK,EAAG/U,OAAQ,IAErB,MAAO,CACLvG,EAAGA,EACHmb,WAAY51B,EAAO+1B,IAAM/1B,EAAOghB,OAChCA,OAAQhhB,EAAOghB,OAEnB,CAhBE,MAAO,CAAEvG,EAAGA,EAiBhB,GACF,EGxBIub,GF6BJ,SAA0Bz3B,EAAS03B,GACjC,IAAIC,EAAgB,CAAA,EA4BpB,OA3BAzd,GAAE1L,QAAQxO,GAAS,SAASE,EAAOwhB,GACjC,IAAItF,EAAMub,EAAcz3B,EAAMgc,GAAK,CACjC0b,SAAU,EACVnL,GAAM,GACNC,IAAK,GACLtP,GAAI,CAACld,EAAMgc,GACXwF,EAAGA,GAEAxH,GAAEH,YAAY7Z,EAAMm3B,cACvBjb,EAAIib,WAAan3B,EAAMm3B,WACvBjb,EAAIqG,OAASviB,EAAMuiB,OAEvB,IAEAvI,GAAE1L,QAAQkpB,EAAG3Y,SAAS,SAASvd,GAC7B,IAAIq2B,EAASF,EAAcn2B,EAAE0a,GACzB4b,EAASH,EAAcn2B,EAAE2a,GACxBjC,GAAEH,YAAY8d,IAAY3d,GAAEH,YAAY+d,KAC3CA,EAAOF,WACPC,EAAOnL,IAAI5sB,KAAK63B,EAAcn2B,EAAE2a,IAEpC,IASF,SAA4B4b,GAC1B,IAAI/3B,EAAU,GAEd,SAASg4B,EAAS5V,GAChB,OAAO,SAAS+K,GACVA,EAAO8K,SAGP/d,GAAEH,YAAYoT,EAAOkK,aACrBnd,GAAEH,YAAYqI,EAAOiV,aACrBlK,EAAOkK,YAAcjV,EAAOiV,aA6BtC,SAAsBa,EAAQ5yB,GAC5B,IAAIkyB,EAAM,EACN/U,EAAS,EAETyV,EAAOzV,SACT+U,GAAOU,EAAOb,WAAaa,EAAOzV,OAClCA,GAAUyV,EAAOzV,QAGfnd,EAAOmd,SACT+U,GAAOlyB,EAAO+xB,WAAa/xB,EAAOmd,OAClCA,GAAUnd,EAAOmd,QAGnByV,EAAO9a,GAAK9X,EAAO8X,GAAGwC,OAAOsY,EAAO9a,IACpC8a,EAAOb,WAAaG,EAAM/U,EAC1ByV,EAAOzV,OAASA,EAChByV,EAAOxW,EAAIrK,KAAK6J,IAAI5b,EAAOoc,EAAGwW,EAAOxW,GACrCpc,EAAO2yB,QAAS,CAClB,CA/CQE,CAAa/V,EAAQ+K,GAG3B,CAEA,SAASiL,EAAUhW,GACjB,OAAO,SAASI,GACdA,EAAW,GAAE1iB,KAAKsiB,GACQ,KAApBI,EAAOoV,UACXG,EAAUj4B,KAAK0iB,GAGrB,CAEA,KAAOuV,EAAUn5B,QAAQ,CACvB,IAAIsB,EAAQ63B,EAAUv4B,MACtBQ,EAAQF,KAAKI,GACbga,GAAE1L,QAAQtO,EAAU,GAAE8zB,UAAWgE,EAAS93B,IAC1Cga,GAAE1L,QAAQtO,EAAMwsB,IAAK0L,EAAUl4B,GACjC,CAEA,OAAOga,GAAEtW,IAAIsW,GAAEL,OAAO7Z,GAAS,SAASE,GAAS,OAAQA,EAAM+3B,MAAQ,KACrE,SAAS/3B,GACP,OAAOga,GAAEsQ,KAAKtqB,EAAO,CAAC,KAAM,IAAK,aAAc,UACjD,GAEJ,CAxCSm4B,CAJSne,GAAEL,OAAO8d,GAAe,SAASz3B,GAC/C,OAAQA,EAAM03B,QAChB,IAGF,EE1DI7O,GDEJ,SAAc/oB,EAASs4B,GACrB,IAAIC,EAAQnI,GAAKR,UAAU5vB,GAAS,SAASE,GAC3C,OAAOga,GAAE7Z,IAAIH,EAAO,aACtB,IACIs4B,EAAWD,EAAMzI,IACnBsH,EAAald,GAAE4Q,OAAOyN,EAAMxI,KAAK,SAAS7vB,GAAS,OAAQA,EAAMwhB,CAAG,IACpEtE,EAAK,GACLoa,EAAM,EACN/U,EAAS,EACTgW,EAAU,EAEZD,EAASzP,MA8Bc2P,IA9BSJ,EA+BzB,SAAST,EAAQC,GACtB,OAAID,EAAOR,WAAaS,EAAOT,YACrB,EACCQ,EAAOR,WAAaS,EAAOT,WAC7B,EAGDqB,EAA6BZ,EAAOpW,EAAImW,EAAOnW,EAAxCmW,EAAOnW,EAAIoW,EAAOpW,KApCnC+W,EAAUtB,GAAkB/Z,EAAIga,EAAYqB,GAE5Cve,GAAE1L,QAAQgqB,GAAU,SAAUt4B,GAC5Bu4B,GAAWv4B,EAAMkd,GAAGxe,OACpBwe,EAAGtd,KAAKI,EAAMkd,IACdoa,GAAOt3B,EAAMm3B,WAAan3B,EAAMuiB,OAChCA,GAAUviB,EAAMuiB,OAChBgW,EAAUtB,GAAkB/Z,EAAIga,EAAYqB,EAC9C,IAoBF,IAAyBC,EAlBvB,IAAIj3B,EAAS,CAAE2b,GAAIlD,GAAEyP,QAAQvM,GAAI,IAC7BqF,IACFhhB,EAAO41B,WAAaG,EAAM/U,EAC1BhhB,EAAOghB,OAASA,GAElB,OAAOhhB,CACT,EC7BApD,GAEA,SAASs6B,EAAa5Y,EAAG7D,EAAGwb,EAAIY,GAC9B,IAAIhB,EAAUvX,EAAEpC,SAASzB,GACrBoB,EAAOyC,EAAEzC,KAAKpB,GACd0c,EAAKtb,EAAOA,EAAKgY,gBAAa31B,EAC9Bk5B,EAAKvb,EAAOA,EAAKiY,iBAAa51B,EAC9Bm5B,EAAY,CAAA,EAEZF,IACFtB,EAAUpd,GAAEL,OAAOyd,GAAS,SAASnb,GACnC,OAAOA,IAAMyc,GAAMzc,IAAM0c,CAC3B,KAGF,IAAIE,EAAc1B,GAAWtX,EAAGuX,GAChCpd,GAAE1L,QAAQuqB,GAAa,SAAS74B,GAC9B,GAAI6f,EAAEpC,SAASzd,EAAMgc,GAAGtd,OAAQ,CAC9B,IAAIo6B,EAAiBL,EAAa5Y,EAAG7f,EAAMgc,EAAGwb,EAAIY,GAClDQ,EAAU54B,EAAMgc,GAAK8c,EACjB9e,GAAE7Z,IAAI24B,EAAgB,gBAwCNd,EAvCDh4B,EAuCS3B,EAvCFy6B,EAwCzB9e,GAAEH,YAAYme,EAAOb,aAMxBa,EAAOb,WAAa94B,EAAM84B,WAC1Ba,EAAOzV,OAASlkB,EAAMkkB,SANtByV,EAAOb,YAAca,EAAOb,WAAaa,EAAOzV,OAC3BlkB,EAAM84B,WAAa94B,EAAMkkB,SACzByV,EAAOzV,OAASlkB,EAAMkkB,QAC3CyV,EAAOzV,QAAUlkB,EAAMkkB,QA1CvB,CAqCJ,IAA0ByV,EAAQ35B,CApChC,IAEA,IAAIyB,EAAUy3B,GAAiBsB,EAAarB,IAuB9C,SAAyB13B,EAAS84B,GAChC5e,GAAE1L,QAAQxO,GAAS,SAASE,GAC1BA,EAAMkd,GAAKlD,GAAEyP,QAAQzpB,EAAMkd,GAAGxZ,KAAI,SAASsY,GACzC,OAAI4c,EAAU5c,GACL4c,EAAU5c,GAAGkB,GAEflB,MACL,EACN,GACF,CA/BE+c,CAAgBj5B,EAAS84B,GAEzB,IAAIr3B,EAASsnB,GAAK/oB,EAASs4B,GAE3B,GAAIM,IACFn3B,EAAO2b,GAAKlD,GAAEyP,QAAQ,CAACiP,EAAIn3B,EAAO2b,GAAIyb,IAAK,GACvC9Y,EAAE9B,aAAa2a,GAAIh6B,QAAQ,CAC7B,IAAIs6B,EAASnZ,EAAEzC,KAAKyC,EAAE9B,aAAa2a,GAAI,IACrCO,EAASpZ,EAAEzC,KAAKyC,EAAE9B,aAAa4a,GAAI,IAChC3e,GAAE7Z,IAAIoB,EAAQ,gBACjBA,EAAO41B,WAAa,EACpB51B,EAAOghB,OAAS,GAElBhhB,EAAO41B,YAAc51B,EAAO41B,WAAa51B,EAAOghB,OAC3ByW,EAAOtU,MAAQuU,EAAOvU,QAAUnjB,EAAOghB,OAAS,GACrEhhB,EAAOghB,QAAU,CACnB,CAGF,OAAOhhB,CACT,ECpDA,IAAIyY,GAAIzb,GACJ2b,GAAQ3b,GAAuB2b,MAEnC/b,GAgCA,SAAyB0hB,EAAGsP,EAAM+J,GAChC,IAAIz4B,EAgCN,SAAwBof,GACtB,IAAI7D,EACJ,KAAO6D,EAAExC,QAASrB,EAAIhC,GAAE8Q,SAAS,YACjC,OAAO9O,CACT,CApCamd,CAAetZ,GACxBte,EAAS,IAAI2Y,GAAM,CAAEU,UAAU,IAAQ6B,SAAS,CAAEhc,KAAMA,IACrDkc,qBAAoB,SAASX,GAAK,OAAO6D,EAAEzC,KAAKpB,EAAI,IA2BzD,OAzBAhC,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GAChB4B,EAASiC,EAAEjC,OAAO5B,IAEhBoB,EAAK+R,OAASA,GAAQ/R,EAAK+W,SAAWhF,GAAQA,GAAQ/R,EAAK8R,WAC7D3tB,EAAO4b,QAAQnB,GACfza,EAAOoc,UAAU3B,EAAG4B,GAAUnd,GAG9BuZ,GAAE1L,QAAQuR,EAAEqZ,GAAcld,IAAI,SAAS1a,GACrC,IAAI+d,EAAI/d,EAAE0a,IAAMA,EAAI1a,EAAE2a,EAAI3a,EAAE0a,EAC1BwC,EAAOjd,EAAOid,KAAKa,EAAGrD,GACtBuG,EAAUvI,GAAEH,YAAY2E,GAAsB,EAAdA,EAAK+D,OACvChhB,EAAOgd,QAAQc,EAAGrD,EAAG,CAAEuG,OAAQ1C,EAAErB,KAAKld,GAAGihB,OAASA,GACpD,IAEIvI,GAAE7Z,IAAIid,EAAM,YACd7b,EAAO4b,QAAQnB,EAAG,CAChBoZ,WAAYhY,EAAKgY,WAAWjG,GAC5BkG,YAAajY,EAAKiY,YAAYlG,KAItC,IAEO5tB,CACT,EClEA,IAAIyY,GAAIzb,GCER,IAAIyb,GAAIzb,GACJ66B,GAAY76B,GACZ86B,GAAa96B,GACbk6B,GAAel6B,GACf+6B,GAAkB/6B,GAClBg7B,GDHJ,SAAgC1Z,EAAG2X,EAAIta,GACrC,IACEsc,EADE9D,EAAO,CAAE,EAGb1b,GAAE1L,QAAQ4O,GAAI,SAASlB,GAIrB,IAHA,IACE4B,EACA6b,EAFE/b,EAAQmC,EAAEjC,OAAO5B,GAGd0B,GAAO,CASZ,IARAE,EAASiC,EAAEjC,OAAOF,KAEhB+b,EAAY/D,EAAK9X,GACjB8X,EAAK9X,GAAUF,IAEf+b,EAAYD,EACZA,EAAW9b,GAET+b,GAAaA,IAAc/b,EAE7B,YADA8Z,EAAGjZ,QAAQkb,EAAW/b,GAGxBA,EAAQE,CACV,CACF,GAyBF,EC5CI1D,GAAQ3b,GAAuB2b,MAC/BgW,GAAO3xB,GAEXJ,GAiBA,SAAe0hB,GACb,IAAIqP,EAAUgB,GAAKhB,QAAQrP,GACzB6Z,EAAkBC,GAAiB9Z,EAAG7F,GAAE0Q,MAAM,EAAGwE,EAAU,GAAI,WAC/D0K,EAAgBD,GAAiB9Z,EAAG7F,GAAE0Q,MAAMwE,EAAU,GAAI,GAAI,GAAI,YAEhED,EAAWmK,GAAUvZ,GACzBga,GAAYha,EAAGoP,GAKf,IAHA,IACE6K,EADEC,EAASrX,OAAOC,kBAGXnB,EAAI,EAAGwY,EAAW,EAAGA,EAAW,IAAKxY,IAAKwY,EAAU,CAC3DC,GAAiBzY,EAAI,EAAIkY,EAAkBE,EAAepY,EAAI,GAAK,GAEnEyN,EAAWiB,GAAKlB,iBAAiBnP,GACjC,IAAI0W,EAAK8C,GAAWxZ,EAAGoP,GACnBsH,EAAKwD,IACPC,EAAW,EACXF,EAAO9f,GAAEgP,UAAUiG,GACnB8K,EAASxD,EAEb,CAEAsD,GAAYha,EAAGia,EACjB,EAEA,SAASH,GAAiB9Z,EAAGqa,EAAOhB,GAClC,OAAOlf,GAAEtW,IAAIw2B,GAAO,SAAS/K,GAC3B,OAAOmK,GAAgBzZ,EAAGsP,EAAM+J,EAClC,GACF,CAEA,SAASe,GAAiBE,EAAa/B,GACrC,IAAIZ,EAAK,IAAItd,GACbF,GAAE1L,QAAQ6rB,GAAa,SAASC,GAC9B,IAAI35B,EAAO25B,EAAGngB,QAAQxZ,KAClB45B,EAAS5B,GAAa2B,EAAI35B,EAAM+2B,EAAIY,GACxCpe,GAAE1L,QAAQ+rB,EAAOnd,IAAI,SAASlB,EAAGwF,GAC/B4Y,EAAGhd,KAAKpB,GAAG0I,MAAQlD,CACrB,IACA+X,GAAuBa,EAAI5C,EAAI6C,EAAOnd,GACxC,GACF,CAEA,SAAS2c,GAAYha,EAAGoP,GACtBjV,GAAE1L,QAAQ2gB,GAAU,SAASqL,GAC3BtgB,GAAE1L,QAAQgsB,GAAO,SAASte,EAAGwF,GAC3B3B,EAAEzC,KAAKpB,GAAG0I,MAAQlD,CACpB,GACF,GACF,CC5EA,IAAIxH,GAAIzb,GACJ2b,GAAQ3b,GAAuB2b,MAC/BgW,GAAO3xB,GAOXJ,GA8UA,SAAmB0hB,GACjB,IAMI0a,EANAtL,EAAWiB,GAAKlB,iBAAiBnP,GACjC2a,EAAYxgB,GAAE+P,MAChB0Q,GAAmB5a,EAAGoP,GACtByL,GAAmB7a,EAAGoP,IAEpB0L,EAAM,CAAA,EAEV3gB,GAAE1L,QAAQ,CAAC,IAAK,MAAM,SAASssB,GAC7BL,EAA4B,MAATK,EAAe3L,EAAWjV,GAAE3Q,OAAO4lB,GAAU6E,UAChE9Z,GAAE1L,QAAQ,CAAC,IAAK,MAAM,SAASusB,GACf,MAAVA,IACFN,EAAmBvgB,GAAEtW,IAAI62B,GAAkB,SAASO,GAClD,OAAO9gB,GAAE3Q,OAAOyxB,GAAOhH,SACzB,KAGF,IAAIiH,GAAuB,MAATH,EAAe/a,EAAE9B,aAAe8B,EAAE5B,YAAY0G,KAAK9E,GACjEmb,EAAQC,GAAkBpb,EAAG0a,EAAkBC,EAAWO,GAC1DG,EAAKC,GAAqBtb,EAAG0a,EAC/BS,EAAMv6B,KAAMu6B,EAAMA,MAAiB,MAAVH,GACb,MAAVA,IACFK,EAAKlhB,GAAE4P,UAAUsR,GAAI,SAASpa,GAAK,OAAQA,CAAG,KAEhD6Z,EAAIC,EAAOC,GAASK,CACtB,GACF,IAEA,IAAIE,EAAgBC,GAA2Bxb,EAAG8a,GAElD,OADAW,GAAiBX,EAAKS,GACfG,GAAQZ,EAAK9a,EAAE5F,QAAQ+gB,MAChC,EA/UA,SAASP,GAAmB5a,EAAGoP,GAC7B,IAAIuL,EAAY,CAAA,EAqChB,OADAxgB,GAAEF,OAAOmV,GAlCT,SAAoBuM,EAAWlB,GAC7B,IAGEmB,EAAK,EAGLC,EAAU,EACVC,EAAkBH,EAAU98B,OAC5Bk9B,EAAW5hB,GAAE2P,KAAK2Q,GAsBpB,OApBAtgB,GAAE1L,QAAQgsB,GAAO,SAASte,EAAGwF,GAC3B,IAAIvF,EAuEV,SAAmC4D,EAAG7D,GACpC,GAAI6D,EAAEzC,KAAKpB,GAAGiU,MACZ,OAAOjW,GAAEsP,KAAKzJ,EAAE9B,aAAa/B,IAAI,SAASqD,GACxC,OAAOQ,EAAEzC,KAAKiC,GAAG4Q,KACnB,GAEJ,CA7Ec4L,CAA0Bhc,EAAG7D,GACnC8f,EAAK7f,EAAI4D,EAAEzC,KAAKnB,GAAGyI,MAAQiX,GAEzB1f,GAAKD,IAAM4f,KACb5hB,GAAE1L,QAAQgsB,EAAM1xB,MAAM8yB,EAASla,EAAG,IAAI,SAASua,GAC7C/hB,GAAE1L,QAAQuR,EAAE9B,aAAage,IAAW,SAAS1c,GAC3C,IAAI2c,EAASnc,EAAEzC,KAAKiC,GAClB4c,EAAOD,EAAOtX,QACXuX,EAAOR,GAAMK,EAAKG,IACjBD,EAAO/L,OAASpQ,EAAEzC,KAAK2e,GAAU9L,OACrCiM,GAAY1B,EAAWnb,EAAG0c,EAE9B,GACF,IACAL,EAAUla,EAAI,EACdia,EAAKK,EAET,IAEOxB,CACT,IAGOE,CACT,CAEA,SAASE,GAAmB7a,EAAGoP,GAC7B,IAAIuL,EAAY,CAAA,EAEhB,SAAS2B,EAAKC,EAAOzF,EAAU0F,EAAUC,EAAiBC,GACxD,IAAIvgB,EACJhC,GAAE1L,QAAQ0L,GAAE0Q,MAAMiM,EAAU0F,IAAW,SAAS7a,GAC9CxF,EAAIogB,EAAM5a,GACN3B,EAAEzC,KAAKpB,GAAGiU,OACZjW,GAAE1L,QAAQuR,EAAE9B,aAAa/B,IAAI,SAASqD,GACpC,IAAImd,EAAQ3c,EAAEzC,KAAKiC,GACfmd,EAAMvM,QACLuM,EAAM9X,MAAQ4X,GAAmBE,EAAM9X,MAAQ6X,IAClDL,GAAY1B,EAAWnb,EAAGrD,EAE9B,GAEJ,GACF,CAyBA,OADAhC,GAAEF,OAAOmV,GArBT,SAAoBwN,EAAOL,GACzB,IACEM,EADEC,GAAgB,EAElBhG,EAAW,EAeb,OAbA3c,GAAE1L,QAAQ8tB,GAAO,SAASpgB,EAAG4gB,GAC3B,GAAwB,WAApB/c,EAAEzC,KAAKpB,GAAGiU,MAAoB,CAChC,IAAIlS,EAAe8B,EAAE9B,aAAa/B,GAC9B+B,EAAarf,SACfg+B,EAAe7c,EAAEzC,KAAKW,EAAa,IAAI2G,MACvCyX,EAAKC,EAAOzF,EAAUiG,EAAgBD,EAAcD,GACpD/F,EAAWiG,EACXD,EAAeD,EAEnB,CACAP,EAAKC,EAAOzF,EAAUyF,EAAM19B,OAAQg+B,EAAcD,EAAM/9B,OAC1D,IAEO09B,CACT,IAGO5B,CACT,CAUA,SAAS0B,GAAY1B,EAAWxe,EAAGC,GACjC,GAAID,EAAIC,EAAG,CACT,IAAIC,EAAMF,EACVA,EAAIC,EACJA,EAAIC,CACN,CAEA,IAAI2gB,EAAarC,EAAUxe,GACtB6gB,IACHrC,EAAUxe,GAAK6gB,EAAa,IAE9BA,EAAW5gB,IAAK,CAClB,CAEA,SAAS6gB,GAAYtC,EAAWxe,EAAGC,GACjC,GAAID,EAAIC,EAAG,CACT,IAAIC,EAAMF,EACVA,EAAIC,EACJA,EAAIC,CACN,CACA,OAAOlC,GAAE7Z,IAAIq6B,EAAUxe,GAAIC,EAC7B,CAUA,SAASgf,GAAkBpb,EAAGoP,EAAUuL,EAAWO,GACjD,IAAIt6B,EAAO,CAAE,EACXu6B,EAAQ,CAAE,EACVnE,EAAM,CAAA,EAkCR,OA7BA7c,GAAE1L,QAAQ2gB,GAAU,SAASqL,GAC3BtgB,GAAE1L,QAAQgsB,GAAO,SAASte,EAAG0I,GAC3BjkB,EAAKub,GAAKA,EACVgf,EAAMhf,GAAKA,EACX6a,EAAI7a,GAAK0I,CACX,GACF,IAEA1K,GAAE1L,QAAQ2gB,GAAU,SAASqL,GAC3B,IAAIyC,GAAW,EACf/iB,GAAE1L,QAAQgsB,GAAO,SAASte,GACxB,IAAIghB,EAAKjC,EAAW/e,GACpB,GAAIghB,EAAGt+B,OAAQ,CACbs+B,EAAKhjB,GAAE4Q,OAAOoS,GAAI,SAAS/gB,GAAK,OAAO4a,EAAI5a,EAAI,IAE/C,IADA,IAAIghB,GAAMD,EAAGt+B,OAAS,GAAK,EAClB8iB,EAAIrK,KAAK+lB,MAAMD,GAAKE,EAAKhmB,KAAKsQ,KAAKwV,GAAKzb,GAAK2b,IAAM3b,EAAG,CAC7D,IAAIvF,EAAI+gB,EAAGxb,GACPwZ,EAAMhf,KAAOA,GACb+gB,EAAUlG,EAAI5a,KACb6gB,GAAYtC,EAAWxe,EAAGC,KAC7B+e,EAAM/e,GAAKD,EACXgf,EAAMhf,GAAKvb,EAAKub,GAAKvb,EAAKwb,GAC1B8gB,EAAUlG,EAAI5a,GAElB,CACF,CACF,GACF,IAEO,CAAExb,KAAMA,EAAMu6B,MAAOA,EAC9B,CAEA,SAASG,GAAqBtb,EAAGoP,EAAUxuB,EAAMu6B,EAAOoC,GAMtD,IAAIlC,EAAK,CAAE,EACTmC,EAmDJ,SAAyBxd,EAAGoP,EAAUxuB,EAAM28B,GAC1C,IAAIE,EAAa,IAAIpjB,GACnBwa,EAAa7U,EAAE5F,QACfsjB,EA+GJ,SAAajJ,EAASkJ,EAASJ,GAC7B,OAAO,SAASvd,EAAG7D,EAAGC,GACpB,IAGIsT,EAHAoD,EAAS9S,EAAEzC,KAAKpB,GAChB4W,EAAS/S,EAAEzC,KAAKnB,GAChBqb,EAAM,EAIV,GADAA,GAAO3E,EAAO/D,MAAQ,EAClB5U,GAAE7Z,IAAIwyB,EAAQ,YAChB,OAAQA,EAAOlC,SAASqF,eACxB,IAAK,IAAKvG,GAASoD,EAAO/D,MAAQ,EAAG,MACrC,IAAK,IAAKW,EAAQoD,EAAO/D,MAAQ,EAYnC,GATIW,IACF+H,GAAO8F,EAAa7N,GAASA,GAE/BA,EAAQ,EAER+H,IAAQ3E,EAAO1C,MAAQuN,EAAUlJ,GAAW,EAC5CgD,IAAQ1E,EAAO3C,MAAQuN,EAAUlJ,GAAW,EAE5CgD,GAAO1E,EAAOhE,MAAQ,EAClB5U,GAAE7Z,IAAIyyB,EAAQ,YAChB,OAAQA,EAAOnC,SAASqF,eACxB,IAAK,IAAKvG,EAAQqD,EAAOhE,MAAQ,EAAG,MACpC,IAAK,IAAKW,GAASqD,EAAOhE,MAAQ,EAQpC,OALIW,IACF+H,GAAO8F,EAAa7N,GAASA,GAE/BA,EAAQ,EAED+H,EAEX,CAnJYmG,CAAI/I,EAAWgJ,QAAShJ,EAAWiJ,QAASP,GAgBtD,OAdApjB,GAAE1L,QAAQ2gB,GAAU,SAASqL,GAC3B,IAAIjb,EACJrF,GAAE1L,QAAQgsB,GAAO,SAASte,GACxB,IAAI4hB,EAAQn9B,EAAKub,GAEjB,GADAshB,EAAWngB,QAAQygB,GACfve,EAAG,CACL,IAAIwe,EAAQp9B,EAAK4e,GACfye,EAAUR,EAAW9e,KAAKqf,EAAOD,GACnCN,EAAW/e,QAAQsf,EAAOD,EAAOzmB,KAAKC,IAAImmB,EAAM1d,EAAG7D,EAAGqD,GAAIye,GAAW,GACvE,CACAze,EAAIrD,CACN,GACF,IAEOshB,CACT,CAvEaS,CAAgBle,EAAGoP,EAAUxuB,EAAM28B,GAC5C3H,EAAa2H,EAAa,aAAe,cAE3C,SAASY,EAAQC,EAAWC,GAI1B,IAHA,IAAIjwB,EAAQovB,EAAOvgB,QACfqhB,EAAOlwB,EAAM3O,MACbihB,EAAU,CAAA,EACP4d,GACD5d,EAAQ4d,GACVF,EAAUE,IAEV5d,EAAQ4d,IAAQ,EAChBlwB,EAAMrO,KAAKu+B,GACXlwB,EAAQA,EAAMyR,OAAOwe,EAAcC,KAGrCA,EAAOlwB,EAAM3O,KAEjB,CA6BA,OARA0+B,GAlBA,SAAeG,GACbjD,EAAGiD,GAAQd,EAAOje,QAAQ+e,GAAMrkB,QAAO,SAASoJ,EAAK5hB,GACnD,OAAO6V,KAAKC,IAAI8L,EAAKgY,EAAG55B,EAAE0a,GAAKqhB,EAAO7e,KAAKld,GAC5C,GAAE,EACL,GAce+7B,EAAOtf,aAAa4G,KAAK0Y,IACxCW,GAZA,SAAeG,GACb,IAAInd,EAAMqc,EAAO9d,SAAS4e,GAAMrkB,QAAO,SAASoJ,EAAK5hB,GACnD,OAAO6V,KAAK6J,IAAIkC,EAAKgY,EAAG55B,EAAE2a,GAAKohB,EAAO7e,KAAKld,GAC7C,GAAGohB,OAAOC,mBAENvF,EAAOyC,EAAEzC,KAAK+gB,GACdnd,IAAQ0B,OAAOC,mBAAqBvF,EAAKqY,aAAeA,IAC1DyF,EAAGiD,GAAQhnB,KAAKC,IAAI8jB,EAAGiD,GAAOnd,GAElC,GAGeqc,EAAOpf,WAAW0G,KAAK0Y,IAGtCrjB,GAAE1L,QAAQ0sB,GAAO,SAAShf,GACxBkf,EAAGlf,GAAKkf,EAAGz6B,EAAKub,GAClB,IAEOkf,CACT,CA4BA,SAASG,GAA2Bxb,EAAG8a,GACrC,OAAO3gB,GAAEqQ,MAAMrQ,GAAE3Q,OAAOsxB,IAAM,SAAUO,GACtC,IAAI9jB,EAAMsL,OAAO0b,kBACbpd,EAAM0B,OAAOC,kBASjB,OAPA3I,GAAE0P,MAAMwR,GAAI,SAAUpa,EAAG9E,GACvB,IAAIqiB,EAyHV,SAAexe,EAAG7D,GAChB,OAAO6D,EAAEzC,KAAKpB,GAAG4S,KACnB,CA3HsBA,CAAM/O,EAAG7D,GAAK,EAE9B5E,EAAMD,KAAKC,IAAI0J,EAAIud,EAAWjnB,GAC9B4J,EAAM7J,KAAK6J,IAAIF,EAAIud,EAAWrd,EAChC,IAEO5J,EAAM4J,CACf,GACF,CASA,SAASsa,GAAiBX,EAAK2D,GAC7B,IAAIC,EAAcvkB,GAAE3Q,OAAOi1B,GACzBE,EAAaxkB,GAAEgH,IAAIud,GACnBE,EAAazkB,GAAE5C,IAAImnB,GAErBvkB,GAAE1L,QAAQ,CAAC,IAAK,MAAM,SAASssB,GAC7B5gB,GAAE1L,QAAQ,CAAC,IAAK,MAAM,SAASusB,GAC7B,IAEEtL,EAFEmP,EAAY9D,EAAOC,EACrBK,EAAKP,EAAI+D,GAEX,GAAIxD,IAAOoD,EAAX,CAEA,IAAIK,EAAS3kB,GAAE3Q,OAAO6xB,IACtB3L,EAAkB,MAAVsL,EAAgB2D,EAAaxkB,GAAEgH,IAAI2d,GAAUF,EAAazkB,GAAE5C,IAAIunB,MAGtEhE,EAAI+D,GAAa1kB,GAAE4P,UAAUsR,GAAI,SAASpa,GAAK,OAAOA,EAAIyO,CAAO,IAN/C,CAQtB,GACF,GACF,CAEA,SAASgM,GAAQZ,EAAKK,GACpB,OAAOhhB,GAAE4P,UAAU+Q,EAAIiE,IAAI,SAASC,EAAQ7iB,GAC1C,GAAIgf,EACF,OAAOL,EAAIK,EAAMlF,eAAe9Z,GAEhC,IAAIkf,EAAKlhB,GAAE4Q,OAAO5Q,GAAEtW,IAAIi3B,EAAK3e,IAC7B,OAAQkf,EAAG,GAAKA,EAAG,IAAM,CAE7B,GACF,CCrVA,IAAIlhB,GAAIzb,GACJ2xB,GAAO3xB,GACPugC,GAAYvgC,GCFhB,IAAIyb,GAAIzb,GACJwgC,GAAUxgC,GACVygC,GAAYzgC,GACZ4wB,GAAO5wB,GACP6wB,GAAiB7wB,GAAkB6wB,eACnC6P,GAAoB1gC,GACpB8wB,GAAmB9wB,GAAkB8wB,iBACrC6P,GAAe3gC,GACf4gC,GAAoB5gC,GACpB6gC,GAAmB7gC,GACnBmmB,GAAQnmB,GACR8gC,GDLJ,SAAkBxf,IASlB,SAAmBA,GACjB,IAAIoP,EAAWiB,GAAKlB,iBAAiBnP,GACjCyf,EAAUzf,EAAE5F,QAAQslB,QACpBC,EAAQ,EACZxlB,GAAE1L,QAAQ2gB,GAAU,SAASqL,GAC3B,IAAImF,EAAYzlB,GAAE5C,IAAI4C,GAAEtW,IAAI42B,GAAO,SAASte,GAAK,OAAO6D,EAAEzC,KAAKpB,GAAG8S,MAAS,KAC3E9U,GAAE1L,QAAQgsB,GAAO,SAASte,GACxB6D,EAAEzC,KAAKpB,GAAGyS,EAAI+Q,EAAQC,EAAY,CACpC,IACAD,GAASC,EAAYH,CACvB,GACF,EAjBEI,CAFA7f,EAAIqQ,GAAKnC,mBAAmBlO,IAG5B7F,GAAE1L,QAAQwwB,GAAUjf,IAAI,SAASiB,EAAG9E,GAClC6D,EAAEzC,KAAKpB,GAAG8E,EAAIA,CAChB,GACF,ECDIoP,GAAO3xB,GACP2b,GAAQ3b,GAAsB2b,MAElC/b,GAEA,SAAgB0hB,EAAGvF,GACjB,IAAIwV,EAAOxV,GAAQA,EAAKqlB,YAAczP,GAAKJ,KAAOI,GAAKH,OACvDD,EAAK,UAAU,WACb,IAAI8P,EACF9P,EAAK,sBAAsB,WAAa,OA2F9C,SAA0B+P,GACxB,IAAIhgB,EAAI,IAAI3F,GAAM,CAAEQ,YAAY,EAAME,UAAU,IAC5CX,EAAQ6lB,GAAaD,EAAW5lB,SAqBpC,OAnBA4F,EAAEpD,SAASzC,GAAE+P,MAAM,CAAE,EACnBgW,GACAC,GAAkB/lB,EAAOgmB,IACzBjmB,GAAEsQ,KAAKrQ,EAAOimB,MAEhBlmB,GAAE1L,QAAQuxB,EAAW/iB,SAAS,SAASd,GACrC,IAAIoB,EAAO0iB,GAAaD,EAAWziB,KAAKpB,IACxC6D,EAAE1C,QAAQnB,EAAGhC,GAAEkP,SAAS8W,GAAkB5iB,EAAM+iB,IAAeC,KAC/DvgB,EAAElC,UAAU3B,EAAG6jB,EAAWjiB,OAAO5B,GACnC,IAEAhC,GAAE1L,QAAQuxB,EAAWhhB,SAAS,SAASvd,GACrC,IAAIkd,EAAOshB,GAAaD,EAAWrhB,KAAKld,IACxCue,EAAEtB,QAAQjd,EAAG0Y,GAAE+P,MAAM,CAAE,EACrBsW,GACAL,GAAkBxhB,EAAM8hB,IACxBtmB,GAAEsQ,KAAK9L,EAAM+hB,KACjB,IAEO1gB,CACT,CAnHqD2gB,CAAiB3gB,EAAI,IACtEiQ,EAAK,eAAsB,YAK/B,SAAmBjQ,EAAGiQ,GACpBA,EAAK,8BAA8B,YAsHrC,SAAgCjQ,GAC9B,IAAI5F,EAAQ4F,EAAE5F,QACdA,EAAMslB,SAAW,EACjBvlB,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GAClBkd,EAAKsP,QAAU,EACqB,MAAhCtP,EAAKiS,SAASqF,gBACM,OAAlB7b,EAAM4b,SAAsC,OAAlB5b,EAAM4b,QAClCrX,EAAKoQ,OAASpQ,EAAKiiB,YAEnBjiB,EAAKsQ,QAAUtQ,EAAKiiB,YAG1B,GACF,CApIkDC,CAAuB7gB,EAAI,IAC3EiQ,EAAK,uBAA8B,YAmSrC,SAAyBjQ,GACvB7F,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,GAAIA,EAAE0a,IAAM1a,EAAE2a,EAAG,CACf,IAAImB,EAAOyC,EAAEzC,KAAK9b,EAAE0a,GACfoB,EAAKujB,YACRvjB,EAAKujB,UAAY,IAEnBvjB,EAAKujB,UAAU/gC,KAAK,CAAE0B,EAAGA,EAAGob,MAAOmD,EAAErB,KAAKld,KAC1Cue,EAAEtC,WAAWjc,EACf,CACF,GACF,CA9SkDs/B,CAAgB/gB,EAAI,IACpEiQ,EAAK,eAA8B,WAAaiP,GAAQ5R,IAAItN,EAAI,IAChEiQ,EAAK,wBAA8B,WAAaoP,GAAa/R,IAAItN,EAAI,IACrEiQ,EAAK,YAA8B,WAAaX,GAAKe,GAAKnC,mBAAmBlO,GAAK,IAClFiQ,EAAK,8BAA8B,YAuIrC,SAAgCjQ,GAC9B7F,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GAClB,GAAIkd,EAAKoQ,OAASpQ,EAAKsQ,OAAQ,CAC7B,IAAI9S,EAAI6D,EAAEzC,KAAK9b,EAAE0a,GAEbU,EAAQ,CAAEyS,MADNtP,EAAEzC,KAAK9b,EAAE2a,GACMkT,KAAOnT,EAAEmT,MAAQ,EAAInT,EAAEmT,KAAM7tB,EAAGA,GACvD4uB,GAAKxC,aAAa7N,EAAG,aAAcnD,EAAO,MAC5C,CACF,GACF,CAjJkDmkB,CAAuBhhB,EAAI,IAC3EiQ,EAAK,wBAA8B,WAAaT,GAAiBxP,EAAI,IACrEiQ,EAAK,4BAA8B,WAAaoP,GAAazK,QAAQ5U,EAAI,IACzEiQ,EAAK,sBAA8B,WAAaV,GAAevP,EAAI,IACnEiQ,EAAK,wBAA8B,YA+IrC,SAA0BjQ,GACxB,IAAIqP,EAAU,EACdlV,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GACdoB,EAAK0X,YACP1X,EAAK+W,QAAUtU,EAAEzC,KAAKA,EAAK0X,WAAW3F,KACtC/R,EAAK8R,QAAUrP,EAAEzC,KAAKA,EAAK2X,cAAc5F,KACzCD,EAAUlV,GAAE5C,IAAI8X,EAAS9R,EAAK8R,SAElC,IACArP,EAAE5F,QAAQiV,QAAUA,CACtB,CA1JkD4R,CAAiBjhB,EAAI,IACrEiQ,EAAK,8BAA8B,YA2JrC,SAAgCjQ,GAC9B7F,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GACC,eAAfoB,EAAK6S,QACPpQ,EAAErB,KAAKpB,EAAK9b,GAAGivB,UAAYnT,EAAK+R,KAChCtP,EAAEvC,WAAWtB,GAEjB,GACF,CAnKkD+kB,CAAuBlhB,EAAI,IAC3EiQ,EAAK,qBAA8B,WAAakP,GAAU7R,IAAItN,EAAI,IAClEiQ,EAAK,yBAA8B,WAAamP,GAAkBpf,EAAI,IACtEiQ,EAAK,yBAA8B,WAAaqP,GAAkBtf,EAAI,IACtEiQ,EAAK,aAA8B,WAAapL,GAAM7E,EAAI,IAC1DiQ,EAAK,uBAA8B,YAkSrC,SAAyBjQ,GACvB,IAAIyP,EAASY,GAAKlB,iBAAiBnP,GACnC7F,GAAE1L,QAAQghB,GAAQ,SAASgL,GACzB,IAAI0G,EAAa,EACjBhnB,GAAE1L,QAAQgsB,GAAO,SAASte,EAAGwF,GAC3B,IAAIpE,EAAOyC,EAAEzC,KAAKpB,GAClBoB,EAAKsH,MAAQlD,EAAIwf,EACjBhnB,GAAE1L,QAAQ8O,EAAKujB,WAAW,SAASM,GACjC/Q,GAAKxC,aAAa7N,EAAG,WAAY,CAC/B+O,MAAOqS,EAASvkB,MAAMkS,MACtBE,OAAQmS,EAASvkB,MAAMoS,OACvBK,KAAM/R,EAAK+R,KACXzK,MAAOlD,KAAOwf,EACd1/B,EAAG2/B,EAAS3/B,EACZob,MAAOukB,EAASvkB,OACf,MACL,WACOU,EAAKujB,SACd,GACF,GACF,CAtTkDO,CAAgBrhB,EAAI,IACpEiQ,EAAK,8BAA8B,WAAasP,GAAiBzJ,OAAO9V,EAAI,IAC5EiQ,EAAK,gBAA8B,WAAauP,GAASxf,EAAI,IAC7DiQ,EAAK,yBAA8B,YAqTrC,SAA2BjQ,GACzB7F,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GAClB,GAAmB,aAAfoB,EAAK6S,MAAsB,CAC7B,IAAIkR,EAAWthB,EAAEzC,KAAKA,EAAK9b,EAAE0a,GACzB8E,EAAIqgB,EAASrgB,EAAIqgB,EAASvS,MAAQ,EAClCH,EAAI0S,EAAS1S,EACbC,EAAKtR,EAAK0D,EAAIA,EACd6N,EAAKwS,EAASrS,OAAS,EAC3BjP,EAAEtB,QAAQnB,EAAK9b,EAAG8b,EAAKV,OACvBmD,EAAEvC,WAAWtB,GACboB,EAAKV,MAAM8T,OAAS,CAClB,CAAE1P,EAAGA,EAAI,EAAI4N,EAAK,EAAGD,EAAGA,EAAIE,GAC5B,CAAE7N,EAAGA,EAAI,EAAI4N,EAAK,EAAGD,EAAGA,EAAIE,GAC5B,CAAE7N,EAAGA,EAAQ4N,EAAQD,EAAGA,GACxB,CAAE3N,EAAGA,EAAI,EAAI4N,EAAK,EAAGD,EAAGA,EAAIE,GAC5B,CAAE7N,EAAGA,EAAI,EAAI4N,EAAK,EAAGD,EAAGA,EAAIE,IAE9BvR,EAAKV,MAAMoE,EAAI1D,EAAK0D,EACpB1D,EAAKV,MAAM+R,EAAIrR,EAAKqR,CACtB,CACF,GACF,CA3UkD2S,CAAkBvhB,EAAI,IACtEiQ,EAAK,yBAA8B,YA0PrC,SAA2BjQ,GACzB7F,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,GAAI6D,EAAEpC,SAASzB,GAAGtd,OAAQ,CACxB,IAAI0e,EAAOyC,EAAEzC,KAAKpB,GACd8U,EAAIjR,EAAEzC,KAAKA,EAAK0X,WAChBuM,EAAIxhB,EAAEzC,KAAKA,EAAK2X,cAChBtT,EAAI5B,EAAEzC,KAAKpD,GAAE2P,KAAKvM,EAAKgY,aACvB1T,EAAI7B,EAAEzC,KAAKpD,GAAE2P,KAAKvM,EAAKiY,cAE3BjY,EAAKwR,MAAQzX,KAAK4X,IAAIrN,EAAEZ,EAAIW,EAAEX,GAC9B1D,EAAK0R,OAAS3X,KAAK4X,IAAIsS,EAAE5S,EAAIqC,EAAErC,GAC/BrR,EAAK0D,EAAIW,EAAEX,EAAI1D,EAAKwR,MAAQ,EAC5BxR,EAAKqR,EAAIqC,EAAErC,EAAIrR,EAAK0R,OAAS,CAC/B,CACF,IAEA9U,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GACJ,WAApB6D,EAAEzC,KAAKpB,GAAGiU,OACZpQ,EAAEvC,WAAWtB,EAEjB,GACF,CA/QkDslB,CAAkBzhB,EAAI,IACtEiQ,EAAK,sBAA8B,WAAakP,GAAUvR,KAAK5N,EAAI,IACnEiQ,EAAK,4BAA8B,YAgOrC,SAA8BjQ,GAC5B7F,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GAClB,GAAI0Y,GAAE7Z,IAAIqe,EAAM,KAId,OAHsB,MAAlBA,EAAKiS,UAAsC,MAAlBjS,EAAKiS,WAChCjS,EAAKoQ,OAASpQ,EAAKiiB,aAEbjiB,EAAKiS,UACb,IAAK,IAAKjS,EAAKsC,GAAKtC,EAAKoQ,MAAQ,EAAIpQ,EAAKiiB,YAAa,MACvD,IAAK,IAAKjiB,EAAKsC,GAAKtC,EAAKoQ,MAAQ,EAAIpQ,EAAKiiB,YAG9C,GACF,CA7OkDc,CAAqB1hB,EAAI,IACzEiQ,EAAK,4BAA8B,WAAasP,GAAiB3R,KAAK5N,EAAI,IAC1EiQ,EAAK,sBAA8B,YAwJrC,SAAwBjQ,GACtB,IAAI2hB,EAAO9e,OAAOC,kBACd8e,EAAO,EACPC,EAAOhf,OAAOC,kBACdgf,EAAO,EACPjN,EAAa7U,EAAE5F,QACf2nB,EAAUlN,EAAWmN,SAAW,EAChCC,EAAUpN,EAAWqN,SAAW,EAEpC,SAASC,EAAYhS,GACnB,IAAIlP,EAAIkP,EAAMlP,EACV2N,EAAIuB,EAAMvB,EACVxS,EAAI+T,EAAMpB,MACVC,EAAImB,EAAMlB,OACd0S,EAAOrqB,KAAK6J,IAAIwgB,EAAM1gB,EAAI7E,EAAI,GAC9BwlB,EAAOtqB,KAAKC,IAAIqqB,EAAM3gB,EAAI7E,EAAI,GAC9BylB,EAAOvqB,KAAK6J,IAAI0gB,EAAMjT,EAAII,EAAI,GAC9B8S,EAAOxqB,KAAKC,IAAIuqB,EAAMlT,EAAII,EAAI,EAChC,CAEA7U,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAAKgmB,EAAYniB,EAAEzC,KAAKpB,GAAK,IAC3DhC,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GACd0Y,GAAE7Z,IAAIqe,EAAM,MACdwjB,EAAYxjB,EAEhB,IAEAgjB,GAAQI,EACRF,GAAQI,EAER9nB,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B,IAAIoB,EAAOyC,EAAEzC,KAAKpB,GAClBoB,EAAK0D,GAAK0gB,EACVpkB,EAAKqR,GAAKiT,CACZ,IAEA1nB,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GAClB0Y,GAAE1L,QAAQkQ,EAAKgS,QAAQ,SAASyR,GAC9BA,EAAEnhB,GAAK0gB,EACPS,EAAExT,GAAKiT,CACT,IACI1nB,GAAE7Z,IAAIqe,EAAM,OAAQA,EAAKsC,GAAK0gB,GAC9BxnB,GAAE7Z,IAAIqe,EAAM,OAAQA,EAAKiQ,GAAKiT,EACpC,IAEAhN,EAAW9F,MAAQ6S,EAAOD,EAAOI,EACjClN,EAAW5F,OAAS6S,EAAOD,EAAOI,CACpC,CAzMkDI,CAAeriB,EAAI,IACnEiQ,EAAK,4BAA8B,YA0MrC,SAA8BjQ,GAC5B7F,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAGI6gC,EAAIC,EAHJ5jB,EAAOqB,EAAErB,KAAKld,GACd+gC,EAAQxiB,EAAEzC,KAAK9b,EAAE0a,GACjBsmB,EAAQziB,EAAEzC,KAAK9b,EAAE2a,GAEhBuC,EAAKgS,QAKR2R,EAAK3jB,EAAKgS,OAAO,GACjB4R,EAAK5jB,EAAKgS,OAAOhS,EAAKgS,OAAO9xB,OAAS,KALtC8f,EAAKgS,OAAS,GACd2R,EAAKG,EACLF,EAAKC,GAKP7jB,EAAKgS,OAAO+R,QAAQrS,GAAK9B,cAAciU,EAAOF,IAC9C3jB,EAAKgS,OAAO5wB,KAAKswB,GAAK9B,cAAckU,EAAOF,GAC7C,GACF,CA3NkDI,CAAqB3iB,EAAI,IACzEiQ,EAAK,qBAA8B,YA2OrC,SAAuCjQ,GACrC7F,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5B,IAAIkd,EAAOqB,EAAErB,KAAKld,GACdkd,EAAKgP,UACPhP,EAAKgS,OAAOsD,SAEhB,GACF,CAlPkD2O,CAA8B5iB,EAAI,IAClFiQ,EAAK,oBAA8B,WAAaiP,GAAQtR,KAAK5N,EAAI,GACnE,CAjC4C6iB,CAAU9C,EAAa9P,EAAO,IACtEA,EAAK,sBAAsB,YAwC/B,SAA0B+P,EAAYD,GACpC5lB,GAAE1L,QAAQuxB,EAAW/iB,SAAS,SAASd,GACrC,IAAI2mB,EAAa9C,EAAWziB,KAAKpB,GAC7B4mB,EAAchD,EAAYxiB,KAAKpB,GAE/B2mB,IACFA,EAAW7hB,EAAI8hB,EAAY9hB,EAC3B6hB,EAAWlU,EAAImU,EAAYnU,EAEvBmR,EAAYniB,SAASzB,GAAGtd,SAC1BikC,EAAW/T,MAAQgU,EAAYhU,MAC/B+T,EAAW7T,OAAS8T,EAAY9T,QAGtC,IAEA9U,GAAE1L,QAAQuxB,EAAWhhB,SAAS,SAASvd,GACrC,IAAIqhC,EAAa9C,EAAWrhB,KAAKld,GAC7BshC,EAAchD,EAAYphB,KAAKld,GAEnCqhC,EAAWnS,OAASoS,EAAYpS,OAC5BxW,GAAE7Z,IAAIyiC,EAAa,OACrBD,EAAW7hB,EAAI8hB,EAAY9hB,EAC3B6hB,EAAWlU,EAAImU,EAAYnU,EAE/B,IAEAoR,EAAW5lB,QAAQ2U,MAAQgR,EAAY3lB,QAAQ2U,MAC/CiR,EAAW5lB,QAAQ6U,OAAS8Q,EAAY3lB,QAAQ6U,MAClD,CArE4C+T,CAAiBhjB,EAAG+f,EAAc,GAC5E,GACF,EAqEA,IAAIK,GAAgB,CAAC,UAAW,UAAW,UAAW,UAAW,WAC7DF,GAAgB,CAAER,QAAS,GAAI5B,QAAS,GAAID,QAAS,GAAI7H,QAAS,MAClEqK,GAAa,CAAC,YAAa,SAAU,UAAW,SAChDC,GAAe,CAAC,QAAS,UACzBC,GAAe,CAAExR,MAAO,EAAGE,OAAQ,GACnCwR,GAAe,CAAC,SAAU,SAAU,QAAS,SAAU,eACvDD,GAAe,CACjBvS,OAAQ,EAAGvL,OAAQ,EAAGqM,MAAO,EAAGE,OAAQ,EACxC2R,YAAa,GAAIhQ,SAAU,KAEzB8P,GAAY,CAAC,YAmRjB,SAASP,GAAkB8C,EAAK9S,GAC9B,OAAOhW,GAAE4P,UAAU5P,GAAEsQ,KAAKwY,EAAK9S,GAAQtN,OACzC,CAEA,SAASod,GAAa9P,GACpB,IAAI+S,EAAW,CAAA,EAIf,OAHA/oB,GAAE1L,QAAQ0hB,GAAO,SAAShU,EAAGN,GAC3BqnB,EAASrnB,EAAEoa,eAAiB9Z,CAC9B,IACO+mB,CACT,CCvYA,IAAI/oB,GAAIzb,GACJ2xB,GAAO3xB,GACP2b,GAAQ3b,GAAsB2b,MCFlC/b,ICsBAA,GAAiB,CACfsQ,SAAUlQ,GAEVykC,OAAQzkC,GACR0kC,MFtBe,CACfC,cAIF,SAAuBrjB,GACrB,IAAIsjB,EAAcjT,GAAKlB,iBAAiBnP,GAEpCgP,EAAI,IAAI3U,GAAM,CAAEU,UAAU,EAAMF,YAAY,IAAQ+B,SAAS,CAAA,GAoBjE,OAlBAzC,GAAE1L,QAAQuR,EAAE/C,SAAS,SAASd,GAC5B6S,EAAE1R,QAAQnB,EAAG,CAAEU,MAAOV,IACtB6S,EAAElR,UAAU3B,EAAG,QAAU6D,EAAEzC,KAAKpB,GAAGmT,KACrC,IAEAnV,GAAE1L,QAAQuR,EAAEhB,SAAS,SAASvd,GAC5ButB,EAAEtQ,QAAQjd,EAAE0a,EAAG1a,EAAE2a,EAAG,CAAE,EAAE3a,EAAEkP,KAC5B,IAEAwJ,GAAE1L,QAAQ60B,GAAa,SAAS7I,EAAO9Y,GACrC,IAAI4hB,EAAS,QAAU5hB,EACvBqN,EAAE1R,QAAQimB,EAAQ,CAAEjU,KAAM,SAC1BnV,GAAEF,OAAOwgB,GAAO,SAASjb,EAAGrD,GAE1B,OADA6S,EAAEtQ,QAAQc,EAAGrD,EAAG,CAAEqnB,MAAO,UAClBrnB,CACT,GACF,IAEO6S,CACT,GENEqB,KAAM,CACJJ,KAAMvxB,GAAsBuxB,KAC5BC,OAAQxxB,GAAsBwxB,QAEhCpQ,QD/Be,eEyCJ2jB,GAcX,MAAAC,CAAOC,GACL5kC,KAAK4kC,GAAKA,CACX,CAMD,MAAAR,CAAOS,EAAsB,IAC3B,MAAM3mB,MAAEA,EAAK+B,MAAEA,EAAK6kB,SAAEA,GAAa9kC,KAAK4kC,GAAGG,WAG3C,IAAIjG,EAAU,IACV6B,EAAU,IACVmE,EAAW,KACbhG,EAAqB,EAAXgG,EACVnE,EAAqB,EAAXmE,GAIZ9kC,KAAK6kC,OAAMnjC,OAAAsjC,OAAA,CAET/N,QAAS,KAETmF,MAAO,KAEP3H,OAAQ,aAERkM,UAEA7B,UAEAmE,QAAS,IAETE,QAAS,KAEN0B,GAIL,MAAM5jB,EAAI,IAAIpR,YAASyL,MACvB2F,EAAEpD,SAAS7d,KAAK6kC,QAChB5jB,EAAElB,qBAAoB,MAAS,KAG/B7B,EAAMxO,SAAS8O,IACbyC,EAAE1C,QAAQC,EAAK6N,GAAI,CACjB2D,MAAOxR,EAAKwR,OAAS,IACrBE,OAAQ1R,EAAK0R,QAAU,GACvB7D,GAAI7N,EAAK6N,IACT,IAIJpM,EAAMvQ,SAASkQ,IACbqB,EAAEtB,QAAQC,EAAKqlB,aAAcrlB,EAAKslB,aAAc,CAC9C7Y,GAAIzM,EAAKyM,IACT,IAIJ8Y,GAAMf,OAAOnjB,GAGb,MAAMmkB,EAAyB,GACzBC,EAAyB,GAG/BnnB,EAAMxO,SAAS8O,UACb,MAAM0D,EAAEA,EAAC2N,EAAEA,GAAM5O,EAAEzC,KAAKA,EAAK6N,IACvBiZ,EAAS9mB,EAAK+mB,UACpB,IAAKD,EACH,MAAM,IAAIrmB,MAAM,eAAeT,EAAK6N,UAItCiZ,EAAOpjB,EAAIA,EACXojB,EAAOzV,EAAIA,GAGK,QAAZ2V,EAAAF,aAAM,EAANA,EAAQG,YAAI,IAAAD,OAAA,EAAAA,EAAEtjB,KAChBojB,EAAOG,KAAKvjB,EAAIA,EAChBojB,EAAOG,KAAK5V,EAAIA,GAGlBuV,EAASpkC,KAAKskC,EAAO,IAIvBrlB,EAAMvQ,SAASkQ,IACb,MAAM8lB,EAAc9lB,EAAK2lB,UACzB,GAAKG,EAAL,CAIA,GAAKb,EAAOc,gBAQL,QAEED,EAAOE,kBACPF,EAAOG,kBACPH,EAAOI,gBACPJ,EAAOK,sBACPL,EAAOM,eAEd,MAAMC,EAAQjmC,KAAK4kC,GAAGsB,iBAAiBtmB,EAAKyM,IAM5C,GALI4Z,IAEFP,EAAOE,WAAa5lC,KAAKmmC,eAAeF,EAAOb,IAG7CM,EAAOE,WAAY,CAErB,MAAMQ,EAAQV,EAAOE,WAAW,GAC1B7a,EAAO2a,EAAOE,WAAWF,EAAOE,WAAW9lC,OAAS,GAC1D4lC,EAAOG,WAAa,CAAE3jB,EAAGkkB,EAAMlkB,EAAG2N,EAAGuW,EAAMvW,GAC3C6V,EAAOI,SAAW,CAAE5jB,EAAG6I,EAAK7I,EAAG2N,EAAG9E,EAAK8E,EACxC,CACG6V,EAAOD,MAAQC,EAAOD,KAAKjmC,QAE7BkmC,EAAOD,KAAOC,EAAOD,KAAKjmC,MAE7B,aA/BQkmC,EAAOE,kBACPF,EAAOG,kBACPH,EAAOI,SACVJ,EAAOD,MAAQC,EAAOD,KAAKjmC,QAC7BkmC,EAAOD,KAAOC,EAAOD,KAAKjmC,OA6B9B6lC,EAASrkC,KAAK0kC,EArCb,CAqCoB,IAGvB1lC,KAAK4kC,GAAGyB,cAAc,CACpBnoB,MAAOknB,EACPnlB,MAAOolB,GAEV,CAOD,cAAAiB,CAAeC,GACb,IAAKA,EACH,OAAO,EAGT,IAAIC,EAAc,EAClB,IAAK,IAAI5jB,EAAI,EAAGA,EAAI2jB,EAAKzmC,OAAQ8iB,IAAK,CACpC,MAAM6jB,EAAIF,EAAKxxB,WAAW6N,GAEtB2jB,EAAKvxB,MAAM,SACbwxB,GAAe,IAIfA,GADQC,GAAK,GAAUA,GAAK,KAAYA,GAAK,OAAUA,GAAK,MAC7C,EAIA,CAElB,CAED,OAAOD,CACR,CAOD,WAAAE,CAAY9U,GACV,MAAM+U,EAAY,IAAI/U,GACtB,IAAIhP,EAAI,EAGR,KAAOA,EAAI+jB,EAAU7mC,OAAS,GAAG,CAC/B,MAAM8mC,EAAMD,EAAU/jB,EAAI,GACpBmF,EAAU4e,EAAU/jB,GACpBikB,EAAOF,EAAU/jB,EAAI,GAIxBgkB,EAAI1kB,IAAM6F,EAAQ7F,GAAK6F,EAAQ7F,IAAM2kB,EAAK3kB,GAC1C0kB,EAAI/W,IAAM9H,EAAQ8H,GAAK9H,EAAQ8H,IAAMgX,EAAKhX,EAG3C8W,EAAUtmC,OAAOuiB,EAAG,GAEpBA,GAEH,CAED,OAAO+jB,CACR,CAQD,cAAAR,CACEF,EACA/nB,GAEA,MAAM0nB,EAAsB,GAGtBkB,EAAkB9mC,KAAK4kC,GAAGmC,iBAAiBd,EAAMhB,cACjD+B,EAAkBhnC,KAAK4kC,GAAGmC,iBAAiBd,EAAMf,cACjD+B,EAAoB/oB,EAAMwM,MAC7BlM,GAAqBA,EAAK6N,KAAO4Z,EAAMhB,eAEpCiC,EAAoBhpB,EAAMwM,MAC7BlM,GAAqBA,EAAK6N,KAAO4Z,EAAMf,eAI1C,KACG4B,GACAE,GACAC,GACAC,GAED,OAIF,MAAMx8B,EAASoZ,OAAOmiB,EAAMv7B,SAAW,GAGvC,GAA4B,OAAxB1K,KAAK6kC,OAAO5N,SAAwC,kBAApBgP,EAAMkB,UAA+B,CAEvE,GAAIF,EAAkB/kB,EAAIglB,EAAkBhlB,EAsB1C,OApBA0jB,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EACjDH,EAAGoX,EAAkBpX,IAGvB+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EAAItlB,EACrDmlB,EAAGoX,EAAkBpX,IAGvB+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EAAItlB,EACrDmlB,EAAGqX,EAAkBrX,IAGvB+V,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EAAI8kB,EAAgBhX,MAAQ,EACjDH,EAAGqX,EAAkBrX,IAGhB7vB,KAAK0mC,YAAYd,GAI1B,GAAIqB,EAAkB/kB,EAAIglB,EAAkBhlB,EAwC1C,OAtCI+kB,EAAkBpX,GAAKqX,EAAkBrX,GAE3C+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,IAEpD0V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,EAAIxlB,IAExDk7B,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,EAAIxlB,IAExDk7B,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EACrB2N,EAAGqX,EAAkBrX,EAAImX,EAAgB9W,OAAS,MAIpD0V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,IAEpD0V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,EAAIxlB,IAExDk7B,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,EAAIxlB,IAExDk7B,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EACrB2N,EAAGqX,EAAkBrX,EAAImX,EAAgB9W,OAAS,KAI/ClwB,KAAK0mC,YAAYd,EAE3B,CAGD,GAA4B,OAAxB5lC,KAAK6kC,OAAO5N,SAAwC,kBAApBgP,EAAMkB,UAA+B,CAEvE,GAAIF,EAAkBpX,EAAIqX,EAAkBrX,EAsB1C,OApBA+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,IAGpD0V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,EAAIxlB,IAGxDk7B,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EACrB2N,EAAGoX,EAAkBpX,EAAIiX,EAAgB5W,OAAS,EAAIxlB,IAGxDk7B,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EACrB2N,EAAGqX,EAAkBrX,EAAImX,EAAgB9W,OAAS,IAG7ClwB,KAAK0mC,YAAYd,GAI1B,GAAIqB,EAAkBpX,EAAIqX,EAAkBrX,EAuC1C,OAtCIoX,EAAkB/kB,GAAKglB,EAAkBhlB,GAE3C0jB,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EACjDH,EAAGoX,EAAkBpX,IAEvB+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EAAItlB,EACrDmlB,EAAGoX,EAAkBpX,IAEvB+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EAAItlB,EACrDmlB,EAAGqX,EAAkBrX,IAEvB+V,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EAAI8kB,EAAgBhX,MAAQ,EACjDH,EAAGqX,EAAkBrX,MAIvB+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EACjDH,EAAGoX,EAAkBpX,IAEvB+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EAAItlB,EACrDmlB,EAAGoX,EAAkBpX,IAEvB+V,EAAW5kC,KAAK,CACdkhB,EAAG+kB,EAAkB/kB,EAAI4kB,EAAgB9W,MAAQ,EAAItlB,EACrDmlB,EAAGqX,EAAkBrX,IAEvB+V,EAAW5kC,KAAK,CACdkhB,EAAGglB,EAAkBhlB,EAAI8kB,EAAgBhX,MAAQ,EACjDH,EAAGqX,EAAkBrX,KAIlB7vB,KAAK0mC,YAAYd,EAE3B,CAIF,EAzYMlB,GAAU0C,WAAG","x_google_ignoreList":[0,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,43,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,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273,274,275,276,277,278,279,280,281,282,283,284,285,286,287,288,289]}