@countermeasure-platform/web-components 1.2.1 → 1.2.2-dev.8.1

package/dist/dagre-IxFkiJHF.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dagre-IxFkiJHF.js","names":["hasOwnProperty","hasOwnProperty","objectTag","objectProto","hasOwnProperty","hasOwnProperty","boolTag","dateTag","mapTag","numberTag","regexpTag","setTag","stringTag","symbolTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","mapTag","getTag","setTag","getTag","CLONE_DEEP_FLAG","CLONE_SYMBOLS_FLAG","mapTag","setTag","stringTag","getTag","hasOwnProperty","nativeMax","getTag","_.constant","_.flatten","_.map","_.range","run","_.uniqueId","undo","_.uniqueId","_.map","_.range","_.isUndefined","min","_.min","_.has","addBorderNode","_.max","_.now","util.addDummyNode","undo","run","util.addDummyNode","_.min","_.map","_.minBy","DEFAULT_WEIGHT_FUNC","_.constant","_.constant","_.size","dfs","_.isArray","postorder","dfs","dfs","alg.postorder","_.find","_.filter","_.minBy","alg.preorder","util.addDummyNode","_.max","_.values","util.addBorderNode","_.reduce","_.isUndefined","_.uniqueId","_.zipObject","_.map","_.flatten","_.sortBy","_.filter","_.max","_.map","_.range","_.has","_.sortBy","_.map","_.reduce","_.isUndefined","_.filter","_.map","_.pick","util.partition","_.sortBy","_.flatten","last","_.last","_.filter","_.flatten","_.isUndefined","maxRank","util.maxRank","_.range","util.buildLayerMatrix","_.cloneDeep","_.map","_.last","_.range","_.find","_.sortBy","_.minBy","_.values","_.min","_.max","_.mapValues","_.map","util.buildLayerMatrix","_.merge","util.asNonCompoundGraph","util.buildLayerMatrix","_.max","_.map","time","util.time","util.notime","acyclic.run","nestingGraph.run","util.asNonCompoundGraph","util.removeEmptyRanks","nestingGraph.cleanup","util.normalizeRanks","normalize.run","coordinateSystem.adjust","normalize.undo","coordinateSystem.undo","acyclic.undo","_.merge","_.pick","_.defaults","_.max","util.intersectRect","_.last","util.buildLayerMatrix","_.mapValues"],"sources":["../node_modules/lodash-es/_trimmedEndIndex.js","../node_modules/lodash-es/_baseTrim.js","../node_modules/lodash-es/toNumber.js","../node_modules/lodash-es/toFinite.js","../node_modules/lodash-es/toInteger.js","../node_modules/lodash-es/_baseCreate.js","../node_modules/lodash-es/_copyArray.js","../node_modules/lodash-es/_baseAssignValue.js","../node_modules/lodash-es/_assignValue.js","../node_modules/lodash-es/_copyObject.js","../node_modules/lodash-es/_isIterateeCall.js","../node_modules/lodash-es/_createAssigner.js","../node_modules/lodash-es/_nativeKeysIn.js","../node_modules/lodash-es/_baseKeysIn.js","../node_modules/lodash-es/keysIn.js","../node_modules/lodash-es/flatten.js","../node_modules/lodash-es/_flatRest.js","../node_modules/lodash-es/_getPrototype.js","../node_modules/lodash-es/isPlainObject.js","../node_modules/lodash-es/_hasUnicode.js","../node_modules/lodash-es/_baseAssign.js","../node_modules/lodash-es/_baseAssignIn.js","../node_modules/lodash-es/_cloneBuffer.js","../node_modules/lodash-es/_copySymbols.js","../node_modules/lodash-es/_getSymbolsIn.js","../node_modules/lodash-es/_copySymbolsIn.js","../node_modules/lodash-es/_getAllKeysIn.js","../node_modules/lodash-es/_initCloneArray.js","../node_modules/lodash-es/_cloneArrayBuffer.js","../node_modules/lodash-es/_cloneDataView.js","../node_modules/lodash-es/_cloneRegExp.js","../node_modules/lodash-es/_cloneSymbol.js","../node_modules/lodash-es/_cloneTypedArray.js","../node_modules/lodash-es/_initCloneByTag.js","../node_modules/lodash-es/_initCloneObject.js","../node_modules/lodash-es/_baseIsMap.js","../node_modules/lodash-es/isMap.js","../node_modules/lodash-es/_baseIsSet.js","../node_modules/lodash-es/isSet.js","../node_modules/lodash-es/_baseClone.js","../node_modules/lodash-es/cloneDeep.js","../node_modules/lodash-es/now.js","../node_modules/lodash-es/defaults.js","../node_modules/lodash-es/_assignMergeValue.js","../node_modules/lodash-es/_safeGet.js","../node_modules/lodash-es/toPlainObject.js","../node_modules/lodash-es/_baseMergeDeep.js","../node_modules/lodash-es/_baseMerge.js","../node_modules/lodash-es/last.js","../node_modules/lodash-es/_createFind.js","../node_modules/lodash-es/findIndex.js","../node_modules/lodash-es/find.js","../node_modules/lodash-es/_baseMap.js","../node_modules/lodash-es/map.js","../node_modules/lodash-es/forIn.js","../node_modules/lodash-es/forOwn.js","../node_modules/lodash-es/_baseGt.js","../node_modules/lodash-es/_baseHas.js","../node_modules/lodash-es/has.js","../node_modules/lodash-es/isString.js","../node_modules/lodash-es/_baseLt.js","../node_modules/lodash-es/mapValues.js","../node_modules/lodash-es/_baseExtremum.js","../node_modules/lodash-es/max.js","../node_modules/lodash-es/merge.js","../node_modules/lodash-es/min.js","../node_modules/lodash-es/minBy.js","../node_modules/lodash-es/_baseSet.js","../node_modules/lodash-es/_basePickBy.js","../node_modules/lodash-es/_baseSortBy.js","../node_modules/lodash-es/_compareAscending.js","../node_modules/lodash-es/_compareMultiple.js","../node_modules/lodash-es/_baseOrderBy.js","../node_modules/lodash-es/_asciiSize.js","../node_modules/lodash-es/_unicodeSize.js","../node_modules/lodash-es/_stringSize.js","../node_modules/lodash-es/_basePick.js","../node_modules/lodash-es/pick.js","../node_modules/lodash-es/_baseRange.js","../node_modules/lodash-es/_createRange.js","../node_modules/lodash-es/range.js","../node_modules/lodash-es/size.js","../node_modules/lodash-es/sortBy.js","../node_modules/lodash-es/uniqueId.js","../node_modules/lodash-es/_baseZipObject.js","../node_modules/lodash-es/zipObject.js","../node_modules/dagre-d3-es/src/dagre/data/list.js","../node_modules/dagre-d3-es/src/dagre/greedy-fas.js","../node_modules/dagre-d3-es/src/dagre/acyclic.js","../node_modules/dagre-d3-es/src/dagre/util.js","../node_modules/dagre-d3-es/src/dagre/add-border-segments.js","../node_modules/dagre-d3-es/src/dagre/coordinate-system.js","../node_modules/dagre-d3-es/src/dagre/normalize.js","../node_modules/dagre-d3-es/src/dagre/rank/util.js","../node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js","../node_modules/dagre-d3-es/src/graphlib/alg/dijkstra.js","../node_modules/dagre-d3-es/src/graphlib/alg/floyd-warshall.js","../node_modules/dagre-d3-es/src/graphlib/alg/topsort.js","../node_modules/dagre-d3-es/src/graphlib/alg/dfs.js","../node_modules/dagre-d3-es/src/graphlib/alg/postorder.js","../node_modules/dagre-d3-es/src/graphlib/alg/preorder.js","../node_modules/dagre-d3-es/src/dagre/rank/network-simplex.js","../node_modules/dagre-d3-es/src/dagre/rank/index.js","../node_modules/dagre-d3-es/src/dagre/nesting-graph.js","../node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js","../node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js","../node_modules/dagre-d3-es/src/dagre/order/cross-count.js","../node_modules/dagre-d3-es/src/dagre/order/init-order.js","../node_modules/dagre-d3-es/src/dagre/order/barycenter.js","../node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js","../node_modules/dagre-d3-es/src/dagre/order/sort.js","../node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js","../node_modules/dagre-d3-es/src/dagre/order/index.js","../node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js","../node_modules/dagre-d3-es/src/dagre/position/bk.js","../node_modules/dagre-d3-es/src/dagre/position/index.js","../node_modules/dagre-d3-es/src/dagre/layout.js"],"sourcesContent":["/** 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\nexport default trimmedEndIndex;\n","import trimmedEndIndex from './_trimmedEndIndex.js';\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\nexport default baseTrim;\n","import baseTrim from './_baseTrim.js';\nimport isObject from './isObject.js';\nimport isSymbol from './isSymbol.js';\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\nexport default toNumber;\n","import toNumber from './toNumber.js';\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\nexport default toFinite;\n","import toFinite from './toFinite.js';\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\nexport default toInteger;\n","import isObject from './isObject.js';\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\nexport default baseCreate;\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\nexport default copyArray;\n","import defineProperty from './_defineProperty.js';\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\nexport default baseAssignValue;\n","import baseAssignValue from './_baseAssignValue.js';\nimport eq from './eq.js';\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\nexport default assignValue;\n","import assignValue from './_assignValue.js';\nimport baseAssignValue from './_baseAssignValue.js';\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\nexport default copyObject;\n","import eq from './eq.js';\nimport isArrayLike from './isArrayLike.js';\nimport isIndex from './_isIndex.js';\nimport isObject from './isObject.js';\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\nexport default isIterateeCall;\n","import baseRest from './_baseRest.js';\nimport isIterateeCall from './_isIterateeCall.js';\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\nexport default createAssigner;\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\nexport default nativeKeysIn;\n","import isObject from './isObject.js';\nimport isPrototype from './_isPrototype.js';\nimport nativeKeysIn from './_nativeKeysIn.js';\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\nexport default baseKeysIn;\n","import arrayLikeKeys from './_arrayLikeKeys.js';\nimport baseKeysIn from './_baseKeysIn.js';\nimport isArrayLike from './isArrayLike.js';\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\nexport default keysIn;\n","import baseFlatten from './_baseFlatten.js';\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\nexport default flatten;\n","import flatten from './flatten.js';\nimport overRest from './_overRest.js';\nimport setToString from './_setToString.js';\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\nexport default flatRest;\n","import overArg from './_overArg.js';\n\n/** Built-in value references. */\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\nexport default getPrototype;\n","import baseGetTag from './_baseGetTag.js';\nimport getPrototype from './_getPrototype.js';\nimport isObjectLike from './isObjectLike.js';\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\nexport default isPlainObject;\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\nexport default hasUnicode;\n","import copyObject from './_copyObject.js';\nimport keys from './keys.js';\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\nexport default baseAssign;\n","import copyObject from './_copyObject.js';\nimport keysIn from './keysIn.js';\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\nexport default baseAssignIn;\n","import root from './_root.js';\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\nexport default cloneBuffer;\n","import copyObject from './_copyObject.js';\nimport getSymbols from './_getSymbols.js';\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\nexport default copySymbols;\n","import arrayPush from './_arrayPush.js';\nimport getPrototype from './_getPrototype.js';\nimport getSymbols from './_getSymbols.js';\nimport stubArray from './stubArray.js';\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\nexport default getSymbolsIn;\n","import copyObject from './_copyObject.js';\nimport getSymbolsIn from './_getSymbolsIn.js';\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\nexport default copySymbolsIn;\n","import baseGetAllKeys from './_baseGetAllKeys.js';\nimport getSymbolsIn from './_getSymbolsIn.js';\nimport keysIn from './keysIn.js';\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\nexport default 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\nexport default initCloneArray;\n","import Uint8Array from './_Uint8Array.js';\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\nexport default cloneArrayBuffer;\n","import cloneArrayBuffer from './_cloneArrayBuffer.js';\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\nexport default 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\nexport default cloneRegExp;\n","import Symbol from './_Symbol.js';\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\nexport default cloneSymbol;\n","import cloneArrayBuffer from './_cloneArrayBuffer.js';\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\nexport default cloneTypedArray;\n","import cloneArrayBuffer from './_cloneArrayBuffer.js';\nimport cloneDataView from './_cloneDataView.js';\nimport cloneRegExp from './_cloneRegExp.js';\nimport cloneSymbol from './_cloneSymbol.js';\nimport cloneTypedArray from './_cloneTypedArray.js';\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\nexport default initCloneByTag;\n","import baseCreate from './_baseCreate.js';\nimport getPrototype from './_getPrototype.js';\nimport isPrototype from './_isPrototype.js';\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\nexport default initCloneObject;\n","import getTag from './_getTag.js';\nimport isObjectLike from './isObjectLike.js';\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\nexport default baseIsMap;\n","import baseIsMap from './_baseIsMap.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\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\nexport default isMap;\n","import getTag from './_getTag.js';\nimport isObjectLike from './isObjectLike.js';\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\nexport default baseIsSet;\n","import baseIsSet from './_baseIsSet.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\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\nexport default isSet;\n","import Stack from './_Stack.js';\nimport arrayEach from './_arrayEach.js';\nimport assignValue from './_assignValue.js';\nimport baseAssign from './_baseAssign.js';\nimport baseAssignIn from './_baseAssignIn.js';\nimport cloneBuffer from './_cloneBuffer.js';\nimport copyArray from './_copyArray.js';\nimport copySymbols from './_copySymbols.js';\nimport copySymbolsIn from './_copySymbolsIn.js';\nimport getAllKeys from './_getAllKeys.js';\nimport getAllKeysIn from './_getAllKeysIn.js';\nimport getTag from './_getTag.js';\nimport initCloneArray from './_initCloneArray.js';\nimport initCloneByTag from './_initCloneByTag.js';\nimport initCloneObject from './_initCloneObject.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isMap from './isMap.js';\nimport isObject from './isObject.js';\nimport isSet from './isSet.js';\nimport keys from './keys.js';\nimport keysIn from './keysIn.js';\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\nexport default baseClone;\n","import baseClone from './_baseClone.js';\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\nexport default cloneDeep;\n","import root from './_root.js';\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\nexport default now;\n","import baseRest from './_baseRest.js';\nimport eq from './eq.js';\nimport isIterateeCall from './_isIterateeCall.js';\nimport keysIn from './keysIn.js';\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\nexport default defaults;\n","import baseAssignValue from './_baseAssignValue.js';\nimport eq from './eq.js';\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\nexport default 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\nexport default safeGet;\n","import copyObject from './_copyObject.js';\nimport keysIn from './keysIn.js';\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\nexport default toPlainObject;\n","import assignMergeValue from './_assignMergeValue.js';\nimport cloneBuffer from './_cloneBuffer.js';\nimport cloneTypedArray from './_cloneTypedArray.js';\nimport copyArray from './_copyArray.js';\nimport initCloneObject from './_initCloneObject.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\nimport isArrayLikeObject from './isArrayLikeObject.js';\nimport isBuffer from './isBuffer.js';\nimport isFunction from './isFunction.js';\nimport isObject from './isObject.js';\nimport isPlainObject from './isPlainObject.js';\nimport isTypedArray from './isTypedArray.js';\nimport safeGet from './_safeGet.js';\nimport toPlainObject from './toPlainObject.js';\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\nexport default baseMergeDeep;\n","import Stack from './_Stack.js';\nimport assignMergeValue from './_assignMergeValue.js';\nimport baseFor from './_baseFor.js';\nimport baseMergeDeep from './_baseMergeDeep.js';\nimport isObject from './isObject.js';\nimport keysIn from './keysIn.js';\nimport safeGet from './_safeGet.js';\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\nexport default baseMerge;\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\nexport default last;\n","import baseIteratee from './_baseIteratee.js';\nimport isArrayLike from './isArrayLike.js';\nimport keys from './keys.js';\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\nexport default createFind;\n","import baseFindIndex from './_baseFindIndex.js';\nimport baseIteratee from './_baseIteratee.js';\nimport toInteger from './toInteger.js';\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\nexport default findIndex;\n","import createFind from './_createFind.js';\nimport findIndex from './findIndex.js';\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\nexport default find;\n","import baseEach from './_baseEach.js';\nimport isArrayLike from './isArrayLike.js';\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\nexport default baseMap;\n","import arrayMap from './_arrayMap.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseMap from './_baseMap.js';\nimport isArray from './isArray.js';\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\nexport default map;\n","import baseFor from './_baseFor.js';\nimport castFunction from './_castFunction.js';\nimport keysIn from './keysIn.js';\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\nexport default forIn;\n","import baseForOwn from './_baseForOwn.js';\nimport castFunction from './_castFunction.js';\n\n/**\n * Iterates over own enumerable string keyed properties of an object and\n * invokes `iteratee` for each property. The iteratee is invoked with three\n * arguments: (value, key, object). Iteratee functions may exit iteration\n * 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 _.forOwnRight\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwn(new Foo, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\nfunction forOwn(object, iteratee) {\n  return object && baseForOwn(object, castFunction(iteratee));\n}\n\nexport default forOwn;\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\nexport default baseGt;\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\nexport default baseHas;\n","import baseHas from './_baseHas.js';\nimport hasPath from './_hasPath.js';\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\nexport default has;\n","import baseGetTag from './_baseGetTag.js';\nimport isArray from './isArray.js';\nimport isObjectLike from './isObjectLike.js';\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\nexport default isString;\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\nexport default baseLt;\n","import baseAssignValue from './_baseAssignValue.js';\nimport baseForOwn from './_baseForOwn.js';\nimport baseIteratee from './_baseIteratee.js';\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\nexport default mapValues;\n","import isSymbol from './isSymbol.js';\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\nexport default baseExtremum;\n","import baseExtremum from './_baseExtremum.js';\nimport baseGt from './_baseGt.js';\nimport identity from './identity.js';\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\nexport default max;\n","import baseMerge from './_baseMerge.js';\nimport createAssigner from './_createAssigner.js';\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\nexport default merge;\n","import baseExtremum from './_baseExtremum.js';\nimport baseLt from './_baseLt.js';\nimport identity from './identity.js';\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\nexport default min;\n","import baseExtremum from './_baseExtremum.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseLt from './_baseLt.js';\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\nexport default minBy;\n","import assignValue from './_assignValue.js';\nimport castPath from './_castPath.js';\nimport isIndex from './_isIndex.js';\nimport isObject from './isObject.js';\nimport toKey from './_toKey.js';\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\nexport default baseSet;\n","import baseGet from './_baseGet.js';\nimport baseSet from './_baseSet.js';\nimport castPath from './_castPath.js';\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\nexport default basePickBy;\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\nexport default baseSortBy;\n","import isSymbol from './isSymbol.js';\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\nexport default compareAscending;\n","import compareAscending from './_compareAscending.js';\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\nexport default compareMultiple;\n","import arrayMap from './_arrayMap.js';\nimport baseGet from './_baseGet.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseMap from './_baseMap.js';\nimport baseSortBy from './_baseSortBy.js';\nimport baseUnary from './_baseUnary.js';\nimport compareMultiple from './_compareMultiple.js';\nimport identity from './identity.js';\nimport isArray from './isArray.js';\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\nexport default baseOrderBy;\n","import baseProperty from './_baseProperty.js';\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\nexport default 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 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\nexport default unicodeSize;\n","import asciiSize from './_asciiSize.js';\nimport hasUnicode from './_hasUnicode.js';\nimport unicodeSize from './_unicodeSize.js';\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\nexport default stringSize;\n","import basePickBy from './_basePickBy.js';\nimport hasIn from './hasIn.js';\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\nexport default basePick;\n","import basePick from './_basePick.js';\nimport flatRest from './_flatRest.js';\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\nexport default pick;\n","/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeCeil = Math.ceil,\n    nativeMax = Math.max;\n\n/**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\nfunction baseRange(start, end, step, fromRight) {\n  var index = -1,\n      length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n      result = Array(length);\n\n  while (length--) {\n    result[fromRight ? length : ++index] = start;\n    start += step;\n  }\n  return result;\n}\n\nexport default baseRange;\n","import baseRange from './_baseRange.js';\nimport isIterateeCall from './_isIterateeCall.js';\nimport toFinite from './toFinite.js';\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\nexport default createRange;\n","import createRange from './_createRange.js';\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\nexport default range;\n","import baseKeys from './_baseKeys.js';\nimport getTag from './_getTag.js';\nimport isArrayLike from './isArrayLike.js';\nimport isString from './isString.js';\nimport stringSize from './_stringSize.js';\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\nexport default size;\n","import baseFlatten from './_baseFlatten.js';\nimport baseOrderBy from './_baseOrderBy.js';\nimport baseRest from './_baseRest.js';\nimport isIterateeCall from './_isIterateeCall.js';\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\nexport default sortBy;\n","import toString from './toString.js';\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\nexport default uniqueId;\n","/**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\nfunction baseZipObject(props, values, assignFunc) {\n  var index = -1,\n      length = props.length,\n      valsLength = values.length,\n      result = {};\n\n  while (++index < length) {\n    var value = index < valsLength ? values[index] : undefined;\n    assignFunc(result, props[index], value);\n  }\n  return result;\n}\n\nexport default baseZipObject;\n","import assignValue from './_assignValue.js';\nimport baseZipObject from './_baseZipObject.js';\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\nexport default zipObject;\n","/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */\n\nexport { List };\n\nclass List {\n  constructor() {\n    var sentinel = {};\n    sentinel._next = sentinel._prev = sentinel;\n    this._sentinel = sentinel;\n  }\n  dequeue() {\n    var sentinel = this._sentinel;\n    var entry = sentinel._prev;\n    if (entry !== sentinel) {\n      unlink(entry);\n      return entry;\n    }\n  }\n  enqueue(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  toString() {\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}\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","import * as _ from 'lodash-es';\nimport { Graph } from '../graphlib/index.js';\nimport { List } from './data/list.js';\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 */\nexport { 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(\n    _.map(results, function (e) {\n      return g.outEdges(e.v, e.w);\n    }),\n  );\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())) {\n      removeNode(g, buckets, zeroIdx, entry);\n    }\n    while ((entry = sources.dequeue())) {\n      removeNode(g, buckets, zeroIdx, entry);\n    }\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 () {\n    return new List();\n  });\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","import * as _ from 'lodash-es';\nimport { greedyFAS } from './greedy-fas.js';\n\nexport { run, undo };\n\nfunction run(g) {\n  var fas = g.graph().acyclicer === 'greedy' ? greedyFAS(g, weightFn(g)) : 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 (Object.prototype.hasOwnProperty.call(visited, v)) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    _.forEach(g.outEdges(v), function (e) {\n      if (Object.prototype.hasOwnProperty.call(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","import * as _ from 'lodash-es';\nimport { Graph } from '../graphlib/index.js';\n\nexport {\n  addDummyNode,\n  simplify,\n  asNonCompoundGraph,\n  successorWeights,\n  predecessorWeights,\n  intersectRect,\n  buildLayerMatrix,\n  normalizeRanks,\n  removeEmptyRanks,\n  addBorderNode,\n  maxRank,\n  partition,\n  time,\n  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) {\n    simplified.setNode(v, g.node(v));\n  });\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 () {\n    return [];\n  });\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(\n    _.map(g.nodes(), function (v) {\n      return g.node(v).rank;\n    }),\n  );\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(\n    _.map(g.nodes(), function (v) {\n      return g.node(v).rank;\n    }),\n  );\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) {\n        g.node(v).rank += delta;\n      });\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(\n    _.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/*\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","import * as _ from 'lodash-es';\nimport * as util from './util.js';\n\nexport { 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 (Object.prototype.hasOwnProperty.call(node, 'minRank')) {\n      node.borderLeft = [];\n      node.borderRight = [];\n      for (var rank = node.minRank, maxRank = node.maxRank + 1; rank < maxRank; ++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","import * as _ from 'lodash-es';\n\nexport { adjust, undo };\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) {\n    swapWidthHeightOne(g.node(v));\n  });\n  _.forEach(g.edges(), function (e) {\n    swapWidthHeightOne(g.edge(e));\n  });\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) {\n    reverseYOne(g.node(v));\n  });\n\n  _.forEach(g.edges(), function (e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, reverseYOne);\n    if (Object.prototype.hasOwnProperty.call(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) {\n    swapXYOne(g.node(v));\n  });\n\n  _.forEach(g.edges(), function (e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, swapXYOne);\n    if (Object.prototype.hasOwnProperty.call(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","/**\n * TypeScript type imports:\n *\n * @import { Graph } from '../graphlib/graph.js';\n */\nimport * as _ from 'lodash-es';\nimport * as util from './util.js';\n\nexport { run, undo };\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) {\n    normalizeEdge(g, edge);\n  });\n}\n\n/**\n * @param {Graph} g\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  /**\n   * @typedef {Object} Attrs\n   * @property {number} width\n   * @property {number} height\n   * @property {ReturnType<Graph[\"node\"]>} edgeLabel\n   * @property {any} edgeObj\n   * @property {ReturnType<Graph[\"node\"]>[\"rank\"]} rank\n   * @property {string} [dummy]\n   * @property {ReturnType<Graph[\"node\"]>[\"labelpos\"]} [labelpos]\n   */\n\n  /** @type {Attrs | undefined} */\n  var attrs = undefined;\n  var dummy, i;\n  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n    edgeLabel.points = [];\n    attrs = {\n      width: 0,\n      height: 0,\n      edgeLabel: edgeLabel,\n      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","import * as _ from 'lodash-es';\n\nexport { longestPath, slack };\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 (Object.prototype.hasOwnProperty.call(visited, v)) {\n      return label.rank;\n    }\n    visited[v] = true;\n\n    var rank = _.min(\n      _.map(g.outEdges(v), function (e) {\n        return dfs(e.w) - g.edge(e).minlen;\n      }),\n    );\n\n    if (\n      rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3\n      rank === undefined || // return value of _.map([]) for Lodash 4\n      rank === null\n    ) {\n      // 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","import * as _ from 'lodash-es';\nimport { Graph } from '../../graphlib/index.js';\nimport { slack } from './util.js';\n\nexport { 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","import * as _ from 'lodash-es';\nimport { PriorityQueue } from '../data/priority-queue.js';\n\n/**\n * @import { EdgeObj, Graph, NodeID } from '../graph.js';\n */\n\nexport { dijkstra };\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\n/**\n * @typedef {Object} PathEntry\n * @property {number} distance The sum of the weights from `source` to `v`\n * along the shortest path or `Number.POSITIVE_INFINITY` if there is no path\n * from `source`.\n * @property {NodeID} [predecessor] Can be used to walk the individual\n * elements of the path from `source` to `v` in reverse order.\n */\n\n/**\n * This function is an implementation of [Dijkstra's algorithm][] which finds\n * the shortest path from `source` to all other nodes in `g`. This\n * function returns\n *\n * [Dijkstra's algorithm]: http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm\n *\n * @example\n *\n * ![](https://github.com/dagrejs/graphlib/wiki/images/dijkstra-source.png)\n * <!-- SOURCE:\n * http://dagrejs.github.io/project/dagre-d3/latest/demo/interactive-demo.html?graph=digraph%20%7B%0Anode%20%5Bshape%3Dcircle%2C%20style%3D%22fill%3Awhite%3Bstroke%3A%23333%3Bstroke-width%3A1.5px%22%5D%0Aedge%20%5Blabeloffset%3D2%20labelpos%3Dr%5D%0Arankdir%3Dlr%0A%20%20A%20-%3E%20B%5Blabel%3D10%5D%0A%20%20A%20-%3E%20C%5Blabel%3D4%5D%0A%20%20A%20-%3E%20D%5Blabel%3D2%5D%0A%20%20C%20-%3E%20B%5Blabel%3D2%5D%0A%20%20C%20-%3E%20D%5Blabel%3D8%5D%0A%20%20B%20-%3E%20E%5Blabel%3D6%5D%0A%20%20D%20-%3E%20F%5Blabel%3D2%5D%0A%20%20F%20-%3E%20E%5Blabel%3D4%5D%0A%7D\n * -->\n *\n * ```js\n * function weight(e) { return g.edge(e); }\n *\n * graphlib.alg.dijkstra(g, \"A\", weight);\n * // => { A: { distance: 0 },\n * //      B: { distance: 6, predecessor: 'C' },\n * //      C: { distance: 4, predecessor: 'A' },\n * //      D: { distance: 2, predecessor: 'A' },\n * //      E: { distance: 8, predecessor: 'F' },\n * //      F: { distance: 4, predecessor: 'D' } }\n * ```\n *\n * @remarks It takes `O((|E| + |V|) * log |V|)` time.\n *\n * @param {Graph} g - Input graph.\n * @param {NodeID | number} source - The source node id. Converted to a string.\n * @param {(e: EdgeObj) => number} [weightFn] - Optional function that returns\n * the weight for edge `e`. If no `weightFn` is supplied then each edge is\n * assumed to have a weight of 1.\n * @param {(v: NodeID) => EdgeObj[]} [edgeFn] - Optional function that returns\n * the ids of all edges incident to the node `v` for the purposes of shortest\n * path traversal.\n * By default this function uses the {@link Graph.outEdges} function on the\n * supplied graph.\n * @returns {Record<NodeID, PathEntry>} a map of `v -> { distance, predecessor }`.\n * @throws {Error} If any of the traversed edges has a negative edge weight.\n */\nfunction dijkstra(g, source, weightFn, edgeFn) {\n  return runDijkstra(\n    g,\n    String(source),\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn ||\n      function (v) {\n        return g.outEdges(v);\n      },\n  );\n}\n\n/**\n * @param {Graph} g - Input graph.\n * @param {NodeID} source - The source node id.\n * @param {(e: EdgeObj) => number} weightFn - Required weight function.\n * @param {(v: NodeID) => EdgeObj[]} edgeFn - Required edge function.\n */\nfunction runDijkstra(g, source, weightFn, edgeFn) {\n  /** @type {Record<NodeID, PathEntry>} */\n  var results = {};\n  var pq = new PriorityQueue();\n  /** @type {NodeID} */\n  var v;\n  /** @type {PathEntry} */\n  var vEntry;\n\n  /** @param {EdgeObj} edge */\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(\n        'dijkstra does not allow negative edge weights. ' +\n          'Bad edge: ' +\n          edge +\n          ' Weight: ' +\n          weight,\n      );\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","import * as _ from 'lodash-es';\n\n/**\n * @import { Graph, EdgeObj, NodeID } from '../graph.js';\n * @import { PathEntry } from './dijkstra.js';\n */\n\nexport { floydWarshall };\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\n/**\n * This function is an implementation of the [Floyd-Warshall algorithm][],\n * which finds the shortest path from each node to every other reachable node\n * in the graph. It is similar to {@link dijkstraAll}, but\n * it handles negative edge weights and is more efficient for some types of\n * graphs.\n *\n * [Floyd-Warshall algorithm]: https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm\n *\n * @remarks This algorithm takes `O(|V|^3)` time.\n *\n * @example\n *\n * ![](https://github.com/dagrejs/graphlib/wiki/images/dijkstra-source.png)\n *\n * ```js\n * function weight(e) { return g.edge(e); }\n *\n * graphlib.alg.floydWarshall(g, function(e) { return g.edge(e); });\n *\n * // => { A:\n * //       { A: { distance: 0 },\n * //         B: { distance: 6, predecessor: 'C' },\n * //         C: { distance: 4, predecessor: 'A' },\n * //         D: { distance: 2, predecessor: 'A' },\n * //         E: { distance: 8, predecessor: 'F' },\n * //         F: { distance: 4, predecessor: 'D' } },\n * //      B:\n * //       { A: { distance: Infinity },\n * //         B: { distance: 0 },\n * //         C: { distance: Infinity },\n * //         D: { distance: Infinity },\n * //         E: { distance: 6, predecessor: 'B' },\n * //         F: { distance: Infinity } },\n * //      C: { ... },\n * //      D: { ... },\n * //      E: { ... },\n * //      F: { ... } }\n * ```\n *\n * @param {Graph} g - The graph to analyze.\n * @param {(e: EdgeObj) => number} [weightFn] - Optional function that returns\n * the weight for edge `e`. If no `weightFn` is supplied then each edge is\n * assumed to have a weight of 1.\n * @param {(v: NodeID) => EdgeObj[]} [edgeFn] - Optional function that returns\n * the ids of all edges incident to the node `v` for the purposes of shortest\n * path traversal.\n * By default this function uses the {@link Graph.outEdges} function on the\n * supplied graph.\n * @returns {Record<NodeID, Record<NodeID, PathEntry>>} a map of\n * `source -> { target -> { distance, predecessor }`.\n */\nfunction floydWarshall(g, weightFn, edgeFn) {\n  return runFloydWarshall(\n    g,\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn ||\n      function (v) {\n        return g.outEdges(v);\n      },\n  );\n}\n\n/**\n * @param {Graph} g - Input graph.\n * @param {(e: EdgeObj) => number} weightFn - Required weight function.\n * @param {(v: NodeID) => EdgeObj[]} edgeFn - Required edge function.\n */\nfunction runFloydWarshall(g, weightFn, edgeFn) {\n  /** @type {Record<NodeID, Record<NodeID, PathEntry>>} */\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","import * as _ from 'lodash-es';\n\n/**\n * @import { Graph, NodeID } from '../graph.js';\n */\n\nexport { topsort, CycleException };\n\ntopsort.CycleException = CycleException;\n\n/**\n * An implementation of [topological sorting](https://en.wikipedia.org/wiki/Topological_sorting).\n *\n * @remarks Takes `O(|V| + |E|)` time.\n *\n * @example\n *\n * ![](https://github.com/dagrejs/graphlib/wiki/images/topsort.png)\n *\n * ```js\n * graphlib.alg.topsort(g)\n * // [ '1', '2', '3', '4' ] or [ '1', '3', '2', '4' ]\n * ```\n *\n * @param {Graph} g - The graph to sort.\n * @returns {NodeID[]} an array of nodes\n * such that for each edge `u -> v`, `u` appears before `v` in the array.\n * @throws {CycleException} If the graph has a cycle so that it is impossible\n * to generate a topological sort.\n */\nfunction topsort(g) {\n  /** @type {Record<NodeID, true>} */\n  var visited = {};\n  /** @type {Record<NodeID, true>} */\n  var stack = {};\n  /** @type {NodeID[]} */\n  var results = [];\n\n  /**\n   * @param {NodeID} node - Node to recursively visit.\n   */\n  function visit(node) {\n    if (Object.prototype.hasOwnProperty.call(stack, node)) {\n      throw new CycleException();\n    }\n\n    if (!Object.prototype.hasOwnProperty.call(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\n/**\n * @class\n */\nfunction CycleException() {}\nCycleException.prototype = new Error(); // must be an instance of Error to pass testing\n","import * as _ from 'lodash-es';\n\n/**\n * @import { Graph, NodeID } from '../graph.js';\n */\n\nexport { 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 * @param {Graph} g - Input graph.\n * @param {NodeID[] | NodeID} vs - Starting node or array of nodes.\n * @param {'post' | 'pre'} order - The order to use. Must be one of \"pre\" or \"post\".\n * @returns {NodeID[]} The nodes in the order they were visited.\n */\nfunction dfs(g, vs, order) {\n  if (!_.isArray(vs)) {\n    vs = [vs];\n  }\n\n  /** @type {Parameters<typeof doDfs>[4]} */\n  var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);\n  /** @type {Parameters<typeof doDfs>[5]} */\n  var acc = [];\n  /** @type {Parameters<typeof doDfs>[3]} */\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\n/**\n * @param {Graph} g - Input graph.\n * @param {NodeID} v - The node to visit.\n * @param {boolean} postorder - Whether to do postorder traversal.\n * @param {Record<NodeID, true>} visited - Visited nodes.\n * @param {(node: NodeID) => (NodeID[] | undefined)} navigation - Function to get\n * neighbors/successors.\n * @param {NodeID[]} acc - Accumulator for visited nodes.\n */\nfunction doDfs(g, v, postorder, visited, navigation, acc) {\n  if (!Object.prototype.hasOwnProperty.call(visited, v)) {\n    visited[v] = true;\n\n    if (!postorder) {\n      acc.push(v);\n    }\n    _.each(navigation(v), function (w) {\n      doDfs(g, w, postorder, visited, navigation, acc);\n    });\n    if (postorder) {\n      acc.push(v);\n    }\n  }\n}\n","import { dfs } from './dfs.js';\n\nexport { postorder };\n\n/**\n * This function performs a [postorder traversal][] of the graph `g` starting\n * at the nodes `vs`. For each node visited, `v`,  the function `callback(v)`\n * is called.\n *\n * [postorder traversal]: https://en.wikipedia.org/wiki/Tree_traversal#Depth-first\n *\n * @example\n *\n * ![](https://github.com/dagrejs/graphlib/wiki/images/preorder.png)\n *\n * ```js\n * graphlib.alg.postorder(g, \"A\");\n * // => One of:\n * // [ \"B\", \"D\", \"E\", C\", \"A\" ]\n * // [ \"B\", \"E\", \"D\", C\", \"A\" ]\n * // [ \"D\", \"E\", \"C\", B\", \"A\" ]\n * // [ \"E\", \"D\", \"C\", B\", \"A\" ]\n * ```\n *\n * @param {Parameters<typeof dfs>[0]} g - The graph to traverse.\n * @param {Parameters<typeof dfs>[1]} vs - Nodes to start the traversal from.\n * @returns {ReturnType<typeof dfs>} The nodes in the order they were visited.\n */\nfunction postorder(g, vs) {\n  return dfs(g, vs, 'post');\n}\n","import { dfs } from './dfs.js';\n\nexport { preorder };\n\n/**\n * This function performs a [preorder traversal][] of the graph `g` starting\n * at the nodes `vs`. For each node visited, `v`,  the function `callback(v)`\n * is called.\n *\n * [preorder traversal]: https://en.wikipedia.org/wiki/Tree_traversal#Depth-first\n *\n * @example\n *\n * ![](https://github.com/dagrejs/graphlib/wiki/images/preorder.png)\n * <!-- SOURCE:\n * http://dagrejs.github.io/project/dagre-d3/latest/demo/interactive-demo.html?graph=digraph%20%7B%0Anode%20%5Bshape%3Dcircle%2C%20style%3D%22fill%3Awhite%3Bstroke%3A%23333%3Bstroke-width%3A1.5px%22%5D%0Aedge%20%5Blabeloffset%3D2%20labelpos%3Dr%5D%0Arankdir%3Dlr%0A%20%20A%20-%3E%20B%0A%20%20A%20-%3E%20C%0A%20%20C%20-%3E%20D%0A%20%20C%20-%3E%20E%0A%7D\n * -->\n *\n * ```js\n * graphlib.alg.preorder(g, \"A\");\n * // => One of:\n * // [ \"A\", \"B\", \"C\", \"D\", \"E\" ]\n * // [ \"A\", \"B\", \"C\", \"E\", \"D\" ]\n * // [ \"A\", \"C\", \"D\", \"E\", \"B\" ]\n * // [ \"A\", \"C\", \"E\", \"D\", \"B\" ]\n * ```\n *\n * @param {Parameters<typeof dfs>[0]} g - The graph to traverse.\n * @param {Parameters<typeof dfs>[1]} vs - Nodes to start the traversal from.\n * @returns {ReturnType<typeof dfs>} The nodes in the order they were visited.\n */\nfunction preorder(g, vs) {\n  return dfs(g, vs, 'pre');\n}\n","import * as _ from 'lodash-es';\nimport * as alg from '../../graphlib/alg/index.js';\nimport { simplify } from '../util.js';\nimport { feasibleTree } from './feasible-tree.js';\nimport { longestPath, slack } from './util.js';\n\nexport { 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  longestPath(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 = alg.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 (!Object.prototype.hasOwnProperty.call(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 (\n      flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n      flip !== isDescendant(t, t.node(edge.w), tailLabel)\n    );\n  });\n\n  return _.minBy(candidates, function (edge) {\n    return slack(g, edge);\n  });\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) {\n    return !g.node(v).parent;\n  });\n  var vs = alg.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","import { feasibleTree } from './feasible-tree.js';\nimport { networkSimplex } from './network-simplex.js';\nimport { longestPath } from './util.js';\n\nexport { 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':\n      networkSimplexRanker(g);\n      break;\n    case 'tight-tree':\n      tightTreeRanker(g);\n      break;\n    case 'longest-path':\n      longestPathRanker(g);\n      break;\n    default:\n      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","import * as _ from 'lodash-es';\nimport * as util from './util.js';\n\nexport { run, cleanup };\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) {\n    g.edge(e).minlen *= nodeSep;\n  });\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) {\n    dfs(v, 1);\n  });\n  return depths;\n}\n\nfunction sumWeights(g) {\n  return _.reduce(\n    g.edges(),\n    function (acc, e) {\n      return acc + g.edge(e).weight;\n    },\n    0,\n  );\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","import * as _ from 'lodash-es';\n\nexport { 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","import * as _ from 'lodash-es';\nimport { Graph } from '../../graphlib/index.js';\n\nexport { 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 })\n      .setGraph({ root: root })\n      .setDefaultNodeLabel(function (v) {\n        return g.node(v);\n      });\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 (Object.prototype.hasOwnProperty.call(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","import * as _ from 'lodash-es';\n\nexport { 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(\n    southLayer,\n    _.map(southLayer, function (v, i) {\n      return i;\n    }),\n  );\n  var southEntries = _.flatten(\n    _.map(northLayer, function (v) {\n      return _.sortBy(\n        _.map(g.outEdges(v), function (e) {\n          return { pos: southPos[e.w], weight: g.edge(e).weight };\n        }),\n        'pos',\n      );\n    }),\n  );\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 () {\n    return 0;\n  });\n\n  // Calculate the weighted crossings\n  var cc = 0;\n  _.forEach(\n    // @ts-expect-error\n    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\n  return cc;\n}\n","import * as _ from 'lodash-es';\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 */\nexport function initOrder(g) {\n  var visited = {};\n  var simpleNodes = _.filter(g.nodes(), function (v) {\n    return !g.children(v).length;\n  });\n  var maxRank = _.max(\n    _.map(simpleNodes, function (v) {\n      return g.node(v).rank;\n    }),\n  );\n  var layers = _.map(_.range(maxRank + 1), function () {\n    return [];\n  });\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) {\n    return g.node(v).rank;\n  });\n  _.forEach(orderedVs, dfs);\n\n  return layers;\n}\n","import * as _ from 'lodash-es';\n\nexport { 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(\n        inV,\n        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        },\n        { sum: 0, weight: 0 },\n      );\n\n      return {\n        v: v,\n        barycenter: result.sum / result.weight,\n        weight: result.weight,\n      };\n    }\n  });\n}\n","import * as _ from 'lodash-es';\n\nexport { 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      // @ts-expect-error\n      tmp.barycenter = entry.barycenter;\n      // @ts-expect-error\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    // @ts-expect-error\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 (\n        _.isUndefined(uEntry.barycenter) ||\n        _.isUndefined(vEntry.barycenter) ||\n        uEntry.barycenter >= vEntry.barycenter\n      ) {\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(\n    _.filter(entries, function (entry) {\n      return !entry.merged;\n    }),\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","import * as _ from 'lodash-es';\nimport * as util from '../util.js';\n\nexport { sort };\n\nfunction sort(entries, biasRight) {\n  var parts = util.partition(entries, function (entry) {\n    return Object.prototype.hasOwnProperty.call(entry, 'barycenter');\n  });\n  var sortable = parts.lhs,\n    unsortable = _.sortBy(parts.rhs, function (entry) {\n      return -entry.i;\n    }),\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) };\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","import * as _ from 'lodash-es';\nimport { barycenter } from './barycenter.js';\nimport { resolveConflicts } from './resolve-conflicts.js';\nimport { sort } from './sort.js';\n\nexport { 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 (Object.prototype.hasOwnProperty.call(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]);\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 (!Object.prototype.hasOwnProperty.call(result, 'barycenter')) {\n        result.barycenter = 0;\n        result.weight = 0;\n      }\n      result.barycenter =\n        (result.barycenter * result.weight + 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(\n      entry.vs.map(function (v) {\n        if (subgraphs[v]) {\n          return subgraphs[v].vs;\n        }\n        return v;\n      }),\n    );\n  });\n}\n\nfunction mergeBarycenters(target, other) {\n  if (!_.isUndefined(target.barycenter)) {\n    target.barycenter =\n      (target.barycenter * target.weight + 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","import * as _ from 'lodash-es';\nimport { Graph } from '../../graphlib/index.js';\nimport * as util from '../util.js';\nimport { addSubgraphConstraints } from './add-subgraph-constraints.js';\nimport { buildLayerGraph } from './build-layer-graph.js';\nimport { crossCount } from './cross-count.js';\nimport { initOrder } from './init-order.js';\nimport { sortSubgraph } from './sort-subgraph.js';\n\nexport { 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","import * as _ from 'lodash-es';\n\nexport { 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 && 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 (\n          pathIdx < path.length - 1 &&\n          g.node((pathV = path[pathIdx + 1])).minRank <= node.rank\n        ) {\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 && (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","import * as _ from 'lodash-es';\nimport { Graph } from '../../graphlib/index.js';\nimport * as util from '../util.js';\n\n/*\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\n\nexport {\n  positionX,\n  findType1Conflicts,\n  findType2Conflicts,\n  addConflict,\n  hasConflict,\n  verticalAlignment,\n  horizontalCompaction,\n  alignCoordinates,\n  findSmallestWidthAlignment,\n  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  /** @type {{[nodeId: string | number]: {[nodeId: string | number]: true}}} */\n  var conflicts = {};\n\n  function visitLayer(prevLayer, layer) {\n    var // 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) && !(uLabel.dummy && g.node(scanNode).dummy)) {\n              addConflict(conflicts, u, scanNode);\n            }\n          });\n        });\n        // @ts-expect-error\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  /** @type {{[nodeId: string | number]: {[nodeId: string | number]: true}}} */\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 && (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {\n            addConflict(conflicts, u, v);\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          // @ts-expect-error\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\n/**\n * Sets `conflicts[v][w] = true`, creating objects if needed.\n *\n * @param {{[nodeId: string | number]: {[nodeId: string | number]: true}}} conflicts - Object to set.\n * @param {string | number} v - First Node ID\n * @param {string | number} w - Second Node ID\n */\nfunction addConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n\n  if (!Object.prototype.hasOwnProperty.call(conflicts, v)) {\n    // can't use conflicts[v] = {} since it's unsafe if v = `__proto__`\n    Object.defineProperty(conflicts, v, {\n      enumerable: true,\n      configurable: true,\n      value: {},\n      writable: true,\n    });\n  }\n  var conflictsV = conflicts[v];\n  Object.defineProperty(conflictsV, w, {\n    enumerable: true,\n    configurable: true,\n    value: true,\n    writable: true,\n  });\n}\n\nfunction hasConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return !!conflicts[v] && Object.prototype.hasOwnProperty.call(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) {\n          return pos[w];\n        });\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 && prevIdx < pos[w] && !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  /** @type {Record<import('../../graphlib/graph.js').NodeID, number>} */\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\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) {\n          return x + delta;\n        });\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(findType1Conflicts(g, layering), 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, align.root, align.align, horiz === 'r');\n      if (horiz === 'r') {\n        xs = _.mapValues(xs, function (x) {\n          return -x;\n        });\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 (Object.prototype.hasOwnProperty.call(vLabel, 'labelpos')) {\n      switch (vLabel.labelpos.toLowerCase()) {\n        case 'l':\n          delta = -vLabel.width / 2;\n          break;\n        case 'r':\n          delta = vLabel.width / 2;\n          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 (Object.prototype.hasOwnProperty.call(wLabel, 'labelpos')) {\n      switch (wLabel.labelpos.toLowerCase()) {\n        case 'l':\n          delta = wLabel.width / 2;\n          break;\n        case 'r':\n          delta = -wLabel.width / 2;\n          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","import * as _ from 'lodash-es';\nimport * as util from '../util.js';\nimport { positionX } from './bk.js';\n\nexport { position };\n\nfunction position(g) {\n  g = util.asNonCompoundGraph(g);\n\n  positionY(g);\n  _.forOwn(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(\n      _.map(layer, function (v) {\n        return g.node(v).height;\n      }),\n    );\n    _.forEach(layer, function (v) {\n      g.node(v).y = prevY + maxHeight / 2;\n    });\n    prevY += maxHeight + rankSep;\n  });\n}\n","import * as _ from 'lodash-es';\nimport { Graph } from '../graphlib/index.js';\nimport { addBorderSegments } from './add-border-segments.js';\nimport * as coordinateSystem from './coordinate-system.js';\nimport * as acyclic from './acyclic.js';\nimport * as normalize from './normalize.js';\nimport { rank } from './rank/index.js';\nimport * as nestingGraph from './nesting-graph.js';\nimport { order } from './order/index.js';\nimport { parentDummyChains } from './parent-dummy-chains.js';\nimport { position } from './position/index.js';\nimport * as util from './util.js';\n\nexport { layout };\n\nfunction layout(g, opts) {\n  var time = opts && opts.debugTiming ? util.time : util.notime;\n  time('layout', () => {\n    var layoutGraph = time('  buildLayoutGraph', () => buildLayoutGraph(g));\n    time('  runLayout', () => runLayout(layoutGraph, time));\n    time('  updateInputGraph', () => updateInputGraph(g, layoutGraph));\n  });\n}\n\nfunction runLayout(g, time) {\n  time('    makeSpaceForEdgeLabels', () => makeSpaceForEdgeLabels(g));\n  time('    removeSelfEdges', () => removeSelfEdges(g));\n  time('    acyclic', () => acyclic.run(g));\n  time('    nestingGraph.run', () => nestingGraph.run(g));\n  time('    rank', () => rank(util.asNonCompoundGraph(g)));\n  time('    injectEdgeLabelProxies', () => injectEdgeLabelProxies(g));\n  time('    removeEmptyRanks', () => util.removeEmptyRanks(g));\n  time('    nestingGraph.cleanup', () => nestingGraph.cleanup(g));\n  time('    normalizeRanks', () => util.normalizeRanks(g));\n  time('    assignRankMinMax', () => assignRankMinMax(g));\n  time('    removeEdgeLabelProxies', () => removeEdgeLabelProxies(g));\n  time('    normalize.run', () => normalize.run(g));\n  time('    parentDummyChains', () => parentDummyChains(g));\n  time('    addBorderSegments', () => addBorderSegments(g));\n  time('    order', () => order(g));\n  time('    insertSelfEdges', () => insertSelfEdges(g));\n  time('    adjustCoordinateSystem', () => coordinateSystem.adjust(g));\n  time('    position', () => position(g));\n  time('    positionSelfEdges', () => positionSelfEdges(g));\n  time('    removeBorderNodes', () => removeBorderNodes(g));\n  time('    normalize.undo', () => normalize.undo(g));\n  time('    fixupEdgeLabelCoords', () => fixupEdgeLabelCoords(g));\n  time('    undoCoordinateSystem', () => coordinateSystem.undo(g));\n  time('    translateGraph', () => translateGraph(g));\n  time('    assignNodeIntersects', () => assignNodeIntersects(g));\n  time('    reversePoints', () => reversePointsForReversedEdges(g));\n  time('    acyclic.undo', () => 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 (Object.prototype.hasOwnProperty.call(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,\n  weight: 1,\n  width: 0,\n  height: 0,\n  labeloffset: 10,\n  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(\n    _.merge({}, graphDefaults, selectNumberAttrs(graph, graphNumAttrs), _.pick(graph, graphAttrs)),\n  );\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(\n      e,\n      _.merge({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), _.pick(edge, edgeAttrs)),\n    );\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      // @ts-expect-error\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) {\n    getExtremes(g.node(v));\n  });\n  _.forEach(g.edges(), function (e) {\n    var edge = g.edge(e);\n    if (Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(edge, 'x')) {\n      edge.x -= minX;\n    }\n    if (Object.prototype.hasOwnProperty.call(edge, 'y')) {\n      edge.y -= minY;\n    }\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 (Object.prototype.hasOwnProperty.call(edge, 'x')) {\n      if (edge.labelpos === 'l' || edge.labelpos === 'r') {\n        edge.width -= edge.labeloffset;\n      }\n      switch (edge.labelpos) {\n        case 'l':\n          edge.x -= edge.width / 2 + edge.labeloffset;\n          break;\n        case 'r':\n          edge.x += edge.width / 2 + edge.labeloffset;\n          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(\n          g,\n          'selfedge',\n          {\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          },\n          '_se',\n        );\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"],"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],"mappings":";;AACA,IAAI,KAAe;AAUnB,SAAS,GAAgB,GAAQ;AAG/B,MAFA,IAAI,IAAQ,EAAO,QAEZ,OAAW,GAAa,KAAK,EAAO,OAAO,EAAM,CAAC;AACzD,QAAO;;;;ACZT,IAAI,KAAc;AASlB,SAAS,GAAS,GAAQ;AACxB,QAAO,KACH,EAAO,MAAM,GAAG,GAAgB,EAAO,GAAG,EAAE,CAAC,QAAQ,IAAa,GAAG;;;;ACT3E,IAAI,KAAM,KAGN,KAAa,sBAGb,KAAa,cAGb,KAAY,eAGZ,KAAe;AAyBnB,SAAS,GAAS,GAAO;AACvB,KAAI,OAAO,KAAS,SAClB,QAAO;AAET,KAAI,EAAS,EAAM,CACjB,QAAO;AAET,KAAI,EAAS,EAAM,EAAE;EACnB,IAAI,IAAQ,OAAO,EAAM,WAAW,aAAa,EAAM,SAAS,GAAG;AACnE,MAAQ,EAAS,EAAM,GAAI,IAAQ,KAAM;;AAE3C,KAAI,OAAO,KAAS,SAClB,QAAO,MAAU,IAAI,IAAQ,CAAC;AAEhC,KAAQ,GAAS,EAAM;CACvB,IAAI,IAAW,GAAW,KAAK,EAAM;AACrC,QAAQ,KAAY,GAAU,KAAK,EAAM,GACrC,GAAa,EAAM,MAAM,EAAE,EAAE,IAAW,IAAI,EAAE,GAC7C,GAAW,KAAK,EAAM,GAAG,KAAM,CAAC;;;;ACzDvC,IAAI,KAAW,UACX,KAAc;AAyBlB,SAAS,EAAS,GAAO;AASvB,QARK,KAGL,IAAQ,GAAS,EAAM,EACnB,MAAU,MAAY,MAAU,CAAC,MACvB,IAAQ,IAAI,KAAK,KACf,KAET,MAAU,IAAQ,IAAQ,KAPxB,MAAU,IAAI,IAAQ;;;;ACHjC,SAAS,GAAU,GAAO;CACxB,IAAI,IAAS,EAAS,EAAM,EACxB,IAAY,IAAS;AAEzB,QAAO,MAAW,IAAU,IAAY,IAAS,IAAY,IAAU;;;;AC7BzE,IAAI,KAAe,OAAO,QAUtB,KAAc,WAAW;CAC3B,SAAS,IAAS;AAClB,QAAO,SAAS,GAAO;AACrB,MAAI,CAAC,EAAS,EAAM,CAClB,QAAO,EAAE;AAEX,MAAI,GACF,QAAO,GAAa,EAAM;AAE5B,IAAO,YAAY;EACnB,IAAI,IAAS,IAAI,GAAM;AAEvB,SADA,EAAO,YAAY,KAAA,GACZ;;GAER;;;ACnBH,SAAS,GAAU,GAAQ,GAAO;CAChC,IAAI,IAAQ,IACR,IAAS,EAAO;AAGpB,MADA,AAAU,MAAQ,MAAM,EAAO,EACxB,EAAE,IAAQ,GACf,GAAM,KAAS,EAAO;AAExB,QAAO;;;;ACLT,SAAS,EAAgB,GAAQ,GAAK,GAAO;AAC3C,CAAI,KAAO,eAAe,KACxB,GAAe,GAAQ,GAAK;EAC1B,cAAgB;EAChB,YAAc;EACd,OAAS;EACT,UAAY;EACb,CAAC,GAEF,EAAO,KAAO;;;;ACblB,IAAIA,KAHc,OAAO,UAGQ;AAYjC,SAAS,EAAY,GAAQ,GAAK,GAAO;CACvC,IAAI,IAAW,EAAO;AACtB,EAAI,EAAEA,GAAe,KAAK,GAAQ,EAAI,IAAI,EAAG,GAAU,EAAM,KACxD,MAAU,KAAA,KAAa,EAAE,KAAO,OACnC,EAAgB,GAAQ,GAAK,EAAM;;;;ACVvC,SAAS,EAAW,GAAQ,GAAO,GAAQ,GAAY;CACrD,IAAI,IAAQ,CAAC;AACb,CAAW,MAAS,EAAE;AAKtB,MAHA,IAAI,IAAQ,IACR,IAAS,EAAM,QAEZ,EAAE,IAAQ,IAAQ;EACvB,IAAI,IAAM,EAAM,IAEZ,IAAW,IACX,EAAW,EAAO,IAAM,EAAO,IAAM,GAAK,GAAQ,EAAO,GACzD,KAAA;AAKJ,EAHI,MAAa,KAAA,MACf,IAAW,EAAO,KAEhB,IACF,EAAgB,GAAQ,GAAK,EAAS,GAEtC,EAAY,GAAQ,GAAK,EAAS;;AAGtC,QAAO;;;;ACrBT,SAAS,EAAe,GAAO,GAAO,GAAQ;AAC5C,KAAI,CAAC,EAAS,EAAO,CACnB,QAAO;CAET,IAAI,IAAO,OAAO;AAOlB,SANI,KAAQ,WACH,EAAY,EAAO,IAAI,GAAQ,GAAO,EAAO,OAAO,GACpD,KAAQ,YAAY,KAAS,KAE7B,EAAG,EAAO,IAAQ,EAAM,GAE1B;;;;AChBT,SAAS,GAAe,GAAU;AAChC,QAAO,EAAS,SAAS,GAAQ,GAAS;EACxC,IAAI,IAAQ,IACR,IAAS,EAAQ,QACjB,IAAa,IAAS,IAAI,EAAQ,IAAS,KAAK,KAAA,GAChD,IAAQ,IAAS,IAAI,EAAQ,KAAK,KAAA;AAWtC,OATA,IAAc,EAAS,SAAS,KAAK,OAAO,KAAc,cACrD,KAAU,KACX,KAAA,GAEA,KAAS,EAAe,EAAQ,IAAI,EAAQ,IAAI,EAAM,KACxD,IAAa,IAAS,IAAI,KAAA,IAAY,GACtC,IAAS,IAEX,IAAS,OAAO,EAAO,EAChB,EAAE,IAAQ,IAAQ;GACvB,IAAI,IAAS,EAAQ;AACrB,GAAI,KACF,EAAS,GAAQ,GAAQ,GAAO,EAAW;;AAG/C,SAAO;GACP;;;;ACxBJ,SAAS,GAAa,GAAQ;CAC5B,IAAI,IAAS,EAAE;AACf,KAAI,KAAU,KACZ,MAAK,IAAI,KAAO,OAAO,EAAO,CAC5B,GAAO,KAAK,EAAI;AAGpB,QAAO;;;;ACRT,IAAIC,KAHc,OAAO,UAGQ;AASjC,SAAS,GAAW,GAAQ;AAC1B,KAAI,CAAC,EAAS,EAAO,CACnB,QAAO,GAAa,EAAO;CAE7B,IAAI,IAAU,EAAY,EAAO,EAC7B,IAAS,EAAE;AAEf,MAAK,IAAI,KAAO,EACd,CAAM,KAAO,kBAAkB,KAAW,CAACA,GAAe,KAAK,GAAQ,EAAI,KACzE,EAAO,KAAK,EAAI;AAGpB,QAAO;;;;ACFT,SAAS,EAAO,GAAQ;AACtB,QAAO,EAAY,EAAO,GAAG,EAAc,GAAQ,GAAK,GAAG,GAAW,EAAO;;;;ACZ/E,SAAS,EAAQ,GAAO;AAEtB,QADa,KAAS,QAAW,EAAM,SACvB,EAAY,GAAO,EAAE,GAAG,EAAE;;;;ACP5C,SAAS,GAAS,GAAM;AACtB,QAAO,EAAY,GAAS,GAAM,KAAA,GAAW,EAAQ,EAAE,IAAO,GAAG;;;;ACTnE,IAAI,KAAe,GAAQ,OAAO,gBAAgB,OAAO,ECErDC,KAAY,mBAGZ,KAAY,SAAS,WACrBC,KAAc,OAAO,WAGrB,KAAe,GAAU,UAGzBC,KAAiBD,GAAY,gBAG7B,KAAmB,GAAa,KAAK,OAAO;AA8BhD,SAAS,GAAc,GAAO;AAC5B,KAAI,CAAC,EAAa,EAAM,IAAI,GAAW,EAAM,IAAID,GAC/C,QAAO;CAET,IAAI,IAAQ,GAAa,EAAM;AAC/B,KAAI,MAAU,KACZ,QAAO;CAET,IAAI,IAAOE,GAAe,KAAK,GAAO,cAAc,IAAI,EAAM;AAC9D,QAAO,OAAO,KAAQ,cAAc,aAAgB,KAClD,GAAa,KAAK,EAAK,IAAI;;;;AC9C/B,IAAI,KAAe,OAAO,sFAA+D;AASzF,SAAS,GAAW,GAAQ;AAC1B,QAAO,GAAa,KAAK,EAAO;;;;ACVlC,SAAS,GAAW,GAAQ,GAAQ;AAClC,QAAO,KAAU,EAAW,GAAQ,GAAK,EAAO,EAAE,EAAO;;;;ACD3D,SAAS,GAAa,GAAQ,GAAQ;AACpC,QAAO,KAAU,EAAW,GAAQ,EAAO,EAAO,EAAE,EAAO;;;;ACV7D,IAAI,KAAc,OAAO,WAAW,YAAY,WAAW,CAAC,QAAQ,YAAY,SAG5E,KAAa,MAAe,OAAO,UAAU,YAAY,UAAU,CAAC,OAAO,YAAY,QAMvF,KAHgB,MAAc,GAAW,YAAY,KAG5B,GAAK,SAAS,KAAA,GACvC,KAAc,KAAS,GAAO,cAAc,KAAA;AAUhD,SAAS,GAAY,GAAQ,GAAQ;AACnC,KAAI,EACF,QAAO,EAAO,OAAO;CAEvB,IAAI,IAAS,EAAO,QAChB,IAAS,KAAc,GAAY,EAAO,GAAG,IAAI,EAAO,YAAY,EAAO;AAG/E,QADA,EAAO,KAAK,EAAO,EACZ;;;;ACpBT,SAAS,GAAY,GAAQ,GAAQ;AACnC,QAAO,EAAW,GAAQ,GAAW,EAAO,EAAE,EAAO;;;;ACGvD,IAAI,KATmB,OAAO,wBASqB,SAAS,GAAQ;AAElE,MADA,IAAI,IAAS,EAAE,EACR,GAEL,CADA,GAAU,GAAQ,GAAW,EAAO,CAAC,EACrC,IAAS,GAAa,EAAO;AAE/B,QAAO;IAN8B;;;ACJvC,SAAS,GAAc,GAAQ,GAAQ;AACrC,QAAO,EAAW,GAAQ,GAAa,EAAO,EAAE,EAAO;;;;ACAzD,SAAS,GAAa,GAAQ;AAC5B,QAAO,GAAe,GAAQ,GAAQ,GAAa;;;;ACTrD,IAAIC,KAHc,OAAO,UAGQ;AASjC,SAAS,GAAe,GAAO;CAC7B,IAAI,IAAS,EAAM,QACf,IAAS,IAAI,EAAM,YAAY,EAAO;AAO1C,QAJI,KAAU,OAAO,EAAM,MAAM,YAAYA,GAAe,KAAK,GAAO,QAAQ,KAC9E,EAAO,QAAQ,EAAM,OACrB,EAAO,QAAQ,EAAM,QAEhB;;;;ACbT,SAAS,GAAiB,GAAa;CACrC,IAAI,IAAS,IAAI,EAAY,YAAY,EAAY,WAAW;AAEhE,QADA,IAAI,GAAW,EAAO,CAAC,IAAI,IAAI,GAAW,EAAY,CAAC,EAChD;;;;ACFT,SAAS,GAAc,GAAU,GAAQ;CACvC,IAAI,IAAS,IAAS,GAAiB,EAAS,OAAO,GAAG,EAAS;AACnE,QAAO,IAAI,EAAS,YAAY,GAAQ,EAAS,YAAY,EAAS,WAAW;;;;ACXnF,IAAI,KAAU;AASd,SAAS,GAAY,GAAQ;CAC3B,IAAI,IAAS,IAAI,EAAO,YAAY,EAAO,QAAQ,GAAQ,KAAK,EAAO,CAAC;AAExE,QADA,EAAO,YAAY,EAAO,WACnB;;;;ACVT,IAAI,KAAc,KAAS,GAAO,YAAY,KAAA,GAC1C,KAAgB,KAAc,GAAY,UAAU,KAAA;AASxD,SAAS,GAAY,GAAQ;AAC3B,QAAO,KAAgB,OAAO,GAAc,KAAK,EAAO,CAAC,GAAG,EAAE;;;;ACJhE,SAAS,GAAgB,GAAY,GAAQ;CAC3C,IAAI,IAAS,IAAS,GAAiB,EAAW,OAAO,GAAG,EAAW;AACvE,QAAO,IAAI,EAAW,YAAY,GAAQ,EAAW,YAAY,EAAW,OAAO;;;;ACLrF,IAAIC,KAAU,oBACVC,KAAU,iBACVC,KAAS,gBACTC,KAAY,mBACZC,KAAY,mBACZC,KAAS,gBACTC,KAAY,mBACZC,KAAY,mBAEZC,KAAiB,wBACjBC,KAAc,qBACdC,KAAa,yBACbC,KAAa,yBACbC,KAAU,sBACVC,KAAW,uBACXC,KAAW,uBACXC,KAAW,uBACXC,KAAkB,8BAClBC,KAAY,wBACZC,KAAY;AAchB,SAAS,GAAe,GAAQ,GAAK,GAAQ;CAC3C,IAAI,IAAO,EAAO;AAClB,SAAQ,GAAR;EACE,KAAKV,GACH,QAAO,GAAiB,EAAO;EAEjC,KAAKR;EACL,KAAKC,GACH,QAAO,IAAI,EAAK,CAAC,EAAO;EAE1B,KAAKQ,GACH,QAAO,GAAc,GAAQ,EAAO;EAEtC,KAAKC;EAAY,KAAKC;EACtB,KAAKC;EAAS,KAAKC;EAAU,KAAKC;EAClC,KAAKC;EAAU,KAAKC;EAAiB,KAAKC;EAAW,KAAKC,GACxD,QAAO,GAAgB,GAAQ,EAAO;EAExC,KAAKhB,GACH,QAAO,IAAI,GAAI;EAEjB,KAAKC;EACL,KAAKG,GACH,QAAO,IAAI,EAAK,EAAO;EAEzB,KAAKF,GACH,QAAO,GAAY,EAAO;EAE5B,KAAKC,GACH,QAAO,IAAI,GAAI;EAEjB,KAAKE,GACH,QAAO,GAAY,EAAO;;;;;AC7DhC,SAAS,GAAgB,GAAQ;AAC/B,QAAQ,OAAO,EAAO,eAAe,cAAc,CAAC,EAAY,EAAO,GACnE,GAAW,GAAa,EAAO,CAAC,GAChC,EAAE;;;;ACVR,IAAIY,KAAS;AASb,SAAS,GAAU,GAAO;AACxB,QAAO,EAAa,EAAM,IAAIC,EAAO,EAAM,IAAID;;;;ACTjD,IAAI,KAAY,KAAY,EAAS,OAmBjC,KAAQ,KAAY,EAAU,GAAU,GAAG,ICpB3CE,KAAS;AASb,SAAS,GAAU,GAAO;AACxB,QAAO,EAAa,EAAM,IAAIC,EAAO,EAAM,IAAID;;;;ACTjD,IAAI,KAAY,KAAY,EAAS,OAmBjC,KAAQ,KAAY,EAAU,GAAU,GAAG,ICA3CE,KAAkB,GAClB,KAAkB,GAClBC,KAAqB,GAGrB,KAAU,sBACV,KAAW,kBACX,KAAU,oBACV,KAAU,iBACV,KAAW,kBACX,KAAU,qBACV,KAAS,8BACTC,KAAS,gBACT,KAAY,mBACZ,KAAY,mBACZ,KAAY,mBACZC,KAAS,gBACTC,KAAY,mBACZ,KAAY,mBACZ,KAAa,oBAEb,KAAiB,wBACjB,KAAc,qBACd,KAAa,yBACb,KAAa,yBACb,KAAU,sBACV,KAAW,uBACX,KAAW,uBACX,KAAW,uBACX,KAAkB,8BAClB,KAAY,wBACZ,KAAY,wBAGZ,IAAgB,EAAE;AACtB,EAAc,MAAW,EAAc,MACvC,EAAc,MAAkB,EAAc,MAC9C,EAAc,MAAW,EAAc,MACvC,EAAc,MAAc,EAAc,MAC1C,EAAc,MAAW,EAAc,MACvC,EAAc,MAAY,EAAcF,MACxC,EAAc,MAAa,EAAc,MACzC,EAAc,MAAa,EAAcC,MACzC,EAAcC,MAAa,EAAc,MACzC,EAAc,MAAY,EAAc,MACxC,EAAc,MAAa,EAAc,MAAa,IACtD,EAAc,MAAY,EAAc,MACxC,EAAc,MAAc;AAkB5B,SAAS,EAAU,GAAO,GAAS,GAAY,GAAK,GAAQ,GAAO;CACjE,IAAI,GACA,IAAS,IAAUJ,IACnB,IAAS,IAAU,IACnB,IAAS,IAAUC;AAKvB,KAHI,MACF,IAAS,IAAS,EAAW,GAAO,GAAK,GAAQ,EAAM,GAAG,EAAW,EAAM,GAEzE,MAAW,KAAA,EACb,QAAO;AAET,KAAI,CAAC,EAAS,EAAM,CAClB,QAAO;CAET,IAAI,IAAQ,EAAQ,EAAM;AAC1B,KAAI,GAEF;MADA,IAAS,GAAe,EAAM,EAC1B,CAAC,EACH,QAAO,GAAU,GAAO,EAAO;QAE5B;EACL,IAAI,IAAMI,EAAO,EAAM,EACnB,IAAS,KAAO,MAAW,KAAO;AAEtC,MAAI,EAAS,EAAM,CACjB,QAAO,GAAY,GAAO,EAAO;AAEnC,MAAI,KAAO,MAAa,KAAO,MAAY,KAAU,CAAC,GAEpD;OADA,IAAU,KAAU,IAAU,EAAE,GAAG,GAAgB,EAAM,EACrD,CAAC,EACH,QAAO,IACH,GAAc,GAAO,GAAa,GAAQ,EAAM,CAAC,GACjD,GAAY,GAAO,GAAW,GAAQ,EAAM,CAAC;SAE9C;AACL,OAAI,CAAC,EAAc,GACjB,QAAO,IAAS,IAAQ,EAAE;AAE5B,OAAS,GAAe,GAAO,GAAK,EAAO;;;AAI/C,CAAU,MAAQ,IAAI,IAAK;CAC3B,IAAI,IAAU,EAAM,IAAI,EAAM;AAC9B,KAAI,EACF,QAAO;AAIT,CAFA,EAAM,IAAI,GAAO,EAAO,EAEpB,GAAM,EAAM,GACd,EAAM,QAAQ,SAAS,GAAU;AAC/B,IAAO,IAAI,EAAU,GAAU,GAAS,GAAY,GAAU,GAAO,EAAM,CAAC;GAC5E,GACO,GAAM,EAAM,IACrB,EAAM,QAAQ,SAAS,GAAU,GAAK;AACpC,IAAO,IAAI,GAAK,EAAU,GAAU,GAAS,GAAY,GAAK,GAAO,EAAM,CAAC;GAC5E;CAOJ,IAAI,IAAQ,IAAQ,KAAA,KAJL,IACV,IAAS,KAAe,KACxB,IAAS,IAAS,IAEkB,EAAM;AAS/C,QARA,EAAU,KAAS,GAAO,SAAS,GAAU,GAAK;AAMhD,EALI,MACF,IAAM,GACN,IAAW,EAAM,KAGnB,EAAY,GAAQ,GAAK,EAAU,GAAU,GAAS,GAAY,GAAK,GAAO,EAAM,CAAC;GACrF,EACK;;;;AC/JT,IAAI,KAAkB,GAClB,KAAqB;AAoBzB,SAAS,GAAU,GAAO;AACxB,QAAO,EAAU,GAAO,KAAkB,GAAmB;;;;ACP/D,IAAI,KAAM,WAAW;AACnB,QAAO,GAAK,KAAK,KAAK;GCbpB,KAAc,OAAO,WAGrBC,KAAiB,GAAY,gBAuB7B,KAAW,EAAS,SAAS,GAAQ,GAAS;AAChD,KAAS,OAAO,EAAO;CAEvB,IAAI,IAAQ,IACR,IAAS,EAAQ,QACjB,IAAQ,IAAS,IAAI,EAAQ,KAAK,KAAA;AAMtC,MAJI,KAAS,EAAe,EAAQ,IAAI,EAAQ,IAAI,EAAM,KACxD,IAAS,IAGJ,EAAE,IAAQ,GAMf,MALA,IAAI,IAAS,EAAQ,IACjB,IAAQ,EAAO,EAAO,EACtB,IAAa,IACb,IAAc,EAAM,QAEjB,EAAE,IAAa,IAAa;EACjC,IAAI,IAAM,EAAM,IACZ,IAAQ,EAAO;AAEnB,GAAI,MAAU,KAAA,KACT,EAAG,GAAO,GAAY,GAAK,IAAI,CAACA,GAAe,KAAK,GAAQ,EAAI,MACnE,EAAO,KAAO,EAAO;;AAK3B,QAAO;EACP;;;ACjDF,SAAS,GAAiB,GAAQ,GAAK,GAAO;AAC5C,EAAK,MAAU,KAAA,KAAa,CAAC,EAAG,EAAO,IAAM,EAAM,IAC9C,MAAU,KAAA,KAAa,EAAE,KAAO,OACnC,EAAgB,GAAQ,GAAK,EAAM;;;;ACPvC,SAAS,GAAQ,GAAQ,GAAK;AACxB,aAAQ,iBAAiB,OAAO,EAAO,MAAS,eAIhD,KAAO,YAIX,QAAO,EAAO;;;;ACUhB,SAAS,GAAc,GAAO;AAC5B,QAAO,EAAW,GAAO,EAAO,EAAM,CAAC;;;;ACGzC,SAAS,GAAc,GAAQ,GAAQ,GAAK,GAAU,GAAW,GAAY,GAAO;CAClF,IAAI,IAAW,GAAQ,GAAQ,EAAI,EAC/B,IAAW,GAAQ,GAAQ,EAAI,EAC/B,IAAU,EAAM,IAAI,EAAS;AAEjC,KAAI,GAAS;AACX,KAAiB,GAAQ,GAAK,EAAQ;AACtC;;CAEF,IAAI,IAAW,IACX,EAAW,GAAU,GAAW,IAAM,IAAK,GAAQ,GAAQ,EAAM,GACjE,KAAA,GAEA,IAAW,MAAa,KAAA;AAE5B,KAAI,GAAU;EACZ,IAAI,IAAQ,EAAQ,EAAS,EACzB,IAAS,CAAC,KAAS,EAAS,EAAS,EACrC,IAAU,CAAC,KAAS,CAAC,KAAU,EAAa,EAAS;AAGzD,EADA,IAAW,GACP,KAAS,KAAU,IACjB,EAAQ,EAAS,GACnB,IAAW,IAEJ,GAAkB,EAAS,GAClC,IAAW,GAAU,EAAS,GAEvB,KACP,IAAW,IACX,IAAW,GAAY,GAAU,GAAK,IAE/B,KACP,IAAW,IACX,IAAW,GAAgB,GAAU,GAAK,IAG1C,IAAW,EAAE,GAGR,GAAc,EAAS,IAAI,EAAY,EAAS,IACvD,IAAW,GACP,EAAY,EAAS,GACvB,IAAW,GAAc,EAAS,IAE3B,CAAC,EAAS,EAAS,IAAI,GAAW,EAAS,MAClD,IAAW,GAAgB,EAAS,KAItC,IAAW;;AASf,CANI,MAEF,EAAM,IAAI,GAAU,EAAS,EAC7B,EAAU,GAAU,GAAU,GAAU,GAAY,EAAM,EAC1D,EAAM,OAAU,EAAS,GAE3B,GAAiB,GAAQ,GAAK,EAAS;;;;ACvEzC,SAAS,GAAU,GAAQ,GAAQ,GAAU,GAAY,GAAO;AAC1D,OAAW,KAGf,GAAQ,GAAQ,SAAS,GAAU,GAAK;AAEtC,MADA,AAAU,MAAQ,IAAI,IAAK,EACvB,EAAS,EAAS,CACpB,IAAc,GAAQ,GAAQ,GAAK,GAAU,IAAW,GAAY,EAAM;OAEvE;GACH,IAAI,IAAW,IACX,EAAW,GAAQ,GAAQ,EAAI,EAAE,GAAW,IAAM,IAAK,GAAQ,GAAQ,EAAM,GAC7E,KAAA;AAKJ,GAHI,MAAa,KAAA,MACf,IAAW,IAEb,GAAiB,GAAQ,GAAK,EAAS;;IAExC,EAAO;;;;ACxBZ,SAAS,EAAK,GAAO;CACnB,IAAI,IAAS,KAAS,OAAO,IAAI,EAAM;AACvC,QAAO,IAAS,EAAM,IAAS,KAAK,KAAA;;;;ACLtC,SAAS,GAAW,GAAe;AACjC,QAAO,SAAS,GAAY,GAAW,GAAW;EAChD,IAAI,IAAW,OAAO,EAAW;AACjC,MAAI,CAAC,EAAY,EAAW,EAAE;GAC5B,IAAI,IAAW,EAAa,GAAW,EAAE;AAEzC,GADA,IAAa,GAAK,EAAW,EAC7B,IAAY,SAAS,GAAK;AAAE,WAAO,EAAS,EAAS,IAAM,GAAK,EAAS;;;EAE3E,IAAI,IAAQ,EAAc,GAAY,GAAW,EAAU;AAC3D,SAAO,IAAQ,KAAK,EAAS,IAAW,EAAW,KAAS,KAAS,KAAA;;;;;ACfzE,IAAIC,KAAY,KAAK;AAqCrB,SAAS,GAAU,GAAO,GAAW,GAAW;CAC9C,IAAI,IAAS,KAAS,OAAO,IAAI,EAAM;AACvC,KAAI,CAAC,EACH,QAAO;CAET,IAAI,IAAQ,KAAa,OAAO,IAAI,GAAU,EAAU;AAIxD,QAHI,IAAQ,MACV,IAAQA,GAAU,IAAS,GAAO,EAAE,GAE/B,GAAc,GAAO,EAAa,GAAW,EAAE,EAAE,EAAM;;;;ACZhE,IAAI,KAAO,GAAW,GAAU;;;AC5BhC,SAAS,GAAQ,GAAY,GAAU;CACrC,IAAI,IAAQ,IACR,IAAS,EAAY,EAAW,GAAG,MAAM,EAAW,OAAO,GAAG,EAAE;AAKpE,QAHA,GAAS,GAAY,SAAS,GAAO,GAAK,GAAY;AACpD,IAAO,EAAE,KAAS,EAAS,GAAO,GAAK,EAAW;GAClD,EACK;;;;AC6BT,SAAS,EAAI,GAAY,GAAU;AAEjC,SADW,EAAQ,EAAW,GAAG,IAAW,IAChC,GAAY,EAAa,GAAU,EAAE,CAAC;;;;ACjBpD,SAAS,GAAM,GAAQ,GAAU;AAC/B,QAAO,KAAU,OACb,IACA,GAAQ,GAAQ,GAAa,EAAS,EAAE,EAAO;;;;ACJrD,SAAS,GAAO,GAAQ,GAAU;AAChC,QAAO,KAAU,GAAW,GAAQ,GAAa,EAAS,CAAC;;;;ACvB7D,SAAS,GAAO,GAAO,GAAO;AAC5B,QAAO,IAAQ;;;;ACNjB,IAAI,KAHc,OAAO,UAGQ;AAUjC,SAAS,GAAQ,GAAQ,GAAK;AAC5B,QAAO,KAAU,QAAQ,GAAe,KAAK,GAAQ,EAAI;;;;ACe3D,SAAS,GAAI,GAAQ,GAAM;AACzB,QAAO,KAAU,QAAQ,GAAQ,GAAQ,GAAM,GAAQ;;;;AC1BzD,IAAI,KAAY;AAmBhB,SAAS,GAAS,GAAO;AACvB,QAAO,OAAO,KAAS,YACpB,CAAC,EAAQ,EAAM,IAAI,EAAa,EAAM,IAAI,GAAW,EAAM,IAAI;;;;ACjBpE,SAAS,GAAO,GAAO,GAAO;AAC5B,QAAO,IAAQ;;;;ACsBjB,SAAS,EAAU,GAAQ,GAAU;CACnC,IAAI,IAAS,EAAE;AAMf,QALA,IAAW,EAAa,GAAU,EAAE,EAEpC,GAAW,GAAQ,SAAS,GAAO,GAAK,GAAQ;AAC9C,IAAgB,GAAQ,GAAK,EAAS,GAAO,GAAK,EAAO,CAAC;GAC1D,EACK;;;;AC3BT,SAAS,GAAa,GAAO,GAAU,GAAY;AAIjD,MAHA,IAAI,IAAQ,IACR,IAAS,EAAM,QAEZ,EAAE,IAAQ,IAAQ;EACvB,IAAI,IAAQ,EAAM,IACd,IAAU,EAAS,EAAM;AAE7B,MAAI,KAAW,SAAS,MAAa,KAAA,IAC5B,MAAY,KAAW,CAAC,EAAS,EAAQ,GAC1C,EAAW,GAAS,EAAS,GAEnC,IAAI,IAAW,GACX,IAAS;;AAGjB,QAAO;;;;ACNT,SAAS,EAAI,GAAO;AAClB,QAAQ,KAAS,EAAM,SACnB,GAAa,GAAO,IAAU,GAAO,GACrC,KAAA;;;;ACSN,IAAI,KAAQ,GAAe,SAAS,GAAQ,GAAQ,GAAU;AAC5D,IAAU,GAAQ,GAAQ,EAAS;EACnC;;;ACdF,SAAS,EAAI,GAAO;AAClB,QAAQ,KAAS,EAAM,SACnB,GAAa,GAAO,IAAU,GAAO,GACrC,KAAA;;;;ACEN,SAAS,GAAM,GAAO,GAAU;AAC9B,QAAQ,KAAS,EAAM,SACnB,GAAa,GAAO,EAAa,GAAU,EAAE,EAAE,GAAO,GACtD,KAAA;;;;ACdN,SAAS,GAAQ,GAAQ,GAAM,GAAO,GAAY;AAChD,KAAI,CAAC,EAAS,EAAO,CACnB,QAAO;AAET,KAAO,EAAS,GAAM,EAAO;AAO7B,MALA,IAAI,IAAQ,IACR,IAAS,EAAK,QACd,IAAY,IAAS,GACrB,IAAS,GAEN,KAAU,QAAQ,EAAE,IAAQ,IAAQ;EACzC,IAAI,IAAM,EAAM,EAAK,GAAO,EACxB,IAAW;AAEf,MAAI,MAAQ,eAAe,MAAQ,iBAAiB,MAAQ,YAC1D,QAAO;AAGT,MAAI,KAAS,GAAW;GACtB,IAAI,IAAW,EAAO;AAEtB,GADA,IAAW,IAAa,EAAW,GAAU,GAAK,EAAO,GAAG,KAAA,GACxD,MAAa,KAAA,MACf,IAAW,EAAS,EAAS,GACzB,IACC,GAAQ,EAAK,IAAQ,GAAG,GAAG,EAAE,GAAG,EAAE;;AAI3C,EADA,EAAY,GAAQ,GAAK,EAAS,EAClC,IAAS,EAAO;;AAElB,QAAO;;;;AClCT,SAAS,GAAW,GAAQ,GAAO,GAAW;AAK5C,MAJA,IAAI,IAAQ,IACR,IAAS,EAAM,QACf,IAAS,EAAE,EAER,EAAE,IAAQ,IAAQ;EACvB,IAAI,IAAO,EAAM,IACb,IAAQ,GAAQ,GAAQ,EAAK;AAEjC,EAAI,EAAU,GAAO,EAAK,IACxB,GAAQ,GAAQ,EAAS,GAAM,EAAO,EAAE,EAAM;;AAGlD,QAAO;;;;AChBT,SAAS,GAAW,GAAO,GAAU;CACnC,IAAI,IAAS,EAAM;AAGnB,MADA,EAAM,KAAK,EAAS,EACb,KACL,GAAM,KAAU,EAAM,GAAQ;AAEhC,QAAO;;;;ACPT,SAAS,GAAiB,GAAO,GAAO;AACtC,KAAI,MAAU,GAAO;EACnB,IAAI,IAAe,MAAU,KAAA,GACzB,IAAY,MAAU,MACtB,IAAiB,MAAU,GAC3B,IAAc,EAAS,EAAM,EAE7B,IAAe,MAAU,KAAA,GACzB,IAAY,MAAU,MACtB,IAAiB,MAAU,GAC3B,IAAc,EAAS,EAAM;AAEjC,MAAK,CAAC,KAAa,CAAC,KAAe,CAAC,KAAe,IAAQ,KACtD,KAAe,KAAgB,KAAkB,CAAC,KAAa,CAAC,KAChE,KAAa,KAAgB,KAC7B,CAAC,KAAgB,KAClB,CAAC,EACH,QAAO;AAET,MAAK,CAAC,KAAa,CAAC,KAAe,CAAC,KAAe,IAAQ,KACtD,KAAe,KAAgB,KAAkB,CAAC,KAAa,CAAC,KAChE,KAAa,KAAgB,KAC7B,CAAC,KAAgB,KAClB,CAAC,EACH,QAAO;;AAGX,QAAO;;;;ACrBT,SAAS,GAAgB,GAAQ,GAAO,GAAQ;AAO9C,MANA,IAAI,IAAQ,IACR,IAAc,EAAO,UACrB,IAAc,EAAM,UACpB,IAAS,EAAY,QACrB,IAAe,EAAO,QAEnB,EAAE,IAAQ,IAAQ;EACvB,IAAI,IAAS,GAAiB,EAAY,IAAQ,EAAY,GAAO;AACrE,MAAI,EAKF,QAJI,KAAS,IACJ,IAGF,KADK,EAAO,MACO,SAAS,KAAK;;AAU5C,QAAO,EAAO,QAAQ,EAAM;;;;ACrB9B,SAAS,GAAY,GAAY,GAAW,GAAQ;AAClD,CAUE,IAVE,EAAU,SACA,EAAS,GAAW,SAAS,GAAU;AAMjD,SALI,EAAQ,EAAS,GACZ,SAAS,GAAO;AACrB,UAAO,GAAQ,GAAO,EAAS,WAAW,IAAI,EAAS,KAAK,EAAS;MAGlE;GACP,GAEU,CAAC,GAAS;CAGxB,IAAI,IAAQ;AAUZ,QATA,IAAY,EAAS,GAAW,EAAU,EAAa,CAAC,EASjD,GAPM,GAAQ,GAAY,SAAS,GAAO,GAAK,GAAY;AAIhE,SAAO;GAAE,UAHM,EAAS,GAAW,SAAS,GAAU;AACpD,WAAO,EAAS,EAAM;KACtB;GAC6B,OAAS,EAAE;GAAO,OAAS;GAAO;GACjE,EAEwB,SAAS,GAAQ,GAAO;AAChD,SAAO,GAAgB,GAAQ,GAAO,EAAO;GAC7C;;;;ACpCJ,IAAI,KAAY,GAAa,SAAS,ECRlC,KAAgB,mBAIhB,KAAe,iDACf,KAAa,kBAGb,KAAW,MAAM,KAAgB,KACjC,IAAU,MAAM,KAAe,KAC/B,KAAS,4BACT,KAAa,QAAQ,IAAU,MAAM,KAAS,KAC9C,KAAc,OAAO,KAAgB,KACrC,KAAa,mCACb,KAAa,sCACb,KAAQ,WAGR,KAAW,KAAa,KACxB,KAAW,MAAM,KAAa,MAC9B,KAAY,QAAQ,KAAQ,QAAQ;CAAC;CAAa;CAAY;CAAW,CAAC,KAAK,IAAI,GAAG,MAAM,KAAW,KAAW,MAClH,KAAQ,KAAW,KAAW,IAC9B,KAAW,QAAQ;CAAC,KAAc,IAAU;CAAK;CAAS;CAAY;CAAY;CAAS,CAAC,KAAK,IAAI,GAAG,KAGxG,KAAY,OAAO,KAAS,QAAQ,KAAS,OAAO,KAAW,IAAO,IAAI;AAS9E,SAAS,GAAY,GAAQ;AAE3B,MADA,IAAI,IAAS,GAAU,YAAY,GAC5B,GAAU,KAAK,EAAO,EAC3B,GAAE;AAEJ,QAAO;;;;AC7BT,SAAS,GAAW,GAAQ;AAC1B,QAAO,GAAW,EAAO,GACrB,GAAY,EAAO,GACnB,GAAU,EAAO;;;;ACFvB,SAAS,GAAS,GAAQ,GAAO;AAC/B,QAAO,GAAW,GAAQ,GAAO,SAAS,GAAO,GAAM;AACrD,SAAO,GAAM,GAAQ,EAAK;GAC1B;;;;ACKJ,IAAI,IAAO,GAAS,SAAS,GAAQ,GAAO;AAC1C,QAAO,KAAU,OAAO,EAAE,GAAG,GAAS,GAAQ,EAAM;EACpD,ECrBE,KAAa,KAAK,MAClB,KAAY,KAAK;AAarB,SAAS,GAAU,GAAO,GAAK,GAAM,GAAW;AAK9C,MAJA,IAAI,IAAQ,IACR,IAAS,GAAU,IAAY,IAAM,MAAU,KAAQ,GAAG,EAAE,EAAE,EAC9D,IAAS,MAAM,EAAO,EAEnB,KAEL,CADA,EAAO,IAAY,IAAS,EAAE,KAAS,GACvC,KAAS;AAEX,QAAO;;;;ACbT,SAAS,GAAY,GAAW;AAC9B,QAAO,SAAS,GAAO,GAAK,GAAM;AAahC,SAZI,KAAQ,OAAO,KAAQ,YAAY,EAAe,GAAO,GAAK,EAAK,KACrE,IAAM,IAAO,KAAA,IAGf,IAAQ,EAAS,EAAM,EACnB,MAAQ,KAAA,KACV,IAAM,GACN,IAAQ,KAER,IAAM,EAAS,EAAI,EAErB,IAAO,MAAS,KAAA,IAAa,IAAQ,IAAM,IAAI,KAAM,EAAS,EAAK,EAC5D,GAAU,GAAO,GAAK,GAAM,EAAU;;;;;ACkBjD,IAAI,IAAQ,IAAa,ECpCrB,KAAS,gBACT,KAAS;AAuBb,SAAS,GAAK,GAAY;AACxB,KAAI,KAAc,KAChB,QAAO;AAET,KAAI,EAAY,EAAW,CACzB,QAAO,GAAS,EAAW,GAAG,GAAW,EAAW,GAAG,EAAW;CAEpE,IAAI,IAAMC,EAAO,EAAW;AAI5B,QAHI,KAAO,MAAU,KAAO,KACnB,EAAW,OAEb,EAAS,EAAW,CAAC;;;;ACR9B,IAAI,IAAS,EAAS,SAAS,GAAY,GAAW;AACpD,KAAI,KAAc,KAChB,QAAO,EAAE;CAEX,IAAI,IAAS,EAAU;AAMvB,QALI,IAAS,KAAK,EAAe,GAAY,EAAU,IAAI,EAAU,GAAG,GACtE,IAAY,EAAE,GACL,IAAS,KAAK,EAAe,EAAU,IAAI,EAAU,IAAI,EAAU,GAAG,KAC/E,IAAY,CAAC,EAAU,GAAG,GAErB,GAAY,GAAY,EAAY,GAAW,EAAE,EAAE,EAAE,CAAC;EAC7D,EC1CE,KAAY;AAmBhB,SAAS,GAAS,GAAQ;CACxB,IAAI,IAAK,EAAE;AACX,QAAO,EAAS,EAAO,GAAG;;;;ACf5B,SAAS,GAAc,GAAO,GAAQ,GAAY;AAMhD,MALA,IAAI,IAAQ,IACR,IAAS,EAAM,QACf,IAAa,EAAO,QACpB,IAAS,EAAE,EAER,EAAE,IAAQ,IAAQ;EACvB,IAAI,IAAQ,IAAQ,IAAa,EAAO,KAAS,KAAA;AACjD,IAAW,GAAQ,EAAM,IAAQ,EAAM;;AAEzC,QAAO;;;;ACAT,SAAS,GAAU,GAAO,GAAQ;AAChC,QAAO,GAAc,KAAS,EAAE,EAAE,KAAU,EAAE,EAAE,EAAY;;;;ACb9D,IAAM,KAAN,MAAW;CACT,cAAc;EACZ,IAAI,IAAW,EAAE;AAEjB,EADA,EAAS,QAAQ,EAAS,QAAQ,GAClC,KAAK,YAAY;;CAEnB,UAAU;EACR,IAAI,IAAW,KAAK,WAChB,IAAQ,EAAS;AACrB,MAAI,MAAU,EAEZ,QADA,GAAO,EAAM,EACN;;CAGX,QAAQ,GAAO;EACb,IAAI,IAAW,KAAK;AAOpB,EANI,EAAM,SAAS,EAAM,SACvB,GAAO,EAAM,EAEf,EAAM,QAAQ,EAAS,OACvB,EAAS,MAAM,QAAQ,GACvB,EAAS,QAAQ,GACjB,EAAM,QAAQ;;CAEhB,WAAW;AAIT,OAHA,IAAI,IAAO,EAAE,EACT,IAAW,KAAK,WAChB,IAAO,EAAS,OACb,MAAS,GAEd,CADA,EAAK,KAAK,KAAK,UAAU,GAAM,GAAe,CAAC,EAC/C,IAAO,EAAK;AAEd,SAAO,MAAM,EAAK,KAAK,KAAK,GAAG;;;AAInC,SAAS,GAAO,GAAO;AAIrB,CAHA,EAAM,MAAM,QAAQ,EAAM,OAC1B,EAAM,MAAM,QAAQ,EAAM,OAC1B,OAAO,EAAM,OACb,OAAO,EAAM;;AAGf,SAAS,GAAe,GAAG,GAAG;AAC5B,KAAI,MAAM,WAAW,MAAM,QACzB,QAAO;;;;ACvCX,IAAI,KAAoBC,EAAW,EAAE;AAErC,SAAS,GAAU,GAAG,GAAU;AAC9B,KAAI,EAAE,WAAW,IAAI,EACnB,QAAO,EAAE;CAEX,IAAI,IAAQ,GAAW,GAAG,KAAY,GAAkB;AAIxD,QAAOC,EACLC,EAJY,GAAY,EAAM,OAAO,EAAM,SAAS,EAAM,QAAQ,EAInD,SAAU,GAAG;AAC1B,SAAO,EAAE,SAAS,EAAE,GAAG,EAAE,EAAE;GAC3B,CACH;;AAGH,SAAS,GAAY,GAAG,GAAS,GAAS;AAMxC,MALA,IAAI,IAAU,EAAE,EACZ,IAAU,EAAQ,EAAQ,SAAS,IACnC,IAAQ,EAAQ,IAEhB,GACG,EAAE,WAAW,GAAE;AACpB,SAAQ,IAAQ,EAAM,SAAS,EAC7B,IAAW,GAAG,GAAS,GAAS,EAAM;AAExC,SAAQ,IAAQ,EAAQ,SAAS,EAC/B,IAAW,GAAG,GAAS,GAAS,EAAM;AAExC,MAAI,EAAE,WAAW,EACf;QAAK,IAAI,IAAI,EAAQ,SAAS,GAAG,IAAI,GAAG,EAAE,EAExC,KADA,IAAQ,EAAQ,GAAG,SAAS,EACxB,GAAO;AACT,QAAU,EAAQ,OAAO,GAAW,GAAG,GAAS,GAAS,GAAO,GAAK,CAAC;AACtE;;;;AAMR,QAAO;;AAGT,SAAS,GAAW,GAAG,GAAS,GAAS,GAAO,GAAqB;CACnE,IAAI,IAAU,IAAsB,EAAE,GAAG,KAAA;AAwBzC,QAtBA,EAAU,EAAE,QAAQ,EAAM,EAAE,EAAE,SAAU,GAAM;EAC5C,IAAI,IAAS,EAAE,KAAK,EAAK,EACrB,IAAS,EAAE,KAAK,EAAK,EAAE;AAO3B,EALI,KACF,EAAQ,KAAK;GAAE,GAAG,EAAK;GAAG,GAAG,EAAK;GAAG,CAAC,EAGxC,EAAO,OAAO,GACd,GAAa,GAAS,GAAS,EAAO;GACtC,EAEF,EAAU,EAAE,SAAS,EAAM,EAAE,EAAE,SAAU,GAAM;EAC7C,IAAI,IAAS,EAAE,KAAK,EAAK,EACrB,IAAI,EAAK,GACT,IAAS,EAAE,KAAK,EAAE;AAEtB,EADA,EAAO,MAAS,GAChB,GAAa,GAAS,GAAS,EAAO;GACtC,EAEF,EAAE,WAAW,EAAM,EAAE,EAEd;;AAGT,SAAS,GAAW,GAAG,GAAU;CAC/B,IAAI,IAAW,IAAI,GAAO,EACtB,IAAQ,GACR,IAAS;AAQb,CANA,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;AAChC,IAAS,QAAQ,GAAG;GAAK;GAAG,IAAI;GAAG,KAAK;GAAG,CAAC;GAC5C,EAIF,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAa,EAAS,KAAK,EAAE,GAAG,EAAE,EAAE,IAAI,GACxC,IAAS,EAAS,EAAE,EACpB,IAAa,IAAa;AAG9B,EAFA,EAAS,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAW,EACtC,IAAS,KAAK,IAAI,GAAS,EAAS,KAAK,EAAE,EAAE,CAAC,OAAO,EAAQ,EAC7D,IAAQ,KAAK,IAAI,GAAQ,EAAS,KAAK,EAAE,EAAE,CAAC,MAAS,EAAQ;GAC7D;CAEF,IAAI,IAAUC,EAAQ,IAAS,IAAQ,EAAE,CAAC,IAAI,WAAY;AACxD,SAAO,IAAI,IAAM;GACjB,EACE,IAAU,IAAQ;AAMtB,QAJA,EAAU,EAAS,OAAO,EAAE,SAAU,GAAG;AACvC,KAAa,GAAS,GAAS,EAAS,KAAK,EAAE,CAAC;GAChD,EAEK;EAAE,OAAO;EAAmB;EAAkB;EAAS;;AAGhE,SAAS,GAAa,GAAS,GAAS,GAAO;AAC7C,CAAK,EAAM,MAEC,EAAM,KAGhB,EAAQ,EAAM,MAAM,EAAM,KAAQ,GAAS,QAAQ,EAAM,GAFzD,EAAQ,EAAQ,SAAS,GAAG,QAAQ,EAAM,GAF1C,EAAQ,GAAG,QAAQ,EAAM;;;;AClH7B,SAASC,GAAI,GAAG;AAEd,GADU,EAAE,OAAO,CAAC,cAAc,WAAW,GAAU,GAAG,EAAS,EAAE,CAAC,GAAG,GAAO,EAAE,EACnE,SAAU,GAAG;EAC1B,IAAI,IAAQ,EAAE,KAAK,EAAE;AAIrB,EAHA,EAAE,WAAW,EAAE,EACf,EAAM,cAAc,EAAE,MACtB,EAAM,WAAW,IACjB,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,GAAOC,GAAW,MAAM,CAAC;GAC7C;CAEF,SAAS,EAAS,GAAG;AACnB,SAAO,SAAU,GAAG;AAClB,UAAO,EAAE,KAAK,EAAE,CAAC;;;;AAKvB,SAAS,GAAO,GAAG;CACjB,IAAI,IAAM,EAAE,EACR,IAAQ,EAAE,EACV,IAAU,EAAE;CAEhB,SAAS,EAAI,GAAG;AACV,SAAO,UAAU,eAAe,KAAK,GAAS,EAAE,KAGpD,EAAQ,KAAK,IACb,EAAM,KAAK,IACX,EAAU,EAAE,SAAS,EAAE,EAAE,SAAU,GAAG;AACpC,GAAI,OAAO,UAAU,eAAe,KAAK,GAAO,EAAE,EAAE,GAClD,EAAI,KAAK,EAAE,GAEX,EAAI,EAAE,EAAE;IAEV,EACF,OAAO,EAAM;;AAIf,QADA,EAAU,EAAE,OAAO,EAAE,EAAI,EAClB;;AAGT,SAASC,GAAK,GAAG;AACf,GAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAQ,EAAE,KAAK,EAAE;AACrB,MAAI,EAAM,UAAU;AAClB,KAAE,WAAW,EAAE;GAEf,IAAI,IAAc,EAAM;AAGxB,GAFA,OAAO,EAAM,UACb,OAAO,EAAM,aACb,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,GAAO,EAAY;;GAEzC;;;;ACnCJ,SAAS,EAAa,GAAG,GAAM,GAAO,GAAM;CAC1C,IAAI;AACJ;AACE,MAAIC,GAAW,EAAK;QACb,EAAE,QAAQ,EAAE;AAIrB,QAFA,EAAM,QAAQ,GACd,EAAE,QAAQ,GAAG,EAAM,EACZ;;AAOT,SAAS,GAAS,GAAG;CACnB,IAAI,IAAa,IAAI,GAAO,CAAC,SAAS,EAAE,OAAO,CAAC;AAYhD,QAXA,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;AAChC,IAAW,QAAQ,GAAG,EAAE,KAAK,EAAE,CAAC;GAChC,EACF,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAc,EAAW,KAAK,EAAE,GAAG,EAAE,EAAE,IAAI;GAAE,QAAQ;GAAG,QAAQ;GAAG,EACnE,IAAQ,EAAE,KAAK,EAAE;AACrB,IAAW,QAAQ,EAAE,GAAG,EAAE,GAAG;GAC3B,QAAQ,EAAY,SAAS,EAAM;GACnC,QAAQ,KAAK,IAAI,EAAY,QAAQ,EAAM,OAAO;GACnD,CAAC;GACF,EACK;;AAGT,SAAS,GAAmB,GAAG;CAC7B,IAAI,IAAa,IAAI,EAAM,EAAE,YAAY,EAAE,cAAc,EAAE,CAAC,CAAC,SAAS,EAAE,OAAO,CAAC;AAShF,QARA,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;AAChC,EAAK,EAAE,SAAS,EAAE,CAAC,UACjB,EAAW,QAAQ,GAAG,EAAE,KAAK,EAAE,CAAC;GAElC,EACF,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;AAChC,IAAW,QAAQ,GAAG,EAAE,KAAK,EAAE,CAAC;GAChC,EACK;;AA6BT,SAAS,GAAc,GAAM,GAAO;CAClC,IAAI,IAAI,EAAK,GACT,IAAI,EAAK,GAIT,IAAK,EAAM,IAAI,GACf,IAAK,EAAM,IAAI,GACf,IAAI,EAAK,QAAQ,GACjB,IAAI,EAAK,SAAS;AAEtB,KAAI,CAAC,KAAM,CAAC,EACV,OAAU,MAAM,4DAA4D;CAG9E,IAAI,GAAI;AAiBR,QAhBI,KAAK,IAAI,EAAG,GAAG,IAAI,KAAK,IAAI,EAAG,GAAG,KAEhC,IAAK,MACP,IAAI,CAAC,IAEP,IAAM,IAAI,IAAM,GAChB,IAAK,MAGD,IAAK,MACP,IAAI,CAAC,IAEP,IAAK,GACL,IAAM,IAAI,IAAM,IAGX;EAAE,GAAG,IAAI;EAAI,GAAG,IAAI;EAAI;;AAOjC,SAAS,EAAiB,GAAG;CAC3B,IAAI,IAAWC,EAAMC,EAAQ,GAAQ,EAAE,GAAG,EAAE,EAAE,WAAY;AACxD,SAAO,EAAE;GACT;AAQF,QAPA,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE,EAChB,IAAO,EAAK;AAChB,EAAKC,EAAc,EAAK,KACtB,EAAS,GAAM,EAAK,SAAS;GAE/B,EACK;;AAOT,SAAS,GAAe,GAAG;CACzB,IAAIC,IAAMC,EACRJ,EAAM,EAAE,OAAO,EAAE,SAAU,GAAG;AAC5B,SAAO,EAAE,KAAK,EAAE,CAAC;GACjB,CACH;AACD,GAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,EAAIK,GAAM,GAAM,OAAO,KACrB,EAAK,QAAQF;GAEf;;AAGJ,SAAS,GAAiB,GAAG;CAE3B,IAAI,IAASC,EACXJ,EAAM,EAAE,OAAO,EAAE,SAAU,GAAG;AAC5B,SAAO,EAAE,KAAK,EAAE,CAAC;GACjB,CACH,EAEG,IAAS,EAAE;AACf,GAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE,CAAC,OAAO;AAI5B,EAHK,EAAO,OACV,EAAO,KAAQ,EAAE,GAEnB,EAAO,GAAM,KAAK,EAAE;GACpB;CAEF,IAAI,IAAQ,GACR,IAAiB,EAAE,OAAO,CAAC;AAC/B,GAAU,GAAQ,SAAU,GAAI,GAAG;AACjC,EAAIE,EAAc,EAAG,IAAI,IAAI,MAAmB,IAC9C,EAAE,IACO,KACT,EAAU,GAAI,SAAU,GAAG;AACzB,KAAE,KAAK,EAAE,CAAC,QAAQ;IAClB;GAEJ;;AAGJ,SAASI,GAAc,GAAG,GAAQ,GAAM,GAAO;CAC7C,IAAI,IAAO;EACT,OAAO;EACP,QAAQ;EACT;AAKD,QAJI,UAAU,UAAU,MACtB,EAAK,OAAO,GACZ,EAAK,QAAQ,IAER,EAAa,GAAG,UAAU,GAAM,EAAO;;AAGhD,SAAS,GAAQ,GAAG;AAClB,QAAOC,EACLP,EAAM,EAAE,OAAO,EAAE,SAAU,GAAG;EAC5B,IAAI,IAAO,EAAE,KAAK,EAAE,CAAC;AACrB,MAAI,CAACE,EAAc,EAAK,CACtB,QAAO;GAET,CACH;;AAQH,SAAS,GAAU,GAAY,GAAI;CACjC,IAAI,IAAS;EAAE,KAAK,EAAE;EAAE,KAAK,EAAE;EAAE;AAQjC,QAPA,EAAU,GAAY,SAAU,GAAO;AACrC,EAAI,EAAG,EAAM,GACX,EAAO,IAAI,KAAK,EAAM,GAEtB,EAAO,IAAI,KAAK,EAAM;GAExB,EACK;;AAOT,SAAS,GAAK,GAAM,GAAI;CACtB,IAAI,IAAQM,IAAO;AACnB,KAAI;AACF,SAAO,GAAI;WACH;AACR,UAAQ,IAAI,IAAO,aAAaA,IAAO,GAAG,KAAS,KAAK;;;AAI5D,SAAS,GAAO,GAAM,GAAI;AACxB,QAAO,GAAI;;;;ACnPb,SAAS,GAAkB,GAAG;CAC5B,SAAS,EAAI,GAAG;EACd,IAAI,IAAW,EAAE,SAAS,EAAE,EACxB,IAAO,EAAE,KAAK,EAAE;AAKpB,MAJI,EAAS,UACX,EAAU,GAAU,EAAI,EAGtB,OAAO,UAAU,eAAe,KAAK,GAAM,UAAU,EAAE;AAEzD,GADA,EAAK,aAAa,EAAE,EACpB,EAAK,cAAc,EAAE;AACrB,QAAK,IAAI,IAAO,EAAK,SAAS,IAAU,EAAK,UAAU,GAAG,IAAO,GAAS,EAAE,EAE1E,CADA,GAAc,GAAG,cAAc,OAAO,GAAG,GAAM,EAAK,EACpD,GAAc,GAAG,eAAe,OAAO,GAAG,GAAM,EAAK;;;AAK3D,GAAU,EAAE,UAAU,EAAE,EAAI;;AAG9B,SAAS,GAAc,GAAG,GAAM,GAAQ,GAAI,GAAQ,GAAM;CACxD,IAAI,IAAQ;EAAE,OAAO;EAAG,QAAQ;EAAS;EAAM,YAAY;EAAM,EAC7D,IAAO,EAAO,GAAM,IAAO,IAC3B,IAAOC,EAAkB,GAAG,UAAU,GAAO,EAAO;AAGxD,CAFA,EAAO,GAAM,KAAQ,GACrB,EAAE,UAAU,GAAM,EAAG,EACjB,KACF,EAAE,QAAQ,GAAM,GAAM,EAAE,QAAQ,GAAG,CAAC;;;;AC7BxC,SAAS,GAAO,GAAG;CACjB,IAAI,IAAU,EAAE,OAAO,CAAC,QAAQ,aAAa;AAC7C,EAAI,MAAY,QAAQ,MAAY,SAClC,GAAgB,EAAE;;AAItB,SAASC,GAAK,GAAG;CACf,IAAI,IAAU,EAAE,OAAO,CAAC,QAAQ,aAAa;AAK7C,EAJI,MAAY,QAAQ,MAAY,SAClC,GAAS,EAAE,GAGT,MAAY,QAAQ,MAAY,UAClC,GAAO,EAAE,EACT,GAAgB,EAAE;;AAItB,SAAS,GAAgB,GAAG;AAI1B,CAHA,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;AAChC,KAAmB,EAAE,KAAK,EAAE,CAAC;GAC7B,EACF,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;AAChC,KAAmB,EAAE,KAAK,EAAE,CAAC;GAC7B;;AAGJ,SAAS,GAAmB,GAAO;CACjC,IAAI,IAAI,EAAM;AAEd,CADA,EAAM,QAAQ,EAAM,QACpB,EAAM,SAAS;;AAGjB,SAAS,GAAS,GAAG;AAKnB,CAJA,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;AAChC,KAAY,EAAE,KAAK,EAAE,CAAC;GACtB,EAEF,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE;AAEpB,EADA,EAAU,EAAK,QAAQ,GAAY,EAC/B,OAAO,UAAU,eAAe,KAAK,GAAM,IAAI,IACjD,GAAY,EAAK;GAEnB;;AAGJ,SAAS,GAAY,GAAO;AAC1B,GAAM,IAAI,CAAC,EAAM;;AAGnB,SAAS,GAAO,GAAG;AAKjB,CAJA,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;AAChC,KAAU,EAAE,KAAK,EAAE,CAAC;GACpB,EAEF,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE;AAEpB,EADA,EAAU,EAAK,QAAQ,GAAU,EAC7B,OAAO,UAAU,eAAe,KAAK,GAAM,IAAI,IACjD,GAAU,EAAK;GAEjB;;AAGJ,SAAS,GAAU,GAAO;CACxB,IAAI,IAAI,EAAM;AAEd,CADA,EAAM,IAAI,EAAM,GAChB,EAAM,IAAI;;;;AC/CZ,SAASC,GAAI,GAAG;AAEd,CADA,EAAE,OAAO,CAAC,cAAc,EAAE,EAC1B,EAAU,EAAE,OAAO,EAAE,SAAU,GAAM;AACnC,KAAc,GAAG,EAAK;GACtB;;AAMJ,SAAS,GAAc,GAAG,GAAG;CAC3B,IAAI,IAAI,EAAE,GACN,IAAQ,EAAE,KAAK,EAAE,CAAC,MAClB,IAAI,EAAE,GACN,IAAQ,EAAE,KAAK,EAAE,CAAC,MAClB,IAAO,EAAE,MACT,IAAY,EAAE,KAAK,EAAE,EACrB,IAAY,EAAU;AAEtB,WAAU,IAAQ,GAEtB;IAAE,WAAW,EAAE;EAcf,IAAI,IAAQ,KAAA,GACR,GAAO;AACX,OAAK,IAAI,GAAG,EAAE,GAAO,IAAQ,GAAO,EAAE,GAAG,EAAE,EAoBzC,CAnBA,EAAU,SAAS,EAAE,EACrB,IAAQ;GACN,OAAO;GACP,QAAQ;GACG;GACX,SAAS;GACT,MAAM;GACP,EACD,IAAQC,EAAkB,GAAG,QAAQ,GAAO,KAAK,EAC7C,MAAU,MACZ,EAAM,QAAQ,EAAU,OACxB,EAAM,SAAS,EAAU,QACzB,EAAM,QAAQ,cACd,EAAM,WAAW,EAAU,WAE7B,EAAE,QAAQ,GAAG,GAAO,EAAE,QAAQ,EAAU,QAAQ,EAAE,EAAK,EACnD,MAAM,KACR,EAAE,OAAO,CAAC,YAAY,KAAK,EAAM,EAEnC,IAAI;AAGN,IAAE,QAAQ,GAAG,GAAG,EAAE,QAAQ,EAAU,QAAQ,EAAE,EAAK;;;AAGrD,SAAS,GAAK,GAAG;AACf,GAAU,EAAE,OAAO,CAAC,aAAa,SAAU,GAAG;EAC5C,IAAI,IAAO,EAAE,KAAK,EAAE,EAChB,IAAY,EAAK,WACjB;AAEJ,OADA,EAAE,QAAQ,EAAK,SAAS,EAAU,EAC3B,EAAK,OAWV,CAVA,IAAI,EAAE,WAAW,EAAE,CAAC,IACpB,EAAE,WAAW,EAAE,EACf,EAAU,OAAO,KAAK;GAAE,GAAG,EAAK;GAAG,GAAG,EAAK;GAAG,CAAC,EAC3C,EAAK,UAAU,iBACjB,EAAU,IAAI,EAAK,GACnB,EAAU,IAAI,EAAK,GACnB,EAAU,QAAQ,EAAK,OACvB,EAAU,SAAS,EAAK,SAE1B,IAAI,GACJ,IAAO,EAAE,KAAK,EAAE;GAElB;;;;ACnFJ,SAAS,GAAY,GAAG;CACtB,IAAI,IAAU,EAAE;CAEhB,SAAS,EAAI,GAAG;EACd,IAAI,IAAQ,EAAE,KAAK,EAAE;AACrB,MAAI,OAAO,UAAU,eAAe,KAAK,GAAS,EAAE,CAClD,QAAO,EAAM;AAEf,IAAQ,KAAK;EAEb,IAAI,IAAOC,EACTC,EAAM,EAAE,SAAS,EAAE,EAAE,SAAU,GAAG;AAChC,UAAO,EAAI,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;IAC5B,CACH;AAWD,UARE,MAAS,YACT,KACS,UAGT,IAAO,IAGD,EAAM,OAAO;;AAGvB,GAAU,EAAE,SAAS,EAAE,EAAI;;AAO7B,SAAS,EAAM,GAAG,GAAG;AACnB,QAAO,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC;;;;AC9BzD,SAAS,GAAa,GAAG;CACvB,IAAI,IAAI,IAAI,EAAM,EAAE,UAAU,IAAO,CAAC,EAGlC,IAAQ,EAAE,OAAO,CAAC,IAClB,IAAO,EAAE,WAAW;AACxB,GAAE,QAAQ,GAAO,EAAE,CAAC;AAGpB,MADA,IAAI,GAAM,GACH,GAAU,GAAG,EAAE,GAAG,GAGvB,CAFA,IAAO,GAAiB,GAAG,EAAE,EAC7B,IAAQ,EAAE,QAAQ,EAAK,EAAE,GAAG,EAAM,GAAG,EAAK,GAAG,CAAC,EAAM,GAAG,EAAK,EAC5D,GAAW,GAAG,GAAG,EAAM;AAGzB,QAAO;;AAOT,SAAS,GAAU,GAAG,GAAG;CACvB,SAAS,EAAI,GAAG;AACd,IAAU,EAAE,UAAU,EAAE,EAAE,SAAU,GAAG;GACrC,IAAI,IAAQ,EAAE,GACZ,IAAI,MAAM,IAAQ,EAAE,IAAI;AAC1B,GAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAM,GAAG,EAAE,KAC/B,EAAE,QAAQ,GAAG,EAAE,CAAC,EAChB,EAAE,QAAQ,GAAG,GAAG,EAAE,CAAC,EACnB,EAAI,EAAE;IAER;;AAIJ,QADA,EAAU,EAAE,OAAO,EAAE,EAAI,EAClB,EAAE,WAAW;;AAOtB,SAAS,GAAiB,GAAG,GAAG;AAC9B,QAAOC,GAAQ,EAAE,OAAO,EAAE,SAAU,GAAG;AACrC,MAAI,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,CACnC,QAAO,EAAM,GAAG,EAAE;GAEpB;;AAGJ,SAAS,GAAW,GAAG,GAAG,GAAO;AAC/B,GAAU,EAAE,OAAO,EAAE,SAAU,GAAG;AAChC,IAAE,KAAK,EAAE,CAAC,QAAQ;GAClB;;;;AC5EsBE,EAAW,EAAE,ECAbC,EAAW,EAAE,ECDvC,GAAQ,iBAAiB;AAsBzB,SAAS,GAAQ,GAAG;CAElB,IAAI,IAAU,EAAE,EAEZ,IAAQ,EAAE,EAEV,IAAU,EAAE;CAKhB,SAAS,EAAM,GAAM;AACnB,MAAI,OAAO,UAAU,eAAe,KAAK,GAAO,EAAK,CACnD,OAAM,IAAI,GAAgB;AAG5B,EAAK,OAAO,UAAU,eAAe,KAAK,GAAS,EAAK,KACtD,EAAM,KAAQ,IACd,EAAQ,KAAQ,IAChB,EAAO,EAAE,aAAa,EAAK,EAAE,EAAM,EACnC,OAAO,EAAM,IACb,EAAQ,KAAK,EAAK;;AAMtB,KAFA,EAAO,EAAE,OAAO,EAAE,EAAM,EAEpBC,GAAO,EAAQ,KAAK,EAAE,WAAW,CACnC,OAAM,IAAI,GAAgB;AAG5B,QAAO;;AAMT,SAAS,IAAiB;AAC1B,EAAe,YAAY,gBAAI,OAAO;;;ACjDtC,SAASC,GAAI,GAAG,GAAI,GAAO;AACzB,CAAKC,EAAU,EAAG,KAChB,IAAK,CAAC,EAAG;CAIX,IAAI,KAAc,EAAE,YAAY,GAAG,EAAE,aAAa,EAAE,WAAW,KAAK,EAAE,EAElE,IAAM,EAAE,EAER,IAAU,EAAE;AAQhB,QAPA,EAAO,GAAI,SAAU,GAAG;AACtB,MAAI,CAAC,EAAE,QAAQ,EAAE,CACf,OAAU,MAAM,+BAA+B,EAAE;AAGnD,KAAM,GAAG,GAAG,MAAU,QAAQ,GAAS,GAAY,EAAI;GACvD,EACK;;AAYT,SAAS,GAAM,GAAG,GAAG,GAAW,GAAS,GAAY,GAAK;AACxD,CAAK,OAAO,UAAU,eAAe,KAAK,GAAS,EAAE,KACnD,EAAQ,KAAK,IAER,KACH,EAAI,KAAK,EAAE,EAEb,EAAO,EAAW,EAAE,EAAE,SAAU,GAAG;AACjC,KAAM,GAAG,GAAG,GAAW,GAAS,GAAY,EAAI;GAChD,EACE,KACF,EAAI,KAAK,EAAE;;;;AChCjB,SAASC,GAAU,GAAG,GAAI;AACxB,QAAOC,GAAI,GAAG,GAAI,OAAO;;;;ACE3B,SAAS,GAAS,GAAG,GAAI;AACvB,QAAOC,GAAI,GAAG,GAAI,MAAM;;ACvB1B,EAAe,mBAAmB,IAClC,EAAe,gBAAgB,IAC/B,EAAe,eAAe,IAC9B,EAAe,YAAY,IAC3B,EAAe,YAAY,IAC3B,EAAe,gBAAgB;AAmC/B,SAAS,EAAe,GAAG;AAEzB,CADA,IAAI,GAAS,EAAE,EACf,GAAY,EAAE;CACd,IAAI,IAAI,GAAa,EAAE;AAEvB,CADA,GAAiB,EAAE,EACnB,GAAc,GAAG,EAAE;AAGnB,MADA,IAAI,GAAG,GACC,IAAI,GAAU,EAAE,EAEtB,CADA,IAAI,GAAU,GAAG,GAAG,EAAE,EACtB,GAAc,GAAG,GAAG,GAAG,EAAE;;AAO7B,SAAS,GAAc,GAAG,GAAG;CAC3B,IAAI,IAAKC,GAAc,GAAG,EAAE,OAAO,CAAC;AAEpC,CADA,IAAK,EAAG,MAAM,GAAG,EAAG,SAAS,EAAE,EAC/B,EAAU,GAAI,SAAU,GAAG;AACzB,KAAe,GAAG,GAAG,EAAE;GACvB;;AAGJ,SAAS,GAAe,GAAG,GAAG,GAAO;CAEnC,IAAI,IADW,EAAE,KAAK,EAAM,CACN;AACtB,GAAE,KAAK,GAAO,EAAO,CAAC,WAAW,GAAa,GAAG,GAAG,EAAM;;AAO5D,SAAS,GAAa,GAAG,GAAG,GAAO;CAEjC,IAAI,IADW,EAAE,KAAK,EAAM,CACN,QAElB,IAAc,IAEd,IAAY,EAAE,KAAK,GAAO,EAAO,EAEjC,IAAW;AAyBf,QAvBA,AAEE,OADA,IAAc,IACF,EAAE,KAAK,GAAQ,EAAM,GAGnC,IAAW,EAAU,QAErB,EAAU,EAAE,UAAU,EAAM,EAAE,SAAU,GAAG;EACzC,IAAI,IAAY,EAAE,MAAM,GACtB,IAAQ,IAAY,EAAE,IAAI,EAAE;AAE9B,MAAI,MAAU,GAAQ;GACpB,IAAI,IAAe,MAAc,GAC/B,IAAc,EAAE,KAAK,EAAE,CAAC;AAG1B,OADA,KAAY,IAAe,IAAc,CAAC,GACtC,GAAW,GAAG,GAAO,EAAM,EAAE;IAC/B,IAAI,IAAgB,EAAE,KAAK,GAAO,EAAM,CAAC;AACzC,SAAY,IAAe,CAAC,IAAgB;;;GAGhD,EAEK;;AAGT,SAAS,GAAiB,GAAM,GAAM;AAIpC,CAHI,UAAU,SAAS,MACrB,IAAO,EAAK,OAAO,CAAC,KAEtB,GAAgB,GAAM,EAAE,EAAE,GAAG,EAAK;;AAGpC,SAAS,GAAgB,GAAM,GAAS,GAAS,GAAG,GAAQ;CAC1D,IAAI,IAAM,GACN,IAAQ,EAAK,KAAK,EAAE;AAkBxB,QAhBA,EAAQ,KAAK,IACb,EAAU,EAAK,UAAU,EAAE,EAAE,SAAU,GAAG;AACxC,EAAK,OAAO,UAAU,eAAe,KAAK,GAAS,EAAE,KACnD,IAAU,GAAgB,GAAM,GAAS,GAAS,GAAG,EAAE;GAEzD,EAEF,EAAM,MAAM,GACZ,EAAM,MAAM,KACR,IACF,EAAM,SAAS,IAGf,OAAO,EAAM,QAGR;;AAGT,SAAS,GAAU,GAAM;AACvB,QAAOC,GAAO,EAAK,OAAO,EAAE,SAAU,GAAG;AACvC,SAAO,EAAK,KAAK,EAAE,CAAC,WAAW;GAC/B;;AAGJ,SAAS,GAAU,GAAG,GAAG,GAAM;CAC7B,IAAI,IAAI,EAAK,GACT,IAAI,EAAK;AAKb,CAAK,EAAE,QAAQ,GAAG,EAAE,KAClB,IAAI,EAAK,GACT,IAAI,EAAK;CAGX,IAAI,IAAS,EAAE,KAAK,EAAE,EAClB,IAAS,EAAE,KAAK,EAAE,EAClB,IAAY,GACZ,IAAO;AAgBX,QAZI,EAAO,MAAM,EAAO,QACtB,IAAY,GACZ,IAAO,KAUFE,GAPUD,EAAS,EAAE,OAAO,EAAE,SAAU,GAAM;AACnD,SACE,MAAS,GAAa,GAAG,EAAE,KAAK,EAAK,EAAE,EAAE,EAAU,IACnD,MAAS,GAAa,GAAG,EAAE,KAAK,EAAK,EAAE,EAAE,EAAU;GAErD,EAEyB,SAAU,GAAM;AACzC,SAAO,EAAM,GAAG,EAAK;GACrB;;AAGJ,SAAS,GAAc,GAAG,GAAG,GAAG,GAAG;CACjC,IAAI,IAAI,EAAE,GACN,IAAI,EAAE;AAKV,CAJA,EAAE,WAAW,GAAG,EAAE,EAClB,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EACvB,GAAiB,EAAE,EACnB,GAAc,GAAG,EAAE,EACnB,GAAY,GAAG,EAAE;;AAGnB,SAAS,GAAY,GAAG,GAAG;CAIzB,IAAI,IAAKE,GAAa,GAHXH,GAAO,EAAE,OAAO,EAAE,SAAU,GAAG;AACxC,SAAO,CAAC,EAAE,KAAK,EAAE,CAAC;GAClB,CAC4B;AAE9B,CADA,IAAK,EAAG,MAAM,EAAE,EAChB,EAAU,GAAI,SAAU,GAAG;EACzB,IAAI,IAAS,EAAE,KAAK,EAAE,CAAC,QACrB,IAAO,EAAE,KAAK,GAAG,EAAO,EACxB,IAAU;AAOZ,EALK,MACH,IAAO,EAAE,KAAK,GAAQ,EAAE,EACxB,IAAU,KAGZ,EAAE,KAAK,EAAE,CAAC,OAAO,EAAE,KAAK,EAAO,CAAC,QAAQ,IAAU,EAAK,SAAS,CAAC,EAAK;GACtE;;AAMJ,SAAS,GAAW,GAAM,GAAG,GAAG;AAC9B,QAAO,EAAK,QAAQ,GAAG,EAAE;;AAO3B,SAAS,GAAa,GAAM,GAAQ,GAAW;AAC7C,QAAO,EAAU,OAAO,EAAO,OAAO,EAAO,OAAO,EAAU;;;;ACjNhE,SAAS,GAAK,GAAG;AACf,SAAQ,EAAE,OAAO,CAAC,QAAlB;EACE,KAAK;AACH,MAAqB,EAAE;AACvB;EACF,KAAK;AACH,MAAgB,EAAE;AAClB;EACF,KAAK;AACH,MAAkB,EAAE;AACpB;EACF,QACE,IAAqB,EAAE;;;AAK7B,IAAI,KAAoB;AAExB,SAAS,GAAgB,GAAG;AAE1B,CADA,GAAY,EAAE,EACd,GAAa,EAAE;;AAGjB,SAAS,GAAqB,GAAG;AAC/B,GAAe,EAAE;;;;ACtBnB,SAAS,GAAI,GAAG;CACd,IAAI,IAAOI,EAAkB,GAAG,QAAQ,EAAE,EAAE,QAAQ,EAChD,IAAS,GAAW,EAAE,EACtB,IAASC,EAAMC,EAAS,EAAO,CAAC,GAAG,GACnC,IAAU,IAAI,IAAS;AAK3B,CAHA,EAAE,OAAO,CAAC,cAAc,GAGxB,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;AAChC,IAAE,KAAK,EAAE,CAAC,UAAU;GACpB;CAGF,IAAI,IAAS,GAAW,EAAE,GAAG;AAS7B,CANA,EAAU,EAAE,UAAU,EAAE,SAAU,GAAO;AACvC,KAAI,GAAG,GAAM,GAAS,GAAQ,GAAQ,GAAQ,EAAM;GACpD,EAIF,EAAE,OAAO,CAAC,iBAAiB;;AAG7B,SAAS,GAAI,GAAG,GAAM,GAAS,GAAQ,GAAQ,GAAQ,GAAG;CACxD,IAAI,IAAW,EAAE,SAAS,EAAE;AAC5B,KAAI,CAAC,EAAS,QAAQ;AACpB,EAAI,MAAM,KACR,EAAE,QAAQ,GAAM,GAAG;GAAE,QAAQ;GAAG,QAAQ;GAAS,CAAC;AAEpD;;CAGF,IAAI,IAAMC,GAAmB,GAAG,MAAM,EAClC,IAASA,GAAmB,GAAG,MAAM,EACrC,IAAQ,EAAE,KAAK,EAAE;AA6BrB,CA3BA,EAAE,UAAU,GAAK,EAAE,EACnB,EAAM,YAAY,GAClB,EAAE,UAAU,GAAQ,EAAE,EACtB,EAAM,eAAe,GAErB,EAAU,GAAU,SAAU,GAAO;AACnC,KAAI,GAAG,GAAM,GAAS,GAAQ,GAAQ,GAAQ,EAAM;EAEpD,IAAI,IAAY,EAAE,KAAK,EAAM,EACzB,IAAW,EAAU,YAAY,EAAU,YAAY,GACvD,IAAc,EAAU,eAAe,EAAU,eAAe,GAChE,IAAa,EAAU,YAAY,IAAS,IAAI,GAChD,IAAS,MAAa,IAAkB,IAAS,EAAO,KAAK,IAAzB;AAQxC,EANA,EAAE,QAAQ,GAAK,GAAU;GACvB,QAAQ;GACA;GACR,aAAa;GACd,CAAC,EAEF,EAAE,QAAQ,GAAa,GAAQ;GAC7B,QAAQ;GACA;GACR,aAAa;GACd,CAAC;GACF,EAEG,EAAE,OAAO,EAAE,IACd,EAAE,QAAQ,GAAM,GAAK;EAAE,QAAQ;EAAG,QAAQ,IAAS,EAAO;EAAI,CAAC;;AAInE,SAAS,GAAW,GAAG;CACrB,IAAI,IAAS,EAAE;CACf,SAAS,EAAI,GAAG,GAAO;EACrB,IAAI,IAAW,EAAE,SAAS,EAAE;AAM5B,EALI,KAAY,EAAS,UACvB,EAAU,GAAU,SAAU,GAAO;AACnC,KAAI,GAAO,IAAQ,EAAE;IACrB,EAEJ,EAAO,KAAK;;AAKd,QAHA,EAAU,EAAE,UAAU,EAAE,SAAU,GAAG;AACnC,IAAI,GAAG,EAAE;GACT,EACK;;AAGT,SAAS,GAAW,GAAG;AACrB,QAAOC,EACL,EAAE,OAAO,EACT,SAAU,GAAK,GAAG;AAChB,SAAO,IAAM,EAAE,KAAK,EAAE,CAAC;IAEzB,EACD;;AAGH,SAAS,GAAQ,GAAG;CAClB,IAAI,IAAa,EAAE,OAAO;AAG1B,CAFA,EAAE,WAAW,EAAW,YAAY,EACpC,OAAO,EAAW,aAClB,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;AAEhC,EADW,EAAE,KAAK,EAAE,CACX,eACP,EAAE,WAAW,EAAE;GAEjB;;;;ACnIJ,SAAS,GAAuB,GAAG,GAAI,GAAI;CACzC,IAAI,IAAO,EAAE,EACX;AAEF,GAAU,GAAI,SAAU,GAAG;AAIzB,OAHA,IAAI,IAAQ,EAAE,OAAO,EAAE,EACrB,GACA,GACK,IAAO;AASZ,OARA,IAAS,EAAE,OAAO,EAAM,EACpB,KACF,IAAY,EAAK,IACjB,EAAK,KAAU,MAEf,IAAY,GACZ,IAAW,IAET,KAAa,MAAc,GAAO;AACpC,MAAG,QAAQ,GAAW,EAAM;AAC5B;;AAEF,OAAQ;;GAEV;;;;ACQJ,SAAS,GAAgB,GAAG,GAAM,GAAc;CAC9C,IAAI,IAAO,GAAe,EAAE,EAC1B,IAAS,IAAI,EAAM,EAAE,UAAU,IAAM,CAAC,CACnC,SAAS,EAAQ,SAAM,CAAC,CACxB,oBAAoB,SAAU,GAAG;AAChC,SAAO,EAAE,KAAK,EAAE;GAChB;AA2BN,QAzBA,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE,EAClB,IAAS,EAAE,OAAO,EAAE;AAEtB,GAAI,EAAK,SAAS,KAAS,EAAK,WAAW,KAAQ,KAAQ,EAAK,aAC9D,EAAO,QAAQ,EAAE,EACjB,EAAO,UAAU,GAAG,KAAU,EAAK,EAGnC,EAAU,EAAE,GAAc,EAAE,EAAE,SAAU,GAAG;GACzC,IAAI,IAAI,EAAE,MAAM,IAAI,EAAE,IAAI,EAAE,GAC1B,IAAO,EAAO,KAAK,GAAG,EAAE,EACxB,IAAUC,EAAc,EAAK,GAAiB,IAAd,EAAK;AACvC,KAAO,QAAQ,GAAG,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,SAAS,GAAQ,CAAC;IAC3D,EAEE,OAAO,UAAU,eAAe,KAAK,GAAM,UAAU,IACvD,EAAO,QAAQ,GAAG;GAChB,YAAY,EAAK,WAAW;GAC5B,aAAa,EAAK,YAAY;GAC/B,CAAC;GAGN,EAEK;;AAGT,SAAS,GAAe,GAAG;AAEzB,MADA,IAAI,GACG,EAAE,QAAS,IAAIC,GAAW,QAAQ,CAAE;AAC3C,QAAO;;;;ACtDT,SAAS,GAAW,GAAG,GAAU;AAE/B,MAAK,IADD,IAAK,GACA,IAAI,GAAG,IAAI,EAAS,QAAQ,EAAE,EACrC,MAAM,GAAmB,GAAG,EAAS,IAAI,IAAI,EAAS,GAAG;AAE3D,QAAO;;AAGT,SAAS,GAAmB,GAAG,GAAY,GAAY;AAuBrD,MAnBA,IAAI,IAAWC,GACb,GACAC,EAAM,GAAY,SAAU,GAAG,GAAG;AAChC,SAAO;GACP,CACH,EACG,IAAeC,EACjBD,EAAM,GAAY,SAAU,GAAG;AAC7B,SAAOE,EACLF,EAAM,EAAE,SAAS,EAAE,EAAE,SAAU,GAAG;AAChC,UAAO;IAAE,KAAK,EAAS,EAAE;IAAI,QAAQ,EAAE,KAAK,EAAE,CAAC;IAAQ;IACvD,EACF,MACD;GACD,CACH,EAGG,IAAa,GACV,IAAa,EAAW,QAAQ,OAAe;CACtD,IAAI,IAAW,IAAI,IAAa;AAChC;CACA,IAAI,IAAOA,EAAU,MAAM,EAAS,EAAE,WAAY;AAChD,SAAO;GACP,EAGE,IAAK;AAkBT,QAjBA,EAEE,EAAa,QAAQ,SAAU,GAAO;EACpC,IAAI,IAAQ,EAAM,MAAM;AACxB,IAAK,MAAU,EAAM;AAErB,OADA,IAAI,IAAY,GACT,IAAQ,GAKb,CAJI,IAAQ,MACV,KAAa,EAAK,IAAQ,KAE5B,IAAS,IAAQ,KAAM,GACvB,EAAK,MAAU,EAAM;AAEvB,OAAM,EAAM,SAAS;GACrB,CACH,EAEM;;;;AChET,SAAgB,GAAU,GAAG;CAC3B,IAAI,IAAU,EAAE,EACZ,IAAcG,EAAS,EAAE,OAAO,EAAE,SAAU,GAAG;AACjD,SAAO,CAAC,EAAE,SAAS,EAAE,CAAC;GACtB,EAME,IAASE,EAAMC,EALLF,EACZC,EAAM,GAAa,SAAU,GAAG;AAC9B,SAAO,EAAE,KAAK,EAAE,CAAC;GACjB,CACH,GACoC,EAAE,EAAE,WAAY;AACnD,SAAO,EAAE;GACT;CAEF,SAAS,EAAI,GAAG;AACVE,KAAM,GAAS,EAAE,KACrB,EAAQ,KAAK,IAEb,EADW,EAAE,KAAK,EAAE,CACR,MAAM,KAAK,EAAE,EACzB,EAAU,EAAE,WAAW,EAAE,EAAE,EAAI;;AAQjC,QAFA,EAHgBC,EAAS,GAAa,SAAU,GAAG;AACjD,SAAO,EAAE,KAAK,EAAE,CAAC;GACjB,EACmB,EAAI,EAElB;;;;ACpCT,SAAS,GAAW,GAAG,GAAS;AAC9B,QAAOC,EAAM,GAAS,SAAU,GAAG;EACjC,IAAI,IAAM,EAAE,QAAQ,EAAE;AACtB,MAAK,EAAI,QAEF;GACL,IAAI,IAASC,EACX,GACA,SAAU,GAAK,GAAG;IAChB,IAAI,IAAO,EAAE,KAAK,EAAE,EAClB,IAAQ,EAAE,KAAK,EAAE,EAAE;AACrB,WAAO;KACL,KAAK,EAAI,MAAM,EAAK,SAAS,EAAM;KACnC,QAAQ,EAAI,SAAS,EAAK;KAC3B;MAEH;IAAE,KAAK;IAAG,QAAQ;IAAG,CACtB;AAED,UAAO;IACF;IACH,YAAY,EAAO,MAAM,EAAO;IAChC,QAAQ,EAAO;IAChB;QAnBD,QAAO,EAAK,MAAG;GAqBjB;;;;ACAJ,SAAS,GAAiB,GAAS,GAAI;CACrC,IAAI,IAAgB,EAAE;AA+BtB,QA9BA,EAAU,GAAS,SAAU,GAAO,GAAG;EACrC,IAAI,IAAO,EAAc,EAAM,KAAK;GAClC,UAAU;GACV,IAAI,EAAE;GACN,KAAK,EAAE;GACP,IAAI,CAAC,EAAM,EAAE;GACV;GACJ;AACD,EAAKC,EAAc,EAAM,WAAW,KAElC,EAAI,aAAa,EAAM,YAEvB,EAAI,SAAS,EAAM;GAErB,EAEF,EAAU,EAAG,OAAO,EAAE,SAAU,GAAG;EACjC,IAAI,IAAS,EAAc,EAAE,IACzB,IAAS,EAAc,EAAE;AAC7B,EAAI,CAACA,EAAc,EAAO,IAAI,CAACA,EAAc,EAAO,KAClD,EAAO,YACP,EAAO,IAAI,KAAK,EAAc,EAAE,GAAG;GAErC,EAOK,GALSC,EAAS,GAAe,SAAU,GAAO;AAEvD,SAAO,CAAC,EAAM;GACd,CAEkC;;AAGtC,SAAS,GAAmB,GAAW;CACrC,IAAI,IAAU,EAAE;CAEhB,SAAS,EAAS,GAAQ;AACxB,SAAO,SAAU,GAAQ;AACnB,KAAO,WAITD,EAAc,EAAO,WAAW,IAChCA,EAAc,EAAO,WAAW,IAChC,EAAO,cAAc,EAAO,eAE5B,GAAa,GAAQ,EAAO;;;CAKlC,SAAS,EAAU,GAAQ;AACzB,SAAO,SAAU,GAAQ;AAEvB,GADA,EAAO,GAAM,KAAK,EAAO,EACrB,EAAE,EAAO,aAAa,KACxB,EAAU,KAAK,EAAO;;;AAK5B,QAAO,EAAU,SAAQ;EACvB,IAAI,IAAQ,EAAU,KAAK;AAG3B,EAFA,EAAQ,KAAK,EAAM,EACnB,EAAU,EAAM,GAAM,SAAS,EAAE,EAAS,EAAM,CAAC,EACjD,EAAU,EAAM,KAAK,EAAU,EAAM,CAAC;;AAGxC,QAAOE,EACLD,EAAS,GAAS,SAAU,GAAO;AACjC,SAAO,CAAC,EAAM;GACd,EACF,SAAU,GAAO;AACf,SAAOE,EAAO,GAAO;GAAC;GAAM;GAAK;GAAc;GAAS,CAAC;GAE5D;;AAGH,SAAS,GAAa,GAAQ,GAAQ;CACpC,IAAI,IAAM,GACN,IAAS;AAgBb,CAdI,EAAO,WACT,KAAO,EAAO,aAAa,EAAO,QAClC,KAAU,EAAO,SAGf,EAAO,WACT,KAAO,EAAO,aAAa,EAAO,QAClC,KAAU,EAAO,SAGnB,EAAO,KAAK,EAAO,GAAG,OAAO,EAAO,GAAG,EACvC,EAAO,aAAa,IAAM,GAC1B,EAAO,SAAS,GAChB,EAAO,IAAI,KAAK,IAAI,EAAO,GAAG,EAAO,EAAE,EACvC,EAAO,SAAS;;;;ACzHlB,SAAS,GAAK,GAAS,GAAW;CAChC,IAAI,IAAQC,GAAe,GAAS,SAAU,GAAO;AACnD,SAAO,OAAO,UAAU,eAAe,KAAK,GAAO,aAAa;GAChE,EACE,IAAW,EAAM,KACnB,IAAaC,EAAS,EAAM,KAAK,SAAU,GAAO;AAChD,SAAO,CAAC,EAAM;GACd,EACF,IAAK,EAAE,EACP,IAAM,GACN,IAAS,GACT,IAAU;AAMZ,CAJA,EAAS,KAAK,GAAgB,CAAC,CAAC,EAAU,CAAC,EAE3C,IAAU,GAAkB,GAAI,GAAY,EAAQ,EAEpD,EAAU,GAAU,SAAU,GAAO;AAKnC,EAJA,KAAW,EAAM,GAAG,QACpB,EAAG,KAAK,EAAM,GAAG,EACjB,KAAO,EAAM,aAAa,EAAM,QAChC,KAAU,EAAM,QAChB,IAAU,GAAkB,GAAI,GAAY,EAAQ;GACpD;CAEF,IAAI,IAAS,EAAE,IAAIC,EAAU,EAAG,EAAE;AAKlC,QAJI,MACF,EAAO,aAAa,IAAM,GAC1B,EAAO,SAAS,IAEX;;AAGT,SAAS,GAAkB,GAAI,GAAY,GAAO;AAEhD,MADA,IAAIC,GACG,EAAW,WAAW,IAAOC,EAAO,EAAW,EAAE,KAAK,GAG3D,CAFA,EAAW,KAAK,EAChB,EAAG,KAAKD,EAAK,GAAG,EAChB;AAEF,QAAO;;AAGT,SAAS,GAAgB,GAAM;AAC7B,QAAO,SAAU,GAAQ,GAAQ;AAO/B,SANI,EAAO,aAAa,EAAO,aACtB,KACE,EAAO,aAAa,EAAO,aAC7B,IAGD,IAA6B,EAAO,IAAI,EAAO,IAAxC,EAAO,IAAI,EAAO;;;;;ACjDrC,SAAS,GAAa,GAAG,GAAG,GAAI,GAAW;CACzC,IAAI,IAAU,EAAE,SAAS,EAAE,EACvB,IAAO,EAAE,KAAK,EAAE,EAChB,IAAK,IAAO,EAAK,aAAa,KAAA,GAC9B,IAAK,IAAO,EAAK,cAAc,KAAA,GAC/B,IAAY,EAAE;AAElB,CAAI,MACF,IAAUE,EAAS,GAAS,SAAU,GAAG;AACvC,SAAO,MAAM,KAAM,MAAM;GACzB;CAGJ,IAAI,IAAc,GAAW,GAAG,EAAQ;AACxC,GAAU,GAAa,SAAU,GAAO;AACtC,MAAI,EAAE,SAAS,EAAM,EAAE,CAAC,QAAQ;GAC9B,IAAI,IAAiB,GAAa,GAAG,EAAM,GAAG,GAAI,EAAU;AAE5D,GADA,EAAU,EAAM,KAAK,GACjB,OAAO,UAAU,eAAe,KAAK,GAAgB,aAAa,IACpE,GAAiB,GAAO,EAAe;;GAG3C;CAEF,IAAI,IAAU,GAAiB,GAAa,EAAG;AAC/C,IAAgB,GAAS,EAAU;CAEnC,IAAI,IAAS,GAAK,GAAS,EAAU;AAErC,KAAI,MACF,EAAO,KAAKC,EAAU;EAAC;EAAI,EAAO;EAAI;EAAG,CAAC,EACtC,EAAE,aAAa,EAAG,CAAC,SAAQ;EAC7B,IAAI,IAAS,EAAE,KAAK,EAAE,aAAa,EAAG,CAAC,GAAG,EACxC,IAAS,EAAE,KAAK,EAAE,aAAa,EAAG,CAAC,GAAG;AAOxC,EANK,OAAO,UAAU,eAAe,KAAK,GAAQ,aAAa,KAC7D,EAAO,aAAa,GACpB,EAAO,SAAS,IAElB,EAAO,cACJ,EAAO,aAAa,EAAO,SAAS,EAAO,QAAQ,EAAO,UAAU,EAAO,SAAS,IACvF,EAAO,UAAU;;AAIrB,QAAO;;AAGT,SAAS,GAAgB,GAAS,GAAW;AAC3C,GAAU,GAAS,SAAU,GAAO;AAClC,IAAM,KAAKA,EACT,EAAM,GAAG,IAAI,SAAU,GAAG;AAIxB,UAHI,EAAU,KACL,EAAU,GAAG,KAEf;IACP,CACH;GACD;;AAGJ,SAAS,GAAiB,GAAQ,GAAO;AACvC,CAAKC,EAAc,EAAO,WAAW,IAMnC,EAAO,aAAa,EAAM,YAC1B,EAAO,SAAS,EAAM,WANtB,EAAO,cACJ,EAAO,aAAa,EAAO,SAAS,EAAM,aAAa,EAAM,WAC7D,EAAO,SAAS,EAAM,SACzB,EAAO,UAAU,EAAM;;;;AC9C3B,SAAS,GAAM,GAAG;CAChB,IAAIC,IAAUC,GAAa,EAAE,EAC3B,IAAkB,GAAiB,GAAGC,EAAQ,GAAGF,IAAU,EAAE,EAAE,UAAU,EACzE,IAAgB,GAAiB,GAAGE,EAAQF,IAAU,GAAG,IAAI,GAAG,EAAE,WAAW,EAE3E,IAAW,GAAU,EAAE;AAC3B,IAAY,GAAG,EAAS;AAKxB,MAAK,IAHD,IAAS,UACX,GAEO,IAAI,GAAG,IAAW,GAAG,IAAW,GAAG,EAAE,GAAG,EAAE,GAAU;AAG3D,EAFA,GAAiB,IAAI,IAAI,IAAkB,GAAe,IAAI,KAAK,EAAE,EAErE,IAAWG,EAAsB,EAAE;EACnC,IAAI,IAAK,GAAW,GAAG,EAAS;AAChC,EAAI,IAAK,MACP,IAAW,GACX,IAAOC,GAAY,EAAS,EAC5B,IAAS;;AAIb,IAAY,GAAG,EAAK;;AAGtB,SAAS,GAAiB,GAAG,GAAO,GAAc;AAChD,QAAOC,EAAM,GAAO,SAAU,GAAM;AAClC,SAAO,GAAgB,GAAG,GAAM,EAAa;GAC7C;;AAGJ,SAAS,GAAiB,GAAa,GAAW;CAChD,IAAI,IAAK,IAAI,GAAO;AACpB,GAAU,GAAa,SAAU,GAAI;EACnC,IAAI,IAAO,EAAG,OAAO,CAAC,MAClB,IAAS,GAAa,GAAI,GAAM,GAAI,EAAU;AAIlD,EAHA,EAAU,EAAO,IAAI,SAAU,GAAG,GAAG;AACnC,KAAG,KAAK,EAAE,CAAC,QAAQ;IACnB,EACF,GAAuB,GAAI,GAAI,EAAO,GAAG;GACzC;;AAGJ,SAAS,GAAY,GAAG,GAAU;AAChC,GAAU,GAAU,SAAU,GAAO;AACnC,IAAU,GAAO,SAAU,GAAG,GAAG;AAC/B,KAAE,KAAK,EAAE,CAAC,QAAQ;IAClB;GACF;;;;ACvEJ,SAAS,GAAkB,GAAG;CAC5B,IAAI,IAAgB,GAAU,EAAE;AAEhC,GAAU,EAAE,OAAO,CAAC,aAAa,SAAU,GAAG;AAU5C,OATA,IAAI,IAAO,EAAE,KAAK,EAAE,EAChB,IAAU,EAAK,SACf,IAAW,GAAS,GAAG,GAAe,EAAQ,GAAG,EAAQ,EAAE,EAC3D,IAAO,EAAS,MAChB,IAAM,EAAS,KACf,IAAU,GACV,IAAQ,EAAK,IACb,IAAY,IAET,MAAM,EAAQ,IAAG;AAGtB,OAFA,IAAO,EAAE,KAAK,EAAE,EAEZ,GAAW;AACb,YAAQ,IAAQ,EAAK,QAAc,KAAO,EAAE,KAAK,EAAM,CAAC,UAAU,EAAK,MACrE;AAGF,IAAI,MAAU,MACZ,IAAY;;AAIhB,OAAI,CAAC,GAAW;AACd,WACE,IAAU,EAAK,SAAS,KACxB,EAAE,KAAM,IAAQ,EAAK,IAAU,GAAI,CAAC,WAAW,EAAK,MAEpD;AAEF,QAAQ,EAAK;;AAIf,GADA,EAAE,UAAU,GAAG,EAAM,EACrB,IAAI,EAAE,WAAW,EAAE,CAAC;;GAEtB;;AAKJ,SAAS,GAAS,GAAG,GAAe,GAAG,GAAG;CACxC,IAAI,IAAQ,EAAE,EACV,IAAQ,EAAE,EACV,IAAM,KAAK,IAAI,EAAc,GAAG,KAAK,EAAc,GAAG,IAAI,EAC1D,IAAM,KAAK,IAAI,EAAc,GAAG,KAAK,EAAc,GAAG,IAAI,EAC1D,IAIK,GAHL;AAIJ;AAEE,EADA,IAAS,EAAE,OAAO,EAAO,EACzB,EAAM,KAAK,EAAO;QACX,MAAW,EAAc,GAAQ,MAAM,KAAO,IAAM,EAAc,GAAQ;AAKnF,MAJA,IAAM,GAGN,IAAS,IACD,IAAS,EAAE,OAAO,EAAO,MAAM,GACrC,GAAM,KAAK,EAAO;AAGpB,QAAO;EAAE,MAAM,EAAM,OAAO,EAAM,SAAS,CAAC;EAAO;EAAK;;AAG1D,SAAS,GAAU,GAAG;CACpB,IAAI,IAAS,EAAE,EACX,IAAM;CAEV,SAAS,EAAI,GAAG;EACd,IAAI,IAAM;AAEV,EADA,EAAU,EAAE,SAAS,EAAE,EAAE,EAAI,EAC7B,EAAO,KAAK;GAAO;GAAK,KAAK;GAAO;;AAItC,QAFA,EAAU,EAAE,UAAU,EAAE,EAAI,EAErB;;;;AC7CT,SAAS,GAAmB,GAAG,GAAU;CAEvC,IAAI,IAAY,EAAE;CAElB,SAAS,EAAW,GAAW,GAAO;EACpC,IAEE,IAAK,GAGL,IAAU,GACV,IAAkB,EAAU,QAC5B,IAAWC,EAAO,EAAM;AAsB1B,SApBA,EAAU,GAAO,SAAU,GAAG,GAAG;GAC/B,IAAI,IAAI,GAA0B,GAAG,EAAE,EACrC,IAAK,IAAI,EAAE,KAAK,EAAE,CAAC,QAAQ;AAE7B,IAAI,KAAK,MAAM,OACb,EAAU,EAAM,MAAM,GAAS,IAAI,EAAE,EAAE,SAAU,GAAU;AACzD,MAAU,EAAE,aAAa,EAAS,EAAE,SAAU,GAAG;KAC/C,IAAI,IAAS,EAAE,KAAK,EAAE,EACpB,IAAO,EAAO;AAChB,MAAK,IAAO,KAAM,IAAK,MAAS,EAAE,EAAO,SAAS,EAAE,KAAK,EAAS,CAAC,UACjE,GAAY,GAAW,GAAG,EAAS;MAErC;KACF,EAEF,IAAU,IAAI,GACd,IAAK;IAEP,EAEK;;AAIT,QADA,EAAS,GAAU,EAAW,EACvB;;AAGT,SAAS,GAAmB,GAAG,GAAU;CAEvC,IAAI,IAAY,EAAE;CAElB,SAAS,EAAK,GAAO,GAAU,GAAU,GAAiB,GAAiB;EACzE,IAAI;AACJ,IAAUC,EAAQ,GAAU,EAAS,EAAE,SAAU,GAAG;AAElD,GADA,IAAI,EAAM,IACN,EAAE,KAAK,EAAE,CAAC,SACZ,EAAU,EAAE,aAAa,EAAE,EAAE,SAAU,GAAG;IACxC,IAAI,IAAQ,EAAE,KAAK,EAAE;AACrB,IAAI,EAAM,UAAU,EAAM,QAAQ,KAAmB,EAAM,QAAQ,MACjE,GAAY,GAAW,GAAG,EAAE;KAE9B;IAEJ;;CAGJ,SAAS,EAAW,GAAO,GAAO;EAChC,IAAI,IAAe,IACjB,GACA,IAAW;AAgBb,SAdA,EAAU,GAAO,SAAU,GAAG,GAAgB;AAC5C,OAAI,EAAE,KAAK,EAAE,CAAC,UAAU,UAAU;IAChC,IAAI,IAAe,EAAE,aAAa,EAAE;AACpC,IAAI,EAAa,WACf,IAAe,EAAE,KAAK,EAAa,GAAG,CAAC,OACvC,EAAK,GAAO,GAAU,GAAgB,GAAc,EAAa,EAEjE,IAAW,GACX,IAAe;;AAGnB,KAAK,GAAO,GAAU,EAAM,QAAQ,GAAc,EAAM,OAAO;IAC/D,EAEK;;AAIT,QADA,EAAS,GAAU,EAAW,EACvB;;AAGT,SAAS,GAA0B,GAAG,GAAG;AACvC,KAAI,EAAE,KAAK,EAAE,CAAC,MACZ,QAAOC,GAAO,EAAE,aAAa,EAAE,EAAE,SAAU,GAAG;AAC5C,SAAO,EAAE,KAAK,EAAE,CAAC;GACjB;;AAWN,SAAS,GAAY,GAAW,GAAG,GAAG;AACpC,KAAI,IAAI,GAAG;EACT,IAAI,IAAM;AAEV,EADA,IAAI,GACJ,IAAI;;AAGN,CAAK,OAAO,UAAU,eAAe,KAAK,GAAW,EAAE,IAErD,OAAO,eAAe,GAAW,GAAG;EAClC,YAAY;EACZ,cAAc;EACd,OAAO,EAAE;EACT,UAAU;EACX,CAAC;CAEJ,IAAI,IAAa,EAAU;AAC3B,QAAO,eAAe,GAAY,GAAG;EACnC,YAAY;EACZ,cAAc;EACd,OAAO;EACP,UAAU;EACX,CAAC;;AAGJ,SAAS,GAAY,GAAW,GAAG,GAAG;AACpC,KAAI,IAAI,GAAG;EACT,IAAI,IAAM;AAEV,EADA,IAAI,GACJ,IAAI;;AAEN,QAAO,CAAC,CAAC,EAAU,MAAM,OAAO,UAAU,eAAe,KAAK,EAAU,IAAI,EAAE;;AAWhF,SAAS,GAAkB,GAAG,GAAU,GAAW,GAAY;CAC7D,IAAI,IAAO,EAAE,EACX,IAAQ,EAAE,EACV,IAAM,EAAE;AAkCV,QA7BA,EAAU,GAAU,SAAU,GAAO;AACnC,IAAU,GAAO,SAAU,GAAG,GAAO;AAGnC,GAFA,EAAK,KAAK,GACV,EAAM,KAAK,GACX,EAAI,KAAK;IACT;GACF,EAEF,EAAU,GAAU,SAAU,GAAO;EACnC,IAAI,IAAU;AACd,IAAU,GAAO,SAAU,GAAG;GAC5B,IAAI,IAAK,EAAW,EAAE;AACtB,OAAI,EAAG,QAAQ;AACb,QAAKC,EAAS,GAAI,SAAU,GAAG;AAC7B,YAAO,EAAI;MACX;AAEF,SAAK,IADD,KAAM,EAAG,SAAS,KAAK,GAClB,IAAI,KAAK,MAAM,EAAG,EAAE,IAAK,KAAK,KAAK,EAAG,EAAE,KAAK,GAAI,EAAE,GAAG;KAC7D,IAAI,IAAI,EAAG;AACX,KAAI,EAAM,OAAO,KAAK,IAAU,EAAI,MAAM,CAAC,GAAY,GAAW,GAAG,EAAE,KACrE,EAAM,KAAK,GACX,EAAM,KAAK,EAAK,KAAK,EAAK,IAC1B,IAAU,EAAI;;;IAIpB;GACF,EAEK;EAAQ;EAAa;EAAO;;AAGrC,SAAS,GAAqB,GAAG,GAAU,GAAM,GAAO,GAAY;CAOlE,IAAI,IAAK,EAAE,EACT,IAAS,GAAgB,GAAG,GAAU,GAAM,EAAW,EACvD,IAAa,IAAa,eAAe;CAE3C,SAAS,EAAQ,GAAW,GAAe;AAIzC,OAHA,IAAI,IAAQ,EAAO,OAAO,EACtB,IAAO,EAAM,KAAK,EAClB,IAAU,EAAE,EACT,GASL,CARI,EAAQ,KACV,EAAU,EAAK,IAEf,EAAQ,KAAQ,IAChB,EAAM,KAAK,EAAK,EAChB,IAAQ,EAAM,OAAO,EAAc,EAAK,CAAC,GAG3C,IAAO,EAAM,KAAK;;CAKtB,SAAS,EAAM,GAAM;AACnB,IAAG,KAAQ,EAAO,QAAQ,EAAK,CAAC,OAAO,SAAU,GAAK,GAAG;AACvD,UAAO,KAAK,IAAI,GAAK,EAAG,EAAE,KAAK,EAAO,KAAK,EAAE,CAAC;KAC7C,EAAE;;CAIP,SAAS,EAAM,GAAM;EACnB,IAAI,IAAM,EAAO,SAAS,EAAK,CAAC,OAAO,SAAU,GAAK,GAAG;AACvD,UAAO,KAAK,IAAI,GAAK,EAAG,EAAE,KAAK,EAAO,KAAK,EAAE,CAAC;KAC7C,SAAyB,EAExB,IAAO,EAAE,KAAK,EAAK;AACvB,EAAI,MAAQ,YAA4B,EAAK,eAAe,MAC1D,EAAG,KAAQ,KAAK,IAAI,EAAG,IAAO,EAAI;;AAYtC,QARA,EAAQ,GAAO,EAAO,aAAa,KAAK,EAAO,CAAC,EAChD,EAAQ,GAAO,EAAO,WAAW,KAAK,EAAO,CAAC,EAG9C,EAAU,GAAO,SAAU,GAAG;AAC5B,IAAG,KAAK,EAAG,EAAK;GAChB,EAEK;;AAGT,SAAS,GAAgB,GAAG,GAAU,GAAM,GAAY;CACtD,IAAI,IAAa,IAAI,GAAO,EAC1B,IAAa,EAAE,OAAO,EACtB,IAAQ,GAAI,EAAW,SAAS,EAAW,SAAS,EAAW;AAgBjE,QAdA,EAAU,GAAU,SAAU,GAAO;EACnC,IAAI;AACJ,IAAU,GAAO,SAAU,GAAG;GAC5B,IAAI,IAAQ,EAAK;AAEjB,OADA,EAAW,QAAQ,EAAM,EACrB,GAAG;IACL,IAAI,IAAQ,EAAK,IACf,IAAU,EAAW,KAAK,GAAO,EAAM;AACzC,MAAW,QAAQ,GAAO,GAAO,KAAK,IAAI,EAAM,GAAG,GAAG,EAAE,EAAE,KAAW,EAAE,CAAC;;AAE1E,OAAI;IACJ;GACF,EAEK;;AAMT,SAAS,GAA2B,GAAG,GAAK;AAC1C,QAAOC,GAAQC,EAAS,EAAI,EAAE,SAAU,GAAI;EAC1C,IAAI,IAAM,WACN,IAAM;AASV,SAPA,GAAQ,GAAI,SAAU,GAAG,GAAG;GAC1B,IAAI,IAAY,GAAM,GAAG,EAAE,GAAG;AAG9B,GADA,IAAM,KAAK,IAAI,IAAI,GAAW,EAAI,EAClC,IAAM,KAAK,IAAI,IAAI,GAAW,EAAI;IAClC,EAEK,IAAM;GACb;;AAUJ,SAAS,GAAiB,GAAK,GAAS;CACtC,IAAI,IAAcA,EAAS,EAAQ,EACjC,IAAaC,EAAM,EAAY,EAC/B,IAAaC,EAAM,EAAY;AAEjC,GAAU,CAAC,KAAK,IAAI,EAAE,SAAU,GAAM;AACpC,IAAU,CAAC,KAAK,IAAI,EAAE,SAAU,GAAO;GACrC,IAAI,IAAY,IAAO,GACrB,IAAK,EAAI,IACT;AACE,aAAO,GAEX;QAAI,IAASF,EAAS,EAAG;AAGzB,IAFA,IAAQ,MAAU,MAAM,IAAaC,EAAM,EAAO,GAAG,IAAaC,EAAM,EAAO,EAE3E,MACF,EAAI,KAAaC,EAAY,GAAI,SAAU,GAAG;AAC5C,YAAO,IAAI;MACX;;IAEJ;GACF;;AAGJ,SAAS,GAAQ,GAAK,GAAO;AAC3B,QAAOA,EAAY,EAAI,IAAI,SAAU,GAAQ,GAAG;AAC9C,MAAI,EACF,QAAO,EAAI,EAAM,aAAa,EAAE;EAEhC,IAAI,IAAKL,EAASM,EAAM,GAAK,EAAE,CAAC;AAChC,UAAQ,EAAG,KAAK,EAAG,MAAM;GAE3B;;AAGJ,SAAS,GAAU,GAAG;CACpB,IAAI,IAAWC,EAAsB,EAAE,EACnC,IAAYC,GAAQ,GAAmB,GAAG,EAAS,EAAE,GAAmB,GAAG,EAAS,CAAC,EAErF,IAAM,EAAE,EACR;AAwBJ,QAvBA,EAAU,CAAC,KAAK,IAAI,EAAE,SAAU,GAAM;AAEpC,EADA,IAAmB,MAAS,MAAM,IAAWN,EAAS,EAAS,CAAC,SAAS,EACzE,EAAU,CAAC,KAAK,IAAI,EAAE,SAAU,GAAO;AACrC,GAAI,MAAU,QACZ,IAAmBI,EAAM,GAAkB,SAAU,GAAO;AAC1D,WAAOJ,EAAS,EAAM,CAAC,SAAS;KAChC;GAGJ,IAAI,KAAc,MAAS,MAAM,EAAE,eAAe,EAAE,YAAY,KAAK,EAAE,EACnE,IAAQ,GAAkB,GAAG,GAAkB,GAAW,EAAW,EACrE,IAAK,GAAqB,GAAG,GAAkB,EAAM,MAAM,EAAM,OAAO,MAAU,IAAI;AAM1F,GALI,MAAU,QACZ,IAAKG,EAAY,GAAI,SAAU,GAAG;AAChC,WAAO,CAAC;KACR,GAEJ,EAAI,IAAO,KAAS;IACpB;GACF,EAGF,GAAiB,GADG,GAA2B,GAAG,EAAI,CAClB,EAC7B,GAAQ,GAAK,EAAE,OAAO,CAAC,MAAM;;AAGtC,SAAS,GAAI,GAAS,GAAS,GAAY;AACzC,QAAO,SAAU,GAAG,GAAG,GAAG;EACxB,IAAI,IAAS,EAAE,KAAK,EAAE,EAClB,IAAS,EAAE,KAAK,EAAE,EAClB,IAAM,GACN;AAGJ,MADA,KAAO,EAAO,QAAQ,GAClB,OAAO,UAAU,eAAe,KAAK,GAAQ,WAAW,CAC1D,SAAQ,EAAO,SAAS,aAAa,EAArC;GACE,KAAK;AACH,QAAQ,CAAC,EAAO,QAAQ;AACxB;GACF,KAAK;AACH,QAAQ,EAAO,QAAQ;AACvB;;AAYN,MATI,MACF,KAAO,IAAa,IAAQ,CAAC,IAE/B,IAAQ,GAER,MAAQ,EAAO,QAAQ,IAAU,KAAW,GAC5C,MAAQ,EAAO,QAAQ,IAAU,KAAW,GAE5C,KAAO,EAAO,QAAQ,GAClB,OAAO,UAAU,eAAe,KAAK,GAAQ,WAAW,CAC1D,SAAQ,EAAO,SAAS,aAAa,EAArC;GACE,KAAK;AACH,QAAQ,EAAO,QAAQ;AACvB;GACF,KAAK;AACH,QAAQ,CAAC,EAAO,QAAQ;AACxB;;AAQN,SALI,MACF,KAAO,IAAa,IAAQ,CAAC,IAE/B,IAAQ,GAED;;;AAIX,SAAS,GAAM,GAAG,GAAG;AACnB,QAAO,EAAE,KAAK,EAAE,CAAC;;;;ACpbnB,SAAS,GAAS,GAAG;AAInB,CAHA,IAAII,GAAwB,EAAE,EAE9B,GAAU,EAAE,EACZ,GAAS,GAAU,EAAE,EAAE,SAAU,GAAG,GAAG;AACrC,IAAE,KAAK,EAAE,CAAC,IAAI;GACd;;AAGJ,SAAS,GAAU,GAAG;CACpB,IAAI,IAAWC,EAAsB,EAAE,EACnC,IAAU,EAAE,OAAO,CAAC,SACpB,IAAQ;AACZ,GAAU,GAAU,SAAU,GAAO;EACnC,IAAI,IAAYC,EACdC,EAAM,GAAO,SAAU,GAAG;AACxB,UAAO,EAAE,KAAK,EAAE,CAAC;IACjB,CACH;AAID,EAHA,EAAU,GAAO,SAAU,GAAG;AAC5B,KAAE,KAAK,EAAE,CAAC,IAAI,IAAQ,IAAY;IAClC,EACF,KAAS,IAAY;GACrB;;;;ACdJ,SAAS,GAAO,GAAG,GAAM;CACvB,IAAIC,IAAO,KAAQ,EAAK,cAAcC,KAAYC;AAClD,GAAK,gBAAgB;EACnB,IAAI,IAAcF,EAAK,4BAA4B,GAAiB,EAAE,CAAC;AAEvE,EADA,EAAK,qBAAqB,GAAU,GAAaA,EAAK,CAAC,EACvD,EAAK,4BAA4B,GAAiB,GAAG,EAAY,CAAC;GAClE;;AAGJ,SAAS,GAAU,GAAG,GAAM;AA2B1B,CA1BA,EAAK,oCAAoC,GAAuB,EAAE,CAAC,EACnE,EAAK,6BAA6B,GAAgB,EAAE,CAAC,EACrD,EAAK,qBAAqBG,GAAY,EAAE,CAAC,EACzC,EAAK,8BAA8BC,GAAiB,EAAE,CAAC,EACvD,EAAK,kBAAkB,GAAKC,GAAwB,EAAE,CAAC,CAAC,EACxD,EAAK,oCAAoC,GAAuB,EAAE,CAAC,EACnE,EAAK,8BAA8BC,GAAsB,EAAE,CAAC,EAC5D,EAAK,kCAAkCC,GAAqB,EAAE,CAAC,EAC/D,EAAK,4BAA4BC,GAAoB,EAAE,CAAC,EACxD,EAAK,8BAA8B,GAAiB,EAAE,CAAC,EACvD,EAAK,oCAAoC,GAAuB,EAAE,CAAC,EACnE,EAAK,2BAA2BC,GAAc,EAAE,CAAC,EACjD,EAAK,+BAA+B,GAAkB,EAAE,CAAC,EACzD,EAAK,+BAA+B,GAAkB,EAAE,CAAC,EACzD,EAAK,mBAAmB,GAAM,EAAE,CAAC,EACjC,EAAK,6BAA6B,GAAgB,EAAE,CAAC,EACrD,EAAK,oCAAoCC,GAAwB,EAAE,CAAC,EACpE,EAAK,sBAAsB,GAAS,EAAE,CAAC,EACvC,EAAK,+BAA+B,GAAkB,EAAE,CAAC,EACzD,EAAK,+BAA+B,GAAkB,EAAE,CAAC,EACzD,EAAK,4BAA4BC,GAAe,EAAE,CAAC,EACnD,EAAK,kCAAkC,GAAqB,EAAE,CAAC,EAC/D,EAAK,kCAAkCC,GAAsB,EAAE,CAAC,EAChE,EAAK,4BAA4B,GAAe,EAAE,CAAC,EACnD,EAAK,kCAAkC,GAAqB,EAAE,CAAC,EAC/D,EAAK,2BAA2B,GAA8B,EAAE,CAAC,EACjE,EAAK,0BAA0BC,GAAa,EAAE,CAAC;;AASjD,SAAS,GAAiB,GAAY,GAAa;AA4BjD,CA3BA,EAAU,EAAW,OAAO,EAAE,SAAU,GAAG;EACzC,IAAI,IAAa,EAAW,KAAK,EAAE,EAC/B,IAAc,EAAY,KAAK,EAAE;AAErC,EAAI,MACF,EAAW,IAAI,EAAY,GAC3B,EAAW,IAAI,EAAY,GAEvB,EAAY,SAAS,EAAE,CAAC,WAC1B,EAAW,QAAQ,EAAY,OAC/B,EAAW,SAAS,EAAY;GAGpC,EAEF,EAAU,EAAW,OAAO,EAAE,SAAU,GAAG;EACzC,IAAI,IAAa,EAAW,KAAK,EAAE,EAC/B,IAAc,EAAY,KAAK,EAAE;AAGrC,EADA,EAAW,SAAS,EAAY,QAC5B,OAAO,UAAU,eAAe,KAAK,GAAa,IAAI,KACxD,EAAW,IAAI,EAAY,GAC3B,EAAW,IAAI,EAAY;GAE7B,EAEF,EAAW,OAAO,CAAC,QAAQ,EAAY,OAAO,CAAC,OAC/C,EAAW,OAAO,CAAC,SAAS,EAAY,OAAO,CAAC;;AAGlD,IAAI,KAAgB;CAAC;CAAW;CAAW;CAAW;CAAW;CAAU,EACvE,KAAgB;CAAE,SAAS;CAAI,SAAS;CAAI,SAAS;CAAI,SAAS;CAAM,EACxE,KAAa;CAAC;CAAa;CAAU;CAAW;CAAQ,EACxD,KAAe,CAAC,SAAS,SAAS,EAClC,KAAe;CAAE,OAAO;CAAG,QAAQ;CAAG,EACtC,KAAe;CAAC;CAAU;CAAU;CAAS;CAAU;CAAc,EACrE,KAAe;CACjB,QAAQ;CACR,QAAQ;CACR,OAAO;CACP,QAAQ;CACR,aAAa;CACb,UAAU;CACX,EACG,KAAY,CAAC,WAAW;AAQ5B,SAAS,GAAiB,GAAY;CACpC,IAAI,IAAI,IAAI,EAAM;EAAE,YAAY;EAAM,UAAU;EAAM,CAAC,EACnD,IAAQ,GAAa,EAAW,OAAO,CAAC;AAoB5C,QAlBA,EAAE,SACAC,GAAQ,EAAE,EAAE,IAAe,GAAkB,GAAO,GAAc,EAAEC,EAAO,GAAO,GAAW,CAAC,CAC/F,EAED,EAAU,EAAW,OAAO,EAAE,SAAU,GAAG;EACzC,IAAI,IAAO,GAAa,EAAW,KAAK,EAAE,CAAC;AAE3C,EADA,EAAE,QAAQ,GAAGC,GAAW,GAAkB,GAAM,GAAa,EAAE,GAAa,CAAC,EAC7E,EAAE,UAAU,GAAG,EAAW,OAAO,EAAE,CAAC;GACpC,EAEF,EAAU,EAAW,OAAO,EAAE,SAAU,GAAG;EACzC,IAAI,IAAO,GAAa,EAAW,KAAK,EAAE,CAAC;AAC3C,IAAE,QACA,GACAF,GAAQ,EAAE,EAAE,IAAc,GAAkB,GAAM,GAAa,EAAEC,EAAO,GAAM,GAAU,CAAC,CAC1F;GACD,EAEK;;AAWT,SAAS,GAAuB,GAAG;CACjC,IAAI,IAAQ,EAAE,OAAO;AAErB,CADA,EAAM,WAAW,GACjB,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE;AAEpB,EADA,EAAK,UAAU,GACX,EAAK,SAAS,aAAa,KAAK,QAC9B,EAAM,YAAY,QAAQ,EAAM,YAAY,OAC9C,EAAK,SAAS,EAAK,cAEnB,EAAK,UAAU,EAAK;GAGxB;;AASJ,SAAS,GAAuB,GAAG;AACjC,GAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,MAAI,EAAK,SAAS,EAAK,QAAQ;GAC7B,IAAI,IAAI,EAAE,KAAK,EAAE,EAAE;AAGnB,KAAkB,GAAG,cADT;IAAE,OADN,EAAE,KAAK,EAAE,EAAE,CACI,OAAO,EAAE,QAAQ,IAAI,EAAE;IAAS;IAAG,EAChB,MAAM;;GAElD;;AAGJ,SAAS,GAAiB,GAAG;CAC3B,IAAI,IAAU;AAUd,CATA,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,EAAI,EAAK,cACP,EAAK,UAAU,EAAE,KAAK,EAAK,UAAU,CAAC,MACtC,EAAK,UAAU,EAAE,KAAK,EAAK,aAAa,CAAC,MAEzC,IAAUE,EAAM,GAAS,EAAK,QAAQ;GAExC,EACF,EAAE,OAAO,CAAC,UAAU;;AAGtB,SAAS,GAAuB,GAAG;AACjC,GAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,EAAI,EAAK,UAAU,iBACjB,EAAE,KAAK,EAAK,EAAE,CAAC,YAAY,EAAK,MAChC,EAAE,WAAW,EAAE;GAEjB;;AAGJ,SAAS,GAAe,GAAG;CACzB,IAAI,IAAO,UACP,IAAO,GACP,IAAO,UACP,IAAO,GACP,IAAa,EAAE,OAAO,EACtB,IAAU,EAAW,WAAW,GAChC,IAAU,EAAW,WAAW;CAEpC,SAAS,EAAY,GAAO;EAC1B,IAAI,IAAI,EAAM,GACV,IAAI,EAAM,GACV,IAAI,EAAM,OACV,IAAI,EAAM;AAId,EAHA,IAAO,KAAK,IAAI,GAAM,IAAI,IAAI,EAAE,EAChC,IAAO,KAAK,IAAI,GAAM,IAAI,IAAI,EAAE,EAChC,IAAO,KAAK,IAAI,GAAM,IAAI,IAAI,EAAE,EAChC,IAAO,KAAK,IAAI,GAAM,IAAI,IAAI,EAAE;;AAqClC,CAlCA,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;AAChC,IAAY,EAAE,KAAK,EAAE,CAAC;GACtB,EACF,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,EAAI,OAAO,UAAU,eAAe,KAAK,GAAM,IAAI,IACjD,EAAY,EAAK;GAEnB,EAEF,KAAQ,GACR,KAAQ,GAER,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE;AAEpB,EADA,EAAK,KAAK,GACV,EAAK,KAAK;GACV,EAEF,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE;AAQpB,EAPA,EAAU,EAAK,QAAQ,SAAU,GAAG;AAElC,GADA,EAAE,KAAK,GACP,EAAE,KAAK;IACP,EACE,OAAO,UAAU,eAAe,KAAK,GAAM,IAAI,KACjD,EAAK,KAAK,IAER,OAAO,UAAU,eAAe,KAAK,GAAM,IAAI,KACjD,EAAK,KAAK;GAEZ,EAEF,EAAW,QAAQ,IAAO,IAAO,GACjC,EAAW,SAAS,IAAO,IAAO;;AAGpC,SAAS,GAAqB,GAAG;AAC/B,GAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE,EAChB,IAAQ,EAAE,KAAK,EAAE,EAAE,EACnB,IAAQ,EAAE,KAAK,EAAE,EAAE,EACnB,GAAI;AAUR,EATK,EAAK,UAKR,IAAK,EAAK,OAAO,IACjB,IAAK,EAAK,OAAO,EAAK,OAAO,SAAS,OALtC,EAAK,SAAS,EAAE,EAChB,IAAK,GACL,IAAK,IAKP,EAAK,OAAO,QAAQC,GAAmB,GAAO,EAAG,CAAC,EAClD,EAAK,OAAO,KAAKA,GAAmB,GAAO,EAAG,CAAC;GAC/C;;AAGJ,SAAS,GAAqB,GAAG;AAC/B,GAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,MAAI,OAAO,UAAU,eAAe,KAAK,GAAM,IAAI,CAIjD,UAHI,EAAK,aAAa,OAAO,EAAK,aAAa,SAC7C,EAAK,SAAS,EAAK,cAEb,EAAK,UAAb;GACE,KAAK;AACH,MAAK,KAAK,EAAK,QAAQ,IAAI,EAAK;AAChC;GACF,KAAK;AACH,MAAK,KAAK,EAAK,QAAQ,IAAI,EAAK;AAChC;;GAGN;;AAGJ,SAAS,GAA8B,GAAG;AACxC,GAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,EAAI,EAAK,YACP,EAAK,OAAO,SAAS;GAEvB;;AAGJ,SAAS,GAAkB,GAAG;AAgB5B,CAfA,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;AAChC,MAAI,EAAE,SAAS,EAAE,CAAC,QAAQ;GACxB,IAAI,IAAO,EAAE,KAAK,EAAE,EAChB,IAAI,EAAE,KAAK,EAAK,UAAU,EAC1B,IAAI,EAAE,KAAK,EAAK,aAAa,EAC7B,IAAI,EAAE,KAAKC,EAAO,EAAK,WAAW,CAAC,EACnC,IAAI,EAAE,KAAKA,EAAO,EAAK,YAAY,CAAC;AAKxC,GAHA,EAAK,QAAQ,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE,EAChC,EAAK,SAAS,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE,EACjC,EAAK,IAAI,EAAE,IAAI,EAAK,QAAQ,GAC5B,EAAK,IAAI,EAAE,IAAI,EAAK,SAAS;;GAE/B,EAEF,EAAU,EAAE,OAAO,EAAE,SAAU,GAAG;AAChC,EAAI,EAAE,KAAK,EAAE,CAAC,UAAU,YACtB,EAAE,WAAW,EAAE;GAEjB;;AAGJ,SAAS,GAAgB,GAAG;AAC1B,GAAU,EAAE,OAAO,EAAE,SAAU,GAAG;AAChC,MAAI,EAAE,MAAM,EAAE,GAAG;GACf,IAAI,IAAO,EAAE,KAAK,EAAE,EAAE;AAKtB,GAJA,AACE,EAAK,cAAY,EAAE,EAErB,EAAK,UAAU,KAAK;IAAK;IAAG,OAAO,EAAE,KAAK,EAAE;IAAE,CAAC,EAC/C,EAAE,WAAW,EAAE;;GAEjB;;AAGJ,SAAS,GAAgB,GAAG;AAE1B,GADaC,EAAsB,EAAE,EACnB,SAAU,GAAO;EACjC,IAAI,IAAa;AACjB,IAAU,GAAO,SAAU,GAAG,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AAiBpB,GAhBA,EAAK,QAAQ,IAAI,GACjB,EAAU,EAAK,WAAW,SAAU,GAAU;AAC5C,MACE,GACA,YACA;KACE,OAAO,EAAS,MAAM;KACtB,QAAQ,EAAS,MAAM;KACvB,MAAM,EAAK;KACX,OAAO,IAAI,EAAE;KACb,GAAG,EAAS;KACZ,OAAO,EAAS;KACjB,EACD,MACD;KACD,EACF,OAAO,EAAK;IACZ;GACF;;AAGJ,SAAS,GAAkB,GAAG;AAC5B,GAAU,EAAE,OAAO,EAAE,SAAU,GAAG;EAChC,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,MAAI,EAAK,UAAU,YAAY;GAC7B,IAAI,IAAW,EAAE,KAAK,EAAK,EAAE,EAAE,EAC3B,IAAI,EAAS,IAAI,EAAS,QAAQ,GAClC,IAAI,EAAS,GACb,IAAK,EAAK,IAAI,GACd,IAAK,EAAS,SAAS;AAW3B,GAVA,EAAE,QAAQ,EAAK,GAAG,EAAK,MAAM,EAC7B,EAAE,WAAW,EAAE,EACf,EAAK,MAAM,SAAS;IAClB;KAAE,GAAG,IAAK,IAAI,IAAM;KAAG,GAAG,IAAI;KAAI;IAClC;KAAE,GAAG,IAAK,IAAI,IAAM;KAAG,GAAG,IAAI;KAAI;IAClC;KAAE,GAAG,IAAI;KAAO;KAAG;IACnB;KAAE,GAAG,IAAK,IAAI,IAAM;KAAG,GAAG,IAAI;KAAI;IAClC;KAAE,GAAG,IAAK,IAAI,IAAM;KAAG,GAAG,IAAI;KAAI;IACnC,EACD,EAAK,MAAM,IAAI,EAAK,GACpB,EAAK,MAAM,IAAI,EAAK;;GAEtB;;AAGJ,SAAS,GAAkB,GAAK,GAAO;AACrC,QAAOC,EAAYN,EAAO,GAAK,EAAM,EAAE,OAAO;;AAGhD,SAAS,GAAa,GAAO;CAC3B,IAAI,IAAW,EAAE;AAIjB,QAHA,EAAU,GAAO,SAAU,GAAG,GAAG;AAC/B,IAAS,EAAE,aAAa,IAAI;GAC5B,EACK"}